Reliable and Efficient Broadcasting in Asymmetric Mobile Ad Hoc Networks Using Minimized Forward Node List Algorithm
Marimuthu Murugesan and Ammasai Krishnan
DOI : 10.3844/jcssp.2011.46.51
Journal of Computer Science
Volume 7, Issue 1
Problem statement: Network wide broadcasting is a fundamental operation in ad hoc networks. In broadcasting, a source node sends a message to all the other nodes in the network. Unlike in a wired network, a packet transmitted by a node in ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (Forwarding nodes) used as the cost criterion for broadcasting. Approach: This study proposes a reliable and efficient broadcasting algorithm using minimized forward node list algorithm which uses 2-hop neighborhood information more effectively to reduce redundant transmissions in asymmetric Mobile Ad hoc networks that guarantees full delivery. Among the 1-hop neighbors of the sender, only selected forwarding nodes retransmit the broadcast message. Forwarding nodes are selected such a way that to cover the uncovered 2-hop neighbors. Results: Simulation results show that the proposed broadcasting algorithm provides high delivery ratio, low broadcast forward ratio, low overhead and minimized delay. Conclusion: In this study, reliable and efficient broadcasting algorithm in asymmetric Mobile Ad Hoc Networks using minimized forward node list algorithm has been proposed which provides low forward ratio, high delivery ratio while suppressing broadcast redundancy.
© 2011 Marimuthu Murugesan and Ammasai Krishnan. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.