无线传感器网络中的事件驱动数据聚合

E. G. Prathima, S. Iyengar, K. Venugopal, L. Patnaik
{"title":"无线传感器网络中的事件驱动数据聚合","authors":"E. G. Prathima, S. Iyengar, K. Venugopal, L. Patnaik","doi":"10.1109/INDICON.2017.8487934","DOIUrl":null,"url":null,"abstract":"Multiple events may occur simultaneously in heterogeneous sensor networks. It is necessary to aggregate event specific data. Event-Driven Data Aggregation (EDDA) is designed to efficiently gather aggregated data and route event specific data from the location of an event to the base station. The sensor nodes that have detected an event organize into an aggregation tree from the location of event to the base station. The nodes that do not detect the event relay the data to the base station. Such nodes integrate the data from different events into a single packet by prefixing a tag indicating the event type. The performance analysis shows that the EDDA algorithm incurs less energy consumption than existing state-of-the-art algorithms.","PeriodicalId":263943,"journal":{"name":"2017 14th IEEE India Council International Conference (INDICON)","volume":"331 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"EDDA: Event-Driven Data Aggregation in Wireless Sensor Networks\",\"authors\":\"E. G. Prathima, S. Iyengar, K. Venugopal, L. Patnaik\",\"doi\":\"10.1109/INDICON.2017.8487934\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multiple events may occur simultaneously in heterogeneous sensor networks. It is necessary to aggregate event specific data. Event-Driven Data Aggregation (EDDA) is designed to efficiently gather aggregated data and route event specific data from the location of an event to the base station. The sensor nodes that have detected an event organize into an aggregation tree from the location of event to the base station. The nodes that do not detect the event relay the data to the base station. Such nodes integrate the data from different events into a single packet by prefixing a tag indicating the event type. The performance analysis shows that the EDDA algorithm incurs less energy consumption than existing state-of-the-art algorithms.\",\"PeriodicalId\":263943,\"journal\":{\"name\":\"2017 14th IEEE India Council International Conference (INDICON)\",\"volume\":\"331 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 14th IEEE India Council International Conference (INDICON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INDICON.2017.8487934\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 14th IEEE India Council International Conference (INDICON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INDICON.2017.8487934","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在异构传感器网络中,多个事件可能同时发生。有必要聚合特定于事件的数据。事件驱动数据聚合(EDDA)旨在有效地收集聚合数据,并将事件特定数据从事件位置路由到基站。检测到事件的传感器节点从事件位置到基站组织成聚合树。未检测到事件的节点将数据中继到基站。这些节点通过在标记前加上指示事件类型的标记,将来自不同事件的数据集成到单个数据包中。性能分析表明,与现有最先进的算法相比,EDDA算法的能耗更低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
EDDA: Event-Driven Data Aggregation in Wireless Sensor Networks
Multiple events may occur simultaneously in heterogeneous sensor networks. It is necessary to aggregate event specific data. Event-Driven Data Aggregation (EDDA) is designed to efficiently gather aggregated data and route event specific data from the location of an event to the base station. The sensor nodes that have detected an event organize into an aggregation tree from the location of event to the base station. The nodes that do not detect the event relay the data to the base station. Such nodes integrate the data from different events into a single packet by prefixing a tag indicating the event type. The performance analysis shows that the EDDA algorithm incurs less energy consumption than existing state-of-the-art algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信