Randomized Energy Adaptive Routing in MANET to Increase Network Lifetime and Minimize Energy Consumption

Wireless Sensor Networks

Ad- hoc network is defined as the network in which the users communicate with each other by forming a network on-fly without any centralized node or base station. Here each node act as a host as well as a router and allow packet forwarding to neighbours. Ad hoc networks are highly dynamic in nature. They have highly deployable and self-configurable topologies. Due to self- organizing, self-configuring capability MANET is used in different areas like emergency search and rescue, military, etc. Various routing protocols are defined for these Mobile Ad-hoc networks. One of main problem in Ad hoc network is energy issue in mobile nodes. As the Ad-hoc network node operates on battery power the routing algorithms must take account the node battery status while selecting the routing path between source and destination. The reason of packet drop in MANETs is link break which could be a result of mobility or node failure (due to battery exhaust or some hardware failure). Each drop packet is an energy wastage used in transmission and reception of the dropped packet. The existing routing protocols for MANETs do not support energy based routing path selection as they are not energy adaptive. A new energy Adaptive routing mechanism based on AODV is proposed in this paper which selects the path based on node energy. It calculates the remaining energy levels of the nodes before they are selected for routing path. A threshold value is defined and nodes are considered for routing only if its energy level is above this threshold value. This enforces a fair energy consumption rule on all the nodes of the network between source and destination. Another threshold value is defined which decides when to search for alternate path. If during traffic forwarding a node energy level falls below this threshold value, then the node search for its neighbour with high energy and bypass the traffic to the selected neighbour. This will keep the node from complete battery drain condition and increase the network lifetime. The proposed algorithm also drops some of the unnecessary RREQ randomly based on neighbour count of a node, which further reduce energy consumption of nodes and also reduce congestion during Route Discovery process without affecting the Performance of the routing protocol. The proposed IE-AODV (Improved Energy) is implemented in NS2 simulator. The simulation results have shown an increase in PDR, decrease in delay and throughput is maintained without inducing any significant overhead. The proposed IE-AODV provides more consistent and reliable data transfer compared to general AODV with less average energy consummation. .

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.