77 search results - page 5 / 16 » Ad-hoc networks beyond unit disk graphs |
WINET
2010
13 years 8 months ago
2010
We study routing algorithms for three-dimensional ad hoc networks that guarantee delivery and are k-local, i.e., each intermediate node v’s routing decision only depends on knowl...
TIT
2008
13 years 9 months ago
2008
In this correspondence, we show that the uniform throughput capacity of an ultra-wideband (UWB) power-constrained ad hoc network is given by 2(P ( n=logn) ), where P is the per-nod...
TWC
2010
13 years 4 months ago
2010
In wireless ad hoc networks, relative neighborhood graphs (RNGs) are widely used for topology control. If every node has the same transmission radius, then an RNG can be locally co...
ICDCS
2008
IEEE
14 years 4 months ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
ADHOC
2005
13 years 9 months ago
2005
We consider a wireless ad hoc network composed of a set of wireless nodes distributed in a two dimensional plane. Several routing protocols based on the positions of the mobile ho...