DMCA
Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks (2005)
Cached
Download Links
| Venue: | in Proc. WOWMOM |
| Citations: | 159 - 28 self |
BibTeX
@INPROCEEDINGS{Musolesi05adaptiverouting,
author = {Mirco Musolesi and Stephen Hailes and Cecilia Mascolo},
title = {Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks},
booktitle = {in Proc. WOWMOM},
year = {2005},
pages = {183--189},
publisher = {IEEE press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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. 1
Keyphrases
adaptive routing context information large assumption asynchronous communication local decision populated environment small overhead mobile ad hoc partially-connected mobile ad hoc network vast majority good delivery ratio novel approach context-aware routing present simulation result intelligent placement
