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

A fundamental movement in ad hoc networks is network expansive broadcasting. A beginning node broadcasts a idea to all nodes in the network. A bundle transmitted by a bud in an ad hoc wireless network can reach all neighbours, different in a wired network. As a result, the total number of transmissions (Forwarding knots) was used as the transmission cost criterion. A simple approach for broadcasting is blind Flooding place every bud in the network forwards the packet accurately once.This research projected a safe and active broadcasting invention that employs 2-leap neighbourhood information more efficiently to decrease repetitious transmissions in asymmetric Mobile Ad hoc networks and guarantees thorough delivery. Only a subdivision of the sender’s 1-leap neighbours retransmit the broadcast message. Forwarding growth are chosen as if they cover the uncovered 2-bounce neighbours. According to the simulation verdicts, the suggested television algorithm offers a extreme delivery percentage, a low broadcast forward percentage, a low overhead, and a minimal amount of delay.

Author(s) Details:

M. Murugesan,
Department of Computer Science and Engineering, Anurag Engineering College, Telangana-508 206, India.

L. Selvam,
Department of Information Technology, KSR Institute for Engineering and Technology, Tiruchengode- 637 215, India.

Please see the link here:

Keywords: Mobile Ad Hoc Networks (MANETs), forward node, asymmetric, broadcasting, Reliable Broadcast (RB), Reliable Broadcast Protocol (RBP), dynamic network, autonomous mobile, symmetric links, Partial Dominant Pruning algorithm (PDP)

Leave a Reply

Your email address will not be published. Required fields are marked *

Back To Top