A Novel Optimization Method for the Maximum Coverage Sets of WSN
Wenjie Tian, Jicheng Liu · 2009
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.