Load aware broadcast in mobile ad hoc networks

Authors:
Md. Tanvir Al Amin;Sukarna Barua;Sudip Vhaduri;Ashikur Rahman
Affiliations:
Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh;Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh;Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh;Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

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
Routing with load balancing in wireless Ad hoc networks

MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
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
Intelligent broadcasting inmobile ad hoc networks: three classes of adaptive protocols

EURASIP Journal on Wireless Communications and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a wireless ad hoc network, the main issue of a good broadcast protocol is to attain maximum reachability with minimal packet forwarding. Existing protocols address this issue by utilizing the knowledge of up to 2-hop neighbors to approximate an MCDS (minimum connected dominating set) via heuristics derived from techniques known as Self pruning and Dominant pruning. Our experiments show that, using these greedy choice heuristics result in a biased load distribution throughout the network. Some nodes become heavily loaded and consequently packets through those nodes, whether unicast or broadcast, experience significantly larger delay. Contention and collision also increase at some regions, while they are relatively low at other regions. In this paper we address these Issues, and propose various methods to evenly distribute the load caused by broadcast packets. Our algorithms take various reactive measures to dynamically include less loaded nodes in the forward list, while maintaining total number of packet forwards low. Detailed simulation using ns-2 shows fair scheduling of resources and significant improvement in distribution of packet forwarding load, packet delay, latency and overall performance.