The full text of this article:

A novel tree-based broadcast algorithm for wireless ad hoc networks
by Liansheng Tan, Xiaoli Zhan, Jie Li, Fuzhe Zhao
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 1, No. 2, 2006
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.

is only available to individual subscribers or to users at subscribing institutions.

Pay per view: If you are not a Subscriber and you just want to read the full contents of this article, please click here to purchase online access to the full-text of this article. Please allow 3 days + mailing time. Current price for article is Thirty Euros (€30)

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC) journal, that have been redirected here, please check if you have a registered username/password subscription with Inderscience. If that is the case, please Login:

If you are not yet a Subscriber to International Journal of Wireless and Mobile Computing (IJWMC) journal, you can subscribe by following a few simple and quick steps. A subscription will give you complete access to all articles in the current issue, as well as to all articles in the previous three years, where applicable. Click here to subscribe.

Should you experience further difficulties or have any enquiries, please email subs@inderscience.com