477 search results - page 37 / 96 » Information-Theoretic Bounds for Mobile Ad-hoc Networks Rout... |
ICCSA
2004
Springer
14 years 1 months ago
2004
Springer
We propose a hierarchical, cluster based semi-distributed routing protocol for a mobile ad hoc network. The network graph is partitioned into clusters using heuristics and the shor...
VTC
2010
IEEE
13 years 6 months ago
2010
IEEE
1The classic Dynamic Source Routing (DSR) protocol opts for the route requiring the lowest number of hops for transmitting data from the source to the destination. However, owing t...
INFOCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
— HADOF is a set of mechanisms to defend against routing disruptions in mobile ad hoc networks. Based on the observed behavior and the history record of each node, HADOF aims to ...
TON
2008
13 years 8 months ago
2008
Abstract--Existing anycast routing protocols solely route packets to the closest group member. In this paper, we introduce density-based anycast routing, a new anycast routing para...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— In this paper, we present a novel anonymous secure routing protocol for mobile ad hoc networks (MANETs). The proposed protocol not only provides anonymity from all the intermed...