Adaptive routing for intermittently connected mobile ad hoe networks

M  Musolesi; S  Hailes; C  Mascolo

doi:10.1109/WOWMOM.2005.17

Adaptive routing for intermittently connected mobile ad hoe networks

M Musolesi, S Hailes, C Mascolo

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English
Title of host publication	Proceedings of 6th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM'05)
Publisher	IEEE
Pages	183-189
Number of pages	7
ISBN (Print)	0-7695-2342-0
DOIs	https://doi.org/10.1109/WOWMOM.2005.17
Publication status	Published - 2005

Access to Document

10.1109/WOWMOM.2005.17

Cite this

@inproceedings{060e25ca90b4445fa1d3ad8e2c9f6274,

title = "Adaptive routing for intermittently connected mobile ad hoe networks",

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.",

author = "M Musolesi and S Hailes and C Mascolo",

year = "2005",

doi = "10.1109/WOWMOM.2005.17",

language = "English",

isbn = "0-7695-2342-0 ",

pages = "183--189",

booktitle = "Proceedings of 6th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM'05)",

publisher = "IEEE",

}

TY - GEN

T1 - Adaptive routing for intermittently connected mobile ad hoe networks

AU - Musolesi, M

AU - Hailes, S

AU - Mascolo, C

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

U2 - 10.1109/WOWMOM.2005.17

DO - 10.1109/WOWMOM.2005.17

M3 - Conference contribution

SN - 0-7695-2342-0

SP - 183

EP - 189

BT - Proceedings of 6th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM'05)

PB - IEEE

ER -

Adaptive routing for intermittently connected mobile ad hoe networks

Abstract

Access to Document

Fingerprint

Cite this