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 off-course 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 easy approach for broadcasting is blind Flooding place every bud in the network forwards the packet accurately once.This research projected a safe and persuasive broadcasting invention that employs 2-jump on one leg neighbourhood information more efficiently to decrease repetitious transmissions in asymmetric Mobile Ad hoc networks and guarantees entire delivery. Only a subgroup of the sender’s 1-leap neighbours retransmit the broadcast message. Forwarding knots are chosen as though they cover the uncovered 2-leap neighbours. According to the simulation judgments, the suggested transmission 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)

Previous post Nature of Science (NOS) Map for Science Education Instruction: An Overview
Next post Micelles as Supercages for Bimetallic Nanoparticles Synthesis