WIP: Demand-Driven Power Allocation in Wireless Networks with Deep Q-Learning

A. Giannopoulos, S. Spantideas, N. Capsalis, P. Gkonis, Panos Karkazis, L. Sarakis, P. Trakadas, C. Capsalis
{"title":"WIP: Demand-Driven Power Allocation in Wireless Networks with Deep Q-Learning","authors":"A. Giannopoulos, S. Spantideas, N. Capsalis, P. Gkonis, Panos Karkazis, L. Sarakis, P. Trakadas, C. Capsalis","doi":"10.1109/WoWMoM51794.2021.00045","DOIUrl":null,"url":null,"abstract":"Power allocation is strongly related to the coverage and capacity of wireless networks, playing a critical role in the development of 5G networks. This paper proposes a Demand-Driven Power Allocation (DDPA) algorithm aiming to fulfill the requested throughput of individual users and accommodate their needs. DDPA is based on model-free Deep Reinforcement Learning (DRL) approaches and has the ability to proactively adjust the power levels of network transmitters. The performance of the developed algorithm is evaluated for a variety of simulation parameters and variable user demands. According to the presented results, the DDPA scheme exhibits a near-optimal performance for up to 50 users in the network area (i.e. satisfaction percentage exceeds 95%), with each one requesting 1 Mbps. Moreover, performance comparison between DDPA and two typical baseline methods reveals that the former results into enhanced total allocated throughput solutions (i.e. a performance increase by a factor of approximately 9% against baseline methods).","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"184 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WoWMoM51794.2021.00045","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Power allocation is strongly related to the coverage and capacity of wireless networks, playing a critical role in the development of 5G networks. This paper proposes a Demand-Driven Power Allocation (DDPA) algorithm aiming to fulfill the requested throughput of individual users and accommodate their needs. DDPA is based on model-free Deep Reinforcement Learning (DRL) approaches and has the ability to proactively adjust the power levels of network transmitters. The performance of the developed algorithm is evaluated for a variety of simulation parameters and variable user demands. According to the presented results, the DDPA scheme exhibits a near-optimal performance for up to 50 users in the network area (i.e. satisfaction percentage exceeds 95%), with each one requesting 1 Mbps. Moreover, performance comparison between DDPA and two typical baseline methods reveals that the former results into enhanced total allocated throughput solutions (i.e. a performance increase by a factor of approximately 9% against baseline methods).
基于深度q -学习的无线网络中需求驱动的功率分配
功率分配与无线网络的覆盖和容量密切相关,对5G网络的发展起着至关重要的作用。本文提出了一种需求驱动的功率分配算法,以满足单个用户的吞吐量要求并适应其需求。DDPA基于无模型深度强化学习(DRL)方法,具有主动调整网络发射机功率水平的能力。针对不同的仿真参数和不同的用户需求,对所开发算法的性能进行了评估。根据给出的结果,DDPA方案在网络区域内最多可容纳50个用户(即满意度超过95%)时表现出近乎最佳的性能,每个用户请求1mbps。此外,DDPA和两种典型基线方法之间的性能比较表明,前者可以提高总分配吞吐量解决方案(即,与基线方法相比,性能提高了约9%)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信