Find the maximum K-disjoint coverage sets in WSN using genetic algorithm

摘要：

A major concern in wireless sensor networks is to maximize network lifetime (in terms of rounds) while maintaining a high quality of service (QoS) at each round,which includes target coverage and network connectivity.This paper generalizes the searching procedure to maximize the total number of rounds.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 a novel algorithm for selecting the optimal coverage set based on improved NSGA-II is proposed.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.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.

关键词： wireless sensor network coverage genetic algorithm network lifetime.

作者: Jie Jia Jian Chen Guiran Chang Jie Li

作者单位: College of Information Science and EngineeringNortheastern University,Shenyang,China Computing CenterNortheastern University,Shenyang,China Computing Center Northeastern University,Shenyang,China

会议类型: 国际会议

会议名称: International Conference on Modelling,Identification and Control(模拟、鉴定、控制国际会议)

会议地点: 上海

会议语种:英文

在线出版日期: 2008-06-29（万方平台首次上网日期，不代表论文的发表时间）