Throughput-optimal user association in energy harvesting relay-assisted cellular networks

Yanzi Song, Ming Zhao, Wuyang Zhou, Hui Han
{"title":"Throughput-optimal user association in energy harvesting relay-assisted cellular networks","authors":"Yanzi Song, Ming Zhao, Wuyang Zhou, Hui Han","doi":"10.1109/WCSP.2014.6992165","DOIUrl":null,"url":null,"abstract":"We study the user association problem targeting on the throughput optimization for energy harvesting (EH) relay-assisted cellular networks where the base stations (BSs) are powered by grid power and the relay stations (RSs) are powered by renewable energy. Since the harvested energy of RS is stochastic and not always large enough, our challenge is how to match the user association with the energy arrival rate of RS so as to maximize the throughput of the network. For this purpose, we propose a dynamic bias based user association policy which means the user is associated with the BS/RS that provides the strongest-biased-average-received-power, and maximize the throughput by optimizing the bias with different energy constraints. Using tools from stochastic geometry and continuous time Markov chain (CTMC), we first formulate the problem as a throughput-optimal and energy-constrained problem with respect to the bias. Then, by solving the optimization problem, we derive the closed expression of the optimal bias maximizing the throughput. Numerical results show that our dynamic bias based user association policy can always outperform that without bias, especially when the RSs are energy-limited.","PeriodicalId":412971,"journal":{"name":"2014 Sixth International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"276 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Sixth International Conference on Wireless Communications and Signal Processing (WCSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP.2014.6992165","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

We study the user association problem targeting on the throughput optimization for energy harvesting (EH) relay-assisted cellular networks where the base stations (BSs) are powered by grid power and the relay stations (RSs) are powered by renewable energy. Since the harvested energy of RS is stochastic and not always large enough, our challenge is how to match the user association with the energy arrival rate of RS so as to maximize the throughput of the network. For this purpose, we propose a dynamic bias based user association policy which means the user is associated with the BS/RS that provides the strongest-biased-average-received-power, and maximize the throughput by optimizing the bias with different energy constraints. Using tools from stochastic geometry and continuous time Markov chain (CTMC), we first formulate the problem as a throughput-optimal and energy-constrained problem with respect to the bias. Then, by solving the optimization problem, we derive the closed expression of the optimal bias maximizing the throughput. Numerical results show that our dynamic bias based user association policy can always outperform that without bias, especially when the RSs are energy-limited.
能量收集中继辅助蜂窝网络中吞吐量最优用户关联
针对能量收集(EH)中继辅助蜂窝网络中基站(BSs)由电网供电,中继站(RSs)由可再生能源供电的吞吐量优化问题,研究了用户关联问题。由于RS收集的能量是随机的,并不总是足够大,我们的挑战是如何将用户关联与RS的能量到达率相匹配,从而最大化网络的吞吐量。为此,我们提出了一种基于动态偏置的用户关联策略,即用户与提供最强偏置平均接收功率的BS/RS相关联,并通过优化不同能量约束下的偏置来最大化吞吐量。利用随机几何和连续时间马尔可夫链(CTMC)的工具,我们首先将问题表述为关于偏差的吞吐量最优和能量约束问题。然后,通过求解优化问题,导出了吞吐量最大化的最优偏差的封闭表达式。数值结果表明,基于动态偏差的用户关联策略总是优于无偏差的用户关联策略,特别是在RSs能量有限的情况下。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信