DocumentCode
3117595
Title
A Novel Optimization Method for the Maximum Coverage Sets of WSN
Author
Tian, Wen Jie ; Liu, Ji Cheng
Author_Institution
Autom. Inst., Beijing Union Univ., Beijing, China
fYear
2009
fDate
28-29 Dec. 2009
Firstpage
125
Lastpage
128
Abstract
To resolve the problem of traditional lifetime, target coverage and network connectivity, a novel algorithm for selecting the optimal coverage set based on improved particle swarm optimization algorithm (PSOA) is proposed. There are two competing objectives presented to determine where to place the sensor nodes, the coverage rate and the number of working nodes. And then As another new contribution, we apply the novel algorithm in the K-disjoint coverage sets problem, which divides all the sensors into K-disjoint sets, guaranteeing each set with complete coverage. This method can improve the capability of search and convergence of algorithm. By alternating coverage subsets and using only one at each round, the maximum network lifetime is achieved. The simulation result shows that our analysis for wireless sensor networks is better than other algorithms and more effective.
Keywords
particle swarm optimisation; set theory; wireless sensor networks; K-disjoint coverage sets problem; coverage rate; maximum network lifetime; optimal coverage set; particle swarm optimization algorithm; sensor nodes; wireless sensor networks; Algorithm design and analysis; Analytical models; Automation; Convergence; Energy consumption; Information systems; Optimization methods; Particle swarm optimization; Wireless networks; Wireless sensor networks; K-disjoint sets; network lifetime; particle swarm optimization algorithm; target coverage; wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Networks and Information Systems, 2009. WNIS '09. International Conference on
Conference_Location
Shanghai
Print_ISBN
978-0-7695-3901-0
Electronic_ISBN
978-1-4244-5400-6
Type
conf
DOI
10.1109/WNIS.2009.77
Filename
5381551
Link To Document