A decentralized K-barriers construction approach based on nearest neighbors rule for two-dimensional rectangular region

Barrier coverage is a fundamental problem in wireless sensor networks, which can be applied to detect intruders that attempt to cross the boundaries of the region we are supervising. Among a number of issues related to barrier coverage, the most critical one is how to deploy sensors to construct barriers. Many barrier-building approaches have been proposed in previous papers by other scholars, while few papers adopt distributed strategies which allow sensors to move autonomously based on local information and are more practical in some unreachable areas. In this paper, we study a decentralized approach based on the nearest neighbor rule (NNR) to realize the self-deployment of wireless sensor networks to build K strong barriers, while considering network connectivity. This approach can be divided into three stages which correspond to the three times of using the NNR respectively. The sensor can autonomously choose the closest barrier to belonging to, which ensures the total migration distance is relatively smallest. Moreover, we test the availability and performance of our approach with simulations.