Distributed Algorithms for Bottleneck Identification and Segmentation in 3D Wireless Sensor Networks

Segmentation decomposes a network with complex and irregular shape into a set of subnetworks, each under a simple boundary condition without bottlenecks. It has a wide spectrum of applications in routing, coverage, localization, backbone construction and maintenance, and in-network data centric storage and retrieval. To the authors' best knowledge, this is the first work that tackles the segmentation problem in 3D wireless sensor networks. They propose a fully distributed 3D segmentation scheme with mere network connectivity information. Each node on boundary computes its injectivity radius, which reflects the narrowness of the corresponding boundary area and thus is employed to locate the undesired bottlenecks. A cluster of connected boundary nodes with similar smallest injectivity radii form a bottleneck segment.

Provided by: University of Louisiana at Lafayette Topic: Mobility Date Added: Apr 2011 Format: PDF

Find By Topic