DMCA
Probabilistic Routing in Intermittently Connected Networks (2004)
Cached
Download Links
| Venue: | SIGMOBILE Mobile Computing and Communication Review |
| Citations: | 624 - 6 self |
BibTeX
@INPROCEEDINGS{Lindgren04probabilisticrouting,
author = {Anders Lindgren and Avri Doria and Olov Schelen},
title = {Probabilistic Routing in Intermittently Connected Networks},
booktitle = {SIGMOBILE Mobile Computing and Communication Review},
year = {2004},
pages = {2003}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper, we address the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. There does, however, exist a number of scenarios where connectivity is intermittent, but where the possibility of communication still is desirable. Thus, there is a need for a way to route through networks with these properties. We propose PROPHET, a probabilistic routing protocol for intermittently connected networks and compare it to the earlier presented Epidemic Routing protocol through simulations. We show that PROPHET is able to deliver more messages than Epidemic Routing with a lower communication overhead.
