196 search results - page 26 / 40 » Clustering Overhead for Hierarchical Routing in Mobile Ad ho... |
TON
2012
11 years 11 months ago
2012
—This paper presents DAWN, a declarative platform that creates highly adaptive policy-based MANET protocols. DAWN leverages declarative networking techniques to achieve extensibl...
TMC
2008
13 years 9 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 ...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
—Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have b...
ADHOCNOW
2003
Springer
14 years 2 months ago
2003
Springer
This paper models an ad-hoc network as a continuum of nodes, ignoring edge effects, to find how the traffic scales with N, the number of nodes. We obtain expressions for the traffi...
ICPPW
2002
IEEE
14 years 1 months ago
2002
IEEE
A wireless ad hoc network is a collection of mobile nodes with no fixed infrastructure. The absence of central authorization facility in dynamic and distributed environment requir...