XLXiaoqian Li

Xiaoqian Li

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Xiaoqian Li has a total of 49 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Joint Optimization of Sensing, Communication, and Computation for Cooperative Spectrum Sensing

    by Xuesong Liu, Junkang Ge, Xiaoqian Li, Yansong Liu, Haoyu Tang, Gang Feng

    Cooperative spectrum sensing (CSS) is a technique that exploits spatial diversity to enhance spectrum detection in cognitive radio (CR) networks. It involves multiple cognitive users to collaboratively sense spectrum bands and report their raw sensed data or local detection results to a fusion center to make spectrum allocation decisions for CR. The performance of CSS is often degraded by the non-stationarity of the wireless channels and limited computation and communication resources in the CR network. To address these challenges, we propose a novel joint optimization framework tailored for multidimensional resource-constrained CR networks in this paper, by simultaneously determining the user selection, the sensing-transmission-computation duration, and the allocation of communication and computation resources involved in the system, with the aim of maximizing the spectrum sensing performance under strict resource constraints. The proposed framework first derives a closed-form solution for optimal sensing-transmission-computation duration and then develops an efficient iterative algorithm for joint user selection and resource allocation. Simulation results show that the proposed framework significantly outperforms existing solutions without jointly considering the sensing, transmission, and computation processes and/or multidimensional resource limitations.


  • Joint Tilt Angle and User Association Optimization for Directional Antenna-Based Cell-Free Massive MIMO

    by Zihan Hu, Shuang Qin, Gang Feng, Xiaoqian Li

    With flexible antenna deployment, the Cell-Free Massive MIMO (CF-mMIMO) system can reduce wireless communication distance between access antennas and users, and provide multi-antenna access services for mobile users. In this paper, we consider introducing directional antennas in Cell-Free Massive MIMO system (CF-mMIMO-DA) to improve the network coverage and transmission capacity. In CF-mMIMO-DA systems, access control, which specifies the serving antennas, subcarriers, as well as the tilt angle and allocated transmit power, plays a crucial role for system performance. In this paper, we propose an access control optimization model in CF-mMIMO-DA systems with objective of maximizing the network throughput. Considering that the problem is NP-hard, we decompose the original problem into two subproblems, antenna tilt angle adjustment and user association. Then, to solve the two subproblems, we propose an antenna tilt angle adjustment algorithm based on the particle swarm optimization, and a user association algorithm based on the combination of concave-convex procedure and alternating direction of method of multipliers. In addition, we proposed an optimized joint access control mechanism based on alternating optimization between the two subproblems. Numerical results show that the deployment of directional antennas in CF-mMIMO can significantly improve the system throughput, and our proposed algorithm outperforms benchmarks.

  • Open Access

    An ultra energy-saving mechanism based on beacon signals for 6G networks

    by Ailin Deng, Xiaoqian Li, Gang Feng, Lu Guan


  • Trusted Clustering Based Federated Learning in Edge Networks

    by Yi-Jing Liu, Long Zhang, Xiaoqian Li, Hongyang Du, Gang Feng, Shuang Qin, Jiacheng Wang

    Federated learning (FL) is integral to advancing edge intelligence by enabling collaborative machine learning. In FL-empowered edge networks, computing nodes first train local models and then send them to an or multiple aggregation node(s) for global model collaboration. However, the trustworthiness of both local and global models in conventional FL frameworks is compromised due to inadequate model security and transparency. Distributed ledger technique (DLT) can address this issue by leveraging multi-nodes trust capabilities to support distributed consensus. However, model training and consensus performance of DLT may significantly degrade due to instability and resource constraints of edge networks. Sharding technique provides an effective approach by dividing the ledger into smaller and manageable shards. In this paper, to improve model training and consensus performance, we propose a trusted FL framework by incorporating sharding DLT into FL frameworks. We construct a theoretical model to investigate the relationship between model training performance, consensus efficiency, and capacity of edge nodes regarding storage, computing and communications. Based on the theoretical model, we propose a trusted clustering scheme to aggregate local models. Numerical results show that our proposed scheme significantly improves network throughput for transmitting models while guaranteeing model learning performance in comparison with some classical baselines.


  • Cooperative Transmission for Space-Air-Ground Integrated Networks: A Multi-Agent Cooperation Method

    by Lei Cheng, Xiaoqian Li, Gang Feng, Youkun Peng, Shuang Qin, Tony Q.S. Quek

    Unmanned aerial vehicles (UAVs) have been widely applied as aerial relays for satellite-to-terrestrial transmission so that data packets can be delivered either directly from satellites to user equipments (UEs) or relayed via UAVs. To exploit the advantages of such space-aerial cooperative transmission, data transmission, and resource allocation should be jointly optimized under constrained resources in dynamic space-air-ground integrated networks (SAGINs). However, the tight coupling between discrete transmission strategies and continuous resource allocation among users leads to a challenging long-term, large-scale, and non-convex optimization problem. While existing multi-agent reinforcement learning (MARL) techniques have exhibited potential in addressing such problems, their limitations in handling discrete-continuous decisions and ensuring robust multi-agent cooperation often result in significant performance deterioration. In this paper, we propose a new MARL-based Cooperative Transmission Strategy (MCTS) to overcome these limitations. In MCTS, each agent employs a hybrid Actor-Critic (H-AC) algorithm, where the optimal discrete transmission strategy with its associated resource allocation is modeled as parameterized actions and determined by an improved AC structure. To enhance cooperation among agents, a multi-agent cooperation framework is designed based on QMIX, employing a centralized Critic to efficiently guide convergence toward optimal solutions while reducing computational complexity. Simulation results demonstrate the superiority of MCTS over a number of benchmark algorithms and efficiency under various environments, in terms of overall transmitted data and resource utilization.


  • Adaptive Clustering-Based Straggler-Aware Federated Learning in Wireless Edge Networks

    by Yi-Jing Liu, Gang Feng, Hongyang Du, Zheng Qin, Yao Sun, Jiawen Kang, Xiaoqian Li, Dusit Niyato

    Federated learning (FL) has been vigorously promoted in wireless edge networks as it fosters collaborative training of machine learning (ML) models while preserving individual user privacy and data security. In conventional FL, user equipment (UE) and an aggregator can collaboratively train shared global ML models by transmitting interactive ML models. In wireless edge networks, heterogeneity of multi-dimensional resources ( e.g ., computing and communication resources) used to train and transmit FL models may introduce stragglers, characterized by a slow update and/or transmission of local models. The stragglers can significantly degrade learning performance of FL, as the slowest participating UE can dramatically slow down the entire convergence. In this paper, to alleviate the negative impact of stragglers, we propose a dynamic straggler-aware clustering based FL (FeDSC) mechanism via adaptive UE clustering. Specifically, we first group participating UEs into multiple clusters based on their available computing and wireless resources. Then, we propose an adaptive clustering scheme to synchronously update the cluster aggregation model. Meanwhile, an edge server performs global aggregation of different cluster models in an asynchronous manner. Finally, we theoretically demonstrate the convergence of our proposed mechanism via numerical results. Numerical results show that our proposed mechanism can effectively reduce training time and wireless bandwidth consumption, while improving training efficiency and guaranteeing learning accuracy.


  • Optimizing Model Dissemination for Hierarchical Clustering Learning in Edge Computing

    by Long Zhang, Gang Feng, Zheng Qin, Xiaoqian Li

    Hierarchical clustering learning (HCL) extends traditional parameter server-based distributed learning by clustering heterogeneous user equipments (UEs) via cluster nodes (CNs) located at the edge of the network. Currently, most vanilla model dissemination strategies in distributed learning rely on one-to-many transmissions, inevitably consuming excessive precious bandwidth resources. Consequently, communication-efficiency becomes crucial for HCL in resource-constrained edge networks. In this paper, we propose a multistage cooperative model dissemination strategy to sequentially determine the subsets of CNs that can concurrently transmit models during individual scheduling stages, thereby improving communication efficiency in HCL. We formulate the strategy design as an optimization problem to minimize the maximum completion time of the slowest straggler in communication rounds, while accurately clustering UEs to CNs with similar data distributions. To make sequential and combinatorial decisions in individual stages, we develop an online learning algorithm, called sequential combinatorial multi-armed bandit (SCMAB). The SCMAB enables learning a multistage cooperative model dissemination strategy via an asymptotically optimal approach. Furthermore, the SCMAB dynamically re-clusters UEs to appropriate CNs, according to the similarity of UEs’ data distribution. The simulation results indicate that compared to traditional transmission strategies, the proposed strategy improves communication efficiency by 2.11% to 5.57%, while achieving comparable and even higher learning accuracy.


  • Joint User Association and Bandwidth Allocation in Semantic Communication Networks

    by Le Xia, Yao Sun, Dusit Niyato, Xiaoqian Li, Muhammad Ali Imran

    Semantic communication (SemCom) has recently been considered a promising solution to guarantee high resource utilization and transmission reliability for future wireless networks. Nevertheless, the unique demand for background knowledge matching makes it challenging to achieve efficient wireless resource management for multiple users in SemCom-enabled networks (SC-Nets). To this end, this paper investigates SemCom from a networking perspective, where two fundamental problems of user association (UA) and bandwidth allocation (BA) are systematically addressed in the SC-Net. First, considering varying knowledge matching states between mobile users and associated base stations, we identify two general SC-Net scenarios, namely perfect knowledge matching-based SC-Net and imperfect knowledge matching-based SC-Net. Afterward, for each SC-Net scenario, we describe its distinctive semantic channel model from the semantic information theory perspective, whereby a concept of bit-rate-to-message-rate transformation is developed along with a new semantics-level metric, namely system throughput in message (STM), to measure the overall network performance. In this way, we then formulate a joint STM-maximization problem of UA and BA for each SC-Net scenario, followed by a corresponding optimal solution proposed. Numerical results in both scenarios demonstrate significant superiority and reliability of our solutions in the STM performance compared with two benchmarks.