Issue No. 02 - April-June (2002 vol. 1)
<p><b>Abstract</b>—Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is generally used as the cost criterion for broadcasting. The problem of finding the minimum number of forward nodes is NP-complete. Among various approximation approaches, dominant pruning utilizes 2-hop neighborhood information to reduce redundant transmissions. In this paper, we analyze some deficiencies of the dominant pruning algorithm and propose two better approximation algorithms: total dominant pruning and partial dominant pruning. Both algorithms utilize 2-hop neighborhood information more effectively to reduce redundant transmissions. Simulation results of applying these two algorithms show performance improvements compared with the original dominant pruning. In addition, two termination criteria are discussed and compared through simulation under both the static and dynamic environments.</p>
Ad hoc wireless networks, broadcast, dominant pruning, flooding.
W. Lou and J. Wu, "On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks," in IEEE Transactions on Mobile Computing, vol. 1, no. , pp. 111-123, 2002.