Study on Reliable and Efficient Broadcasting in Asymmetric Mobile Ad Hoc Networks Using Minimized Forward Node List Algorithm

A fundamental operation in ad hoc networks is network wide broadcasting. A source node broadcasts a message to all nodes in the network. A packet transmitted by a node in an ad hoc wireless network can reach all neighbours, unlike in a wired network. As a result, the total number of transmissions (Forwarding nodes) was used as the broadcasting cost criterion. A straightforward approach for broadcasting is blind Flooding where every node in the network forwards the packet exactly once.This research proposed a safe and effective broadcasting algorithm that employs 2-hop neighbourhood information more efficiently to decrease redundant transmissions in asymmetric Mobile Ad hoc networks and guarantees full delivery. Only a subset of the sender's 1-hop neighbours retransmit the broadcast message. Forwarding nodes are chosen in such a way that they cover the uncovered 2-hop neighbours. According to the simulation findings, the suggested broadcasting algorithm offers a high delivery ratio, a low broadcast forward ratio, a low overhead, and a minimal amount of delay.