Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (12): 107-109.DOI: 10.3778/j.issn.1002-8331.2009.12.035

• 网络、通信、安全 • Previous Articles     Next Articles

Tree-based distributed algorithm for data collection in sensor networks

YUAN Hui-yong1,2,LIN Ya-ping2,LI Xiao-long2,YI Ye-qing1,2   

  1. 1.Department of Computer Science,Hunan Institute of Humanities Science and Technology,Loudi,Hunan 417000,China
    2.College of Computer and Communication,Hunan University,Changsha 410082,China
  • Received:2008-03-06 Revised:2008-05-26 Online:2009-04-21 Published:2009-04-21
  • Contact: YUAN Hui-yong

传感器网络中基于树的分布式数据收集算法

袁辉勇1,2,林亚平2,李小龙2,易叶青1,2   

  1. 1.湖南人文科技学院 计算机系,湖南 娄底 417000
    2.湖南大学 计算机与通信学院,长沙 410082
  • 通讯作者: 袁辉勇

Abstract: Data collection is a fundamental task in sensor networks.The sensor nodes are typically highly resource constrained and easily failed.How to design a low energy comsumption scalable data collection scheme for sensor networks is a crucial consideration.This paper proposes a distributed data collection scheme based on trees.In the scheme,firstly,the base station sends a broadcast packet to all senor nodes,then the hierachical structure of sensor networks is established based on the minimum hops from each sensor node to the base station,lastly,a tree transmission model whose root is the base station is got based on the hierachical structure.Sensor networks will collect data based on the model.Theory and simulation analyses show that the scheme can achieve low complexity,long lifetime,good scalability and strong robustness.

Key words: sensor network, data collection, spanning tree, energy-efficient

摘要: 数据收集是传感器网络的根本任务,由于传感器网络节点能量有限、易失效等因素,如何设计一个低能耗的、可扩展性强的数据收集机制是传感器网络的一个关键问题。为此,提出一种基于树的分布式数据收集算法,其基本思想是:基站发送广播信息,根据节点到基站的最小跳数构造出网络的层次结构,由层次结构生成以基站为树根的树型传输网络,并基于该网络模型收集数据。理论分析和仿真实验表明该算法具有较低的复杂度,能有效地延长网络的生命周期,并具有良好的扩展性和容错性。

关键词: 传感器网络, 数据收集, 生成树, 能量有效