Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/32126
Title: Joint User Association and Beamforming Design for ISAC Networks With Large Language Models
Authors: Li, H
Xiao, M
Wang, K
Schober, R
Kim, DI
Guan, YL
Keywords: integrated sensing and communication;large language model;user association;beamforming;optimization
Issue Date: 5-Sep-2025
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Citation: Li, H. et al. (2025) 'Joint User Association and Beamforming Design for ISAC Networks With Large Language Models', IEEE Open Journal of the Communications Society, 2025, 6 pp. 7620 - 7644. doi: 10.1109/OJCOMS.2025.3606812.
Abstract: Integrated sensing and communication (ISAC) has been envisioned to play a more important role in future wireless networks. However, the design of ISAC networks is challenging, especially when there are multiple communication and sensing (C&S) nodes and multiple sensing targets. We investigate a multi-base station (BS) ISAC network in which multiple BSs equipped with multiple antennas simultaneously provide C&S services for multiple ground communication users (CUs) and targets. To enhance the overall performance of C&S, we formulate a joint user association (UA) and multi-BS transmit beamforming optimization problem with the objective of maximizing the total sum rate of all CUs while ensuring both the minimum target detection and parameter estimation requirements in terms of the radar signal-to-noise ratio (SNR) and the Cramér-Rao bound (CRB), respectively. To efficiently solve the highly non-convex mixed integer nonlinear programming (MINLP) optimization problem, we propose an alternating optimization (AO)-based algorithm that decomposes the problem into two sub-problems, i.e., UA optimization and multi-BS transmit beamforming optimization. Inspired by the huge potential of large language models (LLMs) for prediction and inference, we propose a unified framework integrating LLMs with convex-based optimization methods to benefit from the theoretical rigor and convergence guarantees of convex-based methods, and the adaptability and flexibility of LLMs. First, we propose a comprehensive design of prompt engineering based on in-context, few-shot, chain of thought, and self-reflection techniques to guide LLMs in solving the binary integer programming UA optimization problem. Second, we utilize convex-based optimization methods to handle the non-convex beamforming optimization problem based on fractional programming (FP), majorization minimization (MM), and the alternating direction method of multipliers (ADMM) with an optimized UA from LLMs. Numerical results demonstrate.
URI: https://bura.brunel.ac.uk/handle/2438/32126
DOI: https://doi.org/10.1109/OJCOMS.2025.3606812
Other Identifiers: ORCiD: Haoyun Li https://orcid.org/0000-0002-6318-587X
ORCiD: Ming Xiao https://orcid.org/0000-0002-5407-0835
ORCiD: Kezhi Wang https://orcid.org/0000-0001-8602-0800
ORCiD: Robert Schober https://orcid.org/0000-0002-6420-4884
ORCiD: Dong In Kim https://orcid.org/0000-0001-7711-8072
ORCiD: Yong Liang Guan https://orcid.org/0000-0002-9757-630X
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Full|Text.pdfCopyright © 2025 The Authors. This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License. For more information, see https://creativecommons.org/licenses/by-nc-nd/4.0/3.67 MBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons