一种基于能量和时延的动态分簇算法  

Dynamical clustering algorithm based on energy and delay

作　　者：沈玲[1] 李德敏[1] 吴海峰[1] 

机构地区：[1]东华大学信息科学与技术学院,上海201620

出　　处：《计算机工程与应用》2011年第24期67-69,96,共4页Computer Engineering and Applications

基　　金：国家自然科学基金(No.70271001);国家博士后基金(No.2002032191);上海市科委重点计划资助项目(No.05dz05036)~~

摘　　要：在无线传感器网络中,传感器节点的能量由电池提供,有时难以更换。因此,降低能耗是目前无线传感器网络设计中一个很重要的技术问题。通过对层次型路由协议的研究,提出了一种基于能量和时延的动态分簇算法,该算法通过动态地确定每一轮数据收集时无线传感器网络中的簇头数目,从而在满足不超过网络最大延迟时间的基础上,使网络能耗达到最小,最大延迟时间由Sink节点确定。通过仿真实验与传统的LEACH和PEGASIS协议进行比较,结果表明,该算法有效地减少了网络能耗,同时显著降低了传输时延。In wireless sensor network,the energy of sensor nodes is provided by buttery which is sometimes hard to replace.Through the research of the hierarchical routing protocols,it proposes a new dynamical clustering algorithm based on energy and delay.With dynamically determining the cluster head number in the wireless sensor networks each time,it collects the in-formation in order to minimize the network’s energy consumption while satisfying not exceeding the maximum wait time.The maximum wait time is determined by Sink node.The simulation results indicate that the new arithmetic can effectively save the energy and remarkable reduce delay through comparing with the traditional protocols of LEACH and PEGASIS.

关 键 词：无线传感器网络 能耗 时延 动态分簇 

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