Research work · 2003
Probabilistic routing in intermittently connected networks
Anders Lindgren, Avri Doria, Olov Schelén
ACM SIGMOBILE Mobile Computing and Communications Review
Abstract
We consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exist at any time, rendering traditional routing protocols unable to deliver messages between hosts. We propose a probabilistic routing protocol for such networks.