An Improved Particle Swarm Optimization-Based Coverage Control Method for Wireless Sensor Network

Coverage control plays a significant role in wireless sensor network (WSN) design. To meet a layout with a certain cover rate, movable nodes are maintained in deployment which accomplish self-organization through moving and changing topological structure. This paper proposes an improved discrete particle swarm optimization algorithm aimed at coverage control method of WSN, and the optimization is implemented under two processes: deployment planning and movement control. The method interpreted in this paper can be easily used solving such problems and the experiment result shows its efficiency, which will inspire new insights in this field.

[1]  Cui Li.  Ant based approach to the optimal deployment in wireless sensor networks , 2009 .

[2]  Godfrey C. Onwubolu,et al.  New optimization techniques in engineering , 2004, Studies in Fuzziness and Soft Computing.

[3]  Salman Mohagheghi,et al.  Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems , 2008, IEEE Transactions on Evolutionary Computation.

[4]  Michael N. Vrahatis,et al.  Recent approaches to global optimization problems through Particle Swarm Optimization , 2002, Natural Computing.

[5]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[6]  S. Sitharama Iyengar,et al.  Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks , 2002, IEEE Trans. Computers.

[7]  Sajal K. Das,et al.  Coverage and connectivity issues in wireless sensor networks: A survey , 2008, Pervasive Mob. Comput..

[8]  Chunguang Zhou,et al.  Particle swarm optimization for traveling salesman problem , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

[9]  Yuanyuan Yang,et al.  Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks , 2007, IEEE Trans. Computers.

[10]  Kejie Li,et al.  Improving sensing coverage of wireless sensor networks by employing mobile robots , 2007, 2007 IEEE International Conference on Robotics and Biomimetics (ROBIO).

[11]  Yanchun Liang,et al.  Particle swarm optimization-based algorithms for TSP and generalized TSP , 2007, Inf. Process. Lett..

[12]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization based on virtual forces , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[13]  Pramod K. Varshney,et al.  A distributed self spreading algorithm for mobile wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[14]  Thomas Stützle,et al.  Ant Colony Optimization: Overview and Recent Advances , 2018, Handbook of Metaheuristics.

[15]  Maurice Clerc,et al.  Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem , 2004 .

[16]  Mohamed F. Younis,et al.  Strategies and techniques for node placement in wireless sensor networks: A survey , 2008, Ad Hoc Networks.