非协调双能量收集链路的分布式功率控制:性能边界和近最优策略

M. Sharma, C. Murthy, R. Vaze
{"title":"非协调双能量收集链路的分布式功率控制:性能边界和近最优策略","authors":"M. Sharma, C. Murthy, R. Vaze","doi":"10.23919/WIOPT.2017.7959920","DOIUrl":null,"url":null,"abstract":"In this paper, we consider a point-to-point link between an energy harvesting transmitter and receiver, where neither node has the information about the battery state or energy availability at the other node. We consider a model where data is successfully delivered only in slots where both nodes are active. Energy loss occurs whenever one node turns on while the other node is in sleep mode. In each slot, based on their own energy availability, the transmitter and receiver need to independently decide whether or not to turn on, with the aim of maximizing the long-term time-average throughput. We present an upper bound on the throughput achievable by analyzing a genie-aided system that has noncausal knowledge of the energy arrivals at both the nodes. Next, we propose an online policy requiring an occasional one-bit feedback whose throughput is within one bit of the upper bound, asymptotically in the battery size. In order to further reduce the feedback required, we propose a time-dilated version of the online policy. As the time dilation gets large, this policy does not require any feedback and achieves the upper bound asymptotically in the battery size. Inspired by this, we also propose a near-optimal fully uncoordinated policy. We use Monte Carlo simulations to validate our theoretical results and illustrate the performance of the proposed policies.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"On distributed power control for uncoordinated dual energy harvesting links: Performance bounds and near-optimal policies\",\"authors\":\"M. Sharma, C. Murthy, R. Vaze\",\"doi\":\"10.23919/WIOPT.2017.7959920\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider a point-to-point link between an energy harvesting transmitter and receiver, where neither node has the information about the battery state or energy availability at the other node. We consider a model where data is successfully delivered only in slots where both nodes are active. Energy loss occurs whenever one node turns on while the other node is in sleep mode. In each slot, based on their own energy availability, the transmitter and receiver need to independently decide whether or not to turn on, with the aim of maximizing the long-term time-average throughput. We present an upper bound on the throughput achievable by analyzing a genie-aided system that has noncausal knowledge of the energy arrivals at both the nodes. Next, we propose an online policy requiring an occasional one-bit feedback whose throughput is within one bit of the upper bound, asymptotically in the battery size. In order to further reduce the feedback required, we propose a time-dilated version of the online policy. As the time dilation gets large, this policy does not require any feedback and achieves the upper bound asymptotically in the battery size. Inspired by this, we also propose a near-optimal fully uncoordinated policy. We use Monte Carlo simulations to validate our theoretical results and illustrate the performance of the proposed policies.\",\"PeriodicalId\":6630,\"journal\":{\"name\":\"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/WIOPT.2017.7959920\",\"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 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/WIOPT.2017.7959920","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在本文中,我们考虑了能量收集发射器和接收器之间的点对点链路,其中两个节点都没有关于另一个节点的电池状态或能量可用性的信息。我们考虑一个模型,其中数据仅在两个节点都处于活动状态的槽中成功传递。当一个节点打开而另一个节点处于睡眠模式时,就会发生能量损失。在每个时隙中,基于各自的能量可用性,发射器和接收器需要独立决定是否打开,目的是最大化长期时间平均吞吐量。我们通过分析具有到达两个节点的能量的非因果知识的基因辅助系统,给出了可实现的吞吐量的上界。接下来,我们提出了一种在线策略,需要偶尔的一位反馈,其吞吐量在电池大小的上界的一位以内。为了进一步减少所需的反馈,我们提出了在线政策的时间扩展版本。当时间膨胀变大时,该策略不需要任何反馈,并且在电池尺寸上渐近地达到上界。受此启发,我们还提出了一种近乎最优的完全不协调政策。我们使用蒙特卡罗模拟来验证我们的理论结果并说明所提出策略的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On distributed power control for uncoordinated dual energy harvesting links: Performance bounds and near-optimal policies
In this paper, we consider a point-to-point link between an energy harvesting transmitter and receiver, where neither node has the information about the battery state or energy availability at the other node. We consider a model where data is successfully delivered only in slots where both nodes are active. Energy loss occurs whenever one node turns on while the other node is in sleep mode. In each slot, based on their own energy availability, the transmitter and receiver need to independently decide whether or not to turn on, with the aim of maximizing the long-term time-average throughput. We present an upper bound on the throughput achievable by analyzing a genie-aided system that has noncausal knowledge of the energy arrivals at both the nodes. Next, we propose an online policy requiring an occasional one-bit feedback whose throughput is within one bit of the upper bound, asymptotically in the battery size. In order to further reduce the feedback required, we propose a time-dilated version of the online policy. As the time dilation gets large, this policy does not require any feedback and achieves the upper bound asymptotically in the battery size. Inspired by this, we also propose a near-optimal fully uncoordinated policy. We use Monte Carlo simulations to validate our theoretical results and illustrate the performance of the proposed policies.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Keynote speaker Keynote speaker Ad-Hoc, Mobile, and Wireless Networks: 19th International Conference on Ad-Hoc Networks and Wireless, ADHOC-NOW 2020, Bari, Italy, October 19–21, 2020, Proceedings Retraction Note to: Mobility Aided Context-Aware Forwarding Approach for Destination-Less OppNets Ad-Hoc, Mobile, and Wireless Networks: 18th International Conference on Ad-Hoc Networks and Wireless, ADHOC-NOW 2019, Luxembourg, Luxembourg, October 1–3, 2019, Proceedings
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1