Download now Free registration required
In this paper, the authors 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. Wireless Sensor Networks (WSNs) have been widely adopted to collect physical information about a Region of Interest (RoI). In most of their applications, the global network topology is of a major concern, as it is closely related to the basic network functionalities such as coverage and data communications.
- Format: PDF
- Size: 192.7 KB