The route discovery process of on-demand routing protocols is based on route request (RREQ) packets that are propagated using either an unrestricted broadcast (flooding) or an expanding ring search. We apply two enhancements to this basic process aimed at reducing the overhead incurred in the dissemination of RREQs. First, we apply the Enhanced Dominant Pruning (EDP), which is a distributed connected dominating-set algorithm used for reducing the number of nodes that need to propagate RREQs transmitted on broadcast mode. Second, information regarding prior routes to a destination is used to unicast RREQs to a region close to the intended destination. Directional antennas are assumed, which provide higher spatial reuse than omni-directional antennas for unicast transmission. We show the benefits of our approach using the Ad-hoc On-demand Distance Vector (AODV) protocol as an example. Detailed simulation results show that using EDP and unicast RREQs provide substantial performance improvements over standard AODV running in ad hoc networks with directional antennas. On-demand unicast routing, route discovery, broadcast in wireless ad-hoc networks, dominant pruning.
In REF , Marco Aur é lio Spohn et al. apply two enhancements aimed at reducing the overhead incurred in the dissemination of RREQs.
Enhancing the Route Discovery Process of On-Demand Routing in Networks with Directional Antennas
NETWORKING
Computer Science