77 search results - page 13 / 16 » Ad-hoc networks beyond unit disk graphs |
122
click to vote
MOBIHOC
2005
ACM
16 years 1 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
111
click to vote
DCOSS
2009
Springer
15 years 6 months ago
2009
Springer
We study the problem of computing a family of connected dominating sets in wireless sensor networks (WSN) in a distributed manner. A WSN is modelled as a unit disk graph G = (V, E)...
113
click to vote
WDAG
2010
Springer
15 years 4 days ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
223
click to vote
INFOCOM
2011
IEEE
14 years 5 months ago
2011
IEEE
—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless n...
102
click to vote
ADHOCNOW
2007
Springer
15 years 8 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...