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.%分析了分簇路由协议中的经典低功耗自适应集簇分层型协议(LEACH)算法与分组成簇算法--SGCH的不足,提出了一种分布式分组成簇算法--AGCH.首先分布式随机生成候选组首,然后通过距离竞争将所有节点分为固定的分组;各分组选取簇首时,综合考虑节点的剩余能量及其簇内通信代价.仿真实验表明,该算法能有效均衡网络能耗,延长网络的稳定期.
展开▼
