Pub Date : 2026-02-04DOI: 10.1109/LWC.2026.3661524
Hao Gao;Cheng Zhang;Wen Wang;Yongming Huang
The growing demand for latency-sensitive applications such as industrial control and real-time monitoring calls for transmission strategies that ensure both low latency and high reliability in cell-free networks. However, this goal is hindered by two main challenges: uncertainty in channel state information (CSI) and significant interaction overhead between access points (APs) and the central processing unit (CPU). To address these challenges, this letter proposes a robust and low-overhead transmission framework that guarantees user quality-of-service (QoS) requirements with minimal bandwidth consumption. The proposed scheme leverages over-the-air superposition of locally computed channel Gram matrices from APs, which enables the CPU to reconstruct the global matrix for robust beamforming and joint power-bandwidth allocation. Simulations show that the proposed low interaction resource allocation (LIRA) algorithm achieves bandwidth efficiency comparable to traditional semidefinite relaxation (SDR) methods, exhibits strong robustness against channel estimation errors, and substantially reduces computation time and AP–CPU interaction overhead, making it a compelling solution for latency-sensitive cell-free networks.
{"title":"Robust and Low-Overhead Resource Allocation for Latency-Sensitive Cell-Free Downlink","authors":"Hao Gao;Cheng Zhang;Wen Wang;Yongming Huang","doi":"10.1109/LWC.2026.3661524","DOIUrl":"10.1109/LWC.2026.3661524","url":null,"abstract":"The growing demand for latency-sensitive applications such as industrial control and real-time monitoring calls for transmission strategies that ensure both low latency and high reliability in cell-free networks. However, this goal is hindered by two main challenges: uncertainty in channel state information (CSI) and significant interaction overhead between access points (APs) and the central processing unit (CPU). To address these challenges, this letter proposes a robust and low-overhead transmission framework that guarantees user quality-of-service (QoS) requirements with minimal bandwidth consumption. The proposed scheme leverages over-the-air superposition of locally computed channel Gram matrices from APs, which enables the CPU to reconstruct the global matrix for robust beamforming and joint power-bandwidth allocation. Simulations show that the proposed low interaction resource allocation (LIRA) algorithm achieves bandwidth efficiency comparable to traditional semidefinite relaxation (SDR) methods, exhibits strong robustness against channel estimation errors, and substantially reduces computation time and AP–CPU interaction overhead, making it a compelling solution for latency-sensitive cell-free networks.","PeriodicalId":13343,"journal":{"name":"IEEE Wireless Communications Letters","volume":"15 ","pages":"1777-1781"},"PeriodicalIF":5.5,"publicationDate":"2026-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146115891","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-04DOI: 10.1109/LWC.2026.3661163
Peiyang Zhao;Zihao Xiang;Ning Ge
Millimeter-wave (mmWave) wireless backhaul is a key enabler for future 6G network densification, but its reliance on line-of-sight (LoS) propagation is a major challenge. We study relay placement for multi-hop mmWave backhaul connecting the small base stations (SBS) to the macro base station (MBS) over complex environment. While relays can circumvent blockages, optimizing their placement is complicated by directional antennas and complex environment. Interference is non-local and tightly coupled with beam pointing, routing and traffic. Environment-induced shadowing produces a highly non-convex optimization landscape, while large relay fleets generate a high-dimensional search space. We develop a network model with an outage-based performance metric that captures this direction-dependent interference and enforces graph-theoretic reliability constraints. To scale, we introduce a link-quality-based cooperative coevolution (LQBCC) algorithm that adaptively groups variables using community detection on a link-quality graph and collaboratively optimizes strongly interacting relays. Experiments on high-fidelity environment scenarios show LQBCC consistently surpasses advanced evolutionary baselines and relay-placement schemes in worst-path success probability, overall reliability, and search efficiency. At a relay density of 20 nodes/km2, LQBCC achieves a 70% performance gain over the best baseline, with 10-fold greater search efficiency and zero reliability violations.
{"title":"Robust Relay Placement for Millimeter-Wave Backhaul via Link-Quality-Based Cooperative Coevolution","authors":"Peiyang Zhao;Zihao Xiang;Ning Ge","doi":"10.1109/LWC.2026.3661163","DOIUrl":"10.1109/LWC.2026.3661163","url":null,"abstract":"Millimeter-wave (mmWave) wireless backhaul is a key enabler for future 6G network densification, but its reliance on line-of-sight (LoS) propagation is a major challenge. We study relay placement for multi-hop mmWave backhaul connecting the small base stations (SBS) to the macro base station (MBS) over complex environment. While relays can circumvent blockages, optimizing their placement is complicated by directional antennas and complex environment. Interference is non-local and tightly coupled with beam pointing, routing and traffic. Environment-induced shadowing produces a highly non-convex optimization landscape, while large relay fleets generate a high-dimensional search space. We develop a network model with an outage-based performance metric that captures this direction-dependent interference and enforces graph-theoretic reliability constraints. To scale, we introduce a link-quality-based cooperative coevolution (LQBCC) algorithm that adaptively groups variables using community detection on a link-quality graph and collaboratively optimizes strongly interacting relays. Experiments on high-fidelity environment scenarios show LQBCC consistently surpasses advanced evolutionary baselines and relay-placement schemes in worst-path success probability, overall reliability, and search efficiency. At a relay density of 20 nodes/km2, LQBCC achieves a 70% performance gain over the best baseline, with 10-fold greater search efficiency and zero reliability violations.","PeriodicalId":13343,"journal":{"name":"IEEE Wireless Communications Letters","volume":"15 ","pages":"1742-1746"},"PeriodicalIF":5.5,"publicationDate":"2026-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146115892","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-03DOI: 10.1109/lwc.2026.3661020
Philipp del Hougne
{"title":"Reduced-Rank Mutual Coupling Representation and Experimental Estimation for Large RIS","authors":"Philipp del Hougne","doi":"10.1109/lwc.2026.3661020","DOIUrl":"https://doi.org/10.1109/lwc.2026.3661020","url":null,"abstract":"","PeriodicalId":13343,"journal":{"name":"IEEE Wireless Communications Letters","volume":"104 1","pages":""},"PeriodicalIF":6.3,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146110365","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-03DOI: 10.1109/lwc.2026.3661418
Daniel Dinis, Risto Wichman
{"title":"s-FAMA-GP: A Low-Complexity Slow FAMA Using Interference Interpolation","authors":"Daniel Dinis, Risto Wichman","doi":"10.1109/lwc.2026.3661418","DOIUrl":"https://doi.org/10.1109/lwc.2026.3661418","url":null,"abstract":"","PeriodicalId":13343,"journal":{"name":"IEEE Wireless Communications Letters","volume":"295 1","pages":""},"PeriodicalIF":6.3,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146110932","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-03DOI: 10.1109/lwc.2026.3661400
Maria Dimitropoulou, Constantinos Psomas, Ioannis Krikidis
{"title":"Backflash Mitigation via Scheduling in FSO Systems With Quantum Key Distribution","authors":"Maria Dimitropoulou, Constantinos Psomas, Ioannis Krikidis","doi":"10.1109/lwc.2026.3661400","DOIUrl":"https://doi.org/10.1109/lwc.2026.3661400","url":null,"abstract":"","PeriodicalId":13343,"journal":{"name":"IEEE Wireless Communications Letters","volume":"100 1","pages":""},"PeriodicalIF":6.3,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146110367","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-03DOI: 10.1109/lwc.2026.3660773
Chengzhong Wang, Zhiwei Shan, Xinping Yi
{"title":"PCGFormer: Power Control for Device-to-Device Communications With Graph Transformer","authors":"Chengzhong Wang, Zhiwei Shan, Xinping Yi","doi":"10.1109/lwc.2026.3660773","DOIUrl":"https://doi.org/10.1109/lwc.2026.3660773","url":null,"abstract":"","PeriodicalId":13343,"journal":{"name":"IEEE Wireless Communications Letters","volume":"8 1","pages":""},"PeriodicalIF":6.3,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146110368","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：