Poster: Probabilistic Routing in Intermittently Connected Networks
Anders Lindgren, Avri Doria · 2003
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. I.