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. Reference to this paper should be made as follows: Tan, L., Zhan, X., Li, J. and Zhao, F. (2006)
A tree based broadcast algorithm for wireless ad hoc network is proposed in REF .
A novel tree-based broadcast algorithm for wireless ad hoc networks
IJWMC
IJWMC
Computer Science