计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (12): 99-102.DOI: 10.3778/j.issn.1002-8331.2010.12.028

• 网络、通信、安全 • 上一篇    下一篇

传感器网络中基于簇的融合树构建算法

林 益1,杨 靖2,3,李捍东3   

  1. 1.贵州大学 教务处,贵阳 550025
    2.江南大学 通信与控制工程学院,江苏 无锡 214122
    3.贵州大学 电气工程学院,贵阳 550025
  • 收稿日期:2008-10-17 修回日期:2009-01-13 出版日期:2010-04-21 发布日期:2010-04-21
  • 通讯作者: 林 益

Aggregation tree constructing algorithm based on clustering for sensor networks

LIN Yi1,YANG Jing2,3,LI Han-dong3   

  1. 1.Educational Administration Office,Guizhou University,Guiyang 550025,China
    2.School of Communication and Control Engineering,Jiangnan University,Wuxi,Jiangsu 214122,China
    3.College of Electric Engineering,Guizhou University,Guiyang 550025,China
  • Received:2008-10-17 Revised:2009-01-13 Online:2010-04-21 Published:2010-04-21
  • Contact: LIN Yi

摘要: 针对无线传感器网络中节点能量有限的特点,提出一种基于簇的数据融合树构建算法。该算法利用基于簇的层次结构减少路由维护代价并提高系统可扩展性;利用数据融合树处理网中冗余信息,降低数据传输量,实现了节点能量高效地使用。仿真结果表明,该算法能有效降低节点能量消耗,并延长网络生存期,性能优于典型算法。

Abstract: An aggregation tree constructing algorithm based on clustering is proposed,according to the limited resources of nodes in Wireless Sensor Networks(WSNs).The proposed algorithm uses clustering’s hierarchical structure to decrease routing control overhead and improve the networks scalability,and uses data aggregation tree to deal with redundant information and reduce traffic.The simulation results show that the proposed algorithm can reduce energy consumption efficiently and prolong networks lifetime.The performance is better than that of typical routing algorithm.

中图分类号: