Probabilistic route reliability with distance

Abstract

In mobile ad hoc networks, node mobility causes frequent link failures, thus invalidating the routes containing those links. This leads the frequent operation of route reconstruction that consumes lots of the network resources and the energy of nodes. Many efforts have been made to design reliable routing protocols that discover long lifetime routes. In these protocols by using reliability metrics for route selection, more reliable routes are discovered. In this paper, we review two mostly used network layer reliability metrics; "Route Expiration Time" and "Probabilistic Route Reliability" and propose a new one; "Probabilistic Route Reliability with Distance". Afterwards, the efficiency of these reliability metrics is evaluated by simulation experiments in different network conditions. The focus was concentrated on the number of route reconstructions as the performance metric. Simulation results show that by using all these three reliability metrics, number of route reconstructions is reduced and for the proposed one, the results are better than the others.

Domain-epidemic spray and forward routing algorithm of opportunistic networks

“…Communication can be realised by the encounter of moving nodes. The ad hoc network routing protocols assume that there are at least one end-to-end path exist between the source and the destination, so these protocols cannot run in the opportunistic networks (Sargolzaey et al, 2010;Jain et al, 2004;Pelusi et al, 2006). The opportunistic networks delivers messages through the strategy 'storage-carry-forward'.…”