Sciweavers

Share
1390 search results - page 2 / 278
» Geometric Spanners for Wireless Ad Hoc Networks
Sort
View
IPPS
2002
IEEE
12 years 2 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 li...
Yu Wang 0003, Xiang-Yang Li
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
12 years 3 months ago
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
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...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
12 years 3 months ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
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...
Yu Wang 0003, Xiang-Yang Li
AHSWN
2005
120views more  AHSWN 2005»
11 years 9 months ago
Low-Interference Topology Control for Wireless Ad Hoc Networks
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...
Kousha Moaveninejad, Xiang-Yang Li
books