Probabilistic routing in intermittently connected networks

20032,278 citationsJournal Articlegreen Open Access

Authors

Anders Lindgren · Luleå University of Technology

Avri Doria · Electronics and Telecommunications Research Institute

Olov Schelén · Luleå University of Technology

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.

Topics & Keywords

Mobile Ad Hoc Networks Opportunistic and Delay-Tolerant Networks Cooperative Communication and Network Coding

Publication Details

Published in: ACM SIGMOBILE Mobile Computing and Communications Review

Volume 7, Issue 3, pp. 19-20

DOI: 10.1145/961268.961272

Field-Weighted Citation Impact: 13.44

Command Palette

Probabilistic routing in intermittently connected networks

Authors

Abstract

Topics & Keywords

Publication Details