Reliable one-hop broadcasting (ROB) in mobile ad hoc networks

Authors:
Seungjin Park;Roopesh R. Palasdeokar
Affiliations:
Merrimack College, N. Andover, MA;Windward Consulting Group Inc., Herndon, VA
Venue:
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Year:
2005

Citing 4
Cited 2

A performance comparison of multi-hop wireless ad hoc network routing protocols

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
The broadcast storm problem in a mobile ad hoc network

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Providing reliable and fault tolerant broadcast delivery in mobile ad-hoc networks

Mobile Networks and Applications
Multicast tree construction and flooding in wireless ad hoc networks

Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems

Piggyback cooperative repetition for reliable broadcasting of safety messages in VANETs

CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
An efficient reliable one-hop broadcast in mobile ad hoc networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Although many algorithms are built on the existence of reliable one-hop broadcasting, reliability is very hard to achieve in MANETs due to the node mobility and hidden terminal problem. This paper proposes a new reliable one-hop broadcast algorithm, called Reliable One-Hop Broadcasting (ROB). Unlike other algorithms that consider the collisions as useless, ROB utilizes the collisions as an indication and measurement of completion of the broadcast. Our simulation results using ns-2 show that ROB outperforms unreliable broadcasting by up to 400% in terms of number of retransmissions when network density is high.