WSN Coverage Enhancement Algorithm Based on Particle Swarm Optimization

Article Preview

Abstract:

For the optimization of WSN coverage, this paper proposes a coverage optimization approach: Adaptive Disturbance Chaotic Particle Swarm Optimization, referred as ADCPSO. Based on the effective coverage of the network as the optimization goal, the method first conducts adaptive operation on the particles. Introducing perturbations factor and making particles trapped into local optimum quickly jump out, this method then use the randomness and the ergodicity of chaotic motion, to make local fine search. This effectively avoids particles’ “being premature” and improves the accuracy of the algorithm. The simulation results show that the ADCPSO algorithm can get better coverage.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 945-949)

Pages:

2386-2393

Citation:

Online since:

June 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] SI H F, YANG Z, WANG J. Review on research status and application of wireless sensor networks [J]. Journal of Mechanical & Electrical Engineering, 2011, 28 (1): 16-20+37.

Google Scholar

[2] HUANG R, ZHU J, XU G. Energy-Efficient Mechanism Based on ACO for the Coverage Problem in Sensor NetWorks [J]. Journal of Southeast University- English Edition, 2007, 23 (2): 255-260.

Google Scholar

[3] CARDEI M, WU J. Energy-Efficient Coverage Problems in Wireless Sensor Network [J]. Computer Communications, 2006, 29 (4): 413-420.

DOI: 10.1016/j.comcom.2004.12.025

Google Scholar

[4] WANG B, BENG L, MA D. A Survey of Movement Strategies for Improving Network Coverage in Wireless Sensor Network [J]. Computer Communications, 2009, 32 (13/14): 1427-1436.

DOI: 10.1016/j.comcom.2009.05.004

Google Scholar

[5] LIU Y S, ZHOU H, ZHAO B H. The optimal sets partition of randomized scheduling algorithm in WSN [J]. Journal of University of Science and Technology of China, 2008, 35(3): 225-229.

Google Scholar

[6] ZHOU T, HONG B, PIAO S. Hybrid Sensor Network Deployment Based on Virtual Force [J], Journal of Computer Research and Development, 2007, 44 (6): 965-972.

Google Scholar

[7] YIN W L, CHEN W. Simulation Research for Wireless Sensor Networks Based on Genetic Algorithm [J]. Computer Simulation, 2010, 27(10): 120-123.

Google Scholar

[8] LIN Z L. Research on wireless sensor networks coverage optimization by multi-step particle swarm algorithm [J], Computer Engineering and Applications, 2009, 45 (13): 87-89.

Google Scholar

[9] CHEN X, HU P A. Simulation Research on Wireless Sensor Networks Coverage Optimization [J], Computer Simulation, 2012, 29 (3): 209-212.

Google Scholar

[10] ZHAO Z G,CHANG C. Adaptive particle swarm optimization algorithm with hybrid mutation operator [J], Computer Engineering and Applications, 2011, 47 (17): 42-44+45.

Google Scholar

[11] ZHU H R, LI P, CHENG J. Optimization Method for Wireless Sensor Network Coverage Based on Improved PSO Algorithm [J], Computer Engineering, 2011, 37 (8): 82-84.

Google Scholar

[12] LIU W T, FAN Z Y. Coverage optimization of wireless sensor networks based onchaos particle swarm algorithm [J], Journal of Computer Applications, 2011, 31 (2): 338-340.

DOI: 10.3724/sp.j.1087.2011.00338

Google Scholar

[13] X IANG X X, HUANG H G, LI Y D. Hybrid sensor networks coverage- enhancing approach based on particle swarm optimization [J], Application Research of Computers, 2010, 27 (6): 2273-2275.

Google Scholar