全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

事件驱动传感器网络中基于数据聚合的自适应路由算法

DOI: 10.13195/j.kzyjc.2013.0560, PP. 1477-1482

Keywords: 事件驱动传感器网络,,数据聚合,路径重叠

Full-Text   Cite this paper   Add to My Lib

Abstract:

为优化事件驱动传感器网络总能耗,提出一个基于数据聚合的自适应路由算法,它能够实现低控制开销的事件域节点分布式成簇,计算并借助于路由汇聚中心,建立一棵基于事件的近似Steiner树,有效减少网内数据分组与控制分组的传输量.理论分析与实验表明,该算法的路由结构建立与维护开销较少,能优化数据聚合效率,实现高能效的数据收集,提升网络性能.

References

[1]  唐伟. 无线传感器网络节能策略及算法研究[D]. 成都: 电子科技大学通信抗干扰技术国家级重点实验室, 2011: 10-15.
[2]  (Tang W. On energy reserving policies and algorithms for wireless sensor networks[D]. Chengdu: National Key Laboratory of Science and Technology on Communications, University of Electronic Science and Techonology of China, 2011: 10-15.)
[3]  Liu Q, Chang Y N, Jia X H. A hybrid method of CSMA/CA and TDMA for real-time data aggregation in wireless sensor networks[J]. Computer Communications, 2013, 36(3): 269-278.
[4]  Souza E, Nikolaidis I. An exploration of aggregation convergecast scheduling[J]. Ad Hoc Networks, 2013, 11(8): 2391-2407.
[5]  Heinzelman W, Chandrakasan A, Balakrishnan H. An application specific protocol architecture for wireless microsensor networks[J]. IEEE Trans on Wireless Communications, 2002, 1(4): 660-670.
[6]  Soro S, HeinzelmanWB. Cluster head election techniques for coverage preservation in wireless sensor networks[J]. Ad Hoc Networks, 2009, 7(5): 955-972.
[7]  Meng L J, Zhang H Z, Zou Y. A data aggregation transfer protocol based on clustering and data prediction in wireless sensor networks[C]. The 7th Int Conf on Wireless Communications, Networking and Mobile Computing. Wuhan: IEEE Press, 2011: 1-5.
[8]  Jung W S, Lim K W, Ko Y B, et al. Efficient clustering-based data aggregation techniques for wireless sensor networks[J]. Wireless Networks, 2011, 17(5): 1387-1400.
[9]  Kwon S, Ko J H, Kim J, et al. Dynamic timeout for data aggregation in wireless sensor networks[J]. Computer Networks, 2011, 55(3): 650-664.
[10]  Al-Karaki J N, Ul-Mustafa R, Kamal A E. Data aggregation
[11]  in wireless sensor networks-exact and approximate algorithms[C]. Workshop on High Performance Switching and Routing. Phoenix: IEEE Press, 2004: 241-245.
[12]  Hougardy S, Promel H J. A 1.598 approximation algorithm for the steiner problem in graphs[C]. Proc of the 10th Ann ACM-SIAM Symp on Discrete Algorithms. Baltimore: Society for Industrial and Applied Mathematics, 1999: 448-453.
[13]  Robins G, Zelikovsky A. Improved steiner tree approximation in graphs[C]. Proc of the 11th Ann ACM-SIAM Symp on Discrete Algorithms. Sanfrancisco: Society for Industrial and Applied Mathematics, 2000: 770-779.
[14]  Krishnamachari B, Estrin D, Wicker S B. The impact of data aggregation in wireless sensor networks[C]. Proc of the 22nd Int Conf on Distributed Computing Systems. Vienna: IEEE Press, 2002: 575-578.
[15]  Villas L A, Boukerche A, Ramos H S, et al. DRINA: A lightweight and reliable routing approach for in-network aggregation in wireless sensor networks[J]. IEEE Trans on Computers, 2013, 62(4): 676-689.
[16]  Villas L A, Boukerche A H, Oliveira A B F, et al. A spatial correlation aware algorithm to perform efficient data collection in wireless sensor networks[J]. Ad Hoc Networks, 2014, 12: 69-85.
[17]  Nakamura E F, Ramos H S, Villas L A, et al. A reactive role assignment for data routing in event-based wireless sensor networks[J]. Computer Networks, 2009, 53(12): 1980-1996.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133