面向无线传感器网络的分布式无碰撞数据聚合方法

M. Merzoug, A. Mostefaoui, Samir Chouali
{"title":"面向无线传感器网络的分布式无碰撞数据聚合方法","authors":"M. Merzoug, A. Mostefaoui, Samir Chouali","doi":"10.1109/DCOSS.2017.9","DOIUrl":null,"url":null,"abstract":"This paper presents a distributed serial data aggregation approach, called Spreading Aggregation~(SA), in which one packet hops sequentially over nodes and aggregates their data. The next hop of the aggregation packet is determined locally by each traversed node using only its one-hop neighborhood information, so no network topology information needs to be known by nodes, nor collisions are generated as only one node is communicating at any given time. This localized and distributed characteristic makes the proposed approach highly scalable and very efficient in terms of communication-reduction, energy conservation, and aggregation time, as confirmed by the numerous simulation results we obtained. These results confirm also the superiority of the proposed approach over the state-of-the-art serial approaches, particularly in very large scale network deployments.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Distributed Collision-Free Data Aggregation Approach for Wireless Sensor Networks\",\"authors\":\"M. Merzoug, A. Mostefaoui, Samir Chouali\",\"doi\":\"10.1109/DCOSS.2017.9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a distributed serial data aggregation approach, called Spreading Aggregation~(SA), in which one packet hops sequentially over nodes and aggregates their data. The next hop of the aggregation packet is determined locally by each traversed node using only its one-hop neighborhood information, so no network topology information needs to be known by nodes, nor collisions are generated as only one node is communicating at any given time. This localized and distributed characteristic makes the proposed approach highly scalable and very efficient in terms of communication-reduction, energy conservation, and aggregation time, as confirmed by the numerous simulation results we obtained. These results confirm also the superiority of the proposed approach over the state-of-the-art serial approaches, particularly in very large scale network deployments.\",\"PeriodicalId\":399222,\"journal\":{\"name\":\"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCOSS.2017.9\",\"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 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCOSS.2017.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种分布式串行数据聚合方法,称为扩散聚合~(SA),其中一个数据包在节点上顺序跳跃并聚合它们的数据。聚合包的下一跳由每个遍历节点仅使用其单跳邻居信息在本地确定,因此节点不需要知道网络拓扑信息,也不会产生冲突,因为在任何给定时间只有一个节点在通信。这种局域化和分布式的特性使得所提出的方法具有高度的可扩展性,并且在减少通信、节约能量和聚合时间方面非常有效,我们获得的大量仿真结果证实了这一点。这些结果也证实了所提出的方法优于最先进的串行方法,特别是在非常大规模的网络部署中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Distributed Collision-Free Data Aggregation Approach for Wireless Sensor Networks
This paper presents a distributed serial data aggregation approach, called Spreading Aggregation~(SA), in which one packet hops sequentially over nodes and aggregates their data. The next hop of the aggregation packet is determined locally by each traversed node using only its one-hop neighborhood information, so no network topology information needs to be known by nodes, nor collisions are generated as only one node is communicating at any given time. This localized and distributed characteristic makes the proposed approach highly scalable and very efficient in terms of communication-reduction, energy conservation, and aggregation time, as confirmed by the numerous simulation results we obtained. These results confirm also the superiority of the proposed approach over the state-of-the-art serial approaches, particularly in very large scale network deployments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信