摘要
针对LEACH算法在选举簇首时没有考虑节点的剩余能量,并且簇首的分布不均匀,簇内节点与簇首采取单跳通信,从而影响网络生命期的问题,提出了利用剩余能量和最小邻近簇半径调整节点成为簇首的概率,并在簇内对部分节点采取多跳通信的成簇算法。仿真结果表明,该算法有效延长了网络生命期,均衡了簇首的分布,并且改善了簇内的结构。
As for the problem of LEACH clustering algorithm not considering the residual energy of nodes when selecting cluster heads,and the distributing of the heads not uniformity,members of the cluster communicating with the head by one- hop,which impacts lifetime of the network. A clUstering algorithm is proposed which adjusts the probability of becoming cluster head by residual energy and least adjacent clustering radius,and takes multi - hop communicating for some nodes. The results of simulation prove that this algorithm can prolong the lifetime of network and balance distributing of the heads and improve structure of the members of cluster.
出处
《现代电子技术》
2009年第3期4-6,10,共4页
Modern Electronics Technique
基金
国家自然科学基金资助项目(60674108)
关键词
簇首
网络生命期
成簇算法
剩余能量
cluster head
lifetime of network
clustering algorithm
residual energy
