WWWen Wang

Wen Wang

*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


Wen Wang has a total of 42 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Predictive Beamforming and Resource Allocation for High-Mobility Cell-Free UAV Networks

    by Chao Fang, Cheng Zhang, Wen Wang, Pengguang Du, Wei Zhang, Yongming Huang

    Accurate acquisition of channel state information (CSI) is crucial for achieving high-rate communication, yet it introduces significant training overhead and latency, particularly in high-mobility cell-free massive multiple-input multipleoutput (CF-mMIMO) communication systems with unmanned aerial vehicles (UAVs). To address this challenge, we propose a predictive beamforming and resource allocation framework that significantly reduces training overhead while enhancing system throughput. Specifically, a novel frame structure is designed in which uplink training is performed only in the first time slot of each beam tracking frame, while distributed beam tracking and predictive beamforming are applied in all subsequent slots using the extended Kalman filter (EKF) at each access point (AP). Moreover, we develop a centralized information fusion algorithm that exploits cell-free multi-point cooperation to improve estimation accuracy with low fronthaul overhead. Then, we derive the theoretical posterior Cram´er-Rao bound (PCRB) for the fused estimation and show that, under the local linear-Gaussian approximation, the predicted PCRB coincides with the covariance of the fused estimate. We further establish an explicit analytical mapping between the predicted PCRB and the uplink pilot length. Leveraging this theoretical bridge, we formulate a prediction-aware joint optimization problem involving uplink pilot length, downlink AP-user association, and power allocation to actively adapt the training overhead and maximize the effective sum spectral efficiency (SE). A low-complexity iterative algorithm based on fractional programming is proposed to solve this problem. Numerical results demonstrate that the proposed framework achieves a favorable trade-off between signaling overhead and system throughput. Specifically, it reduces the training overhead by 95% with only a 3% decrease in positioning accuracy, incurs only modest additional fronthaul overhead, and improves the effective sum SE by 31% compared to traditional schemes. Furthermore, comprehensive evaluations show that the framework remains effective under multipath fading and higher UAV velocities, and continues to benefit from cooperative gains in expanded network deployments.

  • Two-Timescale Optimization for Aerial Rotatable Antenna Array in Cell-Free Networks With Dynamic Users

    by Wen Wang, Yongming Huang, Wanli Ni, Cheng Zhang, Dongming Wang

    Cell-free (CF) networks have attracted increasing attention for their effectiveness in mitigating inter-cell interference through cooperative transmission among distributed access points (APs). However, conventional terrestrial CF networks often lack spatial flexibility and struggle to adapt to dynamic environments. To overcome these limitations, we propose a new CF network served by unmanned aerial vehicles (UAVs) equipped with a three-dimensional (3D) rotatable antenna array. Combined with the UAV’s controllable 3D position, the resulting six-dimensional (6D) spatial reconfigurability enables the active beam steering of such aerial APs, thereby enhancing interference mitigation and dynamic user association. However, this design, referred to as 6D aerial rotatable antenna arrays (6DARAs), faces several critical challenges, such as high-dimensional coupled control variables, time-varying user positions, and increased channel state information (CSI) estimation overhead. To address these issues, we develop a two-timescale optimization framework that separates large-timescale 6DARA control (i.e., clustering, position, and rotation) from small-timescale signal processing. At the small-timescale, a closed-form team minimum mean-squared error decoder is derived using local and statistical CSI. At the large-timescale, 6DARA clustering is modeled as a local altruistic game and solved via a concurrent update algorithm, while 6DARA mobility is managed by an enhanced multi-agent reinforcement learning algorithm for efficient position and rotation adaptation under partial observability. Simulation results demonstrate that the proposed network and optimization framework significantly outperform existing baselines in terms of throughput, scalability, and robustness in dynamic environments.


  • Robust and Low-Overhead Resource Allocation for Latency-Sensitive Cell-Free Downlink

    by 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.

  • OFDM Communications With Deterministic Delay: Energy Optimization and Performance Analysis

    by Xianliang Pu, Cheng Zhang, Wen Wang, Jiaheng Wang, Aimin Tang, Yongming Huang

    Delay guarantee is essential for wireless communication technology, which is beneficial for real-time data processing. Such guarantee manifests as hard delay constraint, whose resolution facilitates reliable task fulfillment within strict deadline while enabling efficient communication resource scheduling. In this paper, we investigate the problem of transmitting a certain amount of data within a deadline and optimizing the expected total energy in an Orthogonal Frequency Division Multiplexing (OFDM) system. We represent the problem as a finite-horizon stochastic dynamic optimization problem, and aim to derive decision rule for allocating communication transmission rates across subcarriers. We propose a method named Multicarrier Deterministic Approximation Method (MDA). First, to address the complexity of expectation computation, we approximate the expected value function. Subsequently, for the resulting deterministic optimization problem, we introduce auxiliary variable, and adopt low-complexity two-layer optimization framework. For the proposed method, we derive performance upper bound for deterministic parameter with specific value and asymptotic performance upper bound for deterministic parameter with general value. The performance bound theoretically demonstrates the superiority of the proposed method over both the equal rate method and the first slot method. Furthermore, it proves that increasing the deterministic parameter under relaxed delay constraint can achieve enhanced theoretical performance guarantee. Finally, the effectiveness of the proposed method is validated through simulations.

  • Task-Agnostic Semantic Communications Relying on Information Bottleneck and Federated Meta-Learning

    by Hao Wei, Wen Wang, Wanli Ni, Wenjun Xu, Yongming Huang, Dusit Niyato, Ping Zhang

    As a paradigm shift towards pervasive intelligence, semantic communication (SemCom) has shown great potentials to improve communication efficiency and provide user-centric services by delivering task-oriented semantic meanings. However, the exponential growth in connected devices, data volumes, and communication demands presents significant challenges for practical SemCom design, particularly in resource-constrained wireless networks. In this work, we propose a task-agnostic semantic communication (TASC) framework capable of supporting multimodal data across diverse tasks. To investigate the interplay between communication and intelligent tasks from an information-theoretic perspective, we introduce a distributed multimodal information bottleneck (DMIB) principle, which enables the extraction of minimal sufficient unimodal and multimodal representations by eliminating redundant information while preserving task-relevant semantics. To further reduce the communication overhead, we develop an adaptive semantic feature transmission method under dynamic channel conditions. Then, TASC is trained based on federated meta-learning (FML) to learn a well-initialized model for rapid adaptation and generalization. To gain deep insights, we conduct theoretical analysis and devise resource management to accelerate convergence while minimizing the training latency and energy cost. Moreover, we develop a joint user selection and resource allocation algorithm to address the non-convex problem with theoretical guarantees. Extensive simulation results validate the effectiveness and superiority of the proposed TASC compared to baselines.


  • Token Communication in the Era of Large Models: An Information Bottleneck-Based Approach

    by Hao Wei, Wanli Ni, Wen Wang, Wenjun Xu, Dusit Niyato, Ping Zhang

    This letter proposes UniToCom, a unified token communication paradigm that treats tokens as the fundamental units for both processing and wireless transmission. Specifically, to enable efficient token representations, we propose a generative information bottleneck (GenIB) principle, which facilitates the learning of tokens that preserve essential information while supporting reliable generation across multiple modalities. By doing this, GenIB-based tokenization is conducive to improving the communication efficiency and reducing computational complexity. Additionally, we develop $\sigma $ -GenIB to address the challenges of variance collapse in autoregressive modeling, maintaining representational diversity and stability. Moreover, we employ a causal Transformer-based multimodal large language model (MLLM) at the receiver to unify the processing of both discrete and continuous tokens under the next-token prediction paradigm. Simulation results validate the effectiveness and superiority of the proposed UniToCom compared to baselines under dynamic channel conditions. By integrating token processing with MLLMs, UniToCom enables scalable and generalizable communication in favor of multimodal understanding and generation, providing a potential solution for next-generation intelligent communications.


  • Aerial 6D Movable Antenna-Enabled Cell-Free Networks

    by Wen Wang, Yongming Huang, Xiaodan Shao, Cheng Zhang

    In this paper, we propose an aerial movable antenna (AMA) architecture with six-dimensional (6D) spatial degrees of freedom (DoFs) to enhance the capacity of cell-free networks. Unlike conventional terrestrial access points (APs) with fixed-position antennas, the proposed AMA-enabled APs can flexibly adjust the three-dimensional (3D) unmanned aerial vehicle (UAV) positions and 3D array rotations. To overcome the high-dimensional movement-design challenges posed by multiple APs and antennas, we develop a low-overhead, low-complexity, and scalable distributed processing optimization framework to maximize the achievable uplink sum-rate of the proposed aerial cell-free network. Specifically, the team minimum mean square error (TMMSE) algorithm is proposed to design receive combiners using partial channel state information, while the weighted critic update multi-agent twin-delayed deep deterministic policy gradient (WCU-MATD3) algorithm efficiently optimizes 3D positions and 3D rotations through distributed AP collaboration. Simulation results demonstrate that the proposed AMA-enable scheme achieves a 37.1% performance gain over conventional cell-free networks with fixed antenna position and rotation by exploiting 6D spatial DoFs, while the proposed algorithm exhibits satisfactory convergence and exploration capabilities.


  • Joint Communication and Computation for Federated Learning Over Cell-Free MIMO Network

    by Zitong Wang, Cheng Zhang, Wen Wang, Mingzeng Dai, Haiming Wang, Yongming Huang

    This paper proposes a joint communication and computation scheme (JCCS) for cell-free multiple-input multiple-output (CF-MIMO) network to support federated learning (FL). The JCCS allows users to choose between a model update process or a data offloading process, where the offloaded data and the uploaded model gradient are respectively sent to the distributed processing units (DPUs) deployed on the access points (APs) for further model updates. Moreover, we define a performance metric called iteration error gap as the difference between model errors of adjacent iterations and decouple the total training time minimization problem into the error gap maximization problem within fixed time limit. Base on common machine learning (ML) assumptions, we derive a lower bound of iteration error gap, which is determined by the minimum batch size among all DPUs. An optimization problem aiming to maximize the minimum batch size is then formulated to jointly optimize the time division, power control, and user selection. By employing the block coordinate descent approach, we develop a new algorithm to solve the formulated non-convex mixed integer programming problem. Our simulation results verify the convergence of proposed algorithm and show that it reduces the relative error of a single FL iteration by more than 1.5 dB compared with other baseline schemes. Furthermore, the CF-MIMO network integrated with JCCS achieves a relative error reduction exceeding 1 dB per iteration when compared to collocated MIMO network. In addition, an FL example of handwritten digits classification shows that the JCCS indeed accelerates the convergence of FL model.


  • Joint UAV Deployment and Space-Time-Frequency Resource Allocation for Low-Altitude Economy

    by Yuxuan Li, Wen Wang, Cheng Zhang, Yongming Huang, Dusit Niyato

    This letter addresses a joint unmanned aerial vehicle (UAV) deployment and space-time-frequency resource allocation problem for air-ground networks. From the perspective of low altitude economy, we aim to maximize the economic profit by delivering high-quality services to different users with diverse and varying requirements, while reducing resource consumption and operational costs. To address the high-dimensional complexity of this combinatorial optimization problem, we decompose different categories of tasks to separate agents and utilize multi-agent deep reinforcement learning (MA-DRL) in a centralized training and distributed execution approach. Furthermore, we employ an attention mechanism to analyze heterogeneous effects of different local observations from individual UAVs and generate agent-specific global state augmentations so that the performance is further improved. Simulation results demonstrate that the proposed scheme is effective in enhancing the economic profit, and outperforms typical state-of-the-art DRL approaches.


  • Deep Reinforcement Learning for Movable Antenna-Assisted Cell-Free Networks

    by Qinghang Li, Wen Wang, Yuxuan Li, Fei Yu, Cheng Zhang, Yongming Huang

    In this paper, we propose a movable antenna (MA)-assisted cell-free communication network to serve multiple users. The proposed MA is capable of moving in a three-dimensional region, and making full use of the spatial degrees of freedom (DoFs) to adjust the channel condition. As such, higher spatial diversity gains are achieved at the transmitters, thereby significantly enhancing the signals received at the users. With multiple MAs per access point (AP), we maximize the sum-rate of all users by jointly optimizing the MA positions and digital precoders. Then, we propose a novel deep reinforcement learning (DRL)-based algorithm, named multi-agent twin delayed deep deterministic policy gradient (MATD3)-team minimum mean square error (TMMSE) to solve this non-convex problem efficiently. Simulation results demonstrate that, through the proposed MATD3-TMMSE algorithm, the joint design of cell-free networks and MA architecture can effectively improve the sum-rate and reduce the network cost compared to existing fixed-position antenna (FPA) networks and traditional precoding algorithms.