基于能量最小路径的WSN分簇算法  

Clustering Algorithm for Wireless Sensor Network Based on Minimum Energy Path

作　　者：龚闻天[1] 樊镭[1] 施晓秋[1] 

机构地区：[1]温州大学物理与电子信息工程学院,浙江温州325035

出　　处：《计算机工程》2012年第3期74-76,79,共4页Computer Engineering

基　　金：国家自然科学基金资助项目"基于迭代测距整合的无线网络可定位性与定位算法研究"(60970118)

摘　　要：为延长无线传感器网络(WSN)的生存时间,提出一种基于能量最小路径的WSN分簇算法。参照节点的剩余能量与全网动态平均能量的比例关系,决定节点是否成为簇头,并结合簇头间的能量最小路径,实现全网的能耗均衡。仿真结果显示,该算法在网络生存时间、数据吞吐量和网络能耗等指标上性能较优。In order to improve the lifetime of Wireless Sensor Network（WSN）, this paper proposes a clustering algorithm for WSN based on minimum energy path. It evaluates the ratio of residual energy of a particular node to the average energy of the network, and uses the ratio to determine whether the node would become a cluster head. It uses the minimum energy paths between the cluster heads to achieve balanced energy consumption of the network. Simulation results show that the proposed algorithm can improve the network lifetime, energy consumption and data throughput.

关 键 词：无线传感器网络 分簇算法 网络生存时间 能量最小路径 数据转发 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]