Localized energy conservation algorithm

Energy is one of the most important metric when we talk about Mobile ad-hoc networks. In order to increase the system's life-time, energy consumption has to be minimized. Here we will look at some energy saving algorithms. The initial analysis tells us that LECA conserves more energy that SPAN or any other algorithm. We present a Localized Energy Conservation Algorithm (LECA) [3] for routing in Mobile Ad-hoc Networks (MANETs), to reduce energy consumption while being able to maintain performance levels. In LECA a small subset nodes, called coordinators, is selected to participate in routing while the others are put off to conserve power. The number of coordinators selected is lower than the corresponding number in the existing methods. This makes it possible for the network to attain high performance levels although a sparse set of coordinators are elected to reduce energy consumption to the bare minimum. we proposed a localized algorithm for conservation of energy in MANET's, without compromising the system performance. The algorithm presented here (LECA) selects minimum number of coordinators which constitute a connected backbone.