首页 | 本学科首页   官方微博 | 高级检索  
     

分组敏感的无线传感器网络实时数据融合树算法
引用本文:王结太,许家栋,于海勋. 分组敏感的无线传感器网络实时数据融合树算法[J]. 传感技术学报, 2008, 21(10)
作者姓名:王结太  许家栋  于海勋
作者单位:西北工业大学电子信息学院,西安,710072;西北工业大学电子信息学院,西安,710072;西北工业大学电子信息学院,西安,710072
摘    要:针对无线传感器网络中数据传输必须在指定时延约束下完成的特殊场景提出了一种能量有效的数据融合树算法,该算法首次将分组敏感的概念引入到传感器网络实时数据融合应用中,并通过特殊机制使得该算法在降低能耗水平的同时可以为实时数据动态地选择满足时延要求的路径。另外,针对该数据融合树算法设计了一种特殊的数据融合定时机制,从而进一步改善了该算法的性能。最后,通过仿真试验将该算法与已存在算法进行了比较,证明了该算法的优越性。

关 键 词:无线传感器网络  数据融合  分组敏感  时延约束

A Group-aware Real-time Data Aggregation Tree Algorithm in Wireless Sensor Networks
Wang Jie-tai,Xu Jia-dong,Yu Hai-xun. A Group-aware Real-time Data Aggregation Tree Algorithm in Wireless Sensor Networks[J]. Journal of Transduction Technology, 2008, 21(10)
Authors:Wang Jie-tai  Xu Jia-dong  Yu Hai-xun
Affiliation:School of Electronic and Information, Northwestern Polytechnical University
Abstract:We propose an energy efficient data aggregation tree algorithm for wireless sensor networks under a real-time scenario where the data aggregation must be performed within a specified latency constraint.The algorithm innovatively introduces the group-aware idea into the real-time data aggregation application,and it can choose path satisfying the latency constraint dynamically with lower energy consumption than other existing algorithm through a special mechanism.Moreover,this paper designs a synchronous mechanism for data aggregation timing control to supply special service for real-time data of proposed approach,performance of the proposed algorithm has been improved farther.Finally,extensive simulations show that the proposed algorithm is very efficient in energy-saving under the latency constraint and has better performance than other existing algorithms.
Keywords:wireless sensor networks  data aggregation  group-aware  latency-constraint
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《传感技术学报》浏览原始摘要信息
点击此处可从《传感技术学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号