A new strategy for WSN routing convergence

In recent years, many clustering algorithms have been proposed to solve the problem of routing. However, many of these algorithms have the problem of uneven load of cluster heads. In this paper, we present an algorithm - the maximum balance cluster head energy consumes of routing (MCR) - to solve the above problem. In our proposed MCR algorithm, when ordinary nodes receive broadcast information from different cluster heads, the one that been selected is judged by the distance, as well as the giving comprehensive consideration of the distance and energy consumption of cluster head. Proper measures are also needed to increase the working time of cluster head as much as possible. Moreover, when the selected cluster head rotated, the remaining energy of the nodes is the major consideration. Simulation results show that our MCR algorithm can reduce the energy consumption and extend the network lifetime as well.