Adapted DP Based Algorithm with Distance-Based Approach in Ad Hoc Networks

Ad-hoc networks are self-organizing, multi-hop wireless networks. When performing a route discovery process, ad-hoc networks depend on the broadcasting capability. It´s an important goal to broadcast with efficiency and reliability. Otherwise, the data broadcasting will cause the network flood (broadcast storm). However, a reliable broadcast algorithm, which is less redundant broadcasts, contention and collision, is harder to obtain. In this paper, we use adapted Dominating Pruning (DP) based algorithm with distance-based approach to solve redundant broadcasts in ad-hoc networks. Original DP based algorithm uses the forwarding nodes, which forward the broadcast to most of the nodes as the next rebroadcast transmission. Moreover, DP based algorithm will have more efficiency in practice when we consider the transmitting range. In our study, we found that there are some drawbacks in DP algorithm in ad hoc networks. Therefore, we proposed method to solve the DP algorithm problems and adapted it with distanced-based approach, which can be used for DP algorithm when it can´t make decision which two forward nodes have some conditions sometimes