Deep Reinforcement Learning for Spatial User Density-based AP Clustering

Charmae Franchesca Mendoza, Stefan Schwarz, M. Rupp
{"title":"Deep Reinforcement Learning for Spatial User Density-based AP Clustering","authors":"Charmae Franchesca Mendoza, Stefan Schwarz, M. Rupp","doi":"10.1109/spawc51304.2022.9833939","DOIUrl":null,"url":null,"abstract":"Cell-free massive MIMO combines the benefits of massive MIMO and network densification to provide a uniformly good service throughout the coverage area. This is achieved by the joint transmission from multiple distributed access points (APs)/antennas, as well as by bringing them closer to the users. However, its canonical form where all APs are connected to only a single centralized processing unit (CPU) is not scalable and hard to realize in practice. Motivated by this, we propose a deep reinforcement learning-based approach for partitioning the APs in a multi-CPU cell-free MIMO network. We exploit the available spatial user density information when deciding which APs form the disjoint clusters that are associated to the CPUs. Our simulation results show that our framework dynamically allocates more APs (forms bigger AP clusters) in areas of larger user density, leading to a better performance when compared to small cells and predefined static AP groupings.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/spawc51304.2022.9833939","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Cell-free massive MIMO combines the benefits of massive MIMO and network densification to provide a uniformly good service throughout the coverage area. This is achieved by the joint transmission from multiple distributed access points (APs)/antennas, as well as by bringing them closer to the users. However, its canonical form where all APs are connected to only a single centralized processing unit (CPU) is not scalable and hard to realize in practice. Motivated by this, we propose a deep reinforcement learning-based approach for partitioning the APs in a multi-CPU cell-free MIMO network. We exploit the available spatial user density information when deciding which APs form the disjoint clusters that are associated to the CPUs. Our simulation results show that our framework dynamically allocates more APs (forms bigger AP clusters) in areas of larger user density, leading to a better performance when compared to small cells and predefined static AP groupings.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于空间用户密度的AP聚类深度强化学习
无蜂窝大规模MIMO结合了大规模MIMO和网络密度的优点,在整个覆盖区域内提供统一的良好服务。这是通过多个分布式接入点(ap)/天线的联合传输以及使它们更靠近用户来实现的。但是,其规范形式(所有ap仅连接到单个集中处理单元(CPU))是不可扩展的,并且在实践中难以实现。基于此,我们提出了一种基于深度强化学习的方法来划分多cpu无小区MIMO网络中的ap。我们利用可用的空间用户密度信息来决定哪些ap构成与cpu相关联的不相交集群。我们的模拟结果表明,我们的框架在用户密度较大的区域动态分配更多的AP(形成更大的AP集群),与小单元和预定义的静态AP分组相比,可以获得更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Secure Multi-Antenna Coded Caching Deep Transfer Learning Based Radio Map Estimation for Indoor Wireless Communications A New Outage Probability Bound for IR-HARQ and Its Application to Power Adaptation SPAWC 2022 Cover Page A Sequential Experience-driven Contextual Bandit Policy for MIMO TWAF Online Relay Selection
×
引用
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