一种可扩展的WSN节能分簇算法

An Extensible and Energy-efficient Clustering Algorithm of WSN

摘要:

为了减少网络重建所带来的能量消耗,本文提出一种可扩展的WSN节能分簇算法(AEECA)。首先根据节点的剩余能量在全网范围内进行候选簇首的选举,然后普通节点根据候选簇首的价值度、剩余能量、邻居节点数目等因素来选择自己要加入的簇首。当簇内平均剩余能量大于某个阈值时,采用簇内簇首轮换的方式,不需在全网范围重新选择簇首；当新节点申请入网时,根据周围簇首剩余能量、当前负载、位置分布等因素来计算入网许可值,选择许可值最大的簇首加入,并通过簇首分配的预留时隙进行数据传输。仿真结果表明：与LEACH、EEUC等经典分簇算法相比,本文算法可以有效地均衡节点的能量消耗,延长网络的生命周期。

Abstract:

In order to reduce the energy consumption caused by network reconstruction, this paper proposes an extensible WSN energy saving clustering algorithm (AEECA).Firstly, the candidate cluster heads are selected in the whole network according to the residual energy of nodes, and then the common nodes choose the cluster heads they want to join according to the value degree of candidate cluster heads, residual energy, number of neighbor nodes and other factors. When the average residual energy in the cluster is greater than a certain threshold, the head of the cluster shall be rotated in the cluster, and there is no need to re-select the head of the cluster in the whole network. When a new node applies for network access, it calculates the network access permit value according to the surrounding cluster head residual energy, current load, location distribution and other factors, selects the cluster head with the maximum permit value to join, and carries out data transmission through the reserved time slot allocated by the cluster head. Simulation results show that compared with LEACH, EEUC and other classical clustering algorithms, the proposed algorithm can effectively balance the energy consumption of nodes and prolong the life cycle of the network.