Probabilistic Routing Based on Two-Hop Information in DelayDisruption Tolerant Networks

Abstract EN

We investigate an opportunistic routing protocol in delay/disruption tolerant networks (DTNs) where the end-to-end path between source and destination nodes may not exist for most of the time.

Probabilistic routing protocol using history of encounters and transitivity (PRoPHET) is an efficient history-based routing protocol specifically proposed for DTNs, which only utilizes the delivery predictability of one-hop neighbors to make a decision for message forwarding.

In order to further improve the message delivery rate and to reduce the average overhead of PRoPHET, in this paper we propose an improved probabilistic routing algorithm (IPRA), where the history information of contacts for the immediate encounter and two-hop neighbors has been jointly used to make an informed decision for message forwarding.

Based on the Opportunistic Networking Environment (ONE) simulator, the performance of IPRA has been evaluated via extensive simulations.

The results show that IPRA can significantly improve the average delivery rate while achieving a better or comparable performance with respect to average overhead, average delay, and total energy consumption compared with the existing algorithms.