Abstract : LEACH (Low Energy Adaptive Clustering Hierarchy) is a classic WSN routing protocol that has gained widespread acceptance. This paper proposes a new routing protocol based on the LEACH algorithm, which comprehensively considers the remaining energy of candidate nodes, the distribution location of cluster head nodes, and the number of cluster head nodes. This effectively reduces the possibility of low-energy and poorly located nodes being selected as cluster heads, further ensuring the balance of energy load on network nodes. Simulation results show that the algorithm can effectively balance the energy consumption distribution of nodes and extend the lifetime of nodes and the network. Keywords : Wireless sensor network; LEACH protocol; energy efficiency; load balancing 1. Introduction Wireless sensor networks are self-organizing (ad-hoc) distributed network systems composed of a large number of ubiquitous, tiny sensor nodes with wireless communication and computing capabilities. They are "intelligent" systems that can autonomously complete specified tasks according to the environment. It is "data-centric" and has limited computing power, limited storage power, limited wireless communication power, and limited power supply. How to acquire as much effective feature information of the sensed objects as possible in such a resource-constrained environment and transmit it to user nodes for processing is the current research focus. These problems can all be reduced to the routing problem of sensor networks, that is, to have a good routing protocol to minimize energy consumption and extend network lifetime. Routing protocols for wireless sensor networks can be divided into two types: planar routing protocols and hierarchical routing protocols. Since planar routing protocols need to maintain a large routing table and occupy a lot of storage space, they are not suitable for large-scale networks. Hierarchical routing algorithms can solve this problem to some extent. The LEACH algorithm is a relatively mature, classic, and commonly used representative hierarchical routing algorithm. Therefore, this paper mainly studies the LEACH algorithm and improves it to address its shortcomings. 2. LEACH Routing Algorithm 2.1 Algorithm Description LEACH is a low-power adaptive hierarchical routing algorithm designed by Chandrakasan et al. of MIT for wireless sensor networks. Its basic idea is to randomly select cluster head nodes in a cyclical manner, distributing the energy load of the entire network evenly among each sensor node, thereby reducing network energy consumption and improving the overall network lifetime. LEACH continuously executes the cluster reconstruction process during operation. Each cluster reconstruction process can be described using the concept of a "round." Each round can be divided into two phases: the cluster establishment phase and the data transmission stabilization phase. To save resource overhead, the duration of the stabilization phase is longer than the duration of the establishment phase. The selection of cluster head nodes is determined based on the total number of cluster head nodes required in the network and the number of times each node has been a cluster head so far. Specifically, each sensor node selects a value between 0 and 1. If the selected value is less than a certain threshold T(n), then this node becomes a cluster head node. The threshold T(n) is calculated as follows: [Full text download of "Research and Improvement of LEACH Protocol for Wireless Sensor Networks"]