Sciweavers

Share
IPPS
2002
IEEE

Distributed Spanner with Bounded Degree for Wireless Ad Hoc Networks

9 years 5 months ago
Distributed Spanner with Bounded Degree for Wireless Ad Hoc Networks
In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a linear number of links while still preserving some powerefficient routes for any pair of nodes. We prove that this new topology not only has a bounded node degree   but also has a bounded power stretch factor 2 in civilized graph. Finally, we give some simulation results to verify its performance in practice and conclude the paper with the discussion of possible future works.
Yu Wang 0003, Xiang-Yang Li
Added 15 Jul 2010
Updated 15 Jul 2010
Type Conference
Year 2002
Where IPPS
Authors Yu Wang 0003, Xiang-Yang Li
Comments (0)
books