北京邮电大学学报

  • EI核心期刊

北京邮电大学学报

• 论文 • 上一篇    下一篇

无线传感器网络的动态树型结构

蔺智挺,屈玉贵, 柏荣刚,赵保华   

  1. 中国科学技术大学 电子工程与信息科学系,安徽 合肥 230027
  • 收稿日期:2006-01-01 修回日期:1900-01-01 出版日期:2006-05-30 发布日期:2006-05-30
  • 通讯作者: 蔺智挺
  • 基金资助:
     

A Dynamic Tree Structure of Wireless Sensor Networks

LIN Zhi-ting, QU Yu-gui, BAI Rong-gang, ZHAO Bao-hua   

  1. Department of Electronic Engineering and Information Science, University of
    Science and Technology of China, HeFei 230027, China
  • Received:2006-01-01 Revised:1900-01-01 Online:2006-05-30 Published:2006-05-30
  • Contact: LIN Zhi-ting
  • Supported by:
     

摘要: 无线传感器网络用于在各种环境中监测信息。在聚簇结构的基础上,文章提出了一种节能的动态树型结构。在动态树型结构中,节点周期轮换当选为首领,网络中的大部分节点只与附近的节点通信,并压缩中转数据,以减少与首领的通信量。节点动态地选择路由,不遵循固定路径传输。仿真结果显示动态树型结构与传统的二层结构相比,可以显著地节约能量,并平衡节点能量消耗。

关键词: 多跳, 传感器网络, 层次协议, 动态树型结构

Abstract: Consisting nodes with limited battery power and wireless communication, sensor webs are deployed to collect useful information from a variety of environments. A new dynamic tree (D-tree) structure protocol based on the clustering protocol was proposed. It has significant impact on the overall energy depletion of the network. In D-tree protocol, most of the nodes communicate only with a close neighbor and incorporate data to reduce the amount of information to transmit to the cluster headers (CH). What should be emphasized is that the data generated by nodes won’t pass through the same route. They search for their multi-hop routing dynamically. The sensor nodes elect the CHs at regular intervals. Simulations show that D-tree can achieve a considerable reduction in energy dissipation compared with conventional routing protocols.

Key words: multi-hop, sensor network, cluster protocol, Dynamic-Tree

中图分类号: