196 search results - page 13 / 40 » Clustering Overhead for Hierarchical Routing in Mobile Ad ho... |
MSWIM
2004
ACM
14 years 2 months ago
2004
ACM
In mobile ad hoc networks, node mobility causes links between nodes to break frequently, thus terminating the lifetime of the routes containing those links. An alternative route h...
ICWN
2004
13 years 10 months ago
2004
Abstract-- In this paper, we present a completely distributed algorithm for partitioning a given set of mobile nodes into clusters. The proposed algorithm tries to reduce the amoun...
INFOCOM
2000
IEEE
14 years 1 months ago
2000
IEEE
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...
ICC
2000
IEEE
14 years 1 months ago
2000
IEEE
—We introduce WRP-Lite, which is a table-driven routing protocol that uses non-optimal routes, and compare its performance with the performance of the dynamic source routing (DSR...
PEWASUN
2004
ACM
14 years 2 months ago
2004
ACM
A mobile ad hoc network consists of mobile nodes that can move freely in an open environment. Communicating nodes in a wireless and mobile ad hoc network usually seek the help of ...