Optimizing dominant pruning algorithm using three hop neighbor information

Abstract

Reducing number of forwarding nodes is an important issue to consider when same message needs to be broadcast to all the nodes in a multi-hop ad hoc wireless network. Without proper measures broadcasting may result in many redundant transmissions that increases network traf- fic and the energy expenses of the nodes. Among many algorithms, the prominent Dominant Pruning (DP) proactive algorithm reduces re-transmissions to a great extent using only 2-hop neighbor information of each node. Partial Dominant Pruning (PDP) and Total Dominant Prun- ing (TDP) are two variants of DP which use neighborhood information more effectively. Ac- cording to DP, PDP and TDP, a node selects a subset of nodes from its neighbors as intermediate forwarding nodes based on 2-hop neighborhood information. In this thesis, we propose a new broadcast method based on DP which uses (extended) 3-hop neighborhood information of each node in order to reduce redundancy. Expanding neighborhood knowledge up to 3-hops pro- vides added advantage to the forwarding nodes to detect which nodes are going to be covered by other nodes in the forwarding list of the previous nodes. Thus, redundant transmissions are further reduced using 3-hop neighbor information. Though the new approach requires addi- tional information, the total energy consumed by the entire network and the total number of packet forwarding are much less compared to DP, PDP and TDP.