Yinlu Wang
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
Research Subjects
Yinlu Wang has a total of 46 co-authors. Here are the top co-authors by number of shared publications:
- Ming Chen
Southeast University
12 shared publications - Yuntao Hu
National Mobile Communications Research Laboratory, Southeast University, Nanjing, China
7 shared publications - Cunhua Pan
Southeast University
5 shared publications Ming Chen
National Mobile Communications Research Laboratory, Southeast University, Nanjing, China
5 shared publications- Zhiyang Li
National Mobile Communications Research Laboratory, Southeast University, Nanjing, China
5 shared publications - Yihan Cang
Department of Electrical and Electronic Engineering, The University of Hong Kong, Pokfulam, Hong Kong
4 shared publications
Latest Publications
- 24 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15  (21622337) , 1240-1244
Delay-Doppler Diversity Analysis of ODDM Modulation in Satellite Communication Systems
Orthogonal delay-Doppler division multiplexing (ODDM) modulation offers a promising solution to the problem of severe Doppler effects in low earth orbit (LEO) satellites communications. It has been suggested in the recent literature that ODDM modulation can extract full delay-Doppler (DD) diversity, yet a rigorous analysis has not been presented. In this paper, we present a formal analysis of the DD diversity achieved by ODDM modulation along with supporting simulations. Specifically, the analysis and simulations reveal that the asymptotic DD diversity order of ODDM modulation is one, and this order is achieved at lower bit error rate (BER) values for increased frame sizes. We also present low-complexity detector for ODDM modulation based on the Orthogonal approximate message passing (OAMP) algorithm, and show that this detector extracts full DD diversity with the reduced complexity.
- 24 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15  (21622337) , 1240-1244
Delay-Doppler Diversity Analysis of ODDM Modulation in Satellite Communication Systems
Orthogonal delay-Doppler division multiplexing (ODDM) modulation offers a promising solution to the problem of severe Doppler effects in low earth orbit (LEO) satellites communications. It has been suggested in the recent literature that ODDM modulation can extract full delay-Doppler (DD) diversity, yet a rigorous analysis has not been presented. In this paper, we present a formal analysis of the DD diversity achieved by ODDM modulation along with supporting simulations. Specifically, the analysis and simulations reveal that the asymptotic DD diversity order of ODDM modulation is one, and this order is achieved at lower bit error rate (BER) values for increased frame sizes. We also present low-complexity detector for ODDM modulation based on the Orthogonal approximate message passing (OAMP) algorithm, and show that this detector extracts full DD diversity with the reduced complexity.
- 12 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22  (6) , 5856-5874
Joint Optimal Allocation of Radio and Computational Resources Aiming at Minimizing Global Average Task Offloading Age for Long-Term Multi-Cell MEC Systems
This paper investigates the joint optimal allocation of radio and computational resources aiming to minimize global average task offloading age (TOA) over all time slots and mobile devices (MDs) for long-term multi-cell MEC systems with continuous arrival of MDs. TOA represents the total number of offloading time slots, including both transmission and computation. The joint resource allocation problem cannot be solved online because its objective function is long-term average of TOA over all time slots. We transform the long-term resource allocation problem into an online one by the Lyapunov method, then an iterative algorithm is proposed to solve the online problem. The idea of this algorithm is computing iteratively the two sub-problems which optimize sub-channel allocation and offloading power and computational resources joint allocation based on an initial resource allocation scheme. The alternating direction method of multipliers (ADMM) method is employed to solve the first sub-problem. For the second sub-problem, a closed-form expression of optimal power is deduced by solving a convex optimization problem using the Lagrange multiplier method, then the sub-problem is simplified into a linear programming (LP) problem about computational resource allocation. The improved iterative greedy (IIG) algorithm is applied to solve the LP problem. Simulation results demonstrate that the proposed algorithm approaches the performance of the optimal branch-and-bound (BnB) algorithm in the MEC systems with one-time arrival of MDs, and outperforms two benchmark schemes such as first in first out (FIFO) and Chang’s algorithm.
- 12 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22  (6) , 5856-5874
Joint Optimal Allocation of Radio and Computational Resources Aiming at Minimizing Global Average Task Offloading Age for Long-Term Multi-Cell MEC Systems
This paper investigates the joint optimal allocation of radio and computational resources aiming to minimize global average task offloading age (TOA) over all time slots and mobile devices (MDs) for long-term multi-cell MEC systems with continuous arrival of MDs. TOA represents the total number of offloading time slots, including both transmission and computation. The joint resource allocation problem cannot be solved online because its objective function is long-term average of TOA over all time slots. We transform the long-term resource allocation problem into an online one by the Lyapunov method, then an iterative algorithm is proposed to solve the online problem. The idea of this algorithm is computing iteratively the two sub-problems which optimize sub-channel allocation and offloading power and computational resources joint allocation based on an initial resource allocation scheme. The alternating direction method of multipliers (ADMM) method is employed to solve the first sub-problem. For the second sub-problem, a closed-form expression of optimal power is deduced by solving a convex optimization problem using the Lagrange multiplier method, then the sub-problem is simplified into a linear programming (LP) problem about computational resource allocation. The improved iterative greedy (IIG) algorithm is applied to solve the LP problem. Simulation results demonstrate that the proposed algorithm approaches the performance of the optimal branch-and-bound (BnB) algorithm in the MEC systems with one-time arrival of MDs, and outperforms two benchmark schemes such as first in first out (FIFO) and Chang’s algorithm.
- Open Access
- 30 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 118933-118943
Joint Optimization of Resource Allocation and Task Offloading Strategies in Multi-Cell Dynamic MEC Systems Using Multi-Agent DRL
This paper focuses on minimizing the total energy consumption of a long-term delay-sensitive multi-cell mobile edge computing (MEC) system that serves continuously arriving mobile devices (MDs). The energy consumption minimization is achieved by jointly optimizing the task offloading proportions, transmit power allocations, and computational resource distributions while ensuring the overall deadline constraints and the minimum processing size requirements in each scheduling cycle. The optimization problem is then formulated as a multi-agent Markov decision process (MAMDP) to enable sequential optimization across multiple scheduling cycles. To efficiently solve the formulated problem, we develop a multi-agent deep reinforcement learning (MADRL) algorithm that integrates the actor-critic (AC) framework, the embedding techniques, and the centralized training and decentralized execution (CTDE) framework. Simulation results show that the proposed algorithm converges 14%-23% faster than benchmark methods and significantly outperforms benchmark methods in reducing the total energy consumption under specific constraints by up to 10%.
- 30 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 118933-118943
Open AccessJoint Optimization of Resource Allocation and Task Offloading Strategies in Multi-Cell Dynamic MEC Systems Using Multi-Agent DRL
This paper focuses on minimizing the total energy consumption of a long-term delay-sensitive multi-cell mobile edge computing (MEC) system that serves continuously arriving mobile devices (MDs). The energy consumption minimization is achieved by jointly optimizing the task offloading proportions, transmit power allocations, and computational resource distributions while ensuring the overall deadline constraints and the minimum processing size requirements in each scheduling cycle. The optimization problem is then formulated as a multi-agent Markov decision process (MAMDP) to enable sequential optimization across multiple scheduling cycles. To efficiently solve the formulated problem, we develop a multi-agent deep reinforcement learning (MADRL) algorithm that integrates the actor-critic (AC) framework, the embedding techniques, and the centralized training and decentralized execution (CTDE) framework. Simulation results show that the proposed algorithm converges 14%-23% faster than benchmark methods and significantly outperforms benchmark methods in reducing the total energy consumption under specific constraints by up to 10%.
- 18 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73  (10) , 9087-9101
Delay Efficient Caching Enabled Hierarchical Mobile Edge Computing Networks
Service caching in mobile edge computing (MEC) networks involves pre-storing computation programs on MEC servers to efficiently handle users’ computational tasks. By pre-loading these programs, service caching can significantly reduce both computation and transmission delays, addressing the diverse computational requirements of users. However, optimal caching placement is essential due to limited caching capacity, which directly impacts the efficiency of computation offloading. Proper cache placement ensures that relevant programs are readily available, thereby maximizing offloading performance and minimizing delays. This paper investigates a multi-tier MEC network consisting of caching-enabled edge servers, a cloud server, and multiple users. Users offload computational tasks to proximate edge servers, where locally cached programs facilitate immediate processing, thereby mitigating delays. When programs are absent from the cache, tasks are offloaded to the cloud, leading to additional latency. We formulate an optimization problem to minimize the overall communication and computation delay by jointly optimizing caching placement, transmission power, bandwidth allocation, and computation capacity. To tackle the complexity of this mixed-integer nonlinear programming (MINLP) problem, we propose two novel algorithms. The first is a Dinkelbach and big-M-based algorithm that reformulates the problem into a mixed-integer second-order cone programming (MI-SOCP) problem, approximating a near-optimal solution. Recognizing the computational demands of MI-SOCP, we also develop a low-complexity algorithm based on successive convex approximation (SCA) and alternating methods, which efficiently yields a high-quality sub-optimal solution. Simulation results confirm the effectiveness of the proposed algorithms in reducing network delays and emphasize the critical role of caching in improving network performance.
- 18 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73  (10) , 9087-9101
Delay Efficient Caching Enabled Hierarchical Mobile Edge Computing Networks
Service caching in mobile edge computing (MEC) networks involves pre-storing computation programs on MEC servers to efficiently handle users’ computational tasks. By pre-loading these programs, service caching can significantly reduce both computation and transmission delays, addressing the diverse computational requirements of users. However, optimal caching placement is essential due to limited caching capacity, which directly impacts the efficiency of computation offloading. Proper cache placement ensures that relevant programs are readily available, thereby maximizing offloading performance and minimizing delays. This paper investigates a multi-tier MEC network consisting of caching-enabled edge servers, a cloud server, and multiple users. Users offload computational tasks to proximate edge servers, where locally cached programs facilitate immediate processing, thereby mitigating delays. When programs are absent from the cache, tasks are offloaded to the cloud, leading to additional latency. We formulate an optimization problem to minimize the overall communication and computation delay by jointly optimizing caching placement, transmission power, bandwidth allocation, and computation capacity. To tackle the complexity of this mixed-integer nonlinear programming (MINLP) problem, we propose two novel algorithms. The first is a Dinkelbach and big-M-based algorithm that reformulates the problem into a mixed-integer second-order cone programming (MI-SOCP) problem, approximating a near-optimal solution. Recognizing the computational demands of MI-SOCP, we also develop a low-complexity algorithm based on successive convex approximation (SCA) and alternating methods, which efficiently yields a high-quality sub-optimal solution. Simulation results confirm the effectiveness of the proposed algorithms in reducing network delays and emphasize the critical role of caching in improving network performance.
- 5 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73  (7) , 5214-5230
Resource Management in Multi-Cell Collaborative Transmission for Long-Term URLLC Services
Ultra-reliable low-latency communication (URLLC) is a critical type of service that imposes stringent latency requirements. Considering the random and burst URLLC packets arrival characteristics, incorporating spatial frequency reuse into multi-cell networks can significantly improve the system performance. Nevertheless, how to design the frequency refuse strategy for such a multi-cell URLLC system remains technically challenging. In this article, we investigate an online dynamic resource scheduling problem in a multi-cell downlink system with URLLC services. The long-term time-averaged effective throughput is maximized while guaranteeing the instantaneous transmission reliability and prolonged network stability. The formulated problem is a mixed integer nonlinear stochastic optimization problem, in which the Lyapunov optimization is first leveraged to transform the long-term maximization problem into sequential short-term online ones. To tackle the deterministic problem in each time-slot, we further propose a distributed algorithm that delegates computational processes to corresponding base stations for collaborative execution. In this framework, the user association is abstracted as a cooperative game model. Subsequently, each base station exploits alternating optimization and convex optimization approximation algorithms to address the remaining resource allocation problem. Simulation results validate the effectiveness of the proposed algorithm in throughput-backlog trade-off, showcasing that the multi-cell collaborative transmission can attain better performance compared with existing schemes.
- 5 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73  (7) , 5214-5230
Resource Management in Multi-Cell Collaborative Transmission for Long-Term URLLC Services
Ultra-reliable low-latency communication (URLLC) is a critical type of service that imposes stringent latency requirements. Considering the random and burst URLLC packets arrival characteristics, incorporating spatial frequency reuse into multi-cell networks can significantly improve the system performance. Nevertheless, how to design the frequency refuse strategy for such a multi-cell URLLC system remains technically challenging. In this article, we investigate an online dynamic resource scheduling problem in a multi-cell downlink system with URLLC services. The long-term time-averaged effective throughput is maximized while guaranteeing the instantaneous transmission reliability and prolonged network stability. The formulated problem is a mixed integer nonlinear stochastic optimization problem, in which the Lyapunov optimization is first leveraged to transform the long-term maximization problem into sequential short-term online ones. To tackle the deterministic problem in each time-slot, we further propose a distributed algorithm that delegates computational processes to corresponding base stations for collaborative execution. In this framework, the user association is abstracted as a cooperative game model. Subsequently, each base station exploits alternating optimization and convex optimization approximation algorithms to address the remaining resource allocation problem. Simulation results validate the effectiveness of the proposed algorithm in throughput-backlog trade-off, showcasing that the multi-cell collaborative transmission can attain better performance compared with existing schemes.
- 22 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21  (3) , 3021-3034
Resource Allocation for Multi-Cell Multi-Timeslot Transmission: Centralized and Distributed Algorithms
With the dramatic increase in the diverse service requirements and mobile devices, the application-specific data tends to span multiple consecutive timeslots to complete the transmission, while the demand for spectrum resources is further exacerbated. Recent works have suggested that integrating spatial frequency reuse with multi-cell networks can enhance the spectral efficiency and alleviate the scarcity of spectrum. Hence this paper considers a downlink multi-cell multi-timeslot orthogonal frequency division multiple access (OFDMA) cellular system where the users keep downloading data from the base stations (BS) until reaching a predetermined cache size. Specifically, we aim to minimize the transmission delay by jointly optimizing the BS selection, subcarrier assignment, and transmit power allocation, taking into account the current cache size. Due to inter-cell interference and multi-timeslot coupling, this problem is challenging to solve directly. We prove that this problem can be transformed into sequential online sum rate maximization subproblems under causal channel state information (CSI). To solve the subproblems, we first develop a centralized dynamic resource allocation algorithm based on the parameter transformation and the majorization-minimization (MM). In view of the trade-off between performance and complexity, we further propose a distributed algorithm by a designed BS selection scheme and the MM approach. Simulation results demonstrate that the distributed algorithm achieves comparable performance to the centralized algorithm, while they both outperform the benchmark schemes in terms of transmission delay.
- 22 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21  (3) , 3021-3034
Resource Allocation for Multi-Cell Multi-Timeslot Transmission: Centralized and Distributed Algorithms
With the dramatic increase in the diverse service requirements and mobile devices, the application-specific data tends to span multiple consecutive timeslots to complete the transmission, while the demand for spectrum resources is further exacerbated. Recent works have suggested that integrating spatial frequency reuse with multi-cell networks can enhance the spectral efficiency and alleviate the scarcity of spectrum. Hence this paper considers a downlink multi-cell multi-timeslot orthogonal frequency division multiple access (OFDMA) cellular system where the users keep downloading data from the base stations (BS) until reaching a predetermined cache size. Specifically, we aim to minimize the transmission delay by jointly optimizing the BS selection, subcarrier assignment, and transmit power allocation, taking into account the current cache size. Due to inter-cell interference and multi-timeslot coupling, this problem is challenging to solve directly. We prove that this problem can be transformed into sequential online sum rate maximization subproblems under causal channel state information (CSI). To solve the subproblems, we first develop a centralized dynamic resource allocation algorithm based on the parameter transformation and the majorization-minimization (MM). In view of the trade-off between performance and complexity, we further propose a distributed algorithm by a designed BS selection scheme and the MM approach. Simulation results demonstrate that the distributed algorithm achieves comparable performance to the centralized algorithm, while they both outperform the benchmark schemes in terms of transmission delay.
- 17 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11  (17) , 28094-28110
Online Resource Allocation for Semantic-Aware Edge Computing Systems
Mobile edge computing (MEC) in the next generation networks will provide computation services at the network edge to enrich the capabilities of mobile devices and lengthen their battery lives. However, the performance of MEC cannot be guaranteed, when large size local tasks are uploaded to the server simultaneously causing network congestion. As a new paradigm that focuses on transmitting the meaning of messages, semantic communications reveals the significant potential to reduce the network traffic. In this paper, we propose a semantic-aware joint communication and computation resource allocation framework for MEC systems. In the considered system, random tasks arrive at each terminal device (TD), which needs to be computed locally or offloaded to the MEC server. To further release the transmission burden, each TD sends the small-size extracted semantic information of tasks to the server instead of the original large-size raw data. An optimization problem of joint semantic-aware division factor, communication and computation resource management is formulated. The problem aims to minimize the energy consumption of the whole system, while satisfying long-term delay and processing rate constraints. To solve this problem, an online low-complexity algorithm is proposed. In particular, Lyapunov optimization is utilized to decompose the original coupled long-term problem into a series of decoupled deterministic problems without requiring the realizations of future task arrivals and channel gains. Then, the block coordinate descent method and successive convex approximation algorithm are adopted to solve the current time slot deterministic problem by observing the current system states. Moreover, the closed-form optimal solution of each optimization variable is provided. Simulation results show that the proposed algorithm yields up to 41.8% energy reduction compared to its counterpart without semantic-aware allocation.
- 17 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11  (17) , 28094-28110
Online Resource Allocation for Semantic-Aware Edge Computing Systems
Mobile edge computing (MEC) in the next generation networks will provide computation services at the network edge to enrich the capabilities of mobile devices and lengthen their battery lives. However, the performance of MEC cannot be guaranteed, when large size local tasks are uploaded to the server simultaneously causing network congestion. As a new paradigm that focuses on transmitting the meaning of messages, semantic communications reveals the significant potential to reduce the network traffic. In this paper, we propose a semantic-aware joint communication and computation resource allocation framework for MEC systems. In the considered system, random tasks arrive at each terminal device (TD), which needs to be computed locally or offloaded to the MEC server. To further release the transmission burden, each TD sends the small-size extracted semantic information of tasks to the server instead of the original large-size raw data. An optimization problem of joint semantic-aware division factor, communication and computation resource management is formulated. The problem aims to minimize the energy consumption of the whole system, while satisfying long-term delay and processing rate constraints. To solve this problem, an online low-complexity algorithm is proposed. In particular, Lyapunov optimization is utilized to decompose the original coupled long-term problem into a series of decoupled deterministic problems without requiring the realizations of future task arrivals and channel gains. Then, the block coordinate descent method and successive convex approximation algorithm are adopted to solve the current time slot deterministic problem by observing the current system states. Moreover, the closed-form optimal solution of each optimization variable is provided. Simulation results show that the proposed algorithm yields up to 41.8% energy reduction compared to its counterpart without semantic-aware allocation.
- Open Access
Online Resource Allocation for Semantic-Aware Edge Computing Systems
In this paper, we propose a semantic-aware joint communication and computation resource allocation framework for MEC systems. In the considered system, random tasks arrive at each terminal device (TD), which needs to be computed locally or offloaded to the MEC server. To further release the transmission burden, each TD sends the small-size extracted semantic information of tasks to the server instead of the original large-size raw data. An optimization problem of joint semanticaware division factor, communication and computation resource management is formulated. The problem aims to minimize the energy consumption of the whole system, while satisfying longterm delay and processing rate constraints. To solve this problem, an online low-complexity algorithm is proposed. In particular, Lyapunov optimization is utilized to decompose the original coupled long-term problem into a series of decoupled deterministic problems without requiring the realizations of future task arrivals and channel gains. Then, the block coordinate descent method and successive convex approximation algorithm are adopted to solve the current time slot deterministic problem by observing the current system states. Moreover, the closed-form optimal solution of each optimization variable is provided. Simulation results show that the proposed algorithm yields up to 41.8% energy reduction compared to its counterpart without semantic-aware allocation.
Open AccessOnline Resource Allocation for Semantic-Aware Edge Computing Systems
In this paper, we propose a semantic-aware joint communication and computation resource allocation framework for MEC systems. In the considered system, random tasks arrive at each terminal device (TD), which needs to be computed locally or offloaded to the MEC server. To further release the transmission burden, each TD sends the small-size extracted semantic information of tasks to the server instead of the original large-size raw data. An optimization problem of joint semanticaware division factor, communication and computation resource management is formulated. The problem aims to minimize the energy consumption of the whole system, while satisfying longterm delay and processing rate constraints. To solve this problem, an online low-complexity algorithm is proposed. In particular, Lyapunov optimization is utilized to decompose the original coupled long-term problem into a series of decoupled deterministic problems without requiring the realizations of future task arrivals and channel gains. Then, the block coordinate descent method and successive convex approximation algorithm are adopted to solve the current time slot deterministic problem by observing the current system states. Moreover, the closed-form optimal solution of each optimization variable is provided. Simulation results show that the proposed algorithm yields up to 41.8% energy reduction compared to its counterpart without semantic-aware allocation.
- Open Access
Resource Allocation for Semantic-Aware Mobile Edge Computing Systems
In this paper, a semantic-aware joint communication and computation resource allocation framework is proposed for mobile edge computing (MEC) systems. In the considered system, each terminal device (TD) has a computation task, which needs to be executed by offloading to the MEC server. To further decrease the transmission burden, each TD sends the small-size extracted semantic information of tasks to the server instead of the large-size raw data. An optimization problem of joint semantic-aware division factor, communication and computation resource management is formulated. The problem aims to minimize the maximum execution delay of all TDs while satisfying energy consumption constraints. The original non-convex problem is transformed into a convex one based on the geometric programming and the optimal solution is obtained by the alternating optimization algorithm. Moreover, the closed-form optimal solution of the semantic extraction factor is derived. Simulation results show that the proposed algorithm yields up to 37.10% delay reduction compared with the benchmark algorithm without semantic-aware allocation. Furthermore, small semantic extraction factors are preferred in the case of large task sizes and poor channel conditions.
Open AccessResource Allocation for Semantic-Aware Mobile Edge Computing Systems
In this paper, a semantic-aware joint communication and computation resource allocation framework is proposed for mobile edge computing (MEC) systems. In the considered system, each terminal device (TD) has a computation task, which needs to be executed by offloading to the MEC server. To further decrease the transmission burden, each TD sends the small-size extracted semantic information of tasks to the server instead of the large-size raw data. An optimization problem of joint semantic-aware division factor, communication and computation resource management is formulated. The problem aims to minimize the maximum execution delay of all TDs while satisfying energy consumption constraints. The original non-convex problem is transformed into a convex one based on the geometric programming and the optimal solution is obtained by the alternating optimization algorithm. Moreover, the closed-form optimal solution of the semantic extraction factor is derived. Simulation results show that the proposed algorithm yields up to 37.10% delay reduction compared with the benchmark algorithm without semantic-aware allocation. Furthermore, small semantic extraction factors are preferred in the case of large task sizes and poor channel conditions.
- 28 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27  (5) , 1397-1401
Channel Tracking for RIS-Aided mmWave Communications Under High Mobility Scenarios
The emerging reconfigurable intelligent surface (RIS) technology is promising for applications in the millimeter wave (mmWave) communication systems to effectively compensate for propagation loss or tackle the blockage issue. Considering the high mobility of users in realistic scenarios, it is essential to adjust the phase shifts in real time to align the beam towards the mobile users, which requires to frequently estimate the channel state information. Hence, it is imperative to design efficient channel tracking schemes to avoid the complex channel estimation procedure. In this paper, we develop a novel channel tracking scheme with two advantages over conventional schemes. First, our tracking scheme is based on the cascaded angles at the RIS instead of the accurate angle values, which is more practical. Second, it can be employed under a more general setting where the noise can be non-Gaussian. Simulation results show the high tracking accuracy of our proposed scheme, and validate the superiority to the existing EKF-based tracking scheme.
- 28 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27  (5) , 1397-1401
Channel Tracking for RIS-Aided mmWave Communications Under High Mobility Scenarios
The emerging reconfigurable intelligent surface (RIS) technology is promising for applications in the millimeter wave (mmWave) communication systems to effectively compensate for propagation loss or tackle the blockage issue. Considering the high mobility of users in realistic scenarios, it is essential to adjust the phase shifts in real time to align the beam towards the mobile users, which requires to frequently estimate the channel state information. Hence, it is imperative to design efficient channel tracking schemes to avoid the complex channel estimation procedure. In this paper, we develop a novel channel tracking scheme with two advantages over conventional schemes. First, our tracking scheme is based on the cascaded angles at the RIS instead of the accurate angle values, which is more practical. Second, it can be employed under a more general setting where the noise can be non-Gaussian. Simulation results show the high tracking accuracy of our proposed scheme, and validate the superiority to the existing EKF-based tracking scheme.