Coordinate-Free Distributed Algorithm for Boundary Detection in Wireless Sensor Networks

In this paper, we propose a coordinate-free distributed boundary detection algorithm (CDBD). It adopts general sensing and communication models and exploits two centrality measures, i.e., betweenness and closeness. For CDBD, each node only needs to communicate with its $k$-hop neighbors twice and makes decision whether it itself is a boundary node independently. CDBD has advantages of fast convergence and low communication overhead. Extensive simulation demonstrates the desirable performance of CDBD.