268 search results - page 38 / 54 » Routing characteristics of ad hoc networks with unidirection... |
TMC
2008
13 years 7 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
WONS
2005
IEEE
14 years 1 months ago
2005
IEEE
Developing and evaluating protocols and applications for mobile ad-hoc networks requires significant organisational effort when real mobile ad-hoc networks with several mobile te...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
MSWIM
2006
ACM
14 years 1 months ago
2006
ACM
The simulation of wireless networks has been an important tool for researchers and the industry in the last years. Especially in the field of Mobile Ad Hoc Networking, most curre...