分析了分簇无线传感网中的负载不均衡问题，提出了一种实现节点负载均衡的无线传感网能量高效分簇算法. 根据网络模型计算出最优网络分簇数量，通过调整节点的通信半径来控制网络分簇的大小，以分布式周期性迭代的方法竞争选举簇头，形成合理的网络拓扑结构. 不同网络条件下的仿真实验证明，该算法能有效地均衡网络节点负载，从而降低节点能耗，延长网络生存时间，其性能优于典型的无线传感网分簇算法LEACH和HEED.

In this paper, the load balancing problem in clustering wireless sensor networks (WSN) is investigated, and an energy efficient clustering algorithm for achieving load balancing in WSN presented. The proposed algorithm computes optimal network cluster numbers based on the network model, and adjusts the range of the cluster by coordinating the communication range of the node. The nodes select cluster headers in a distributed and iterative manner to form an appropriate architecture of the network topology. In simulations under different network conditions, performance of the algorithm is compared with two typical clusering algorithms of WSN, LEACH and HEED. The results show that the proposed algorithm performs better than the other two algorithms, and can effectively balance the load of nodes. Thus it reduces energy consumption of the nodes and prolongs the network’s lifespan.