1.
Mobini, Zahra; Mohammadi, Mohammadali; He, Jiajun; Ngo, Hien Quoc; Matthaiou, Michail
Cell-Free Massive MIMO-Assisted ISAC with Beam Scanning Proceedings Article
In: 2025 IEEE 26th International Workshop on Signal Processing and Artificial Intelligence for Wireless Communications (SPAWC), pp. 1–5, 2025, ISSN: 1948-3252, (ISSN: 1948-3252).
Abstract | Links | BibTeX | Tags: Conferences, Copper, Integrated sensing and communication, Optimization, Programming, Protocols, Signal processing, Spectral efficiency, Three-dimensional displays, Transmitters
@inproceedings{mobini_cell-free_2025,
title = {Cell-Free Massive MIMO-Assisted ISAC with Beam Scanning},
author = {Zahra Mobini and Mohammadali Mohammadi and Jiajun He and Hien Quoc Ngo and Michail Matthaiou},
url = {https://ieeexplore.ieee.org/document/11143371},
doi = {10.1109/SPAWC66079.2025.11143371},
issn = {1948-3252},
year = {2025},
date = {2025-07-01},
urldate = {2025-10-08},
booktitle = {2025 IEEE 26th International Workshop on Signal Processing and Artificial Intelligence for Wireless Communications (SPAWC)},
pages = {1–5},
abstract = {This paper proposes a comprehensive framework for a cell-free massive multiple-input multiple-output (CF-mMIMO) integrated sensing and communication (ISAC) system, where the access points (APs) are partitioned into communication APs (CAPs) and the sensing APs (SAPs) to simultaneously support downlink (DL) communications and multi-static sensing. A dedicated sensing transmitter (ST) and the SAPs cooperatively sense a target within a designated zone, while the CAPs serve multiple communication users (CUs). To enable practical 3-dimensional (3D) target localization, we develop a novel beam scanning protocol and derive closed-form expressions for the DL spectral efficiency (SE), mainlobe-to-average sensing ratio (MASR), and the Cramer-Rao lower bound (CRLB) of target estimation. Moreover, we formulate a power optimization problem to improve the sensing performance under SE constraints for CUs, solving it efficiently using fractional programming (FP) techniques. Numerical results demonstrate that our approach achieves sensing performance gains of up to 20 dB and significantly reduces the CRLB.},
note = {ISSN: 1948-3252},
keywords = {Conferences, Copper, Integrated sensing and communication, Optimization, Programming, Protocols, Signal processing, Spectral efficiency, Three-dimensional displays, Transmitters},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper proposes a comprehensive framework for a cell-free massive multiple-input multiple-output (CF-mMIMO) integrated sensing and communication (ISAC) system, where the access points (APs) are partitioned into communication APs (CAPs) and the sensing APs (SAPs) to simultaneously support downlink (DL) communications and multi-static sensing. A dedicated sensing transmitter (ST) and the SAPs cooperatively sense a target within a designated zone, while the CAPs serve multiple communication users (CUs). To enable practical 3-dimensional (3D) target localization, we develop a novel beam scanning protocol and derive closed-form expressions for the DL spectral efficiency (SE), mainlobe-to-average sensing ratio (MASR), and the Cramer-Rao lower bound (CRLB) of target estimation. Moreover, we formulate a power optimization problem to improve the sensing performance under SE constraints for CUs, solving it efficiently using fractional programming (FP) techniques. Numerical results demonstrate that our approach achieves sensing performance gains of up to 20 dB and significantly reduces the CRLB.
2.
Wang, Dingzhao; Liu, Xin; Xu, Chao; Ng, Soon Xin; Hanzo, Lajos
Short-Block Polar-Coded Reverse and Direct Reconciliation in CV-QKD Journal Article
In: IEEE Open Journal of Vehicular Technology, vol. 6, pp. 2195–2209, 2025, ISSN: 2644-1330.
Abstract | Links | BibTeX | Tags: Complexity theory, Continuous-variable quantum key distribution (CV-QKD), Fading channels, Maximum likelihood decoding, multidimensional reconciliation, Parity check codes, polar code, Polar codes, Protection, Protocols, Quantum key distribution, secret key rate, Simulation, Wireless networks
@article{wang_short-block_2025,
title = {Short-Block Polar-Coded Reverse and Direct Reconciliation in CV-QKD},
author = {Dingzhao Wang and Xin Liu and Chao Xu and Soon Xin Ng and Lajos Hanzo},
url = {https://ieeexplore.ieee.org/abstract/document/11087626},
doi = {10.1109/OJVT.2025.3591417},
issn = {2644-1330},
year = {2025},
date = {2025-01-01},
urldate = {2025-10-08},
journal = {IEEE Open Journal of Vehicular Technology},
volume = {6},
pages = {2195–2209},
abstract = {Continuous-variable quantum key distribution (CV-QKD) is a promising technique of supporting quantum-safe wireless networks in the emerging 6 G era, mapping quantum information onto the amplitude or phase of electromagnetic waves. However, conventional CV-QKD reconciliation methods often assume ideal classical side-information channels, which is an unrealistic scenario in practical deployments. To address this critical challenge, we propose a novel protection scheme integrating Polar and low-density parity-check (LDPC) codes. Specifically, Polar codes safeguard quantum transmissions due to their superior performance for short block lengths, while LDPC codes robustly protect the classical side information exchanged over auxiliary classical channels. We further enhance the CV-QKD performance by harnessing a soft-decision Polar decoding method combined with protocols specifically tailored for reverse reconciliation (RR) and direct reconciliation (DR). In the RR scheme, conceived decoding complexity is strategically distributed: Polar decoding is performed by Alice, and LDPC decoding by Bob, hence significantly reducing the computational demands compared to traditional schemes where both decoding processes are invoked at a single node. Simulation results validate the effectiveness of our approach, demonstrating that Polar codes consistently outperform LDPC codes in quantum transmission scenarios having short block lengths under 512 bits. These findings emphasize the strong potential of Polar coding-assisted CV-QKD in achieving secure and efficient quantum-safe control information transmissions, paving the way for practical implementation in next-generation wireless networks.},
keywords = {Complexity theory, Continuous-variable quantum key distribution (CV-QKD), Fading channels, Maximum likelihood decoding, multidimensional reconciliation, Parity check codes, polar code, Polar codes, Protection, Protocols, Quantum key distribution, secret key rate, Simulation, Wireless networks},
pubstate = {published},
tppubtype = {article}
}
Continuous-variable quantum key distribution (CV-QKD) is a promising technique of supporting quantum-safe wireless networks in the emerging 6 G era, mapping quantum information onto the amplitude or phase of electromagnetic waves. However, conventional CV-QKD reconciliation methods often assume ideal classical side-information channels, which is an unrealistic scenario in practical deployments. To address this critical challenge, we propose a novel protection scheme integrating Polar and low-density parity-check (LDPC) codes. Specifically, Polar codes safeguard quantum transmissions due to their superior performance for short block lengths, while LDPC codes robustly protect the classical side information exchanged over auxiliary classical channels. We further enhance the CV-QKD performance by harnessing a soft-decision Polar decoding method combined with protocols specifically tailored for reverse reconciliation (RR) and direct reconciliation (DR). In the RR scheme, conceived decoding complexity is strategically distributed: Polar decoding is performed by Alice, and LDPC decoding by Bob, hence significantly reducing the computational demands compared to traditional schemes where both decoding processes are invoked at a single node. Simulation results validate the effectiveness of our approach, demonstrating that Polar codes consistently outperform LDPC codes in quantum transmission scenarios having short block lengths under 512 bits. These findings emphasize the strong potential of Polar coding-assisted CV-QKD in achieving secure and efficient quantum-safe control information transmissions, paving the way for practical implementation in next-generation wireless networks.
3.
Goay, Amus Chee Yuen; Mishra, Deepak; Matthaiou, Michail; Seneviratne, Aruna
Range Maximization by Optimizing Tag-to-Tag Cooperative Backscatter Communication Journal Article
In: IEEE Transactions on Green Communications and Networking, pp. 1–1, 2025, ISSN: 2473-2400.
Abstract | Links | BibTeX | Tags: Backscatter, Backscatter communication, cooperation, green communication, Internet of Things, Protocols, Quality of service, range maximization, Reflection coefficient, Relays, Resource management, tag-to-tag network, Throughput, time allocation, Wireless communication, Wireless sensor networks
@article{goay_range_2025,
title = {Range Maximization by Optimizing Tag-to-Tag Cooperative Backscatter Communication},
author = {Amus Chee Yuen Goay and Deepak Mishra and Michail Matthaiou and Aruna Seneviratne},
url = {https://ieeexplore.ieee.org/document/11008574},
doi = {10.1109/TGCN.2025.3570568},
issn = {2473-2400},
year = {2025},
date = {2025-01-01},
urldate = {2025-10-08},
journal = {IEEE Transactions on Green Communications and Networking},
pages = {1–1},
abstract = {Backscatter communication (BackCom) is a wireless technology that transmits information wirelessly by modulating the reflection of an incident signal, offering the advantages of low power consumption and low cost. This paper introduces a novel cooperative timing protocol in a two-tag BackCom network, where a single reader communicates with two passive backscatter tags using a cooperative scheme. These tags encode their information by modulating the backscattered signal and then transmitting it back to the reader. In the considered tag-to-tag cooperative scheme, the tag closer to the reader assists the farther tag in relaying its information, effectively mitigating the doubly near-far problem commonly experienced in BackCom systems. The primary objective is to maximize the transmission range of the farther tag by jointly optimizing the proposed time allocation scheme and reflection coefficients while meeting the spectral efficiency and energy threshold constraints for the quality of service and sustainability requirements. This article formulates a non-convex optimization problem and proposes a solution methodology that efficiently approximates the optimized solution with low complexity. Numerical simulations are presented to analyze the effects of varying energy and spectral efficiency requirements on the maximized transmission range. The results demonstrate that the proposed tag-to-tag cooperative BackCom framework provides a significant performance improvement, with an average range gain of over 30% compared to the non-cooperative scheme.},
keywords = {Backscatter, Backscatter communication, cooperation, green communication, Internet of Things, Protocols, Quality of service, range maximization, Reflection coefficient, Relays, Resource management, tag-to-tag network, Throughput, time allocation, Wireless communication, Wireless sensor networks},
pubstate = {published},
tppubtype = {article}
}
Backscatter communication (BackCom) is a wireless technology that transmits information wirelessly by modulating the reflection of an incident signal, offering the advantages of low power consumption and low cost. This paper introduces a novel cooperative timing protocol in a two-tag BackCom network, where a single reader communicates with two passive backscatter tags using a cooperative scheme. These tags encode their information by modulating the backscattered signal and then transmitting it back to the reader. In the considered tag-to-tag cooperative scheme, the tag closer to the reader assists the farther tag in relaying its information, effectively mitigating the doubly near-far problem commonly experienced in BackCom systems. The primary objective is to maximize the transmission range of the farther tag by jointly optimizing the proposed time allocation scheme and reflection coefficients while meeting the spectral efficiency and energy threshold constraints for the quality of service and sustainability requirements. This article formulates a non-convex optimization problem and proposes a solution methodology that efficiently approximates the optimized solution with low complexity. Numerical simulations are presented to analyze the effects of varying energy and spectral efficiency requirements on the maximized transmission range. The results demonstrate that the proposed tag-to-tag cooperative BackCom framework provides a significant performance improvement, with an average range gain of over 30% compared to the non-cooperative scheme.