Skip to Main Content
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.