Authors: Liansheng Tan, Xiaoli Zhan, Jie Li, Fuzhe Zhao
Addresses: 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
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.
Keywords: wireless ad hoc networks; broadcasting redundancy; reachability; sensor networks; wireless networks; broadcast scheduling; simulation.
International Journal of Wireless and Mobile Computing, 2006 Vol.1 No.2, pp.156 - 162
Published online: 16 Feb 2007 *Full-text access for editors Access for subscribers Purchase this article Comment on this article