摘要
提出了一种基于网络中现场数据的响应式节能动态成簇(REDC:Reactive Energy-saving Dynamic-Clustering)算法.算法中网络节点采用了基于事件驱动的响应式路由,通过设置节点的局部阈值和动作阈值,将网络中的信息分类,利用局部数据的相似性和等时性动态选举临时簇首,临时簇首对收集到的数据进行融合.同时采用了两种节能策略,使网络的能量消耗更加均衡,有效地延长了网络的生存时间.仿真结果表明REDC是一种有效节能的响应式动态成簇算法,延长了网络的生存时间.
A Reactive Energy-saving Dynamic-Clustering （REDC） algorithm is proposed according to the field data in network where the nodes are driven by events. All the information is classified by setting local and action thresholds of those nodes from which a temporary cluster-head is selected for the fusion of all the data acquired, according to the similarity and isochronism of local field data. At the same time, two kinds of energy-saving strategies are provided to balance the further network power consumption, thus lengthening the network＇ s lifetime considerably. Simulation results revealed that the REDC algorithm is really efficient.
出处
《东北大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2007年第4期501-504,共4页
Journal of Northeastern University(Natural Science)
基金
国家高技术研究发展计划项目(2002AA784030)
关键词
无线传感器网络
节能
动态成簇
网络主干
wireless sensor network
energy-saving
dynamic-clustering
network backbone
