Online policies for multiple access channel with common energy harvesting source

Abdulrahman Baknina, S. Ulukus
{"title":"Online policies for multiple access channel with common energy harvesting source","authors":"Abdulrahman Baknina, S. Ulukus","doi":"10.1109/ISIT.2016.7541797","DOIUrl":null,"url":null,"abstract":"We consider online transmission policies for the two-user multiple access channel, where both users harvest energy from a common source. The transmitters are equipped with arbitrary but finite-sized batteries. The energy harvests are independent and identically distributed (i.i.d.) over time, and synchronized at the two users due to their common source. The transmitters know the energy arrivals only causally. We first consider the special case of Bernoulli energy arrivals. For this case, we determine the optimal policies that achieve the boundary of the capacity region. We show that the optimal power allocation decreases in time, and that the capacity region is a pentagon. We then consider general i.i.d. energy arrivals, and propose a distributed fractional power (DFP) policy. We develop lower and upper bounds on the performance of the proposed DFP policy for general i.i.d. energy arrivals, and show that the proposed DFP is near-optimal in that it yields rates which are within a constant gap of the derived lower and upper bounds.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2016.7541797","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

Abstract

We consider online transmission policies for the two-user multiple access channel, where both users harvest energy from a common source. The transmitters are equipped with arbitrary but finite-sized batteries. The energy harvests are independent and identically distributed (i.i.d.) over time, and synchronized at the two users due to their common source. The transmitters know the energy arrivals only causally. We first consider the special case of Bernoulli energy arrivals. For this case, we determine the optimal policies that achieve the boundary of the capacity region. We show that the optimal power allocation decreases in time, and that the capacity region is a pentagon. We then consider general i.i.d. energy arrivals, and propose a distributed fractional power (DFP) policy. We develop lower and upper bounds on the performance of the proposed DFP policy for general i.i.d. energy arrivals, and show that the proposed DFP is near-optimal in that it yields rates which are within a constant gap of the derived lower and upper bounds.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有共同能量收集源的多通道在线策略
我们考虑了双用户多址通道的在线传输策略,其中两个用户从一个共同的源获取能量。发射机配备了任意大小但尺寸有限的电池。随着时间的推移,能量收获是独立和相同分布的(i.i.d),并且由于它们的共同来源,在两个用户处同步。发射器只是偶然地知道能量到达。我们首先考虑伯努利能量到达的特殊情况。对于这种情况,我们确定了达到容量区域边界的最优策略。结果表明,最优功率分配随时间递减,容量区域呈五边形。然后,我们考虑一般i.i.d能量到达,并提出一个分布式分数功率(DFP)策略。对于一般的i.i.d能量到达,我们开发了所提出的DFP策略性能的下界和上界,并表明所提出的DFP是接近最优的,因为它产生的比率在推导的下界和上界的恒定间隙内。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
String concatenation construction for Chebyshev permutation channel codes Cyclically symmetric entropy inequalities Near-capacity protograph doubly-generalized LDPC codes with block thresholds On the capacity of a class of dual-band interference channels Distributed detection over connected networks via one-bit quantizer
×
引用
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