Runzi Liu

Dr. Runzi Liu

orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
8 February 2018 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
YWYu Wang
Yu Wang
MSMin Sheng
Min Sheng
WZWeihua Zhuang
Weihua Zhuang
SZShan Zhang
Shan Zhang
NZNing Zhang
Ning Zhang
JLJiandong Li
Jiandong Li
Space information network (SIN) is a promising networking architecture to significantly broaden the observation area and realize continuous information acquisition for Earth observation. Over the dynamic and complex SIN environment, it is a key issue to coordinate multi-dimensional heterogeneous network resources (e.g., observation resource and transmission resource) in the presence of multi-resource variations and severe conflicts, such that diverse Earth observation service requirements can be satisfied. To this end, this paper studies the multiresource coordinate scheduling problem in SINs. Specifically, we first characterize the relationship among multi-resource using an event-driven time-expanded graph (EDTEG). Based on the EDTEG, observation resource and transmission resource are jointly considered, and an integer linear programming optimization problem is formulated to maximize the sum priorities of successfully scheduled tasks. An iterative optimization technique is employed to decompose the problem into separate observation scheduling and transmission scheduling sub-problems, which can be efficiently solved by extended transmission time sharing graph and directed acyclic graph methods, respectively. Simulation results demonstrate the effectiveness of the proposed algorithm and performance impacts of different network parameters.

19 February 2019 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
DZDi Zhou
Di Zhou
MSMin Sheng
Min Sheng
JLJie Luo
Jie Luo
RLRunzi Liu
Runzi Liu
JLJiandong LI
Jiandong LI
ZHZhu Han
Zhu Han
Small satellite networks (SSNs) have attracted intensive research interest recently and have been regarded as an emerging architecture to accommodate the ever-increasing space data transmission demand. However, the limited number of on-board transceivers restricts the number of feasible contacts (i.e., an opportunity to transmit data over a communication link) which can be established concurrently by a satellite for data scheduling. Furthermore, limited battery space, storage space, and stochastic data arrivals can further exacerbate the difficulty of the efficient data scheduling design to well match the limited network resources and random data demands, so as to the long-term payoff. Based on the above motivation and specific characteristics of SSNs, in this paper, we extend the traditional dynamic programming algorithms and propose a finite-embedded-infinite two-level dynamic programming framework for optimal data scheduling under a stochastic data arrival SSN environment with joint consideration of contact selection, battery management, and buffer management while taking into account the impact of current decisions on the infinite future. We further formulate this stochastic data scheduling optimization problem as an infinite-horizon discrete Markov decision process (MDP) and propose a joint forward and backward induction (JFBI) algorithm framework to achieve the optimal solution of the infinite MDP. Simulations have been conducted to demonstrate the significant gains of the proposed algorithms in the amount of downloaded data and to evaluate the impact of various network parameters on the algorithm performance.

7 March 2019 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
LHLijun He
Lijun He
JLJiandong LI
Jiandong LI
MSMin Sheng
Min Sheng
RLRunzi Liu
Runzi Liu
KGKun Guo
Kun Guo
DZDi Zhou
Di Zhou
Through the allocation of multi-antenna time blocks to spacecrafts, the data relay satellite network (DRSN) is capable of providing data relay within their visible intervals (i.e., time windows). During relay process, the generated hybrid tasks incorporate common tasks, emergency tasks, and temporary tasks. However, higher-priority unpredicted tasks (i.e., emergency tasks and temporary tasks) unpredictably preempt antenna resources, thereby resulting in more common tasks unsuccessful to relay. It is therefore nontrivial to investigate the dynamic hybrid task scheduling problem with time windows for the muti-antenna DRSN, to efficiently and real-timely allocate multi-antenna time blocks aiming at accommodating more unpredicted tasks and reducing the number of unsuccessful common tasks. To this end, we propose a stochastic optimization framework to maximize the time average number of hybrid tasks by jointly optimizing the scheduling periods and the antenna time block allocation. For the tractability purpose, by leveraging its unique structure, we first equivalently transform it to a scheduling period adjustment (SPA) problem, embedded with a sequence of antenna time block allocation (ATBA) problems. Then, two algorithms are developed to solve the SPA and ATBA problem efficiently, respectively. Finally, simulation results demonstrate that the proposed algorithm can significantly increase the time average number of hybrid tasks.

