Probabilistic routing in intermittently connected networks

  • Authors:
  • Anders Lindgren;Avri Doria;Olov Schelén

  • Affiliations:
  • Lule University of Technology, Lule, Sweden;Lule University of Technology, Lule, Sweden;Lule University of Technology, Lule, Sweden

  • Venue:
  • ACM SIGMOBILE Mobile Computing and Communications Review
  • Year:
  • 2003

Quantified Score

Hi-index 0.01

Visualization

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.