A non location aware version of modified LEACH algorithm based on residual energy and number of neighbors

A wireless sensor network consists of some sensor nodes that can be effective tool gathering data in various environments. Clustering is one of the methods used to gather information in which sensor nodes are clustered into groups and in each group all sensors communicate only with cluster heads (CHs). CHs send the collected information to a Base Station. Since the energy of the sensors is limited and sending information in each time reduces the nodes´ energy, optimal selecting a CH will be notably effective in decreasing energy consumption of the nodes and therefore increases the network life time. In this paper we present a clustering method to choose the CH in an optimal way without need for information of nodes´ location, based on two parameters of the energy and number of neighbors, considering the mobility of the nodes. The considerable point in the results is that the performance of our algorithm is uniformly in the three cases.