Sciweavers

79 search results - page 2 / 16
» Minimum power assignment in wireless ad hoc networks with sp...
Sort
View
IPPS
2002
IEEE
13 years 9 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
WINET
2010
133views more  WINET 2010»
13 years 3 months ago
Connectivity of ad hoc wireless networks: an alternative to graph-theoretic approaches
Connectivity in wireless ad hoc and sensor networks is typically analyzed using a graph-theoretic approach. In this paper, we investigate an alternative communication-theoretic app...
Sooksan Panichpapiboon, Gian Luigi Ferrari, Ozan K...
MOBIHOC
2002
ACM
14 years 4 months ago
Algorithmic aspects of topology control problems for ad hoc networks
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...
Errol L. Lloyd, Rui Liu, Madhav V. Marathe, Ram Ra...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
13 years 10 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