Heuristic Algorithm Based On Flooding Structure In Wireless Ad Hoc Networks

Abstract

In order to avoid routing overhead and reduce management fee for transmisson of routing information, we purposed two heuristic algorithms which are self-pruning algorithm and dominant pruning algorithm. This algorithm is more efficient than the aimless flooding in wireless networks, and redused unnecessary transmission of information and nodes switching by the movement between neighbourhoods. Result shows that the two kinds of flooding algorithms are obviously superior to the aimless flooding algorithm, particularly the performance of the dominant pruning could almost reach the limit.