A Simple and Energy-Efficient Flooding Scheme for Wireless Routing

Abstract EN

In many wireless networks, such as ad hoc, sensor, and delay-tolerant networks, the destination node is determined from the source node by the flooding process.

Flooding efficiency is important for nodes, because they are driven by limited batteries.

In this paper, we propose a simple flooding scheme to transmit a route request (RREQ) message based on the remaining power of its own node without using control packets and complex calculations.

We applied the proposed scheme to ad hoc on-demand distance vector (AODV) routing protocol as an example and carried out computer simulations (ns3).

The results showed that the proposed scheme was superior to conventional schemes in static and mobile scenarios.

First, we showed the limit of node density that causes the decrease of throughput in the proposed scheme and that the proposed scheme was superior in terms of energy efficiency (bits/J), including throughput and energy consumption.

Next, as the number of flooding times is made uniform in the proposed scheme, all nodes will have almost the same battery replacement time.

As a result, when the nodes are static, the lifetime in the proposed scheme is longer than that in the conventional scheme.