Interference-Free k-barrier Coverage in Wireless Sensor Networks

Barrier coverage is a hot issue in wireless sensor networks. Most literatures study barrier coverage under one-hop wireless sensor networks. In this paper, we consider more practical environment: multi-hop wireless sensor networks. We study the problem of how to achieve interference-free k-barrier coverage which has not been discussed before. Firstly, we analyze how k-barrier coverage suffers from interference in multi-hop networks. Then we propose an effective algorithm to solve the problem which is called computing maximal k-connected barriers without interference. In this algorithm, we construct none-crossing k-barrier coverage firstly and then we construct a communication interference graph to compute a maximal k-connected barriers without interference. Simulations show our algorithm can prolong the network lifetime of k-barrier coverage and is more effective than the existing method.