@inproceedings{821580ef3fbb4fbeb51f6507f1ecaf4e,

title = "Distributed topology control in wireless ad hoc networks using β-skeletons",

abstract = "We propose a novel approach for sparse topology generation in wireless ad hoc networks based on a graph structure known as β-skeletons. Two efficient algorithms are presented in this paper for creating a connected topology from an underlying β-skeleton. One algorithm is a distributed algorithm that runs on each component of the β-skeleton. It creates a connected structure from the disconnected β-skeleton graph using a distributed leader election algorithm. The running time of this algorithm is O(n log n). The other is a localized algorithm that uses two-hop neighborhood information to generate a connected topology, with a running time of O(n). Simulations show consistent decrease in node degree in the resulting topology. The observed decrease is greater than 33% in comparison to the Relative Neighborhod Graph (RNG) and greater than 50% in comparison to other topology structures such as, the Gabriel Graph (GG) and the Yao construction on GG.",

keywords = "Bounded degree, Distributed algorithm, Localized algorithm, Topology control, Wireless ad hoc networks",

author = "Manvendu Bhardwaj and Satyajayant Misra and Guoliang Xue",

year = "2005",

month = nov,

day = "15",

language = "English (US)",

isbn = "0780389247",

series = "2005 Workshop on High Performance Switching and Routing, HPSR 2005",

pages = "371--375",

booktitle = "2005 Workshop on High Performance Switching and Routing, HPSR 2005",

note = "2005 Workshop on High Performance Switching and Routing, HPSR 2005 ; Conference date: 12-05-2005 Through 14-05-2005",

}