Jiahui Li

Jiahui Li

Auto-generated profile, based on publicly available information

Jiahui Li

School of Mathematics and Statistics, Xidian University, Xian, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
6 February 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
JLJiahui Li
Jiahui Li
XQXiaogang Qi
Xiaogang Qi
JLJiliang Li
Jiliang Li
ZSZhou Su
Zhou Su
YSYuan Su
Yuan Su
LLLifang Liu
Lifang Liu
The widespread application of ultradense and multivariate Internet of Things (IoT) benefits from network function virtualization (NFV) that provides flexible frameworks and effective management. NFV leverages the virtualization technologies to integrate the existing network functions of devices into standard servers, storages, and switches. Then, the network functions are achieved in software form to displace the private, dedicated, and closed network devices. However, NFV also brings instability and challenges to the network management where the network dynamics, lack of visibility, and high frequency and abundant types of faults will increase the difficulty. Therefore, diagnosing the faults embedded in the generic NFV framework is crucial for the effective adoption of NFV to the IoT environment and thus ensuring the user services. This article summarizes the differences and connections of fault diagnosis between the NFV framework and traditional networks, and introduces the challenges faced by NFV. Moreover, we provide a comprehensive survey of the state-of-the-art fault detection methods for the NFV framework. After an in-depth discussion of the fault propagation characteristics, we further present a detailed taxonomy of the fault localization approaches. Finally, we highlight the future research directions to provide ample space for improvement in applying NFV to the IoT environment.

11 January 2024 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
YSYuan Su
Yuan Su
JLJiliang Li
Jiliang Li
JLJiahui Li
Jiahui Li
ZSZhou Su
Zhou Su
Weizhi MengWeizhi Meng
Weizhi Meng
RLRongxing Lu
Rongxing Lu
Secure aggregation based on masked encryption is a crucial technique for data collection in the Internet of Things (IoT) as it employs a lightweight style to enable global data aggregation while protecting individual data. However, network instability makes the design of such schemes more complex as dropout-resiliency is required, where the overheads substantially increase with growing dropped users. Moreover, existing methods primarily concentrate on aggregation and fail to support complex data analysis, such as histogram estimation. This paper proposes a Robust and Lightweight Data Aggregation (RLDA) scheme in edge-cloud systems. RLDA leverages the offline/online paradigm to achieve robust data aggregation, where edge nodes are introduced to assist verifiable key generation offline and data aggregation and key recovery online. RLDA decouples keys of dropped and surviving users so that it can reduce the overhead by always recovering the keys of surviving users rather than reconstructing the keys of growing dropped users. To achieve secure histogram estimation, we design two recoverable aggregation algorithms that support the transformation between vector and single value, and additionally support multidimensional data aggregation. We prove the security and dropout-resiliency of RLDA. The performance shows that RLDA significantly reduces the overhead with growing dropped users.

25 July 2022 in Future Generation Computer Systems
Verified
Journal Article
Closed access
JLJiahui Li
Jiahui Li
XQXiaogang Qi
Xiaogang Qi
WMWenchao Ma
Wenchao Ma
LLLifang Liu
Lifang Liu

18 December 2023 in Reliability Engineering & System Safety
Verified
Journal Article
Closed access
JLJiahui Li
Jiahui Li
XQXiaogang Qi
Xiaogang Qi
YHYi He
Yi He
LLLifang Liu
Lifang Liu

20 January 2026 in IEEE Transactions on Consumer Electronics
Verified
Journal Article
Closed access
YSYuan Su
Yuan Su
JLJiahui Li
Jiahui Li
JLJiliang Li
Jiliang Li
WTWei Tang
Wei Tang
CDChengyi Dong
Chengyi Dong
SJShouling Ji
Shouling Ji
The proliferation of healthcare devices enabled by consumer electronics has led to the generation of massive volumes of sensitive data, posing significant challenges for secure and continuous storage. While distributed edge storage offers scalability and accessibility, existing provable continuous storage schemes must predefine the entire storage period and precompute all audit proofs by repeatedly evaluating trapdoor-based Verifiable Delay Functions (VDF), incurring preprocessing costs that scale linearly with storage time and audit frequency. Moreover, once these proofs are generated, these schemes become inherently static - any data update invalidates all precomputed proofs and necessitates the regeneration of the entire preprocessing phase, which renders real-time updates impractical. In this paper, we propose a Distributedly and Provably Continuous Storage Scheme (DPCSS) tailored for healthcare data. DPCSS enables periodic integrity verification without trusted auditors by combining VDF with homomorphic authenticators. To eliminate the inefficiency of local pre-verification, DPCSS introduces a cross-validation method among edge servers that allows sequentially proving and then verifying. Furthermore, a structural interaction protocol is designed to reduce communication overhead, and puncturable key wrapping is leveraged to enable efficient, real-time data and key updates with forward security. Formal security analysis demonstrates that DPCSS ensures confidentiality, forward security, and secure against forgery attack, and experimental results show that our DPCSS achieves low verification cost and constant-time preprocessing that is independent of storage time and audit frequencies, where DPCSS improves the preprocessing time by about 1.4 times compared to the state-of-the-art scheme.

1 January 2022 in Academic Journal of Computing & Information Science
Verified
Journal Article
Open access
PDF file
MLMengting Liu
Mengting Liu
YLYangjie Li
Yangjie Li
JLJiahui Li
Jiahui Li
XTXiaoqi Tan
Xiaoqi Tan
When unexpected events such as road block, closure and damage caused by some major events occur, they will have an impact on people's daily life. With the gradual popularization of 5g network, the application of UAV is becoming more and more extensive. This paper mainly studies the "emergency material distribution problem in 5g network environment". It analyzes the two cases of separate distribution of distribution vehicles and the combined distribution of "distribution vehicles + UAVs" respectively. In order to complete the material distribution task as soon as possible, it puts forward the best distribution scheme respectively. First, the optimal time is simplified, that is, the optimal time is converted into the shortest path, and the graph theory model is used for modeling. The path graph is highlighted by MATLAB, and the minimum spanning tree method is used to visualize all paths. After that, the shortest path from the ninth point to any point and the sequence of several traveling paths are obtained. The sequence of several traveling paths is classified into three schemes, and the total kilometers of the three schemes are calculated respectively. The best scheme is the one with the smallest total number of paths. For the best scheme, the path map of the best scheme is obtained by drawing. Secondly, the combined distribution mode of "distribution vehicle + UAV" is adopted for material transportation. Nowadays, 5g network is becoming more and more popular, and UAVs are more and more widely used. In order to complete the material distribution task as soon as possible, it is assumed that UAVs are used to transport materials to the greatest extent to reduce the transportation time and improve the efficiency. Visualize the path of "distribution vehicle + UAV" for subsequent problem solving. The aircraft route is divided into "three consecutive sections" and "two consecutive sections". After a large amount of data processing, the classification scheme is obtained. Combined with the vehicle optimal path, the best scheme of "distribution vehicle + UAV" combination to complete a complete distribution is obtained. Finally, the maximum load capacity of the delivery vehicle is 500 kg, and the other conditions are the same as above. Based on the obtained optimal scheme, the second question is solved by MATLAB for the constraints given in the question, and two feasible schemes are obtained. The frequency of UAV use in both schemes is greater than that of distribution vehicles. Disassemble and analyze scheme 1 and scheme 2 respectively.