Ant Colony Optimization Based Energy Efficient Routing Algorithms For Routing In Mobile Ad Hoc Networks

摘要

Routing protocols in Mobile Ad-hoc Networks (MANETs) has yielded optimistic results for a long time, but the conflicts begin when we start tofocus on particular parameters of the algorithms, like packet delivery ratio, end-to-end delay, throughput, energy consumptions, etc. These factors arevery crucial in an algorithm as these are the building blocks of the optimal solution. For example, if an algorithm has a satisfactory packet delivery ratiobut the energy used/consumed by the nodes of MANETs is such high that is it not feasible to implement or beneficial to implement in a real-time issue,then the algorithm would not be a practical solution to the efficient routing problem. Ant colony optimization is a heuristic which has so far yielded resultsthat are satisfactory compared to other nature-inspired heuristics. In this paper, we propose Ant Colony Optimization – Energy Efficient RoutingAlgorithm (ACO-EERA), an algorithm which has produced significantly good results in comparison with other algorithms. The algorithm implements afunction which chooses less the nodes with low energy remaining and it reduces the loss of energy of packets being dropped. At the end of the researchpaper, we also compare our proposed algorithm with Ad-Hoc On-demand Distance Vector (AODV), for the factors such as Packet delivery ratio, End toEnd delay and total Energy consumption.