We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
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, line...