Design and Implementation of Leach-x Routing Protocol based on Wireless Sensor Networks

Abstract:
From the perspective of cluster head selection, the LEACH algorithm introduces the concept of rounds and continuously performs cluster reconfiguration cyclically during operation. In each round, during the cluster establishment phase, the node decides whether to become a cluster head node based on the random number generated by itself and the threshold T(n), which can effectively control the energy loss rate of the node and prolong the lifetime of the WSN compared with other algorithms. However, the LEACH algorithm only introduces the concept of rounds, but does not consider the current energy of nodes when selecting cluster heads, which may lead to accelerate the rate of node death and lead to a shorter life span of WSN network structure and a slower transmission speed. To solve this problem, we introduced the current energy factor as a compensation mechanism in the cluster head selection, which reduces the probability of lower energy nodes becoming cluster heads. And according to the simulation experiments, as the number of simulated nodes increases, Leach-x significantly delays the first node death time, and increases the final number of nodes surviving and overall extends the lifetime of WSN than Leach does.