Probabilistic routing in intermittently connected networks
- 1 July 2003
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOBILE Mobile Computing and Communications Review
- Vol. 7 (3), 19-20
- https://doi.org/10.1145/961268.961272
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.Keywords
This publication has 2 references indexed in Scilit:
- Mobility increases the capacity of ad hoc wireless networksIEEE/ACM Transactions on Networking, 2002
- Autonomous Pinniped Environmental Samplers: Using Instrumented Animals as Oceanographic Data CollectorsJournal of Atmospheric and Oceanic Technology, 2001