基于多智能体蛾焰强化学习的广播波束优化

IF 9.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Shan Huang;Haipeng Yao;Tianle Mai;Di Wu;Jiaqi Xu;F. Richard Yu
{"title":"基于多智能体蛾焰强化学习的广播波束优化","authors":"Shan Huang;Haipeng Yao;Tianle Mai;Di Wu;Jiaqi Xu;F. Richard Yu","doi":"10.1109/TMC.2025.3547946","DOIUrl":null,"url":null,"abstract":"Currently, beamforming antenna array technologies are of utmost importance in 5G communication systems. These technologies are essential for optimizing the coverage and signal quality of the cellular network. However, the optimization of broadcast beams presents significant challenges due to the complex strategy profile space. Each beam can be configured with different widths and heights, making it difficult for conventional algorithms to handle. To address this issue, we propose a novel approach called Multi-Agent Moth-Flame Reinforcement Learning (MAMF-RL) algorithm for broadcast beam optimization. MAMF-RL combines reinforcement learning and moth-flame optimization algorithms to interactively search for the optimal broadcast beams. By decomposing the problem into multiple single-sector antenna configuration problems, MAMF-RL effectively reduces the algorithm complexity. We conducted experiments utilizing real data in an 18-sector wireless coverage area. To evaluate the performance of our proposed method, we compared it with traditional methods such as the particle swarm algorithm. The results demonstrate that our MAMF-RL model achieves an average coverage rate of 1.82% higher and a 13.74% lower overlapping coverage rate compared to traditional methods.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 8","pages":"7223-7236"},"PeriodicalIF":9.2000,"publicationDate":"2025-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-Agent Moth-Flame Reinforcement Learning Based Broadcast Beam Optimization\",\"authors\":\"Shan Huang;Haipeng Yao;Tianle Mai;Di Wu;Jiaqi Xu;F. Richard Yu\",\"doi\":\"10.1109/TMC.2025.3547946\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Currently, beamforming antenna array technologies are of utmost importance in 5G communication systems. These technologies are essential for optimizing the coverage and signal quality of the cellular network. However, the optimization of broadcast beams presents significant challenges due to the complex strategy profile space. Each beam can be configured with different widths and heights, making it difficult for conventional algorithms to handle. To address this issue, we propose a novel approach called Multi-Agent Moth-Flame Reinforcement Learning (MAMF-RL) algorithm for broadcast beam optimization. MAMF-RL combines reinforcement learning and moth-flame optimization algorithms to interactively search for the optimal broadcast beams. By decomposing the problem into multiple single-sector antenna configuration problems, MAMF-RL effectively reduces the algorithm complexity. We conducted experiments utilizing real data in an 18-sector wireless coverage area. To evaluate the performance of our proposed method, we compared it with traditional methods such as the particle swarm algorithm. The results demonstrate that our MAMF-RL model achieves an average coverage rate of 1.82% higher and a 13.74% lower overlapping coverage rate compared to traditional methods.\",\"PeriodicalId\":50389,\"journal\":{\"name\":\"IEEE Transactions on Mobile Computing\",\"volume\":\"24 8\",\"pages\":\"7223-7236\"},\"PeriodicalIF\":9.2000,\"publicationDate\":\"2025-03-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Mobile Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10909609/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10909609/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

目前,波束形成天线阵列技术在5G通信系统中至关重要。这些技术对于优化蜂窝网络的覆盖范围和信号质量至关重要。然而,由于复杂的策略轮廓空间,广播波束的优化面临着巨大的挑战。每个光束可以配置不同的宽度和高度,这使得传统算法难以处理。为了解决这个问题,我们提出了一种新的方法,称为多智能体蛾焰强化学习(MAMF-RL)算法,用于广播波束优化。MAMF-RL结合了强化学习和蛾焰优化算法来交互搜索最佳广播波束。通过将问题分解为多个单扇区天线配置问题,MAMF-RL有效降低了算法复杂度。我们利用18扇区无线覆盖区域的真实数据进行了实验。为了评估该方法的性能,我们将其与粒子群算法等传统方法进行了比较。结果表明,与传统方法相比,我们的MAMF-RL模型的平均覆盖率提高了1.82%,重叠覆盖率降低了13.74%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-Agent Moth-Flame Reinforcement Learning Based Broadcast Beam Optimization
Currently, beamforming antenna array technologies are of utmost importance in 5G communication systems. These technologies are essential for optimizing the coverage and signal quality of the cellular network. However, the optimization of broadcast beams presents significant challenges due to the complex strategy profile space. Each beam can be configured with different widths and heights, making it difficult for conventional algorithms to handle. To address this issue, we propose a novel approach called Multi-Agent Moth-Flame Reinforcement Learning (MAMF-RL) algorithm for broadcast beam optimization. MAMF-RL combines reinforcement learning and moth-flame optimization algorithms to interactively search for the optimal broadcast beams. By decomposing the problem into multiple single-sector antenna configuration problems, MAMF-RL effectively reduces the algorithm complexity. We conducted experiments utilizing real data in an 18-sector wireless coverage area. To evaluate the performance of our proposed method, we compared it with traditional methods such as the particle swarm algorithm. The results demonstrate that our MAMF-RL model achieves an average coverage rate of 1.82% higher and a 13.74% lower overlapping coverage rate compared to traditional methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing 工程技术-电信学
CiteScore
12.90
自引率
2.50%
发文量
403
审稿时长
6.6 months
期刊介绍: IEEE Transactions on Mobile Computing addresses key technical issues related to various aspects of mobile computing. This includes (a) architectures, (b) support services, (c) algorithm/protocol design and analysis, (d) mobile environments, (e) mobile communication systems, (f) applications, and (g) emerging technologies. Topics of interest span a wide range, covering aspects like mobile networks and hosts, mobility management, multimedia, operating system support, power management, online and mobile environments, security, scalability, reliability, and emerging technologies such as wearable computers, body area networks, and wireless sensor networks. The journal serves as a comprehensive platform for advancements in mobile computing research.
×
引用
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学术官方微信