Reduction of the broadcast redundancy by location awareness in mobile ad hoc networks

Authors:
Chun-Chuan Yang;Chao-Yu Chen
Affiliations:
Department of Computer Science and Information Engineering, Multimedia and Communications Laboratory, National Chi Nan University, Puli, Taiwan, ROC;Department of Computer Science and Information Engineering, Multimedia and Communications Laboratory, National Chi Nan University, Puli, Taiwan, ROC
Venue:
Computer Communications
Year:
2003

Citing 6
Cited 0

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
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
On the reduction of broadcast redundancy in mobile ad hoc networks

MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Improving the Performance of Broadcasting in Ad Hoc Wireless Networks

ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multihop Mobile Ad Hoc Network

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Flooding in wireless ad hoc networks

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

In this paper, a reachability-guaranteed approach for reducing broadcast storms in MANET is proposed. The approach is based on location awareness of each node, which means each node in the network needs to equip the positioning device like GPS and exchanges location information in the HELLO message with its neighbors. Three mechanisms are included in the proposed approach: Relay Set (RS), Neighbor Coverage (NC), and Transmission Order (TO). RS is a sender-based mechanism in which the sending node of the broadcast message determines the relay set of its neighbors for rebroadcast according to the radio coverage of the neighbors. The idea of the received-based NC is: a node receiving a broadcast message does not have to rebroadcast the message if all its neighbors have received the same message. TO mechanism requires a farther neighbor node away from the sending node to rebroadcast the message earlier than closer nodes so that a closer node may have more chances to save the rebroadcast. Simulation results have shown that the proposed approach 'RS+NC+TO' has a better performance than existing solutions like threshold-based schemes and angle-based scheme in terms of 100% reachability, more saved rebroadcast, and shorter average latency.