基于追求学习的多bs关联与试点分配

Naufan Raharya, Wibowo Hardjawana, Obada Al-Khatib, B. Vucetic
{"title":"基于追求学习的多bs关联与试点分配","authors":"Naufan Raharya, Wibowo Hardjawana, Obada Al-Khatib, B. Vucetic","doi":"10.1109/WCNC45663.2020.9120561","DOIUrl":null,"url":null,"abstract":"Pilot contamination (PC) interference causes an inaccurate user equipment’s (UE) channel estimations and significant signal-to-interference ratio (SINR) degradations. To combat the PC effect and to maximize network spectral efficiency, pilot allocation can be combined with multi-Base Station (BS) association and then solved by using learning algorithm efficiently. However, current methods separate the pilot allocation and multi-BS association in the network. This results in suboptimal network spectral efficiency performance and can cause an outage where some UEs are not allocated pilots due to the limited availability of pilots at each BS. In this paper, we propose a multi-BS association and pilot allocation optimization via pursuit learning. Here, we design a parallel pursuit learning algorithm that decomposes the optimization function into smaller entities called learning automata. Each learning automaton computes the joint pilot allocation and BS association solution in parallel, by using the reward from the environment. Simulation results show that our scheme outperforms the existing schemes and does not cause an outage.","PeriodicalId":415064,"journal":{"name":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Multi-BS association and Pilot Allocation via Pursuit Learning\",\"authors\":\"Naufan Raharya, Wibowo Hardjawana, Obada Al-Khatib, B. Vucetic\",\"doi\":\"10.1109/WCNC45663.2020.9120561\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Pilot contamination (PC) interference causes an inaccurate user equipment’s (UE) channel estimations and significant signal-to-interference ratio (SINR) degradations. To combat the PC effect and to maximize network spectral efficiency, pilot allocation can be combined with multi-Base Station (BS) association and then solved by using learning algorithm efficiently. However, current methods separate the pilot allocation and multi-BS association in the network. This results in suboptimal network spectral efficiency performance and can cause an outage where some UEs are not allocated pilots due to the limited availability of pilots at each BS. In this paper, we propose a multi-BS association and pilot allocation optimization via pursuit learning. Here, we design a parallel pursuit learning algorithm that decomposes the optimization function into smaller entities called learning automata. Each learning automaton computes the joint pilot allocation and BS association solution in parallel, by using the reward from the environment. Simulation results show that our scheme outperforms the existing schemes and does not cause an outage.\",\"PeriodicalId\":415064,\"journal\":{\"name\":\"2020 IEEE Wireless Communications and Networking Conference (WCNC)\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE Wireless Communications and Networking Conference (WCNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCNC45663.2020.9120561\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC45663.2020.9120561","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

导频污染(PC)干扰导致不准确的用户设备(UE)信道估计和显著的信噪比(SINR)下降。为了克服PC效应,最大限度地提高网络频谱效率,可以将导频分配与多基站关联相结合,然后利用学习算法高效地进行求解。然而,目前的方法将网络中的试点分配和多bs关联分离开来。这将导致次优的网络频谱效率性能,并可能导致停机,因为每个BS上的导频可用性有限,因此一些ue没有分配导频。本文提出了一种基于追求学习的多bs关联和试点分配优化方法。在这里,我们设计了一个并行追踪学习算法,将优化函数分解为更小的实体,称为学习自动机。每个学习自动机通过使用来自环境的奖励并行计算联合试点分配和BS关联解决方案。仿真结果表明,该方案的性能优于现有方案,且不会造成网络中断。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-BS association and Pilot Allocation via Pursuit Learning
Pilot contamination (PC) interference causes an inaccurate user equipment’s (UE) channel estimations and significant signal-to-interference ratio (SINR) degradations. To combat the PC effect and to maximize network spectral efficiency, pilot allocation can be combined with multi-Base Station (BS) association and then solved by using learning algorithm efficiently. However, current methods separate the pilot allocation and multi-BS association in the network. This results in suboptimal network spectral efficiency performance and can cause an outage where some UEs are not allocated pilots due to the limited availability of pilots at each BS. In this paper, we propose a multi-BS association and pilot allocation optimization via pursuit learning. Here, we design a parallel pursuit learning algorithm that decomposes the optimization function into smaller entities called learning automata. Each learning automaton computes the joint pilot allocation and BS association solution in parallel, by using the reward from the environment. Simulation results show that our scheme outperforms the existing schemes and does not cause an outage.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信