Joint Admission Control and Power Minimization in IRS-Assisted Networks

IF 3.7 3区 计算机科学 Q2 TELECOMMUNICATIONS
Weijie Xiong;Jingran Lin;Zhiling Xiao;Qiang Li;Yuhan Zhang
{"title":"Joint Admission Control and Power Minimization in IRS-Assisted Networks","authors":"Weijie Xiong;Jingran Lin;Zhiling Xiao;Qiang Li;Yuhan Zhang","doi":"10.1109/LCOMM.2025.3528041","DOIUrl":null,"url":null,"abstract":"Joint admission control and power minimization are critical challenges in intelligent reflecting surface (IRS)-assisted networks. Traditional methods often rely on <inline-formula> <tex-math>$ l_{1} $ </tex-math></inline-formula>-norm approximations and alternating optimization (AO) techniques, which suffer from high computational complexity and lack robust convergence guarantees. To address these limitations, we propose a sigmoid-based approximation of the <inline-formula> <tex-math>$ l_{0} $ </tex-math></inline-formula>-norm AC indicator, enabling a more efficient and tractable reformulation of the problem. Additionally, we introduce a penalty dual decomposition (PDD) algorithm to jointly optimize beamforming and admission control, ensuring convergence to a stationary solution. This approach reduces computational complexity and supports distributed implementation. Moreover, it outperforms existing methods by achieving lower power consumption, accommodating more users, and reducing computational time.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 3","pages":"512-516"},"PeriodicalIF":3.7000,"publicationDate":"2025-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Communications Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10836811/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Joint admission control and power minimization are critical challenges in intelligent reflecting surface (IRS)-assisted networks. Traditional methods often rely on $ l_{1} $ -norm approximations and alternating optimization (AO) techniques, which suffer from high computational complexity and lack robust convergence guarantees. To address these limitations, we propose a sigmoid-based approximation of the $ l_{0} $ -norm AC indicator, enabling a more efficient and tractable reformulation of the problem. Additionally, we introduce a penalty dual decomposition (PDD) algorithm to jointly optimize beamforming and admission control, ensuring convergence to a stationary solution. This approach reduces computational complexity and supports distributed implementation. Moreover, it outperforms existing methods by achieving lower power consumption, accommodating more users, and reducing computational time.
irs辅助网络中的联合接纳控制与功率最小化
联合接纳控制和功率最小化是智能反射面(IRS)辅助网络面临的关键挑战。传统的方法通常依赖于1范数近似和交替优化(AO)技术,这些方法具有较高的计算复杂度和缺乏鲁棒性收敛保证。为了解决这些限制,我们提出了基于s型的$ l_{0} $ norm AC指标近似值,从而使问题的重新表述更加有效和易于处理。此外,我们引入惩罚对偶分解(PDD)算法来共同优化波束形成和接纳控制,确保收敛到平稳解。这种方法降低了计算复杂性,并支持分布式实现。此外,它通过实现更低的功耗、容纳更多的用户和减少计算时间来优于现有的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Communications Letters
IEEE Communications Letters 工程技术-电信学
CiteScore
8.10
自引率
7.30%
发文量
590
审稿时长
2.8 months
期刊介绍: The IEEE Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of communication over different media and channels including wire, underground, waveguide, optical fiber, and storage channels. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of communication systems.
×
引用
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学术官方微信