简短公告:无线网络广播,时间与能量的权衡

M. Klonowski, Dominik Pajak
{"title":"简短公告:无线网络广播,时间与能量的权衡","authors":"M. Klonowski, Dominik Pajak","doi":"10.1145/3212734.3212786","DOIUrl":null,"url":null,"abstract":"In wireless networks, consisting of battery-powered devices, energy is a costly resource and most of it is spent on transmitting messages. Broadcast is a problem where a message needs to be transmitted from one node to all other nodes of the network. We study algorithms that can work under limited energy measured as the maximum number of transmissions among all the stations. The goal of the paper is to study tradeoffs between time and energy complexity of broadcast problem in unknown multi-hop radio networks with no collision detection. We propose and analyse two new randomized energy-efficient algorithms. Our first algorithm works in time O((D+φ)n^1/φ . φ) with high probability and uses O(φ) energy per station for any φ ≤ log n/(2loglog n) for any graph with n nodes and diameter D. Our second algorithm works in time O((D+log n)log n) with high probability and uses O(log n/loglog n) energy. We prove that our algorithms are almost time-optimal for given energy limits for graphs with constant diameters by constructing lower bound on time of Ω(n^1/φ . φ). The lower bound shows also that any algorithm working in polylogaritmic time in n for all graphs needs energy Ω(log n/loglog n).","PeriodicalId":198284,"journal":{"name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Brief Announcement: Broadcast in Radio Networks, Time vs. Energy Tradeoffs\",\"authors\":\"M. Klonowski, Dominik Pajak\",\"doi\":\"10.1145/3212734.3212786\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In wireless networks, consisting of battery-powered devices, energy is a costly resource and most of it is spent on transmitting messages. Broadcast is a problem where a message needs to be transmitted from one node to all other nodes of the network. We study algorithms that can work under limited energy measured as the maximum number of transmissions among all the stations. The goal of the paper is to study tradeoffs between time and energy complexity of broadcast problem in unknown multi-hop radio networks with no collision detection. We propose and analyse two new randomized energy-efficient algorithms. Our first algorithm works in time O((D+φ)n^1/φ . φ) with high probability and uses O(φ) energy per station for any φ ≤ log n/(2loglog n) for any graph with n nodes and diameter D. Our second algorithm works in time O((D+log n)log n) with high probability and uses O(log n/loglog n) energy. We prove that our algorithms are almost time-optimal for given energy limits for graphs with constant diameters by constructing lower bound on time of Ω(n^1/φ . φ). The lower bound shows also that any algorithm working in polylogaritmic time in n for all graphs needs energy Ω(log n/loglog n).\",\"PeriodicalId\":198284,\"journal\":{\"name\":\"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3212734.3212786\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3212734.3212786","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

在由电池供电的设备组成的无线网络中,能源是一种昂贵的资源,其中大部分用于传输信息。广播是一个需要将消息从一个节点传输到网络的所有其他节点的问题。我们研究的算法可以在有限的能量下工作,以所有站之间的最大传输次数为衡量标准。本文的目的是研究无碰撞检测的未知多跳无线网络中广播问题的时间复杂度和能量复杂度的权衡。本文提出并分析了两种新的随机化节能算法。我们的第一个算法在O((D+φ)n^1/φ时间内工作。φ)的高概率,对于φ≤log n/(2loglog n)的任意n个节点和直径为D的图,每个站点使用O(φ)能量。我们的第二种算法高概率地在O((D+log n)log n)时间内工作,使用O(log n/loglog n)能量。我们通过构造时间的下界Ω(n^1/φ)证明了我们的算法在给定的能量极限下几乎是时间最优的。φ)。下界还表明,对于所有图,在n的多对数时间内工作的任何算法都需要能量Ω(log n/loglog n)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Brief Announcement: Broadcast in Radio Networks, Time vs. Energy Tradeoffs
In wireless networks, consisting of battery-powered devices, energy is a costly resource and most of it is spent on transmitting messages. Broadcast is a problem where a message needs to be transmitted from one node to all other nodes of the network. We study algorithms that can work under limited energy measured as the maximum number of transmissions among all the stations. The goal of the paper is to study tradeoffs between time and energy complexity of broadcast problem in unknown multi-hop radio networks with no collision detection. We propose and analyse two new randomized energy-efficient algorithms. Our first algorithm works in time O((D+φ)n^1/φ . φ) with high probability and uses O(φ) energy per station for any φ ≤ log n/(2loglog n) for any graph with n nodes and diameter D. Our second algorithm works in time O((D+log n)log n) with high probability and uses O(log n/loglog n) energy. We prove that our algorithms are almost time-optimal for given energy limits for graphs with constant diameters by constructing lower bound on time of Ω(n^1/φ . φ). The lower bound shows also that any algorithm working in polylogaritmic time in n for all graphs needs energy Ω(log n/loglog n).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信