WWWeimin Wu

Weimin Wu

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Weimin Wu has a total of 48 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Modeling and Optimization of Co-TDMA in Next-Generation Wi-Fi Systems Based on Optimal Transportation Theory

    by Junxiong Zhang, Weimin Wu, Xiaohu Ge, Yingzhuang Liu

    The importance and commercial value of wireless fidelity (Wi-Fi) technology are now widely recognized. However, the traditional Wi-Fi technology causes the throughput of access points (APs) to quickly approaches a saturated level when the number of accessing stations (STAs) is large than a specified threshold. To improve the saturated throughput of APs, a new multi-AP cooperative architecture assisted by a centralized AP controller is proposed. Based on the proposed architecture, a new channel access mechanism called optimal transportation channel access (OTCA) mechanism is proposed to reduce the collision among STAs in Wi-Fi networks. Based on the modulation and coding scheme, a subordinate AP negotiates with the STA to confirm the STA transmission rate in OTCA mechanism. Moreover, the subordinate AP reports the confirmed transmission rate to the centralized AP controller. The centralized AP controller distributes data to the associated subordinate AP based on the optimal transportation theory. Considering the latency constraint, a new algorithm called optimal transportation (OT) algorithm is developed to adjust the STA data volume for associated subordinate APs and improve the throughput of Wi-Fi networks. Compared to the traditional enhanced distributed channel access algorithm, simulation results indicate that the OT algorithm reduces the average latency by 14.14% and improves the average throughput by 21.90%.


  • Simultaneous Wireless Information and Power Transfer for STAR-RIS-Assisted AAV Networks

    by Wenwu Xie, Lijuan Qin, Ji Wang, Weimin Wu, Xingwang Li, Hongbo Xu, Liang Yang

    This paper explores the benefits of deploying simultaneously transmitting and reflecting reconfigurable intelligence surfaces (STAR-RIS) in unmanned aerial vehicle (UAV) networks with simultaneous wireless information and power transfer. In the proposed system, the UAV utilizes STAR-RIS to radiate energy-carrying information signals (ECISs) to multiple outdoor energy receivers and multiple indoor information receivers without flying over indoor no-fly zone. Based on the UAV propulsion power formula, we successively introduce fly-hover-broadcast (FHB) and path discretization (PD) protocols to minimize the total UAV energy consumption by jointly using the extended penalty function and optimization algorithm based on the expected value of channel status information, where the UAV flight constraints, no-fly constraint, minimized energy or information threshold constraints, and STAR-RIS phase-shift constraints are met. The FHB protocol, which requires the UAV to radiate the ECISs to the users at only a few hovering positions, provides a lower-bound performance of UAV energy consumption, while the PD protocol is used to discuss the general situation of the ECISs during UAV flight. Simulation results demonstrate that the utilization of the STAR-RIS in UAV networks outperforms the traditional RIS in improving energy efficiency and extending UAV flight time.


  • Movable-Antenna-Assisted Covert Communications With Reconfigurable Intelligent Surfaces

    by Wenwu Xie, Zilong Li, Chao Yu, Hongbo Xu, Ji Wang, Weimin Wu, Xingwang Li, Liang Yang

    This article proposes a novel covert communication framework utilizing movable antennas (MAs) to enable covert communications in which the evading detection eavesdropper aided by a reconfigurable intelligent surface (RIS). The trajectories of the MAs over the entire time slot, transmit beamforming, and the phase shift of the RIS in each time slot are jointly optimized to improve the covert rate. Specifically, the movement trajectories of the MAs are modeled as a Markov decision process (MDP), optimized by developing a novel deep reinforcement learning (DRL) approach. Furthermore, an alternating optimization (AO) algorithm is designed to jointly optimize the beamforming and phase. In particular, penalty-based two-layer iterative algorithm is proposed to guarantee that the solution satisfies the rank-one constraints. Numerical results show that the proposed MA-assisted covert communications system significantly outperforms conventional fixed-position antenna (FPA) schemes in terms of covert rate.


  • Enhancing IEEE 802.11ax Network Performance: An Investigation and Modeling Into Multi-User Transmission

    by Jin Meng, Qinglin Zhao, Weimin Wu, Minghao Jin, Penghui Song, Yingzhuang Liu

    This study explores the performance optimization of uplink orthogonal frequency division multiple access (OFDMA)-based random access (UORA) in IEEE 802.11ax networks. UORA supports multi-user transmission via two methods, where users transmit either fixed-size or variable-size aggregated MAC protocol data units. However, three critical issues arise: 1. Existing studies only focus on the fixed-size method with low practicality, and overlook the impact of traffic load which leads to inaccurate evaluation of the network performance. 2. The variable-size method has never been studied due to a complex scenario, where user frames append padding bits to fulfill the transmission opportunity constraint. 3. In realistic networks, the variable-size method sacrifices throughput to achieve high practicality and low latency. To address the first two issues, we proposed two novel models based on queueing theory that accurately capture the impact of these transmission methods and various parameters (e.g., the traffic load and padding bits) on throughput, packet loss rate, and latency. To address Issue 3, we design a D ynamic S election A lgorithm of T ransmission M ethods (DSATM), which dynamically switches between the two transmission methods to enhance practicality, maximize throughput, and minimize latency. Finally, we conducted extensive simulations to verify the accuracy of our models and DSATM.


  • Accurate Prediction of Multi-Dimensional Required Resources in 5G via Federated Deep Reinforcement Learning

    by Haojun Huang, Qifan Wang, Weimin Wu, Miao Wang, Geyong Min

    The accurate prediction of required resources in terms of storage, computing and bandwidth is essential for 5G to host diverse services. The existing efforts illustrate that it is more promising to efficiently predict the unknown required resources with a thirdorder tensor compared to the 2D-matrix-based solutions. However, most of them fail to leverage the inherent features hidden in network traffic like temporal stability and service correlation to build a third-order tensor for the multi-dimensional required resource prediction in an intelligent manner, incurring coarse-grained prediction accuracy. Furthermore, it is difficult to build a third-order tensor with rate-varied measurements in 5G due to different lengths of measurement time slots. To address these issues, we propose an Accurate Prediction of Multi-Dimensional Required Resources (APMR) approach in 5G via Federated Deep Reinforcement Learning (FDRL). We first confirm the resource requests originated from different Base Stations (BSs) at varied measurement rates have similar features in service and time domains, but cannot directly form a series of regular tensors. Built on these observations, we reshape these measurement data to form a series of standard third-order tensors with the same size, which include many elements obtained from measurements and some unknown elements needed to be inferred. In order to obtain accurately predicted results, the FDRL-based tensor factorization approach is introduced to intelligently utilize multiple specific iteration rules for local model learning, and the accuracy-aware and latency-based depreciation strategies are exploited to aggregate local models for resource prediction. Extensive simulation experiments demonstrate that APMR can accurately predict the multi-dimensional required resources compared to the state-of-the-art approaches.


  • Enhancing the Performance of Wi-Fi 7 Network via Investigation of Multi-Link and UORA

    by Minghao Jin, Jin Meng, Weimin Wu, Yingzhuang Liu

    With the introduction of multi-link operation, the IEEE 802.11be standard, known as Wi-Fi 7, makes it possible for Wi-Fi devices to simultaneously access multiple channels. However, current studies on multi-link devices (MLDs) concentrated on conventional Distributed Coordination Function (DCF) networks, which experience severe performance degradation in dense user access scenarios. To address this issue, we propose a novel channel access mechanism termed Multi-link Corresponding Resource Unit Binding (MCRUB), which captures the joint impact of multi-link and uplink OFDMA random access (UORA) to enhance network throughput. Moreover, we develop an analytical model for this mechanism and derive the condition for approximate optimal network throughput to optimize control parameters. Simulation results demonstrate that our model accurately predicts the steady-state behavior of the MCRUB mechanism.


  • A Manifold Learning-Based CSI Feedback Framework for FDD Massive MIMO

    by Yandi Cao, Haifan Yin, Ziao Qin, Weidong Li, Weimin Wu, Mérouane Debbah

    Massive multi-input multi-output (MIMO) in Frequency Division Duplex (FDD) mode suffers from heavy feedback overhead for Channel State Information (CSI). In this paper, a novel manifold learning-based CSI feedback framework (MLCF) is proposed to reduce the feedback and improve the spectral efficiency for FDD massive MIMO. Manifold learning (ML) is an effective method for dimensionality reduction. However, most ML algorithms focus only on data compression, and lack the corresponding recovery methods. Moreover, the computational complexity is high when dealing with incremental data. Considering to utilize the intrinsic manifold structure where the CSI samples reside, we propose a landmark selection algorithm to describe the topological skeleton of this manifold. Based on the learned skeleton, the local patch of the incremental CSI on the manifold can be easily determined by its nearest landmarks. This motivates us to propose an incremental CSI compression and reconstruction scheme by keeping the local geometric relationships with landmarks invariant.We theoretically prove the convergence of the proposed landmark selection algorithm. Meanwhile, the upper bound on the error of approximating CSI with landmarks is derived. Simulation results under an industrial channel model of 3GPP demonstrate that the proposed MLCF outperforms existing deep learning based algorithms.


  • Open Access

    Time Reverse Equalization Algorithm for 16 QAM Coherent Optical Communication Systems

    by Junxiong Zhang, Weimin Wu, Xiaohu Ge

    The high speed rotation of state of polarization (RSOP) is a key issue for 16 quadrature amplitude modulation (QAM) coherent optical polarization division multiplexing (PDM) communication systems in strong lightning weather. To reduce the bit error rate (BER) caused by the high speed of RSOP, the historical information is first proposed to correct the demodulation process in coherent optical communication systems. By adding the time reverse error term into the cost function, a new equalization algorithm is proposed for coherent optical communication systems. Compared with the conventional Multi-modulus Algorithm (MMA), simulation results show that the average BER and steady-state error (SSE) of the new algorithm is reduced by 33.47% and 4.08%, respectively. Moreover, the average tolerance of RSOP of the new algorithm is increased by 28.57% compared with the MMA in 16 QAM coherent optical PDM communication systems.