A Dynamic Probabilistic Based Broadcasting Scheme for MANETs

Abstract

MANET is commonly known as Mobile Ad Hoc Network in which cluster of mobile nodes can communicate with each other without having any basic infrastructure. The basic characteristic of MANET is dynamic topology. Due to the dynamic behavior nature, the topology of the network changes very frequently, and this will lead to the failure of the valid route repeatedly. Thus, the process of finding the valid route leads to notable drop in the throughput of the network. To identify a new valid path to the targeted mobile node, available proactive routing protocols use simple broadcasting method known as simple flooding. The simple flooding method broadcasts the RREQ packet from the source to the rest of the nodes in mobile network. But the problem with this method is disproportionate repetitive retransmission of RREQ packet which could result in high contention on the available channel and packet collision due to extreme traffic in the network. A reasonable number of routing algorithms have been suggested for reducing the lethal impact of flooding the RREQ packets. However, most of the algorithms have resulted in considerable amount of complexity and deduce the throughput by depending on special hardware components and maintaining complex information which will be less frequently used. By considering routing complexity with the goal of increasing the throughput of the network, in this paper, we have introduced a new approach called Dynamic Probabilistic Route (DPR) discovery. The Node's Forwarding Probability (NFP) is dynamically calculated by the DPR mobile nodes using Probability Function (PF) which depends on density of local neighbor nodes and the cumulative number of its broadcast covered neighbors.

Mobility‐Aware Routing Algorithm for Mobile Ad Hoc Networks

“…Broadcasting in MANETs can be classified as simple (blind) flooding, location-based, distance-based, neighbor-knowledge-based, counter-based, and probabilistic-based [8][9][10][11][12]. In [12]; the authors have proposed a dynamic probabilisticbased routing scheme. In this scheme, packets forwarded to the neighbor node with dynamically computed probability, which is forwarding probability.…”

Dynamic routing discovery scheme for high mobility in mobile ad hoc wireless networks

“…In [13], the authors suggested a novel discovery scheme within MANET called the Dynamic Probabilistic Route (DPR). The DPR scheme forwarded the packets with a dynamically determined probability known as a forwarding probability (FP) to the neighboring node.…”

Adaptive epidemic dissemination as a finite-horizon optimal stopping problem

“…A degree of context awareness is inherent in it, as knowledge of neighbor count and distance is assumed. Work in [25] proposes improvements to the protocol, where the forwarding probability is tuned according to the local nodes density. This can offer considerable reduction of energy cost due to transmission and reception.…”