Aiming at some chain topology applications

there is a serious imbalance of energy consumption in traditional WSNs routing. This paper proposes an energy balanced and uneven clustering routing algorithm. In the cluster head election stage

an election method based on the timer is proposed. In the global network

each node sets the time of competition according to the relative residual energy and the distance from the converging node. The smaller the time is

the more successful election probability is

the higher the election probability is. In the data transmission phase

the cluster head constructs the optimal multi hop path based on the minimum spanning tree with the parameters of the relative residual energy and the energy cost. The simulation results show that compared with the existing cluster routing protocols LEACH

DEEC and EEUC

the proposed algorithm can effectively balance the energy consumption and prolong the network life cycle.