一种新的无线可充电传感器网络分簇算法

A Novel Clustering Algorithm of Wireless Rechargeable Sensor Networks

为了弥补现有无线可充电传感器网络充电效率低下和节点能量冗余并存的问题,提出了一种基于节点信息的分簇算法。首先,根据传感器节点的剩余能量状态,选择候选簇首。其次,计算候选簇首集合中节点之间的距离,并与基于节点密度的距离阈值比较,最终筛选出合适的簇首。其他节点根据就近原则选择簇首,形成对应的簇。该算法由于同时考虑节点剩余能量和簇首之间的距离,可以使得具有较多剩余能量的节点成为簇首,且簇首均匀分布整个网络中。仿真结果表明,提出的算法可以提高充电效率,减少节点的能量冗余或节点能量消耗过快而死亡的现象,从而有效延长整个网络的寿命。

In order to solve the problems of low charging efficiency and the energy redundancy in the wireless rechargeable sensor network,a clustering algorithm using node information is proposed.Firstly,the node with more residual energy is selected as a candidate of the cluster head.Then,the distance between the nodes in the set of candidates is calculated.The candidate whose distance to other candidates is smaller than the threshold with lower energy level is deleted.After the set of cluster heads is obtained,other nodes join one cluster by the principle of proximity.As the proposed algorithm considers the residual energy and the distance between cluster heads,only the node with more residual energy can be chosen as the cluster head and all cluster heads are uniformly distributed in the network.The simulation results show that the proposed algorithm can improve the charging efficiency and reduce energy overflow and dead node due to energy shortage,the network lifetime can be effectively prolonged.