144 search results - page 21 / 29 » Unit disk graph approximation |
129
click to vote
ADHOCNOW
2007
Springer
15 years 10 months ago
2007
Springer
We present a distributed topology control protocol that runs on a d-QUDG for d ≥ 1/ √ 2, and computes a sparse, constant-spanner, both in Euclidean distance and in hop distance...
139
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
137
click to vote
WWW
2004
ACM
16 years 5 months ago
2004
ACM
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
144
click to vote
PERCOM
2004
ACM
16 years 3 months ago
2004
ACM
We investigate the theoretical limits of positioning algorithms. In particular, we study scenarios where the nodes do not receive anchors directly (multi-hop) and where no physica...
134
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
This paper presents a simple local medium access control protocol, called Jade, for multi-hop wireless networks with a single channel that is provably robust against adaptive adver...