Boundary and holes recognition in wireless sensor networks

In this paper, a distributed solution is proposed for detecting boundaries and holes in the WSN using only the nodes connectivity information. The run of our protocol is divided imto three main steps. In the first step, each node collects connectivity information of its one-hop neighbors and constructs its one-hop neighbors' graph. In the second step, independent sets are constructed. In the last step, the independent sets are connected in order to find the closed path. Therefore, the node can make its own decision to be an internal or a boundary node. Simulation results show that our algorithm can detect fine-grained boundaries with high accuracy, low energy consumption and less communication overhead compared to some former works. In addition, this algorithm performs better than some exiting approaches (BCP, THD, and SDBR).