A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Local approximation schemes for topology control
2006
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing - PODC '06
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, linear size, (1 + ε)-spanner for any given ε > 0. A wireless network is modeled by a d-dimensional α-quasi unit ball graph (α-UBG), which is a higher dimensional generalization of the standard unit disk graph (UDG) model. The d-dimensional α-UBG model goes beyond the unrealistic "flat world" assumption of UDGs and also
doi:10.1145/1146381.1146413
dblp:conf/podc/DamianPP06
fatcat:h6nam2xpyfdn5ouj7wtxb2qj7a