Paper Info
Title
Extending k-Coverage Lifetime of Wireless Sensor Networks Using Mobile Sensor Nodes
Abstract
One of the important issues in wireless sensor network (WSN) is to k-cover the target sensing field and to extend its lifetime. We propose a method to k-cover the field and maximize the WSN lifetime by moving mobile sensor nodes to appropriate positions for a WSN consisting of both static and mobile sensor nodes which periodically collect environmental information. Our target problem is NP-hard. So, we propose a genetic algorithm (GA) based scheme to find a near optimal solution in practical time. In order to speed up the calculation, we devised a method to check a sufficient condition of k-coverage of the field. For the problem that nodes near the sink node have to forward the data from farther nodes, we make a tree where the amount of communication traffic is balanced among all nodes, and add this tree to the initial candidate solutions of our GAbased algorithm. Through computer simulations, we confirmed that our method achieves much longer k-coverage lifetime than conventional methods for 100 to 300 node WSNs.
Year
DOI
Venue
2009
10.1109/WiMob.2009.18
WiMob
Keywords
Field
DocType
communication complexity,genetic algorithms,mobile radio,telecommunication traffic,wireless sensor networks,NP-hard,WSN lifetime,communication traffic,genetic algorithm,k-coverage lifetime,mobile sensor nodes,static sensor nodes,target sensing,wireless sensor network,k-coverage,mobile node,network lifetime,sensor network
Mobile computing,Mobile radio,Key distribution in wireless sensor networks,Computer science,Computer network,Real-time computing,Communication complexity,Schedule,Mobile wireless sensor network,Wireless sensor network,Mobile telephony
Conference
Citations 
PageRank 
References 
16
1.50
5
Authors
5
Name
Order
Citations
PageRank
Ryo Katsuma1205.53
Yoshihiro Murata211511.90
Naoki Shibata318619.39
Keiichi Yasumoto4670110.78
Minoru Ito548377.61