Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks
Abstract:
We present a local distributed algorithm that, given a wireless ad-hoc network modeled as a unit disk graph U in the plane, constructs a planar power spanner of U whose degree is bounded by k and whose stretch factor is bounded by 1+ (2 Sin /k)^þ , where k>=10 is an integer parameter and þ € [2,5] is the power exponent constant. For the same degree bound k, the stretch factor of our algorithm significantly improves the previous best bounds by Song et al. We show that this bound is near-optimal by proving that the slightly smaller stretch factor of 1+ (2 sin π/( k +1)) is unattainable for the same degree bound k . In contrast to previous algorithms for the problem, the presented algorithm is local. As a consequence, the algorithm is highly scalable and robust. Finally, while the algorithm is efficient and easy to implement in practice, it relies on deep insights on the geometry of unit disk graphs and novel techniques that are of independent interest.