12 April 2021 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
WWWeihua Wu
Weihua Wu
RLRunzi Liu
Runzi Liu
QYQinghai Yang
Qinghai Yang
TQTony Q. S. Quek
Tony Q. S. Quek
The resource allocation in vehicle-to-everything (V2X) communications face a great challenge for satisfying the heterogeneous quality of service (QoS) requirements of the ultra-reliable safety-related services and the minimum throughput required entertainment services, due to the channel uncertainties caused by high mobility. In this paper, we first consider an optimistic scenario where the distribution of uncertain channel state information (CSI) can be deterministic and accurately known at the eNB. Then, a low-complexity resource allocation approach is developed, in which the probabilistic QoS constraint of V2V is transformed into a computable optimization constraint. To deal with the scenario with unknown uncertain CSI distribution, we develop a distributionally robust resource allocation approach for converting the intractable chance constraint of V2V into a deterministic semidefinite constraint based only on the first- and second-order moments of uncertain CSI. For alleviating the conservatism of above approach, a support-based distributionally robust resource allocation approach is developed to tighten the semidefinite constraint by utilizing the support information of uncertain CSI. Finally, we conduct simulations to show that the effectiveness of the proposed approaches outperforms other state-of-art approaches.

16 August 2022 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
GCGuanhua Chai
Guanhua Chai
WWWeihua Wu
Weihua Wu
QYQinghai Yang
Qinghai Yang
RLRunzi Liu
Runzi Liu
FYF. Richard Yu
F. Richard Yu
In this paper, we study the resource allocation in high mobility vehicle-to-everything (V2X) networks with only slowly varying large-scale channel parameters. For satisfying the diversity requirements of different types of links, i.e., low delay for vehicle-to-infrastructure (V2I) connections and ultra-reliability for vehicle-to-vehicle (V2V) connections, we formulate a joint power, spectrum and vehicle local computing ratio allocation problem to minimize the delay of V2I links whilst satisfying the V2V reliability constraint. For solving the formulated problem, a Feasible Region Transformation Method is firstly developed to convert the probabilistic V2V reliability requirement into a computable constraint. In addition, a Robust Signal to Interference Plus Noise Ratio (SINR) Modified Method is proposed to give the computable expression for the V2I throughput. Then, a parallel Deep Neural Network (DNN) framework is designed for the resource allocation in V2X networks, where one is the transmit power control unit and the other is the local computing ratio allocation unit. After that, a Feedback-oriented Learning Method is proposed to train the parallel DNN-based resource allocation framework, in which the output of DNN is used as feedback to dynamically revise the training loss function along with the training process. Afterwards, the Hungarian method is employed to obtain the optimal spectrum matching. Finally, we conduct the simulations to show that the proposed learning-based algorithm has better performance compared with other general algorithms.

22 March 2021 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
WWWeihua Wu
Weihua Wu
RLRunzi Liu
Runzi Liu
QYQinghai Yang
Qinghai Yang
HSHangguan Shan
Hangguan Shan
TQTony Q. S. Quek
Tony Q. S. Quek
Vehicle-to-everything (V2X) communications face a great challenge in delivering not only the low-latency and ultra-reliable safety-related services but also the minimum throughput required entertainment services, due to the channel uncertainties caused by high mobility. This paper focuses on the robust resource management of V2X communications with the consideration of channel uncertainties. First, we formulate a transmit power minimization problem, whilst guaranteeing the different quality-of-service (QoS) requirements. To achieve the robustness of QoS provisions against channel uncertainties, a statistical leaning approach is developed to learn the uncertainties from the data samples of the random channel coefficients as a convex ellipsoid set, which is also called high-probability-region (HPR). Then, the highly intractable power minimization problem is converted into a second-order cone program by the robust optimization approach. Afterwards, we propose a joint set partitioning and reconstruction mechanism to further reduce the total transmit power by pruning the rough HPR into a more precise uncertainty set, which leads to a trackable second-order cone program and a linear program. Finally, we prove that the network performance can be effectively enhanced by the improvement mechanism. Simulation results verify the effectiveness of the robust resource allocation approaches over the non-robust one.