OPTIMIZATION ROUTING ALGORITHMS FOR ENERGY EFFICIENCY IN MOBILE AD HOC NETWORKS
K. Uday Kumar Reddy, Dr. P. Subbaiah
MANET; Power conservation, Energy Efficiency, Power management, Topology, Event Based Schemes
Mobile Ad hoc Network (MANET) is a collection of mobile nodes that are arbitrarily located in the network environment. With the dawn of the new era and rising demands of customers, the mobile ad hoc networks has come into full force. But large amount of data usages and complex applications demands the devices to be more and more efficient in terms of utilization of their batteries thus giving rise to most important energy conservation problem in MANETs. The interconnections between the nodes are dynamically changing. Mobile nodes form a temporary network without the use of any existing network infrastructure or centralized administration. A routing protocol is used to find routes between the mobile nodes to facilitate communication within the network. The limited battery power of each node in the MANET requires the optimum use of energy.. Ant colony optimization (ACO) Algorithm has shown to be good techniques for optimizing the solutions for energy constrained problems. The Ant Colony Optimization (ACO) routing technique is adaptive and reliable approach to find the path in routing for MANETs. In ACO algorithms the ant as agent traverses across the network to find the shortest path from the source to destination. The high probability of pheromone is chosen as the optimized path to transfer data packets between the source and destination. The selection of the optimal path is based on the residual energy of the nodes in that path. This algorithms highlights the ability to use ant as an agents to perform foraging activities to communicate between the nodes and to achieve the robustness of an energy efficient shortest path in MANETs. This paper describe the detailed survey of energy based ACO algorithms in MANET.