Probabilistic Routing in Intermittently Connected Networks

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. Categories and Subject Descriptors C.2.1 [Computer-Communication Networks]: Network Architecture and Design General Terms Algorithms, Design Keywords Delay Tolerant Networks, routing, intermittently connected networks

• Type: Conference
• Year: 2004
• Where: SAPIR
• Authors: Anders Lindgren, Avri Doria, Olov Schelén
• Keywords: Computer Networks, Probabilistic Routing Protocol, Routing Protocol, SAPIR 2004, Traditional Routing Protocols