The Comparison of the 3D graph for the energy-equal of LEACH-Mobile

In this paper, propose an algorithm to improve network lifetime by equally consuming energy of LEACH Mobile sensor nodes. LEACH is one of energy efficient protocols. However, we did not consider the mobility of nodes. Therefore, the transmission reception success rate of the moving data is reduced. LEACH-Mobile is a protocol that has improved the drawbacks of these LEACH. However, since LEACH-Mobile has a larger number of data packets and consumes more energy than LEACH, it has a disadvantage that the lifetime of the network is short. In order to improvement these disadvantage, Based on the average of the remaining energy of the node, cluster heads are elected with a number of nodes whose energies are larger than the average of the remaining energy from the member nodes. After that, by trying to increase the lifetime of the network by equalizing the remaining energy. In to confirm whether improve the lifetime of the network, In this paper, the number of nodes and the position of all nodes are varied for each specific round, the rest energy is equalized, and the algorithm which uniformly selected the cluster head is compared with LEACH.