Self-pruning broadcasting for mobile ad hoc networks

Authors:
Wilson Woon;Kwan L. Yeung
Affiliations:
Dept. of Electrical and Electronic Engineering, Faculty of Engineering, The University of Hong Kong, Pokfulam, Hong Kong;Dept. of Electrical and Electronic Engineering, Faculty of Engineering, The University of Hong Kong, Pokfulam, Hong Kong
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 7
Cited 1

Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
The broadcast storm problem in a mobile ad hoc network

Wireless Networks - Selected Papers from Mobicom'99
Comparison of broadcasting techniques for mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
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
Performance Analysis of Broadcast Protocols in Ad Hoc Networks Based on Self-Pruning

IEEE Transactions on Parallel and Distributed Systems
Stationary Distributions for the Random Waypoint Mobility Model

IEEE Transactions on Mobile Computing
Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network

IEEE Transactions on Computers

An adaptive approach for information dissemination in Vehicular Ad hoc Networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Broadcasting is a process of delivering a message to all nodes in a network. While it is important to ensure that all nodes get a copy of the broadcast message, minimizing the number of sending nodes is equally important especially in resource-constrained wireless networks. Existing broadcasting protocols based on self-pruning are ineffective in achieving these objectives. Therefore this paper proposes two protocols based on simple timer mechanisms to prioritize broadcasting of messages such that node with most uncovered neighbors rebroadcast first. Additionally a timer suppression mechanism is proposed to further enhance the effectiveness of the broadcasting protocol. Compared with an existing protocol, extensive simulation experiments confirm that the proposed protocols achieve better performance.