Making On-Demand Routing Efficient with Route-Request Aggregation

TL;DR

This paper proposes a novel on-demand routing method for MANETs that aggregates route requests to reduce signaling overhead, improving efficiency compared to existing protocols.

Contribution

It introduces RREQ aggregation to on-demand routing, applicable to any protocol, demonstrated through ADARA, which outperforms AODV and OLSR in simulations.

Findings

RREQ aggregation reduces signaling overhead.

ADARA outperforms AODV and OLSR in efficiency.

Aggregation makes on-demand routing more scalable.

Abstract

In theory, on-demand routing is very attractive for mobile ad hoc networks (MANET), because it induces signaling only for those destinations for which there is data traffic. However, in practice, the signaling overhead of existing on-demand routing protocols becomes excessive as the rate of topology changes increases due to mobility or other causes. We introduce the first on-demand routing approach that eliminates the main limitation of on-demand routing by aggregating route requests (RREQ) for the same destinations. The approach can be applied to any existing on-demand routing protocol, and we introduce the Ad-hoc Demand-Aggregated Routing with Adaptation (ADARA) as an example of how RREQ aggregation can be used. ADARA is compared to AODV and OLSR using discrete-event simulations, and the results show that aggregating RREQs can make on-demand routing more efficient than existing proactive or on-demand routing protocols.