Title: Find the maximum k-disjoint coverage sets in WSN using genetic algorithm

Authors: Jie Jia, Jian Chen, Guiran Chang, Jie Li

Addresses: School of Information Science and Engineering, Northeastern University, Shenyang, Liaoning, 110004, China. ' School of Information Science and Engineering, Northeastern University, Shenyang, Liaoning, 110004, China. ' Computing Center, Northeastern University, Shenyang, Liaoning, 110004, China. ' Computing Center, Northeastern University, Shenyang, Liaoning, 110004, China

Abstract: A major concern in wireless sensor networks is to maximise network lifetime (in terms of rounds) while maintaining a high quality of service (QoS), which includes target coverage and network connectivity. This paper generalises the searching procedure to maximise the total number of rounds. A novel searching algorithm is proposed on the basis of improved NSGA-II to select the optimal coverage set which includes two competing objectives, the coverage rate and the number of working nodes. As another new contribution, we apply the novel algorithm in the k-disjoint coverage sets problem. All the sensors are divided into k-disjoint sets, guaranteeing each set with full coverage. By alternating coverage subsets and using only one at each round, the maximum network lifetime is achieved. Numerical and simulation results are provided to examine our analysis for wireless sensor networks.

Keywords: WSN; wireless sensor networks; wireless networks; k-disjoint coverage sets; genetic algorithms; GAs; network lifetime; model control; coverage rate; working nodes.

DOI: 10.1504/IJMIC.2010.032359

International Journal of Modelling, Identification and Control, 2010 Vol.9 No.1/2, pp.43 - 52

Available online: 01 Apr 2010 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article