无线传感器网络簇头半径自适应调节路由算法

针对LEACH(low energy adaptive clustering hierarchy)算法以随机概率轮选簇头,存在簇头分布不均匀、簇头数量波动大以及簇头选取时未考虑节点剩余能量等问题,提出簇头半径自适应层次型路由算法(cluster-head range adaptive adjustment clus-tering routing,CRACR),引入节点剩余能量作为权重因子选取簇头,采用自适应调节机制控制簇头广播消息的广播半径大小,根据节点的位置和剩余能量分配时隙。通过仿真实验,结果表明CRACR算法的第1个节点死亡"回合"数比LEACH提高了55%以上,节能性能得到了明显的提高。

Cluster-head range adaptive adjustment clustering routing protocol for wireless sensor networks

low energy adaptive clustering hierarchy(LEACH) algorithm uses random probability rotation to choose cluster heads,yet has deficiencies like unbalanced cluster-head distribution,rebounded amount of cluster-heads,and ignorance of the residual energies of sensor nodes.A cluster-head range adaptive adjustment clustering routing(CRACR) protocol is proposed in this paper.Firstly,node residual energy is introduced as a weight factor while choosing cluster-heads.Secondly,adaptive control mechanism is adopted to control the communication range of broadcast packet when a sensor node is chosen to be a cluster-head.Finally,the cluster-heads assign time slots according to the positions and residual energies of the nodes.Simulation results show that compared with LEACH,CRACR outperforms LEACH at least 55% when the first node dies.The energy-saving performance is greatly enhanced.