A Dynamic Probabilistic Based Broadcasting Scheme for MANETs

الملخص EN

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.