Sciweavers

Share
WOWMOM
2005
ACM

Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks

9 years 3 months ago
Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks
The vast majority of mobile ad hoc networking research makes a very large assumption: that communication can only take place between nodes that are simultaneously accessible within in the same connected cloud (i.e., that communication is synchronous). In reality, this assumption is likely to be a poor one, particularly for sparsely or irregularly populated environments. In this paper, we present the Context-Aware Routing (CAR) algorithm. CAR is a novel approach to the provision of asynchronous communication in partially-connected mobile ad hoc networks, based on the intelligent placement of messages. We discuss the details of the algorithm, and then present simulation results demonstrating that it is possible for nodes to exploit context information in making local decisions that lead to good delivery ratios and latencies with small overheads.
Mirco Musolesi, Stephen Hailes, Cecilia Mascolo
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where WOWMOM
Authors Mirco Musolesi, Stephen Hailes, Cecilia Mascolo
Comments (0)
books