Liang Liu

Liang Liu

Auto-generated profile, based on publicly available information

Liang Liu

Institute of Telecommunication and Navigation Satellites, China Academy of Space Technology, Beijing, China

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
25 April 2023 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
XZXinyuan Zhang
Xinyuan Zhang
JLJiang Liu
Jiang Liu
RZRan Zhang
Ran Zhang
YHYudong Huang
Yudong Huang
JTJincheng Tong
Jincheng Tong
ZXZehui Xiong
Zehui Xiong
Recently, MEC has been integrated with satellite networks to process remote terrestrial computation tasks with superior coverage and delay. Since single satellite computation is hard to tackle spatially uneven computation workloads, computation peer offloading among multiple satellites is urgently needed to further improve service quality and resource utilization. However, considering limited resources, deficient energy, and costly overheads of communication and computation, how to enable efficient offloading cooperation in the time-varying satellite networks is a significant challenge. In this paper, we first design a satellite peer offloading scheme, where offloading is performed along multi-hop paths to explore collaborative computing capabilities. Second, we formulate the Multi-Hop Satellite Peer offloading (MHSPO) problem, aiming to jointly minimize the delay and energy consumption under system resources and backlog constraints. Then, to adapt to the network dynamics, the decision-making process with uncertain future workloads is optimized by leveraging the delayed online learning method under the Lyapunov framework. Finally, we develop a practical online distributed algorithm to solve the MHSPO problem, which is proven to achieve close-to-optimal performance. Extensive simulations show that multi-hop peer offloading among satellites improves edge computing performance efficiently.

14 February 2022 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
NWNingyuan Wang
Ningyuan Wang
FLFeng Li
Feng Li
DCDong Chen
Dong Chen
LLLiang Liu
Liang Liu
ZBZeyu Bao
Zeyu Bao
In this paper, an unmanned aerial vehicle (UAV)-enabledspace-air-ground integrated relay system, in which UAV is equipped with phased-array antennas to receive satellite’s signal while utilizing non-orthogonal multiple access (NOMA) schemes to transmit data to land-based users, is proposed. For UAV signal collection, a detection-vector optimization problem can be addressed by introducing a serial of transformations into a second-order cone programming problem. Furthermore, the UAV-ground NOMA communication is summarized into a max-min problem in terms of UAV’s energy efficiency (EE), which is a fractional mixed-integer non-convex problem and has been widely recognized as hard work. Thus, a two-step solution is proposed. Firstly, we transfer the max-min fractional problem into a subtractive one. After that, the transformed problem is further divided into three sub-problems, which are used for jointly performing UAV trajectory optimization, NOMA scheduling optimization, and NOMA power allocation. In addition, the non-convexity of the above-mentioned problem is well solved by using the proposed iterative algorithm, achieving a rapid convergence. Numerical results illustrate the superiority of the proposed EE-NOMA scheme, which achieves three times higher energy-efficient than the conventional spectrum efficiency scheme, and NOMA is shown to globally outperform the orthogonal multiple access in UAV EE circumstance.

5 September 2023 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
NGNingxuan Guo
Ningxuan Guo
LLLiang Liu
Liang Liu
XZXiaoqing Zhong
Xiaoqing Zhong
Due to the increasing demand for real-time observation data, remote-sensing satellites can be considered as users to access mega communication constellations, which can constitute a Low Earth Orbit (LEO) Double-Layered Satellite Network (DLSN) composed of Remote-sensing Layer Satellites (RLSs) and Communication Layer Satellites (CLSs). In this LEO DLSN, a Distributed Inter-Layer Topology Optimization (DITO) method is proposed based on time-space relationships between two layers, which can maximize task-aware observation benefits with limited onboard resources. For practical purposes, we take link switching interval constraints into account for the recapture and track of laser transceivers. Besides, we put forward a new time-slot division method based on the link switching interval for the linear modeling of the time-sequential coupling problem. With the simulation results in four constellation systems, the proposed distributed interactive method can obtain an optimal solution close to the centralized global solution with much less time. Simulation results indicate that the proposed method can support onboard optimization for future space networks.

