Lijun He

Lijun He

Auto-generated profile, based on publicly available information

Lijun He

China University of Mining and Technology

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
21 February 2025 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
ZJZiye Jia
Ziye Jia
YCYilu Cao
Yilu Cao
LHLijun He
Lijun He
QWQihui Wu
Qihui Wu
Qiuming ZhuQiuming Zhu
Qiuming Zhu
ZHZhu Han
Zhu Han
As an important component of the sixth generation communication technologies, the space-air-ground integrated network (SAGIN) attracts increasing attentions in recent years. However, due to the mobility and heterogeneity of the components such as satellites and unmanned aerial vehiclesin multi-layer SAGIN, the challenges of inefficient resource allocation and management complexity are aggregated. To this end, the network function virtualization technology is introduced and can be implemented via service function chains (SFCs) deployment. However, urgent unexpected tasks may bring conflicts and resource competition during SFC deployment, and how to schedule the SFCs of multiple tasks in SAGIN is a key issue. In this paper, we address the dynamic and complexity of SAGIN by presenting a reconfigurable time extension graph and further propose the dynamic SFC scheduling model. Then, we formulate the SFC scheduling problem to maximize the number of successful deployed SFCs within limited resources and time horizons. Since the problem is in the form of integer linear programming and intractable to solve, we propose the algorithm by incorporating deep reinforcement learning. Finally, simulation results show that the proposed algorithm has better convergence and performance compared to other benchmark algorithms.

17 October 2023 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
HGHongping Gan
Hongping Gan
XWXiaoyang Wang
Xiaoyang Wang
LHLijun He
Lijun He
JLJie Liu
Jie Liu
Deep unrolling architectures have revitalized compressive sensing (CS) by seamlessly blending deep neural networks with traditional optimization-based reconstruction algorithms. In pursuit of an efficient and deep interpretable approach, we propose LTwIST for CS problem, a novel deep unrolling framework that draws inspiration from the well-known two-step iterative shrinkage thresholding (TwIST) algorithm. LTwIST uses a trainable sensing matrix to adaptively learn structural information in images, and introduces a customized U-block architecture to solve the proximal mapping of nonlinear transformations connected with the sparsity-inducing regularizer. Specifically, each iteration recovery step of LTwIST corresponds to an iterative update step of the traditional TwIST algorithm. Moreover, the proposed method is designed to learn all the parameters end-to-end without manual tuning such as shrinkable thresholds, step sizes, etc. As a result, LTwIST obviates the need for manual parameter optimization, allows for high-quality image recovery and provides unambiguous interpretability. Moreover, our proposed LTwIST is also applicable to CS-based magnetic resonance imaging and exhibits a strong reconstruction performance. Extensive experiments on several public benchmark datasets demonstrate that the proposed LTwIST outperforms existing state-of-the-art deep CS methods by considerable margins in terms of quality evaluation metrics and visual performance. Our code is available on LTwIST.

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.

4 February 2025 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
ZJZiye Jia
Ziye Jia
YCYilu Cao
Yilu Cao
LHLijun He
Lijun He
GLGuangxia Li
Guangxia Li
FZFuhui Zhou
Fuhui Zhou
ZHZhu Han
Zhu Han
To achieve ubiquitous connectivity of the sixth generation communication, the space-air-ground integrated network (SAGIN) is a popular topic. However, the dynamic nodes in SAGIN such as satellites and unmanned aerial vehicles, may be fragile and out of operation, which can potentially cause service failure. Therefore, the research on service recovery in SAGIN under situations of resource failure is critical. In order to facilitate the flexible resource utilization of SAGIN, the network function virtualization technology (NFV) is proposed to be employed. Firstly, the task management is transformed into the deployment of service function chains (SFCs). Then, we design an NFV-based SFC recovery model in SAGIN in the face of resource failure, so that tasks can quickly select alternative resources to complete deployments. Moreover, the problem of SFC recovery is formulated to minimize the total time consumption for all completed SFCs. Since it is an NP-hard integer linear programming problem, we propose the efficient recovery algorithm based on the matching game. Finally, via various simulations, the effectiveness of the proposed algorithm and its advantages are verified, where the total time consumption is optimized by about 25%, compared with other benchmark methods.

17 November 2022 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
LHLijun He
Lijun He
JLJiandong LI
Jiandong LI
YWYanting Wang
Yanting Wang
JZJiang-Bin Zheng
Jiang-Bin Zheng
LHLiang He
Liang He
We study the data offloading problem in space-air-ground integrated networks (SAGINs) by jointly optimizing task scheduling and power control to balance the total energy consumption and mean makespan. We consider a mixed integer nonlinear programming problem to minimize a normalized weighted combination of these two conflicting objectives. We first propose an approximation algorithm to find a high-quality solution, which is shown to be at most $\frac{1}{2}$ from the optimum to this problem for given power allocation. We further show that optimal power allocation can be obtained in closed form under the assumption that satellite-ground links have low signal-to-noise ratio (SNR). Thus, the proposed approximation algorithm can be directly utilized to obtain a constant-factor solution to the studied problem in low-SNR scenarios. To extend our solution to more general scenarios, we further propose an efficient hybird algorithm based on a genetic framework. Our simulation results demonstrate the near-optimality and correctness of the proposed algorithms, and they unveil the interplay between total energy consumption and mean makespan in SAGINs as well.

11 September 2025 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
ZJZiye Jia
Ziye Jia
JHJia He
Jia He
LHLijun He
Lijun He
MSMin Sheng
Min Sheng
JLJunyu Liu
Junyu Liu
ZHZhu Han
Zhu Han
Unmanned aerial vehicles (UAVs) can serve as aerial base stations (BSs) to extend the ubiquitous connectivity for ground users (GUs) in the sixth-generation (6G) era. However, it is challenging to cooperatively deploy multiple UAV swarms in large-scale remote areas. Hence, in this paper, we propose a hierarchical UAV swarms structure for 6G aerial access networks, where the head UAVs serve as aerial BSs, and tail UAVs (T-UAVs) are responsible for relay. In detail, we jointly optimize the dynamic deployment and trajectory of UAV swarms, which is formulated as a multi-objective optimization problem (MOP) to concurrently minimize the energy consumption of UAV swarms and GUs, as well as the delay of GUs. However, the proposed MOP is a mixed integer nonlinear programming and NP-hard to solve. Therefore, we develop a K-means and Voronoi diagram based area division method, and construct Fermat points to establish connections between GUs and T-UAVs. Then, an improved non-dominated sorting whale optimization algorithm is proposed to seek Pareto optimal solutions for the transformed MOP. Finally, extensive simulations are conducted to verify the performance of proposed algorithms by comparing with baseline mechanisms, resulting in a 50% complexity reduction.