PTTC:无线传感网络分簇算法  

PTTC:Clustering algorithm for Wireless Sensor Networks

作　　者：王智超[1] 

机构地区：[1]武昌理工学院信息工程学院,湖北武汉430223

出　　处：《电子技术应用》2016年第9期91-94,共4页Application of Electronic Technique

基　　金：湖北省教育厅科学技术研究项目(B2015280)

摘　　要：分簇是延长无线传感网络寿命的有效技术。为此,提出了基于Prim的树簇拓扑的无线传感网络分簇PTTC算法。PTTC算法首先推导最优的簇数,再计算节点被选为簇头的平均概率。然后,结合节点的剩余能量以及被选为簇头的频率数选择簇头,最后利用Prim算法建立树,节点依据树传输数据,进而提高能量利用率,扩延网络寿命。仿真结果表明,提出的PTTC算法平衡了节点间的能量消耗,有效地延长了网络寿命。Clustering in WSNs is an effective technique for prolonging the network lifetime. Therefore, Prim based tree topology Clustering algorithm for wireless sensor networks（PTTC） is proposed in this paper. PTTC algorithm decides optimal number of clusters, and calculate the probability of optimum number of cluster head. After that, PTTC algorithm introduces current energy and the count that the node has been selected as CH to stochastically select the CH. Finally, the tree in cluster is computed by Prim algorithm,and the data is transmitted among tree. This improves the energy efficient and longer network lifetime. Simulation shows that PTTC algorithm effectively reduces and balances the energy consumption among the nodes, and thus significantly extends the network lifetime.

关 键 词：无线传感网 簇 能量 树 普里姆算法 

分 类 号：TN92[电子电信—通信与信息系统] TP393[电子电信—信息与通信工程]