19 March 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
MOMan Ouyang
Man Ouyang
RZRan Zhang
Ran Zhang
BWBingqing Wang
Bingqing Wang
JLJiang Liu
Jiang Liu
THTao Huang
Tao Huang
FYF. Richard Yu
F. Richard Yu
In the large-scale dynamic low-Earth orbit (LEO) satellite networks, the conventional TCP-based single-path transmission encounters challenges, such as prolonged propagation delay, frequent connection failures, and suboptimal resource utilization. In this article, we propose an integrated multipath network coding (IMPNC) transmission scheme. This scheme leverages multiple paths for end-to-end transmission to achieve bandwidth aggregation and redundant backup. The multipath transmission is facilitated by multipath quick UDP Internet connection (MPQUIC) protocol to adapt to the limited satellite bandwidth and caching resources. The proposed approach involves encoding packets at nodes along the paths, addressing the significant out-of-order problem arising from variable delays on different paths. Additionally, we present a software-defined networking (SDN)-based domain clustering architecture, which offers a more streamlined control approach, reducing overall complexity. Furthermore, we formulate the domain clustering problems as mixed-integer nonlinear programming and the coding-based routing problem as a Steiner tree problem. Evaluation results demonstrate that the proposed scheme effectively reduces the latency over 25.1%, enhances bandwidth utilization by 19.6%, and ensures reliable data transmission by reducing retransmission probability by 4.1%.

14 June 2024 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
XZXiaoqing Zhong
Xiaoqing Zhong
NGNingxuan Guo
Ningxuan Guo
ALAnshou Li
Anshou Li
YGYupeng Gong
Yupeng Gong
YWYuqi Wang
Yuqi Wang
LLLiang Liu
Liang Liu
In the future Space Information Network (SIN), remote sensing satellites (RSSs) can access communication constellations (CCs) and ground stations (GSs) through inter-layer links (ILLs) and satellite-ground links (SGLs) to realize the timely transmission of large amounts of observation data. In this paper, we study the link topology of both ILLs and SGLs with different time slot durations from the perspective of each RSS based on the time-expanded graph. We propose a multi-objective mission flow optimization model to jointly achieve transmission benefits maximization, end-of-period energy maximization, and transmission wait time minimization. This model considers missions' importance differences under limited storage, energy, and link bandwidth resources. To reduce the solving complexity and solution time, we propose a Phased Multi-Objective (PMO) algorithm to solve this problem. We simulate the proposed methods in different scale SIN with practical parameters. The results show that RSS's entire orbital period can be covered by ILLs and SGLs, except for the ILLs' handover time. When the ILLs' data transmission rate is much less than the RSSs' data acquisition rate, important mission data can be transmitted in priority. When the transmission rate approaches the data acquisition rate, all observation data can be transmitted in near real-time. The proposed PMO algorithm can obtain the optimal solution in 19.1 seconds for a constellation with 500 satellites, which is much less than the 3.8-minute solution time used by other existing methods.

10 February 2022 in IEEE Access
Verified
Journal Article
Open access
NWNingyuan Wang
Ningyuan Wang
LLLiang Liu
Liang Liu
ZQZhaotao Qin
Zhaotao Qin
BLBingyuan Liang
Bingyuan Liang
DCDong Chen
Dong Chen
This paper proposes a complete network capacity analysis framework for low-earth-orbit (LEO) mega-constellations, where a network capacity estimation problem considering the link packet loss rate is formulated with the support of a time-variant network topology model and a task distribution model. This problem is solved in two steps. First, without considering the link packet loss rate, an improved fully polynomial-time approximation (IFPTA) algorithm is proposed to provide a sub-optimal solution to the multi-commodity flow (MCF) problem, in which a simpler definition of a commodity is given and proved to be equivalent to the original problem. Second, a Jackson-network-based capacity fallback approach is proposed to control the link packet loss rate below a given threshold. Numerical results illustrate the superiority of the proposed IFPTA algorithm in terms of accuracy and time complexity compared to existing solutions. In addition, the capacity characteristics of mega-constellations are analyzed by utilizing the proposed capacity analysis framework, including the relationship between constellation size and capacity, network capacity bottlenecks, and the influence of task distributions.