Probabilistic Routing in Intermittently Connected Networks

In this paper, we address the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. There does, however, exist a number of scenarios where connectivity is intermittent, but where the possibility of communication still is desirable. Thus, there is a need for a way to route through networks with these properties. We propose PRoPHET, a probabilistic routing protocol for intermittently connected networks and compare it to the earlier presented Epidemic Routing protocol through simulations. We show that PRoPHET is able to deliver more messages than Epidemic Routing with a lower communication overhead.

[1]  Philippe Bonnet,et al.  Smart-tag based data dissemination , 2002, WSNA '02.

[2]  Maria Udén,et al.  Providing connectivity to the Saami nomadic community , 2002 .

[3]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[4]  Zygmunt J. Haas,et al.  The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way) , 2003, MobiHoc '03.

[5]  Hari Balakrishnan,et al.  Integrated Routing and Storage for Messaging Applications in Mobile Ad Hoc Networks , 2004, Mob. Networks Appl..

[6]  Jean-Luc Meunier,et al.  Pollen: using people as a communication medium , 2001, Comput. Networks.

[7]  Matthias Grossglauser,et al.  Age matters: efficient route discovery in mobile ad hoc networks using encounter ages , 2003, MobiHoc '03.

[8]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[9]  Chien-Chung Shen,et al.  Interrogation-based relay routing for ad hoc satellite networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[10]  Todd O'Brien,et al.  Autonomous Pinniped Environmental Samplers: Using Instrumented Animals as Oceanographic Data Collectors , 2001 .

[11]  Qun Li,et al.  Communication in disconnected ad hoc networks using message relay , 2003, J. Parallel Distributed Comput..

[12]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[13]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.