基于同步传输和TDMA的高效多对多数据共享

Sudipta Saha, O. Landsiedel, M. Chan
{"title":"基于同步传输和TDMA的高效多对多数据共享","authors":"Sudipta Saha, O. Landsiedel, M. Chan","doi":"10.1109/DCOSS.2017.11","DOIUrl":null,"url":null,"abstract":"Achieving fast and efficient many-to-many communication is one of the most complex communication problems, especially in wireless systems. A compact form of many-to-many communication in a distributed system has the potential to bring huge benefit to many distributed algorithms and protocols. Many-to-many communication can be implemented as a sequential instantiations of a network wide one-to-many communication. One limitation of such an approach is that each individual instance of a one-to-many communication has to be given enough time to propagate through the whole network before the next instance. In addition, there is large overhead in generating the schedule for the sequence of individual one-to-many communications. In this work, we show that many-to-many communication can be more efficiently implemented as many parallel many-to-one communications. In this direction, we first develop an efficient TDMA based many-to-one communication module, and then use it in many-to-many setting. Our approach achieves a minimum about 20% to 50% improvements on latency (radio-on time) over the state-of-the-art solutions in a 90-node wireless sensor network testbed.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Efficient Many-to-Many Data Sharing Using Synchronous Transmission and TDMA\",\"authors\":\"Sudipta Saha, O. Landsiedel, M. Chan\",\"doi\":\"10.1109/DCOSS.2017.11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Achieving fast and efficient many-to-many communication is one of the most complex communication problems, especially in wireless systems. A compact form of many-to-many communication in a distributed system has the potential to bring huge benefit to many distributed algorithms and protocols. Many-to-many communication can be implemented as a sequential instantiations of a network wide one-to-many communication. One limitation of such an approach is that each individual instance of a one-to-many communication has to be given enough time to propagate through the whole network before the next instance. In addition, there is large overhead in generating the schedule for the sequence of individual one-to-many communications. In this work, we show that many-to-many communication can be more efficiently implemented as many parallel many-to-one communications. In this direction, we first develop an efficient TDMA based many-to-one communication module, and then use it in many-to-many setting. Our approach achieves a minimum about 20% to 50% improvements on latency (radio-on time) over the state-of-the-art solutions in a 90-node wireless sensor network testbed.\",\"PeriodicalId\":399222,\"journal\":{\"name\":\"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"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.11\",\"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.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

摘要

实现快速高效的多对多通信是最复杂的通信问题之一,特别是在无线系统中。分布式系统中紧凑形式的多对多通信有可能给许多分布式算法和协议带来巨大的好处。多对多通信可以作为网络范围一对多通信的顺序实例来实现。这种方法的一个限制是,必须给一对多通信的每个单独实例足够的时间,以便在下一个实例之前通过整个网络传播。此外,为单个一对多通信序列生成调度的开销很大。在这项工作中,我们证明了多对多通信可以更有效地实现为多个并行多对一通信。在这个方向上,我们首先开发了一个高效的基于TDMA的多对一通信模块,然后将其应用于多对多环境中。在90个节点的无线传感器网络测试平台中,与最先进的解决方案相比,我们的方法在延迟(无线电接通时间)方面至少提高了20%到50%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient Many-to-Many Data Sharing Using Synchronous Transmission and TDMA
Achieving fast and efficient many-to-many communication is one of the most complex communication problems, especially in wireless systems. A compact form of many-to-many communication in a distributed system has the potential to bring huge benefit to many distributed algorithms and protocols. Many-to-many communication can be implemented as a sequential instantiations of a network wide one-to-many communication. One limitation of such an approach is that each individual instance of a one-to-many communication has to be given enough time to propagate through the whole network before the next instance. In addition, there is large overhead in generating the schedule for the sequence of individual one-to-many communications. In this work, we show that many-to-many communication can be more efficiently implemented as many parallel many-to-one communications. In this direction, we first develop an efficient TDMA based many-to-one communication module, and then use it in many-to-many setting. Our approach achieves a minimum about 20% to 50% improvements on latency (radio-on time) over the state-of-the-art solutions in a 90-node wireless sensor network testbed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信