Xi Zheng

Xi Zheng

Auto-generated profile, based on publicly available information

Xi Zheng

Beijing National Research Center for Information Science and Technology, Department of Electronic Engineering, Tsinghua University, Beijing 100084, China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
15 January 2019 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
ZJZhiyuan Jiang
Zhiyuan Jiang
Bhaskar KrishnamachariBhaskar Krishnamachari
Bhaskar Krishnamachari
XZXi Zheng
Xi Zheng
SZSheng Zhou
Sheng Zhou
ZNZhisheng Niu
Zhisheng Niu
In a typical Internet of Things (IoT) application where a central controller collects status updates from multiple terminals, e.g., sensors and monitors, through a wireless multiaccess uplink, an important problem is how to attain timely status updates autonomously. In this paper, the timeliness of the status is measured by the recently proposed age-of-information (AoI) metric; both the theoretical and practical aspects of the problem are investigated: we aim to obtain a scheduling policy with minimum AoI and, meanwhile, requires little signaling exchange overhead. Toward this end, we first consider the set of arrival-independent and renewal policies; the optimal policy thereof to minimize the time-average AoI is proved to be a round-robin policy with one-packet (latest packet only and others are dropped) buffers (RR-ONE). The optimality is established based on a generalized Poisson-arrival-see-time-average theorem. It is further proved that RR-ONE is asymptotically optimal among all policies in the massive IoT regime. The AoI steady-state stationary distribution under RR-ONE is also derived. An implementation scheme of RR-ONE is proposed which can accommodate dynamic terminal appearances with little overhead. In addition, considering scenarios where packets cannot be dropped, a Lyapunov optimization-based max-AoI-weight policy is proposed which achieves better performance compared with state-of-the-art.

13 June 2019 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
XZXi Zheng
Xi Zheng
SZSheng Zhou
Sheng Zhou
ZJZhiyuan Jiang
Zhiyuan Jiang
ZNZhisheng Niu
Zhisheng Niu
Timely status updates are crucial to enabling applications in massive Internet of Things (IoT). This paper measures the data-freshness performance of a status update system with an energy harvesting transmitter, considering the randomness in information generation, transmission and energy harvesting. The performance is evaluated by a non-linear function of age of information (AoI) that is defined as the time elapsed since the generation of the most up-to-date status information at the receiver. The system is formulated as two queues with status packet generation and energy arrivals both assumed to be Poisson processes. With negligible service time, both First-Come-First-Served (FCFS) and Last-Come-First-Served (LCFS) disciplines for arbitrary buffer and battery capacities are considered, and a method for calculating the average penalty with non-linear penalty functions is proposed. The average AoI, the average penalty under exponential penalty function, and AoI’s threshold violation probability are obtained in closed form. When the service time is assumed to follow exponential distribution, matrix geometric method is used to obtain the average peak AoI. The results illustrate that under the FCFS discipline, the status update frequency needs to be carefully chosen according to the service rate and energy arrival rate in order to minimize the average penalty.

23 July 2020 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
XZXi Zheng
Xi Zheng
SZSheng Zhou
Sheng Zhou
ZNZhisheng Niu
Zhisheng Niu
As 5G and Internet-of-Things (IoT) are deeply integrated into vertical industries such as autonomous driving and industrial robotics, timely status update is crucial for remote monitoring and control. In this regard, Age of Information (AoI) has been proposed to measure the freshness of status updates. However, it is just a metric changing linearly with time and irrelevant of context-awareness. We propose a context-based metric, named as Urgency of Information (UoI), to measure the nonlinear time-varying importance and the non-uniform context-dependence of the status information. This paper first establishes a theoretical framework for UoI characterization and then provides UoI-optimal status updating and user scheduling schemes in both single-terminal and multi-terminal cases. Specifically, an update-index-based scheme is proposed for a single-terminal system, where the terminal always updates and transmits when its update index is larger than a threshold. For the multi-terminal case, the UoI of the proposed scheduling scheme is proven to be upper-bounded and its decentralized implementation by Carrier Sensing Multiple Access with Collision Avoidance (CSMA/CA) is also provided. In the simulations, the proposed updating and scheduling schemes notably outperform the existing ones such as round robin and AoI-optimal schemes in terms of UoI, error-bound violation and control system stability.

15 August 2017 in IEEE Transactions on Green Communications and Networking
Verified
Journal Article
Closed access
BLBingjie Leng
Bingjie Leng
XGXueying Guo
Xueying Guo
XZXi Zheng
Xi Zheng
BKBhaskar Krishnamachari
Bhaskar Krishnamachari
ZNZhisheng Niu
Zhisheng Niu
Making idle servers sleep is considered to be a key approach to reducing energy consumption of various information and communication systems. Optimal sleeping policies for a single server have been derived only for non-bursty traffic in prior work. In this paper, for the first time, we study the optimal sleeping operation for a single server with bursty traffic to answer the question of whether server sleeping can bring extra benefit with bursty traffic or not. Key factors including switchover energy consumption as well as delay performance are considered. We formulate the problem as a partially observable Markov decision process, and show that it can be solved by observing time elapsed since the last arrival. The optimal sleeping policy is shown to be a two-threshold policy with a wait-and-see feature, i.e., the server would wait a period of time to see if there are any extra arrivals before switching modes. Simulation results show that with the optimal sleeping mechanism, traffic burstiness can enhance system performance on energy cost and delay penalty.