期刊文献+

一种基于能耗度量的融合树构建算法 被引量:6

An Aggregation Tree Constructing Algorithm Based on Energy Consumption Assessment
下载PDF
导出
摘要 基于传感器节点能耗情况对数据压缩以及数据融合进行了分析,针对在非完全融合情况下,贪婪增长树(GIT)算法构建融合树时并不能很好选择最优路由的问题,提出了一种基于能耗度量的融合树构建算法,通过融合节点反馈能耗以及到达Sink节点的跳数信息,对多个路由的能耗进行评估,进而选择低能耗路由.同时提出了一种由信息源节点进行路径加强的策略,减小了路径加强信息量以及多路径记录带来的负担.模拟实验数据表明,该算法在数据融合压缩比较小的情况下节能效果优于贪婪增长树GIT算法,并且随着信息源与Sink节点距离的增大,路径加强信息的数量也有很大降低. This paper first gives an analysis of data aggregation and data compression based on energy consumption of sensor nodes, after which an approach is proposed to construct an aggregation tree in the case of non-perfect aggregation, since GIT considers only the case of perfect aggregation and it does not work well if the aggregation is non-perfect. An assessment scheme that can get the information of hops from the aggregation point to the sink and the hops from the aggregation point to the source node is used to construct such an aggregation tree. Moreover, the energy consumption of the aggregation is also considered. This scheme can be used when perfect aggregation cannot be performed. In this paper, an approach to reduce the cost of reinforcement is also proposed, in which the reinforcement work is done by the source nodes themselves, not by the sink node. Simulation result shows that this approach can save more energy than GIT when the aggregation ratio is small. This result also provides a theoretical limit of aggregation to tell when GIT will lose its superiority and thus gives a direction to choose among the aggregation algorithms. Another result shows that the further the sources are away from the sink, the less reinforcement messages are needed. Finally a guidance to tell when to use the ECA (energy consumption assessment) scheme is given.
出处 《计算机研究与发展》 EI CSCD 北大核心 2008年第1期104-109,共6页 Journal of Computer Research and Development
基金 国家自然科学基金项目(60573128) 国家教育部博士点基金项目(20060183043)~~
关键词 无线传感器网络 数据融合 节能 贪婪增长树 路径加强 wireless sensor networks data aggregation energy efficient GIT path reinforcement
  • 相关文献

参考文献17

  • 1Bhaskar Krishnamachari, Deborah Estrin, Stephen Wicker. Modeling data-centric routing in wireless sensor networks [C]. In: I Stojmenovic, S Olariu, eds. Proc of the IEEE INFOCOM 2002. Los Alamitos, CA: IEEE Computer Society Press, 2002. 2-14.
  • 2J M Kahn, R H Katz, K S J Pister. Emerging challenges: Mobile networking for smart dust [J]. Journal of Communications and Networks, 2000,2(3) : 188-196.
  • 3V Raghunathan, C Schurgers, S Park, et al. Energy-aware wireless microsensor networks [J]. IEEE Signal Processing Magazine, 2002, 19(2): 40-50.
  • 4G J Pottie, W J Kaiser. Embedding the Intemet: Wireless integrated network sensors [J]. Communications of the ACM, 2000, 43(5): 51-58.
  • 5Naoto Kimura, Shahram Latifi. A survey on data compression in wireless sensor networks [C]. In: Proc of the Int'l Cord on I nformation Technology: Coding and Computing. Los Alamitos, CA: IEEE Computer Society Press, 2005. 8-13.
  • 6Kenneth Barr, Krste Asanovic. Energy aware lossless data compression [G]. ACM Trans on Computer Systems, 2006, 24 (3) : 250-291.
  • 7谢志军,王雷,林亚平,陈红,刘永和.传感器网络中基于数据压缩的汇聚算法[J].软件学报,2006,17(4):860-867. 被引量:32
  • 8Olga Seukh, Pedro Jose Marrtn, Andre.as Lachenmann, et al. Generic routing metric and policies for WSNs [C]. In: Proc of 3rd European Workshop on Wireless Sensor Networks. Berlin: Springer, 2006. 99-114.
  • 9Noseong Park, Daeyoung Kim, Yoonmee Doh, et al. An optimal and lightweight routing for minimum energy consumption in wireless sensor networks [C]. In: Proc of the 11th IEEE Int'l Conf on Embedded and Real-Time Computing Systems and Applications. New York: IEEE Computer Society Press, 2005. 1533-2306.
  • 10Chalermek Intanagonwiwat, Deborah Estrin, Ramesh Govindan, et al. Impact of network density on data aggregation in wireless sensor Networks [C]. In: Proc of the 22nd Int'l Conf on Distributed Computing Systems. Los Alamitos, CA: IEEE Computer Society Press, 2002. 457-458.

二级参考文献5

共引文献31

同被引文献41

引证文献6

二级引证文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部