无线传感器网络中一种全局节能的聚合树构建算法  

Global energy-efficient aggregation tree constructing algorithm for WSN

作　　者：申帅[1] 林亚平[1,2] 胡玉鹏[1] 徐小龙[1] 余建平[1] 

机构地区：[1]湖南大学计算机与通信学院,长沙410082 [2]湖南大学软件学院,长沙410082

出　　处：《计算机应用》2009年第4期1068-1071,共4页journal of Computer Applications

基　　金：国家863计划项目(2006AA01Z227)

摘　　要：针对聚合树构建过程中存在大量冗余广播消息,导致全局能耗过大的问题,分析了聚合树构建算法性能,提出了一种全局节能聚合树构建算法,只需在已知树内部交换信息即可得到离树最近的源节点,避免了网络中广播消息的产生,其构建能耗受节点密度影响很小且保持在较低水平。由于构建时间不受探测消息周期制约,可有效提高聚合树构建速度。实验表明该聚合树构建方法能有效降低消息交换数量及构建时间,聚合效果等同于采用贪婪增长树(GIT)算法的聚合树。Constructing an aggregation tree generates a large number of redundant broadcast messages, which leads to the excessive energy dissipation in entire sensor network. This paper analyzed the performance of aggregation tree constructing algorithms and proposed a global energy-efficient aggregation tree constructing algorithm based on greedy incremental tree. This algorithm got the best candidate＇s information with few packets exchanged in presence tree and avoided mass exploratory messages broadcasted by sources periodically. The global energy consumption of constructing the aggregation tree was affected by node density slightly and maintained at a relatively low level. Since the construction time was no longer restricted by the exploratory messages＇ periods, the algorithm can improve the speed of constructing a greedy incremental tree. The simulation results show the algorithm decreases the number of packets in entire network effectively and provides low latency. The effect of aggregation is equivalent to the tree constructed by Greedy Incremental Tree （GIT） algorithm.

关 键 词：无线传感器网络 数据聚合 贪婪增长树 全局节能 数据查询 

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