334 search results - page 17 / 67 » Analysis of Clustering and Routing Overhead for Clustered Mo... |
ADHOC
2006
13 years 9 months ago
2006
Abstract--On-demand routing protocols for ad hoc networks reduce the cost of routing in high mobility environments. However, route discovery in on-demand routing is typically perfo...
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...
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 ...
GLOBECOM
2007
IEEE
14 years 3 months ago
2007
IEEE
— Finding a reliable and efficient routing path in vehicular ad hoc networks (VANETs) is a challenging issue due to high mobility of vehicles and frequent link breakage. Motivat...
MASCOTS
2007
13 years 10 months ago
2007
— We propose a hierarchical Connected Dominating Set (CDS) based algorithm for clustering in Mobile Ad hoc Networks (MANETs). Our algorithm is an extension of our previous Connec...