Fenglei Li

Fenglei Li

Auto-generated profile, based on publicly available information

Fenglei Li

School of Electrical Engineering, Yanshan University, Qinhuangdao, China

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
22 July 2019 in Electronics
Verified
Journal Article
Open access
PDF file
FLFenglei Li
Fenglei Li
CDChunxia Dou
Chunxia Dou
SXShiyun Xu
Shiyun Xu
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 October 2025 in Computer Networks
Verified
Journal Article
Closed access
ZLZhixin Liu
Zhixin Liu
LGLei Gao
Lei Gao
ZMZiyang Ma
Ziyang Ma
JSJiawei Su
Jiawei Su
FLFenglei Li
Fenglei Li
XGXinping Guan
Xinping Guan

24 February 2023 in Computer Communications
Verified
Journal Article
Closed access
FLFenglei Li
Fenglei Li
JZJiayuan Zhang
Jiayuan Zhang
ZLZhixin Liu
Zhixin Liu
KCKit Yan Chan
Kit Yan Chan
YYYi Yang
Yi Yang
YXYuan’aI Xie
Yuan’aI Xie

1 January 2006
Verified
Conference Paper
Closed access
FLFenglei Li
Fenglei Li
XGXinping Guan
Xinping Guan
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

18 September 2025 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
ZLZhixin Liu
Zhixin Liu
ZYZhaohui Yue
Zhaohui Yue
FLFenglei Li
Fenglei Li
YYYazhou Yuan
Yazhou Yuan
XGXinping Guan
Xinping Guan
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.