A protocol based on nonrandom selecting of cluster-heads for wireless sensor networks

Generally the energy of each node in wireless sensor networks is restricted, energy efficient and energy evenly distributed route protocol is indispensable to prolong the lifetime of the network. Although Low-Energy Adaptive Clustering Hierarchy (LEACH) and protocols based on LEACH are all low-energy hierarchies, some nodes in network still quickly use up their limited energy, because cluster-heads (CHs) are selected randomly and the number of CHs is fluctuating heavily regardless of energy remaining in the nodes. In this paper, we develop and analyze a protocol which forms clusters like LEACH when first round or after one invalid node or more appear. During other rounds previous CHs can transfer the role of CH to the most energy nodes in corresponding clusters, instead of random reselection of CHs. The information of the residual energy of each node is reported to its cluster-head (CH) in data package at the end of the rounds before invalid one node appears. Moreover number of CHs could change with number of nodes alive. Simulation result shows that the protocol can maximize the time of the network without nodes using up energy, called `no deaths period´.