Stochastic user scheduling and power control for energy harvesting networks with statistical delay provisioning

Imtiaz Ahmed, K. Phan, T. Le-Ngoc
{"title":"Stochastic user scheduling and power control for energy harvesting networks with statistical delay provisioning","authors":"Imtiaz Ahmed, K. Phan, T. Le-Ngoc","doi":"10.1109/PIMRC.2015.7343436","DOIUrl":null,"url":null,"abstract":"We study the stochastic user scheduling and power control problem for an uplink multi-user network over time-varying channels, where the users randomly harvest renewable energies from the environment. For each user, the renewable energies and arriving data packets with a constant rate are stored in energy (battery) and data buffers, respectively. Users have statistical packet delay constraints in terms of maximum acceptable delay-outage probabilities. We classify the users as prioritized and non-prioritized users. Our goal is to maximize the arrival rate of the non-prioritized user while supporting the minimum data rate requirements for the prioritized users. We reformulate the problem as an infinite-horizon Markov decision process (MDP) using asymptotic delay analysis and study the optimal scheduling and power control policy. Since the optimal policy requires centralized processing with high computational complexity, we develop a reduced-complexity distributed algorithm, which can be implemented at each individual user. Online algorithm is devised, which does not require the statistical knowledge of the channel fading and energy harvesting (EH) processes. Numerical results demonstrate the effectiveness of the centralized and distributed schemes for different delay constraints and EH settings.","PeriodicalId":274734,"journal":{"name":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2015.7343436","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

We study the stochastic user scheduling and power control problem for an uplink multi-user network over time-varying channels, where the users randomly harvest renewable energies from the environment. For each user, the renewable energies and arriving data packets with a constant rate are stored in energy (battery) and data buffers, respectively. Users have statistical packet delay constraints in terms of maximum acceptable delay-outage probabilities. We classify the users as prioritized and non-prioritized users. Our goal is to maximize the arrival rate of the non-prioritized user while supporting the minimum data rate requirements for the prioritized users. We reformulate the problem as an infinite-horizon Markov decision process (MDP) using asymptotic delay analysis and study the optimal scheduling and power control policy. Since the optimal policy requires centralized processing with high computational complexity, we develop a reduced-complexity distributed algorithm, which can be implemented at each individual user. Online algorithm is devised, which does not require the statistical knowledge of the channel fading and energy harvesting (EH) processes. Numerical results demonstrate the effectiveness of the centralized and distributed schemes for different delay constraints and EH settings.
具有统计延迟供给的能量收集网络随机用户调度与功率控制
研究了具有时变信道的上行多用户网络的随机用户调度和功率控制问题,其中用户从环境中随机获取可再生能源。对于每个用户,可再生能源和以恒定速率到达的数据包分别存储在能量(电池)和数据缓冲区中。根据最大可接受的延迟中断概率,用户具有统计数据包延迟约束。我们将用户分为优先级用户和非优先级用户。我们的目标是最大化非优先级用户的到达率,同时支持优先级用户的最低数据速率需求。我们利用渐近延迟分析将该问题重新描述为一个无限视界马尔可夫决策过程,并研究了最优调度和功率控制策略。由于最优策略需要高计算复杂度的集中处理,我们开发了一种降低复杂度的分布式算法,该算法可以在每个单独的用户上实现。设计了一种不需要信道衰落和能量收集(EH)过程统计知识的在线算法。数值结果表明,对于不同的延迟约束和EH设置,集中式和分布式方案是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信