Reducing Redundancy by Optimizing Dominant Pruning Algorithm for Wireless Ad Hoc Networks
Sanzida Hoque, Rajashree Majumder, Sanjatul Islam, Tasmiah Tamzid Anannya · 2020
Broadcasting is a fundamental operation in wireless ad hoc network that occurs when a transmitted data packet from source needs to be received by all nodes of the network. Because of the mobility of wireless ad hoc network, broadcast scheduling cannot be facilitated with global topology information and therefore broadcasting is expected to be occurred more often in this network. In this network, the simplest broadcasting mechanism is flooding which may result in redundant re-transmissions, channel contention and packet collisions in the network. Numerous approaches have been proposed to alleviate this problem in different research papers. Among them, Dominant Pruning (DP) algorithm and Counter-based scheme are two efficient approaches. Partial Dominant Pruning (PDP) and Total Dominant Pruning (TDP) are extensions of DP algorithm which further reduces the number of forwarding nodes. In this paper, a new algorithm has been proposed combining advantages of Counter-based scheme with DP which reduces redundancy more efficiently without increasing overhead than DP. Efficiency has been verified by experimental simulation and the result shows that, the proposed algorithm of this paper outperforms DP, PDP and TDP.