Delay-minimized Energy-efficient Data Aggregation in Wireless Sensor Networks

Huu Nghia Le, V. Zalyubovskiy, Hyunseung Choo
{"title":"Delay-minimized Energy-efficient Data Aggregation in Wireless Sensor Networks","authors":"Huu Nghia Le, V. Zalyubovskiy, Hyunseung Choo","doi":"10.1109/CyberC.2012.73","DOIUrl":null,"url":null,"abstract":"Data aggregation is a fundamental problem in wireless sensor networks that has attracted great attention in recent years. To design a data aggregation scheme, delay and energy efficiencies are two crucial issues that require much consideration. In this paper, we propose a distributed, energy-efficient algorithm for collecting data from all sensor nodes with minimum latency called Delay-minimized Energy-efficient Data Aggregation algorithm (DEDA). The DEDA algorithm minimizes data aggregation latency by building a delay-efficient network structure. At the same time, it also considers the distances between network nodes for saving sensor transmission power and network energy. Energy consumption is also well-balanced between sensors to achieve an acceptable network lifetime. The simulation results show that the scheme could significantly decrease data aggregation delay and obtain a reasonable network lifetime compared with other approaches.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CyberC.2012.73","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20

Abstract

Data aggregation is a fundamental problem in wireless sensor networks that has attracted great attention in recent years. To design a data aggregation scheme, delay and energy efficiencies are two crucial issues that require much consideration. In this paper, we propose a distributed, energy-efficient algorithm for collecting data from all sensor nodes with minimum latency called Delay-minimized Energy-efficient Data Aggregation algorithm (DEDA). The DEDA algorithm minimizes data aggregation latency by building a delay-efficient network structure. At the same time, it also considers the distances between network nodes for saving sensor transmission power and network energy. Energy consumption is also well-balanced between sensors to achieve an acceptable network lifetime. The simulation results show that the scheme could significantly decrease data aggregation delay and obtain a reasonable network lifetime compared with other approaches.
无线传感器网络中时延最小化的高能效数据聚合
数据聚合是近年来备受关注的无线传感器网络中的一个基本问题。在设计数据聚合方案时,延迟和能量效率是需要考虑的两个关键问题。在本文中,我们提出了一种分布式、节能的算法,以最小的延迟从所有传感器节点收集数据,称为延迟最小化节能数据聚合算法(DEDA)。DEDA算法通过构建一个延迟高效的网络结构来最小化数据聚合延迟。同时,还考虑了网络节点之间的距离,以节省传感器传输功率和网络能量。传感器之间的能量消耗也很好地平衡,以实现可接受的网络寿命。仿真结果表明,与其他方法相比,该方案可以显著降低数据聚合延迟,并获得合理的网络生存时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信