Using Energy Efficient Relative Neighborhood Graph for AODV Routing Protocol in MANETs

Mobile Ad-hoc Networks (MANET) are self-organizing networks composed of mobile nodes without any fixed infrastructure. The design and the implementation of efficient and scalable routing protocols constitute one main issue. However, routing protocols for MANETs are mainly based on computing the shortest paths and could not be energy efficient. Nodes failure based on power deficiency could affect the overall network lifetime. In our previous work, since in AODV, the processing time of packets stored in nodes queues in- creases as the number of packets increases, we have introduced an enhanced version, named QAODV(26), of the standard AODV (SAODV) protocol. In this enhanced version, we have included a technique to control the packet waiting time inside queues. Simulations have been conducted to compare QAODV protocol with SAODV in terms of network lifetime as well as packet delivery ratio. Simulation results showed that QAODV outperforms SAODV. In this paper, we further study the impact of using an efficient energy relative neigh- borhood graph (e-RNG) on the performance of QAODV in MANETs. Simulation results show that e-RNG provides better performance while decreasing the energy consumption.