Aiming at the problem of poor selection of LEACH algorithm cluster head and short network lifetime, an improved LEACH algorithm based on partition is proposed. The algorithm optimizes the cluster head election function according to the remaining energy of nodes, the number of neighbor nodes, and the distance from the base station on the cluster head election, and optimizes the cluster head election function; partitions the monitoring area, and uses different data transmission methods for different partitions to reduce cluster heads near the base station The load of the node forwarding information effectively avoids the occurrence of "energy holes" near the base station. The experimental results show that, compared with LEACH and LEACH-EDP algorithms, the first dead node of the improved algorithm in this paper is delayed by 23.32% and 18.44%, respectively, and the network life is extended by 32.27% and 21.49% respectively.