HEPRA: History of Encounters Probabilistic Routing Algorithm in Delay-Tolerant Network

F. Alnajjar and T. Saadawi (USA)


DTN, MANET, Probabilistic routing protocol


Routing in mobile ad hoc networks (MANET) is complex and complicated because the network graph is episodically connected. The topology is changing rapidly because of weather, terrain, highly variable delay links, error rate links, and jamming. A key challenge is to create a method that can present good delivery performance and low end-to-end delay in an intermittent network graph and opportunistic or scheduled intermittent links where nodes may move freely. Delay-Tolerant Networking (DTN) architecture is designed to provide communication in intermittently connected networks by moving messages towards destination via ‘store, carry and forward’ technique that supports multi-routing algorithms to acquire best path towards destination. In this paper, we propose the use of probabilistic routing in DTN architecture using the concept of History of Encounters. We compared the new approach, History of Encounters Probabilistic Routing Algorithm (HEPRA) to the common DTN-based protocols. We have used the Opportunistic Network Environment (ONE) simulator as a simulation tool. We demonstrate the ability of HEPRA to accomplish good quality performance than the other common existing Protocols.

Important Links:

Go Back