Fenglei Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Fenglei Li has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Zhixin Liu
Yanshan University
3 shared publications Xinping Guan
2 shared publications- Chunxia Dou
Nanjing University of Posts and Telecommunications
1 shared publication Jiawei Su
1 shared publicationJiayuan Zhang
1 shared publicationKit Yan Chan
1 shared publication
Latest Publications
- 1 October 2025
- Published by Elsevier in Computer Networks
- Vol. 273
Joint task offloading and resource allocation scheme with UAV assistance in vehicle edge computing networks
- 1 October 2025
- Published by Elsevier in Computer Networks
- Vol. 273
Joint task offloading and resource allocation scheme with UAV assistance in vehicle edge computing networks
- 18 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (3) , 4954-4963
Joint Optimization of Adaptive Time Slot Resource Segmentation and Route Scheduling With CQF Mechanism in Time-Sensitive Networks
Time-sensitive networks (TSN), as an emerging technology, are designed to fulfill the need for low-latency and deterministic data transmission in areas such as drones and Industry 4.0. To simplify the computation of scheduling plans in TSN, the cyclic queue forwarding (CQF) mechanism is introduced to efficiently schedule time-triggered (TT) flows in TSN. However, these studies have generally neglected the impact of routing on scheduling and the importance of intratimeslot resource allocation for optimal flow scheduling. To this end, this paper proposes a joint routing-optimized scheduling strategy aimed at enhancing the schedulability of TT flows. This paper also designs an adaptive time slot segmentation (ATSS) mechanism, which improves resource utilization by grouping flows of different sizes and dynamically allocating resources within each time slot based on the amount of data in each group. In order to combine the ATSS mechanism with joint routing co-optimization scheduling for optimal scheduling of TT flows, a heuristic algorithm based on scoring of pathoffset pair is designed in this paper. The algorithm selects the optimal routes and offsets by scoring the path-offset pair of each time-sensitive data flow to maximize the schedulability of TT flows. To verify the effectiveness of the proposed algorithm, the algorithm is compared with several existing algorithms in different simulation scenarios. The experimental results show that the designed algorithm improves the scheduling success rate and resource utilization, ensures link load balancing, has acceptable computational overhead, and has good scalability to adapt to networks of different sizes.
- 18 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (3) , 4954-4963
Joint Optimization of Adaptive Time Slot Resource Segmentation and Route Scheduling With CQF Mechanism in Time-Sensitive Networks
Time-sensitive networks (TSN), as an emerging technology, are designed to fulfill the need for low-latency and deterministic data transmission in areas such as drones and Industry 4.0. To simplify the computation of scheduling plans in TSN, the cyclic queue forwarding (CQF) mechanism is introduced to efficiently schedule time-triggered (TT) flows in TSN. However, these studies have generally neglected the impact of routing on scheduling and the importance of intratimeslot resource allocation for optimal flow scheduling. To this end, this paper proposes a joint routing-optimized scheduling strategy aimed at enhancing the schedulability of TT flows. This paper also designs an adaptive time slot segmentation (ATSS) mechanism, which improves resource utilization by grouping flows of different sizes and dynamically allocating resources within each time slot based on the amount of data in each group. In order to combine the ATSS mechanism with joint routing co-optimization scheduling for optimal scheduling of TT flows, a heuristic algorithm based on scoring of pathoffset pair is designed in this paper. The algorithm selects the optimal routes and offsets by scoring the path-offset pair of each time-sensitive data flow to maximize the schedulability of TT flows. To verify the effectiveness of the proposed algorithm, the algorithm is compared with several existing algorithms in different simulation scenarios. The experimental results show that the designed algorithm improves the scheduling success rate and resource utilization, ensures link load balancing, has acceptable computational overhead, and has good scalability to adapt to networks of different sizes.
- 24 February 2023
- Published by Elsevier in Computer Communications
- Vol. 202, 183-190
Sum-rate maximization for cognitive relay NOMA Systems with channel uncertainty
- 24 February 2023
- Published by Elsevier in Computer Communications
- Vol. 202, 183-190
Sum-rate maximization for cognitive relay NOMA Systems with channel uncertainty
- Open Access
- 22 July 2019
- Published by MDPI AG in Electronics
- Vol. 8 (7) , 816
Optimal Scheduling Strategy of Distribution Network Based on Electric Vehicle Forecasting
Based on the Monte Carlo method, this paper simulates, predicts the load, and considers the travel chain of electric vehicles and different charging methods to establish a predictive model. Based on the results of electric vehicle simulation prediction, an optimal scheduling model of the distribution network considering the demand response side load is established. The firefly optimization algorithm is used to solve the optimal scheduling problem. The results show that the prediction model proposed in this paper has a certain reference value for the prediction of an electric vehicle load. The electric vehicle is placed in the optimal scheduling resource of the distribution network, which increases the dimension of the scheduling resources of the network and improves the economics of the distribution network operation.
- 22 July 2019
- Published by MDPI AG in Electronics
- Vol. 8 (7) , 816
Open AccessOptimal Scheduling Strategy of Distribution Network Based on Electric Vehicle Forecasting
Based on the Monte Carlo method, this paper simulates, predicts the load, and considers the travel chain of electric vehicles and different charging methods to establish a predictive model. Based on the results of electric vehicle simulation prediction, an optimal scheduling model of the distribution network considering the demand response side load is established. The firefly optimization algorithm is used to solve the optimal scheduling problem. The results show that the prediction model proposed in this paper has a certain reference value for the prediction of an electric vehicle load. The electric vehicle is placed in the optimal scheduling resource of the distribution network, which increases the dimension of the scheduling resources of the network and improves the economics of the distribution network operation.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 310-313
Delay-Dependent Stability for Time-Delay Systems with Nonlinear Perturbations
We study the stability of a class of time-delay systems with nonlinear perturbations. A new delay-dependent stability condition which can deal with arbitrarily time-varying delays is formulated by constituting a Lyapunov-Krasovskii functional, the result has less conservatism than those presented before. Numerical examples are presented to indicate significant improvements over some existing results
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 310-313
Delay-Dependent Stability for Time-Delay Systems with Nonlinear Perturbations
We study the stability of a class of time-delay systems with nonlinear perturbations. A new delay-dependent stability condition which can deal with arbitrarily time-varying delays is formulated by constituting a Lyapunov-Krasovskii functional, the result has less conservatism than those presented before. Numerical examples are presented to indicate significant improvements over some existing results