A novel tree-based broadcast algorithm for wireless ad hoc networks

Authors:
Liansheng Tan;Xiaoli Zhan;Jie Li;Fuzhe Zhao
Affiliations:
The Research School of Information Sciences and Engineering, The Australian National University, Canberra ACT 0200, Australia.;Department of Computer Science, Central China Normal University, Wuhan 430079, PR China.;Department of Computer Science, Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba Science City, Japan.;Department of Computer Science, Central China Normal University, Wuhan 430079, PR China
Venue:
International Journal of Wireless and Mobile Computing
Year:
2006

Citing 10
Cited 2

Tree-Based Broadcasting in Multihop Radio Networks

IEEE Transactions on Computers
Introduction to algorithms

Introduction to algorithms
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
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
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation Algorithms for Connected Dominating Sets

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Minimizing broadcast latency and redundancy in ad hoc networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Editorial: wireless sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection

Distributed Computing

Survivable network design problems in wireless networks

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A novel cooperative relay scheme employing fountain codes and rotated constellations

International Journal of Wireless and Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

One designing challenge in the scheduling of broadcast in wireless ad hoc networks is to reduce broadcast redundancy and provide high reachability, simultaneously. In this paper, we propose a broadcasting algorithm in wireless ad hoc networks. The algorithm uses two-hop neighbourhood information to construct the broadcast tree, in which the information can be gathered via exchanging 'hello' messages within the neighbour nodes. The channel is allocated to the non-leaf nodes in the broadcast tree in a time-oriented way to ensure that the forwarding of the broadcasted message along the broadcast tree is collision-free. Both theoretical analysis and simulation results demonstrate that our scheme is efficient in terms of the bounded broadcast redundancy and the highest reachability.