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.

中文翻译：

---

一种简单高效的无线路由泛洪方案

在许多无线网络中，例如ad hoc，传感器和延迟容忍网络，通过洪泛过程从源节点确定目标节点。泛洪效率对节点很重要，因为节点是由有限的电池驱动的。在本文中，我们提出了一种简单的洪泛方案，该方案基于其自身节点的剩余功率来发送路由请求（RREQ）消息，而无需使用控制包和复杂的计算。我们以提议的按需距离矢量（AODV）路由协议为例，并进行了计算机仿真（ns3）。结果表明，该方案在静态和移动场景下均优于传统方案。第一，我们显示了导致该拟议方案吞吐量降低的节点密度极限，并且该拟议方案在能源效率（位/ J）（包括吞吐量和能耗）方面表现优异。下一步，由于在提出的方案中将淹没次数统一，所有节点的电池更换时间几乎相同。结果，当节点是静态的时，所提出的方案中的寿命比传统方案中的寿命更长。