Yuchao Chen

Mr. Yuchao Chen


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 January 2023 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
HTHaoyue Tang
Haoyue Tang
YCYuchao Chen
Yuchao Chen
JWJintao Wang
Jintao Wang
PYPengkun Yang
Pengkun Yang
LTLeandros Tassiulas
Leandros Tassiulas
This paper revisits the problem of sampling and transmitting status updates through a channel with random delay under a sampling frequency constraint [2]. We use the Age of Information (AoI) to characterize the status information freshness at the receiver. The goal is to design a sampling policy that can minimize the average AoI when the statistics of delay is unknown. We reformulate the problem as the optimization of a renewal-reward process, and propose an online sampling strategy based on the Robbins-Monro algorithm. We prove that the proposed algorithm satisfies the sampling frequency constraint. Moreover, when the transmission delay is bounded and its distribution is absolutely continuous, the average AoI obtained by the proposed algorithm converges to the minimum AoI when the number of samples K goes to infinity with probability 1. We show that the optimality gap decays with rate O (ln K / K ), and the proposed algorithm is minimax rate optimal. Simulation results validate the performance of our proposed algorithm.

23 February 2023 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
GCGuozhi Chen
Guozhi Chen
YCYuchao Chen
Yuchao Chen
JWJintao Wang
Jintao Wang
JSJian Song
Jian Song
The rapid development of real-time applications such as the Internet of Things (IoT) puts forward high requirements for the data freshness of wireless networks. The metric Age of Information (AoI) is adopted to measure the data freshness from the user side [1]. In this paper, we investigate the AoI-minimization problem of wireless networks with time-varying channels and the peak power constrained base station (BS). Firstly we model the time-varying channels as a multi-state ergodic Markov chain and formulate the multi-user scheduling problem. Next, we relax the original strict power constraint and formulate the relaxed problem as a constrained Markov decision process (CMDP). To reduce the computational complexity, we exploit the threshold structure of the optimal policy for the CMDP and search for the optimal policy via Linear programming (LP). To satisfy the original strict power constraint, we propose an truncated multi-user scheduling policy, which is proven asymptotic optimal. Finally, we simulate our proposed scheduling policy and compare the AoI performance with other policies. Simulation results verify the theoretical analysis and indicate that our policy can significantly reduce the AoI of users with bad channel quality, thus outperforming other policies.

31 January 2023 in IEEE Communications Letters
Verified
Journal Article
Closed access
YCYuchao Chen
Yuchao Chen
JWJintao Wang
Jintao Wang
XWXiaoqing Wang
Xiaoqing Wang
JSJian Song
Jian Song
We consider a discrete-time multi-channel network where the destination collects time-sensitive packets from multiple sources with sided channel information. The popular metric, Age of Information (AoI), is applied to measure the data freshness at the destination. Due to the interference constraint, only disjoint source-channel pairs can be chosen for transmission in each time slot, and the decision maker should choose the optimal scheduling pairs to minimize the average AoI at the destination. To learn the optimal channel selection, we apply the linear contextual bandit (LCB) framework by utilizing the sided information provided by pilots. Concretely, we establish the relationship between AoI regret and sub-optimal channel selection times and propose both age-independent and age-dependent algorithms. The former method is proven to achieve the sub-linear AoI regret but is outperformed by the latter algorithm both in the linear and non-linear contextual model in simulation.

10 January 2021 in Entropy
Verified
Journal Article
Open access
PDF file
YCYuchao Chen
Yuchao Chen
HTHaoyue Tang
Haoyue Tang
JWJintao Wang
Jintao Wang
JSJian Song
Jian Song
In this paper, we consider a scenario where the base station (BS) collects time-sensitive data from multiple sensors through time-varying and error-prone channels. We characterize the data freshness at the terminal end through a class of monotone increasing functions related to Age of information (AoI). Our goal is to design an optimal policy to minimize the average age penalty of all sensors in infinite horizon under bandwidth and power constraint. By formulating the scheduling problem into a constrained Markov decision process (CMDP), we reveal the threshold structure for the optimal policy and approximate the optimal decision by solving a truncated linear programming (LP). Finally, a bandwidth-truncated policy is proposed to satisfy both power and bandwidth constraint. Through theoretical analysis and numerical simulations, we prove the proposed policy is asymptotic optimal in the large sensor regime.

2 April 2024 in IEEE Transactions on Green Communications and Networking
Verified
Journal Article
Closed access
YCYuchao Chen
Yuchao Chen
JWJintao Wang
Jintao Wang
JDJun Du
Jun Du
JSJian Song
Jian Song
This paper considers an underwater wireless sensor network where a sink station collects time-sensitive information from multiple sensors. For timely monitoring, the sink station aims to maximize the data freshness of the entire network. The difficulty includes time-varying channel states, limited transmission bandwidth and power consumption caused by underwater acoustic communication. Moreover, due to the time-varying service requirements, the importance of data is unknown until it is received and processed by the sink station. To overcome these difficulties, we characterize the data freshness at the terminal through a set of non-decreasing functions with respect to the popular metric Age of Information (AoI). To save the energy consumption, each sensor will transmit with different power to combat the different channel states. Then, we relax the bandwidth constraint and resort to the online learning framework with Lyapunov drift analysis to design a jointly scheduling and power control algorithm based on historical observations. The algorithm is proven to achieve the sub-linear expected performance for both cumulative age regret and bandwidth violation. Finally, we propose the truncated scheduling strategy to satisfy the hard bandwidth constraint. Simulation results validate the performance of the proposed algorithms compared with the optimal offline algorithm with complete information.

22 June 2022 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
YCYuchao Chen
Yuchao Chen
JWJintao Wang
Jintao Wang
QZQining Zhang
Qining Zhang
FGFeifei Gao
Feifei Gao
JSJian Song
Jian Song
In this paper, we consider a multi-user interference network where a central controller allocates power resources to multiple base stations for maximizing the entire network utility under a long-term power budget constraint. The optimal power allocation strategy depends on accurate and instant channel state information (CSI). However, due to users’ mobility and the existence of channel fading and interference, timely channel estimation is unavailable. To overcome the difficulty of unknown channel states, we resort to the Lyapunov drift analysis framework and design an online power allocation algorithm based on historical observations. The algorithm can be proven to achieve sub-linear performance for both cumulative regret and power budget violation. The sub-linear regret indicates the proposed algorithm can asymptotically achieve the optimal static power allocation performance in hindsight. Moreover, we use a general doubling trick to construct a parameter-free algorithm based on the aforementioned online algorithm without the knowledge of time horizon $T$ , which can be proven to preserve the order of the regret and violation upper bound. Simulation results are provided to validate the performance of the proposed online algorithms compared with the offline cave-filling algorithms, as well as its robustness in the presence of adversarial interference.