广播的能量复杂性

Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Qizheng He, Wenzheng Li, S. Pettie
{"title":"广播的能量复杂性","authors":"Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Qizheng He, Wenzheng Li, S. Pettie","doi":"10.1145/3212734.3212774","DOIUrl":null,"url":null,"abstract":"Energy is often the most constrained resource in networks of batterypowered devices, and as devices become smaller, they spend a larger fraction of their energy on communication (transceiver usage) not computation. As an imperfect proxy for true energy usage, we define energy complexity to be the number of time slots a device transmits/listens; idle time and computation are free. In this paper we investigate the energy complexity of fundamental communication primitives such as Broadcast in multi-hop radio networks. We consider models with collision detection (CD) and without (No-CD), as well as both randomized and deterministic algorithms. Some take-away messages from this work are as follows. Time lower bounds imply energy lower bounds. The energy complexity of Broadcast in a multi-hop network is connected to the time complexity of LeaderElection in a single-hop (clique) network. Many existing lower bounds on time complexity immediately transfer to energy complexity. For example, in the CD and No-CD models, Broadcast requires Ω(logn) and Ω(log2 n) energy, respectively, w.h.p. Energy- and time-efficient broadcasting. It requires Ω(D) time to solve Broadcast even allowing unlimited energy budget, where D is the diameter of the network. The complexity measures of energy and time are in conflict, and it is an open problem whether both can be minimized simultaneously. We show that it is possible to achieve near optimality in time complexity with only poly logn energy cost. For any constant ε > 0, Broadcast can be solved in O(D1+ε logO(1/ε) n) time with O(logO(1/ε) n) energy.","PeriodicalId":198284,"journal":{"name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"37","resultStr":"{\"title\":\"The Energy Complexity of Broadcast\",\"authors\":\"Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Qizheng He, Wenzheng Li, S. Pettie\",\"doi\":\"10.1145/3212734.3212774\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Energy is often the most constrained resource in networks of batterypowered devices, and as devices become smaller, they spend a larger fraction of their energy on communication (transceiver usage) not computation. As an imperfect proxy for true energy usage, we define energy complexity to be the number of time slots a device transmits/listens; idle time and computation are free. In this paper we investigate the energy complexity of fundamental communication primitives such as Broadcast in multi-hop radio networks. We consider models with collision detection (CD) and without (No-CD), as well as both randomized and deterministic algorithms. Some take-away messages from this work are as follows. Time lower bounds imply energy lower bounds. The energy complexity of Broadcast in a multi-hop network is connected to the time complexity of LeaderElection in a single-hop (clique) network. Many existing lower bounds on time complexity immediately transfer to energy complexity. For example, in the CD and No-CD models, Broadcast requires Ω(logn) and Ω(log2 n) energy, respectively, w.h.p. Energy- and time-efficient broadcasting. It requires Ω(D) time to solve Broadcast even allowing unlimited energy budget, where D is the diameter of the network. The complexity measures of energy and time are in conflict, and it is an open problem whether both can be minimized simultaneously. We show that it is possible to achieve near optimality in time complexity with only poly logn energy cost. For any constant ε > 0, Broadcast can be solved in O(D1+ε logO(1/ε) n) time with O(logO(1/ε) n) energy.\",\"PeriodicalId\":198284,\"journal\":{\"name\":\"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"37\",\"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.3212774\",\"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.3212774","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 37

摘要

在电池供电的设备网络中,能量通常是最受限制的资源,随着设备变得越来越小,它们在通信(收发器使用)上花费的能量越来越大,而不是计算。作为真实能量使用的不完美代理,我们将能量复杂性定义为设备传输/收听的时隙数量;空闲时间和计算是免费的。本文研究了多跳无线网络中广播等基本通信原语的能量复杂度。我们考虑了有碰撞检测(CD)和没有碰撞检测(No-CD)的模型,以及随机算法和确定性算法。从这项工作中得到的一些启示如下。时间下界意味着能量下界。多跳网络中Broadcast的能量复杂度与单跳(团)网络中LeaderElection的时间复杂度有关。许多现有的时间复杂度下界立即转化为能量复杂度下界。例如,在CD和No-CD模型中,Broadcast分别需要Ω(logn)和Ω(log2 n)能量,w.h.p.能源和时间效率广播。即使允许无限的能量预算,也需要Ω(D)时间来解决Broadcast,其中D为网络的直径。能量和时间的复杂性度量是相互冲突的,两者能否同时最小化是一个悬而未决的问题。我们证明了在时间复杂度上实现近似最优是可能的,而且只需要多时间的能量代价。对于任意常数ε > 0,可以用O(D1+ε logO(1/ε) n)时间和O(logO(1/ε) n)能量求解Broadcast。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The Energy Complexity of Broadcast
Energy is often the most constrained resource in networks of batterypowered devices, and as devices become smaller, they spend a larger fraction of their energy on communication (transceiver usage) not computation. As an imperfect proxy for true energy usage, we define energy complexity to be the number of time slots a device transmits/listens; idle time and computation are free. In this paper we investigate the energy complexity of fundamental communication primitives such as Broadcast in multi-hop radio networks. We consider models with collision detection (CD) and without (No-CD), as well as both randomized and deterministic algorithms. Some take-away messages from this work are as follows. Time lower bounds imply energy lower bounds. The energy complexity of Broadcast in a multi-hop network is connected to the time complexity of LeaderElection in a single-hop (clique) network. Many existing lower bounds on time complexity immediately transfer to energy complexity. For example, in the CD and No-CD models, Broadcast requires Ω(logn) and Ω(log2 n) energy, respectively, w.h.p. Energy- and time-efficient broadcasting. It requires Ω(D) time to solve Broadcast even allowing unlimited energy budget, where D is the diameter of the network. The complexity measures of energy and time are in conflict, and it is an open problem whether both can be minimized simultaneously. We show that it is possible to achieve near optimality in time complexity with only poly logn energy cost. For any constant ε > 0, Broadcast can be solved in O(D1+ε logO(1/ε) n) time with O(logO(1/ε) n) energy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信