Find the maximum k-disjoint coverage sets in WSN using genetic algorithm. (2nd April 2010)

• Record Type: Journal Article
• Authors: Jia, Jie; Chen, Jian; Chang, Guiran; Li, Jie
• Is Part Of: International journal of modelling, identification and control. Volume 9:Number 1/2(2010)
• Page Start: 43
• Page End: 52
• Publication Date: 2010-04-02
• Subjects: WSN -- wireless sensor networks -- wireless networks -- k-disjoint coverage sets -- genetic algorithms -- GAs -- network lifetime -- model control -- coverage rate -- working nodes; Engineering -- Methodology -- Periodicals; Science -- Methodology -- Periodicals; 001.42
• Languages: English
• ISSNs: 1746-6172

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.