1390 search results - page 2 / 278 » Geometric Spanners for Wireless Ad Hoc Networks |
IPPS
2002
IEEE
14 years 10 days ago
2002
IEEE
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 li...
ISAAC
2004
Springer
14 years 24 days ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
DIALM
2003
ACM
14 years 20 days ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
DIALM
2007
ACM
13 years 11 months ago
2007
ACM
AHSWN
2005
13 years 7 months ago
2005
Topology control has been well studied in wireless ad hoc networks. However, only a few topology control methods take into account the low interference as a goal of the methods. So...