An energy-aware spanning tree algorithm for data aggregation in wireless sensor networks

Marc Lee, Vincent W. S. Wong
{"title":"An energy-aware spanning tree algorithm for data aggregation in wireless sensor networks","authors":"Marc Lee, Vincent W. S. Wong","doi":"10.1109/PACRIM.2005.1517285","DOIUrl":null,"url":null,"abstract":"In wireless sensor networks, data aggregation is used to collect local data from neighboring nodes (sources) and generate a data report. In this paper, we propose E-span, which is an energy-aware spanning tree algorithm. E-Span is a distributed protocol and facilitates the sources within an event region to perform data aggregation. In E-span, the source node which has the highest residual energy is chosen as the root. Other source nodes choose their corresponding parent node among their neighbors based on the residual energy and distance to the root. By selecting the directed diffusion [C. Intanagonwiwat et al., Aug. 2000] as the underlying routing platform, simulation results show that the lifetime of sources can be extended significantly when E-Span is used.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"113","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2005.1517285","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 113

Abstract

In wireless sensor networks, data aggregation is used to collect local data from neighboring nodes (sources) and generate a data report. In this paper, we propose E-span, which is an energy-aware spanning tree algorithm. E-Span is a distributed protocol and facilitates the sources within an event region to perform data aggregation. In E-span, the source node which has the highest residual energy is chosen as the root. Other source nodes choose their corresponding parent node among their neighbors based on the residual energy and distance to the root. By selecting the directed diffusion [C. Intanagonwiwat et al., Aug. 2000] as the underlying routing platform, simulation results show that the lifetime of sources can be extended significantly when E-Span is used.
一种能量感知的无线传感器网络数据聚合生成树算法
在无线传感器网络中,数据聚合是指从邻近节点(源)收集本地数据并生成数据报告。本文提出了一种能量感知的生成树算法E-span。E-Span是一种分布式协议,便于事件区域内的源进行数据聚合。在E-span中,选取剩余能量最高的源节点作为根节点。其他源节点根据剩余能量和到根节点的距离从邻居中选择相应的父节点。通过选择定向扩散[C]。Intanagonwiwat et al., Aug. 2000]作为底层路由平台,仿真结果表明,使用E-Span可以显著延长源的生存期。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信