关键词: 无线传感器网络, 负载均衡, 自适应分组成簇, 距离竞争

Abstract: In cluster-based routing algorithms, the drawbacks of classical Low Energy Adaptive Clustering Hierarchy (LEACH) algorithm and Steady Group Clustering Hierarchy (SGCH) algorithm were analyzed to propose a new adaptive group clustering hierarchy (AGCH) algorithm. During the group stage, the group heads candidate were firstly randomly selected, and then all the network nodes were divided into fixed groups through range competition among the heads. When selecting cluster head, each group considered not only the residential energy of nodes, but also their intergroup communication cost. The simulation results show that the proposed algorithm can effectively balance the network energy consumption and prolong the stability period of sensor networks.

Key words: Wireless Sensor Network (WSN), Load balance, adaptive group clustering, range competition