YLYiqing Li

Yiqing 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


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


Latest Publications

  • AoI Minimization for Computation‐Intensive Tasks at the Edge: The Pareto‐Optimal Based Packet Scheduling Algorithm

    by Shihao Li, Bohao Chen, Shihan Zhou, Yuan Chai, Yiqing Li, Quan Chen

    Age of information (AoI), which is defined as the time elapsed since the generation of the latest received update, has drawn growing research attention recently. To optimize the system AoI for computation‐intensive tasks, most existing work either follows simple queuing disciplines or works in an offline manner. Thus, in this paper, we investigate how to minimize the system AoI by taking into account both the freshness of the arrival packets and the computation load of future packets. First, we identify the existence of the Pareto‐optimal frontier for packet scheduling for the first time, which is obtained by defining two auxiliary attributes related to the freshness and the computation load of packets. Second, considering the possible future arrivals, we decompose the problem of AoI minimization into the subproblems of minimizing the possible incurred AoI at each epoch. Then, an efficient Pareto‐optimal packet scheduling method is proposed to minimize the incurred AoI with the selected packets. The proposed method is proven to have an approximation ratio of 5/3. Additionally, to further improve the performance, a Pareto‐optimal packet scheduling method with a retention mechanism is also proposed, which incorporates a candidate packet retention mechanism to dynamically maintain a queue of high‐quality candidate packets, considering the randomness of future packet arrivals. Finally, the theoretical analysis and simulation results verify that the proposed algorithm has high performance in terms of AoI, reducing the AoI by up to 12.6%.

  • Open Access

    Online Network Traffic Recovery Based on Probabilistic Sparse Self-Attention for Transfer Learning: A Lightweight and Efficient Tensor Completion Method

    by Hongkai Chen, Miao Jiang, Yiqing Li

    In contemporary network traffic engineering and anomaly detection, the measurement of network traffic is critically important. A comprehensive dataset of network traffic provides rapid and valuable assistance for traffic scheduling, fault detection, and network monitoring. However, inadequate monitoring facilities at certain observation points, along with high measurement costs, result in incomplete traffic data and significant sparsity within network monitoring systems. Recent studies have demonstrated that tensor completion can effectively recover missing traffic data from partial measurements. Despite its promising potential, existing tensor completion methods often lack the ability to retain historical information, making it challenging to efficiently capture long-term dependencies among tasks. To address this challenge, an online approach based on probabilistic sparse self-attention (PSSA) for Transfer Learning is proposed. This method effectively leverages transfer learning to transmit historical information to new tasks. Experiments conducted on two real-world datasets demonstrate that the integration of the PSSA module accelerates model training speed and improves the accuracy of tensor recovery.

  • Joint Transmit Beamforming and Antenna Position Optimization for Fluid-Antenna-Assisted Dual-Functional Radar-Communication Systems

    by Yiqing Li, Miao Jiang, Tuo Wu, Quanzhong Li, Chau Yuen, Kai-Kit Wong, Fumiyuki Adachi

    By leveraging the position flexibility of the emerging fluid antenna (FA) technology, this correspondence investigates the joint optimization of beamforming and antenna position in FA-assisted dual-functional radar-communication systems. To characterize the performance trade-off between radar and communication functionalities, we propose to maximize the rate region of the system under both transmit power and antenna position constraints. To solve the formulated non-convex problem, an alternating optimization based method is proposed, where a semidefinite relaxation and an exponential gradient descent-based method are adopted to solve the beamforming and the antenna position optimization subproblems, respectively. Simulation results demonstrate that the proposed scheme effectively reduces grating lobes and enhances the overall system performance in terms of both radar sensing and communication throughput.

  • Mobility-Aware Joint Task Offloading and Resource Allocation for Multiserver Cooperative MEC

    by Yiqing Li, Rong Li, Zhong Hu, Miao Jiang, Lianglun Cheng

    The rapid proliferation of delay-sensitive Internet of Things (IoT) applications in sixth-generation (6G) networks necessitates innovative solutions for computation-intensive tasks in mobile edge computing (MEC) systems. This article addresses the critical challenge of spatiotemporal task heterogeneity induced by user mobility in multiserver MEC-enabled IoT networks. A cooperative MEC framework is proposed with joint optimization of transmit power allocation, computation offloading, and central processing unit (CPU)-cycle frequencies. The formulated mixed-integer nonlinear programming (MINLP) problem is decomposed into two tractable subproblems: the transmit power control subproblem solved by Lambert $\mathcal {W}$ function-based closed-form solutions; the task offloading and CPU-cycle frequency allocation subproblem solved by a novel deep reinforcement learning (DRL)-based method named D3SAC. Combining a dueling double deep $Q$ -network with soft actor–critic (SAC) algorithms, our proposed D3SAC method dynamically adapts to user mobility while maintaining energy efficiency and computational latency. Simulation results demonstrate over 52% energy reduction compared with maximum-power transmission schemes. Compared to existing DRL baselines, our proposed method achieves a superior task completion rate and CPU-cycle frequencies utilization (CFU) efficiency while maintaining balanced workload distribution.


  • Robust Beamforming for Active RIS-Assisted Over-the-Air Computation With Partial Channel State Information

    by Baoyuan Wei, Yiqing Li, Miao Jiang, Qi Zhang

    In this paper, we propose a robust beamforming scheme for an active reconfigurable intelligent surface (RIS)-assisted over-the-air computation system, where only partial channel state information (CSI) is available. The partial CSI means deterministic line-of-sight components and Gaussian distribution statistics of non-line-of-sight (NLoS) components for individual transmitter-RIS link and RIS-receiver link. To minimize the average computation mean square error, the technical challenge is the robust RIS reflection matrix optimization considering the unknown information of the NLoS components. The optimization problem, after equivalent transformation using majorization-minimization-based procedure, is a quadratically constrained quadratic programming with additional maximum allowable amplification factor constraints, whose semi-closed-form solution has not been documented. In this paper, the semi-closed-form solution is skillfully derived using the property of matrix inversion and cofactor expansion. Furthermore, by incorporating the optimal receiving beamforming expression into the robust RIS reflection matrix optimization, the conventional triple alternating optimization is effectively reduced to a double one. Numerical results illustrate that our proposed active RIS-assisted system outperforms the conventional passive RIS-assisted one, when the transmission power of sensors is low.

  • Accelerating Distributed Average Consensus in Wireless Sensor Networks via GNN-Based Broadcast Probability Optimization

    by Miao Jiang, Zhong Hu, Yiqing Li

    Achieving efficient distributed average consensus is crucial for collaborative applications in wireless sensor networks (WSNs). Traditional gossip-based methods encounter difficulties in balancing communication efficiency and consensus rate, especially in dynamic and resource-constrained wireless environments. To overcome these challenges, a graph neural network (GNN), specifically the message passing neural network (MPNN) framework, is proposed to optimize node broadcast probabilities for the probabilistic broadcast gossip scheme. By employing MPNN with attention mechanisms, the proposed method dynamically allocates broadcast probabilities based on both local node characteristics and global network topologies. Extensive simulations reveal that the proposed method significantly surpasses heuristic and optimization-based baselines, achieving a substantial reduction in communication costs. These results highlight the potential of GNNs in advancing distributed consensus protocols for WSNs.

  • Joint Dictionary Learning and Channel Estimation in Hybrid-Field XL-MIMO Systems

    by Miao Jiang, Yuanpeng Shi, Zhong Hu, Yiqing Li

    Hybrid-field channel estimation in extremely large-scale multiple-input and multiple-output (XL-MIMO) systems presents significant challenges due to the coexistence of far-field and near-field scatterers. This letter proposes an alternating direction method of multipliers (ADMM)-based joint dictionary learning and channel estimation method to address these challenges. By leveraging extensive channel measurement data, a hybrid-field dictionary is learned to effectively capture the unique characteristics of the hybrid-field channels. Simulation results demonstrate that our proposed method outperforms existing predefined far-field and near-field dictionary-based schemes, highlighting its potential for Internet of Things networks.


  • Rethinking Distributed Average Consensus for Wireless Networks: A Low-Cost Approach to Broadcast Probability Optimization

    by Miao Jiang, Yiqing Li, Tuo Wu, Chau Yuen, Naofal Al-Dhahir

    This letter rethinks the probabilistic broadcast gossip scheme to achieve fast distributed average consensus in wireless networks. The consensus attainment in this scheme is heavily influenced by the broadcast probability of each node, which directly affects the convergence rate. To reduce communication costs for achieving consensus, we formulate an optimization problem to determine the optimal broadcast probability for each node. This problem involves a challenging non-convex spectral radius term in the objective function. To address this challenge, we introduce an enhanced majorization-minimization-based approach that leverages a novel surrogate function to effectively upper bound the spectral radius function. Simulation results show that the proposed method provides substantial performance improvements over existing heuristic methods for broadcast probability optimization.


  • Optimal Power Allocation for Over-the-Air Computation With Correlated Data

    by Jing Wang, Yiqing Li, Quanzhong Li, Qi Zhang

    Over-the-air computation (AirComp) exploits superposition property of wireless multiple access channels for effective sensing data collection. Existing works on AirComp assume statistically independent sensing data, although in practice sensing data may be correlated with one another. Considering correlated sensing data, we formulate a power allocation optimization problem for achieving the minimum computation mean square error. We transform the formulated problem into a fractional quadratically constrained quadratic problem and propose a semidefinite programming-based scheme to obtain the optimal power allocation factors. It is shown through simulation results that our proposed scheme outperforms the full-power and channel-inversion schemes.