Election Algorithm for AODV Routing Protocol in Mobile Adhoc Network

Wireless Ad hoc network has a lack of infrastructure and decentralized network. It is a collection of mobile nodes which has energy, some restricted bandwidth and computational functionality also. Due to its mobility behavior rigorous type of vulnerabilities may get compromised from the nodes which consumes the energy mostly and exploits the bandwidth of the transmitting node. The energy consumption is momentous issue as mobile nodes have battery power. To extend the lifetime of ad hoc network, it is serious issues to minimize the energy consumption of mobile nodes. In this work, an efficient energy conserving scheme which uses election algorithm technique is proposed. This approach is much more efficient in preserving the energy of mobile nodes and also prevents it from the exploitation of bandwidth. The experimental analysis of proposed approach is done in network simulator NS2.34. For measuring the performance of the proposed approach different performance measuring parameter such as Packet Delivery Ratio (PDR), Routing Load and Energy Consumption and Delay is used.