The Community for Technology Leaders
Green Image
Issue No. 10 - October (2004 vol. 53)
ISSN: 0018-9340
pp: 1343-1354
Jie Wu , IEEE
Fei Dai , IEEE
We propose a generic framework for distributed broadcasting in ad hoc wireless networks. The approach is based on selecting a small subset of nodes to form a forward node set to carry out a broadcast process. The status of each node, forward or nonforward, is determined either by the node itself or by other nodes. Node status can be determined at different snapshots of network state along time (called views) without causing problems in broadcast coverage. Therefore, the forward node set can be constructed and maintained through either a proactive process (i.e., "up-to-date”) before the broadcast process or a reactive process (i.e., "on-the-fly”) during the broadcast process. A sufficient condition, called coverage condition, is given for a node to take the nonforward status. Such a condition can be easily checked locally around the node. Several existing broadcast algorithms can be viewed as special cases of the generic framework with k{\hbox{-}}\rm hop neighborhood information. A comprehensive comparison among existing algorithms is conducted. Simulation results show that new algorithms, which are more efficient than existing ones, can be derived from the generic framework.
Ad hoc wireless networks, broadcasting, distributed algorithms, pruning.

F. Dai and J. Wu, "A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks," in IEEE Transactions on Computers, vol. 53, no. , pp. 1343-1354, 2004.
91 ms
(Ver 3.3 (11022016))