Abstract
The computational requirements even in the limited resources of the hardware devices whose small memory size or low price could be addressed by compact optimization methods. In this paper, a compact particle swarm optimization (cPSO) for the base station locations optimization is proposed for wireless sensor networks (WSN). A probabilistic representation random of the collection behavior of swarms is inspired to employ for this proposed algorithm. The real population is replaced with the probability vector updated based on single competition. These lead to the entire algorithm functioning applying a modest memory usage. The experiments to solve the problem of locating the base station in WSN compared with the genetic algorithm (GA) method and the particle swarm optimization (PSO) method show that the proposed method can provide the effective way of using a modest memory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A survey on sensor networks. IEEE Commun. Mag. 40, 102–105 (2002)
Antonio, P., Grimaccia, F., Mussetta, M.: Architecture and methods for innovative heterogeneous wireless sensor network applications. Remote Sens. 4, 1146–1161 (2012)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN 1995 - International Conference on Neural Networks, p. 16 (1995)
Harik, G.R., Lobo, F.G., Goldberg, D.E.: The compact genetic algorithm. IEEE Trans. Evol. Comput. 3, 287–297 (1999)
Billingsley, P.: Probability and Measure, 3rd edn. Wiley, New York (1995)
Neri, F., Mininno, E., Iacca, G.: Compact particle swarm optimization. Inf. Sci. (NY) 239, 96–121 (2013)
Abramowitz, M., Stegun, I.A.: Handbook of Mathematical Functions: with Formulas, Graphs, and Mathematical Tables. Courier Corporation, New York (1964)
Cody, W.J.: Rational Chebyshev approximations for the error function. Math. Comput. 23, 631 (1969)
Iacca, G., Mallipeddi, R., Mininno, E., Neri, F., Suganthan, P.N.: Super-fit and population size reduction in compact differential evolution. In: IEEE SSCI 2011 - Symposium Series on Computational Intelligence - MC 2011: 2011 IEEE Workshop on Memetic Computing, pp. 21–28. IEEE (2011)
Dao, T.-K., Pan, T.-S., Nguyen, T.-T., Pan, J.-S.: Parallel bat algorithm for optimizing makespan in job shop scheduling problems. J. Intell. Manuf. (2015)
Mollanejad, A.: DBSR: dynamic base station repositioning using the genetic algorithm in wireless sensor network. Comput. Eng. 7, 521–525 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Pan, JS., Dao, TK., Nguyen, TT., Pan, TS. (2017). Compact Particle Swarm Optimization for Optimal Location of Base Station in Wireless Sensor Network. In: Pan, JS., Lin, JW., Wang, CH., Jiang, X. (eds) Genetic and Evolutionary Computing. ICGEC 2016. Advances in Intelligent Systems and Computing, vol 536. Springer, Cham. https://doi.org/10.1007/978-3-319-48490-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-48490-7_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-48489-1
Online ISBN: 978-3-319-48490-7
eBook Packages: EngineeringEngineering (R0)