Enhanced Dominant Pruning Applied to the Route Discovery Process of On- Demand Routing Protocols

摘要

Dominant Pruning (DP) is a distributed connected dominating-set algorithm that can be used for reducing the impact of flooding in wireless ad- hoc networks. We propose an enhanced dominant pruning (EDP) approach to be used in the route discovery process of on-demand routing protocols. To show the benefits of EDP, we integrated EDP into the Ad-hoc On-demand Distance Vector (AODV) protocol. We present detailed simulation results showing that our approach improves standard AODV in most aspects, and that it is simple and easy to implement. Our approach is compared against AODV and OLSR, as good representatives of on-demand and proactive routing for ad-hoc wireless networks.