Fengqi Li

Dr. Fengqi Li

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
7 May 2021 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
FLFengqi Li
Fengqi Li
KLKemeng Liu
Kemeng Liu
LZLupeng Zhang
Lupeng Zhang
SHSikai Huang
Sikai Huang
QWQiufan Wu
Qiufan Wu
There is an urgent need to solve the problems of secure storage, reliable sharing, access control and privacy protection in medical industry. In this paper, we propose EHRChain, a blockchain-based EHR system using attribute-based and homomorphic cryptosystem to solve the above problems. First, we design a medical record storage scheme to realize secure high capacity medical data storage and reliable sharing based on blockchain technology and IPFS. Second, we propose an improved cryptographic primitive called SHDPCPC-CP-ABE. Our SHDPCPC-CP-ABE realizes the functions of semi-policy hiding and dynamic permission changing based on partial ciphertext simultaneously. Furthermore, our program achieves the neutrality of the subject of judicial identification in medical disputes and fine-grained access control of medical data. Third, our system applies an additive homomorphic cryptosystem, Paillier cryptosystem with optimized parameters on patients’ privacy protection during the process of the medical insurance claim. After analysis and experiment, we have proved that the SHDPCPC-CP-ABE is indistinguishable under chosen plaintext attack and takes one third of the time of CP-ABE when changing access policy. Our system has higher performance than other EHR systems based on blockchain.

12 November 2020 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
JHJiangbei Hu
Jiangbei Hu
SWShengfa Wang
Shengfa Wang
BLBaojun Li
Baojun Li
FLFengqi Li
Fengqi Li
ZLZhongxuan Luo
Zhongxuan Luo
LLLigang Liu
Ligang Liu
In this approach, we present an efficient topology and geometry optimization of triply periodic minimal surfaces (TPMS) based porous shell structures, which can be represented, analyzed, optimized and stored directly using functions. The proposed framework is directly executed on functions instead of remeshing (tetrahedral/hexahedral), and this framework substantially improves the controllability and efficiency. Specifically, a valid TPMS-based porous shell structure is first constructed by function expressions. The porous shell permits continuous and smooth changes of geometry (shell thickness) and topology (porous period). The porous structures also inherit several of the advantageous properties of TPMS, such as smoothness, full connectivity (no closed hollows), and high controllability. Then, the problem of filling an object’s interior region with porous shell can be formulated into a constraint optimization problem with two control parameter functions. Finally, an efficient topology and geometry optimization scheme is presented to obtain optimized scale-varying porous shell structures. In contrast to traditional heuristic methods for TPMS, our work directly optimize both the topology and geometry of TPMS-based structures. Various experiments have shown that our proposed porous structures have obvious advantages in terms of efficiency and effectiveness.

8 January 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
LZLupeng Zhang
Lupeng Zhang
FLFengqi Li
Fengqi Li
PWPingchuan Wang
Pingchuan Wang
RSRui Su
Rui Su
ZCZongzheng Chi
Zongzheng Chi
Due to the vigorous development of wireless communication technology, massive sensors have been gradually connected to the Internet of Things (IoT) and generate a massive quantity of valuable IoT data from large-scale wireless sensor networks (WSNs) controlled by different owners. Massive IoT data need to be collected and circulated among multiple data owners and data users. However, existing data collection frameworks may cause heavy computational overhead or rely on trusted third parties, since sensors have constrained resources. Consequently, massive IoT data are transformed among different parties, causing severe trust and security issues. In this article, we propose a blockchain-assisted massive IoT data collection (MIDC) intelligent framework to support the security, trust and efficiency of massive data collection for large-scale heterogeneous WSNs. In particular, we propose a series of novel technologies for the framework: 1) we design a large-scale heterogeneous WSNs collaborative identity verification protocol to ensure reliable data sources; 2) we build a hierarchical massive data aggregation scheme to collect massive IoT data efficiently and securely; and 3) we depict a blockchain-based massive IoT data management method to construct trust among different parties. Extensive simulation and prototype experimental results prove the effectiveness of our framework.

7 February 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
FLFengqi Li
Fengqi Li
KZKaiyang Zhang
Kaiyang Zhang
JWJiaheng Wang
Jiaheng Wang
YLYudong Li
Yudong Li
FXFengqiang Xu
Fengqiang Xu
NTNing Tong
Ning Tong
With the exponential growth in mobile data volume, cellular networks are under severe capacity pressure. To address this issue, unmanned aerial vehicles (UAVs) are being used as mobile base stations (BSs) for traffic offloading. However, coordinating and scheduling traffic across multiple UAVs and BSs remains a challenge in complex environments. This article proposes a solution that optimizes UAV deployment locations and user resource allocation, the goal is to maximize traffic offloading and minimize UAV energy consumption simultaneously. We introduce a hierarchical intelligent traffic offloading network optimization framework based on deep federated learning (DFL). Through federated learning, the UAV swarm is organized hierarchically. Additionally, we developed the CPRAFT algorithm, which uses capacity values as criterion to select the leader UAV (L-UAV). The L-UAV then becomes the top-level central server for model aggregation in the federated learning environment. Furthermore, we formalize the traffic offloading problem as a Markov decision process (MDP). Based on MDP, this article proposes an FL-SNTD3 algorithm to optimize dynamic decision making, which adapts to the ever-changing network environment and fluctuating traffic demands. Simulation experiments demonstrate that the proposed framework and algorithm exhibit outstanding performance in various aspects, providing robust support for future research in intelligent traffic offloading networks.

28 October 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
JFJintian Fu
Jintian Fu
LZLupeng Zhang
Lupeng Zhang
LWLeixin Wang
Leixin Wang
FLFengqi Li
Fengqi Li
With the vigorous development of 5G communication technology, massive Internet of Things (IoT) devices generate data incrementally. Different data owners control different private domains of the IoT through edge devices and hope to achieve credible data sharing. Most of the existing solutions are based on blockchain to realize cross-domain IoT data sharing. However, incremental IoT data sharing has dual requirements for the consensus mechanism to be efficient and Byzantine fault tolerant. The independent use of the existing consensus mechanism cannot meet the above requirements simultaneously. Therefore, we propose an efficient and fault-tolerant blockchain consensus transform (BCT) mechanism for IoT. In addition, we design two consensus algorithms, namely, detectable RAFT (DRAFT) and double-layer parallel BFT (DPBFT), to improve the efficiency and fault tolerance of the data-sharing process. Extensive experiments have been conducted to show the efficiency and tolerance of our BCT mechanism.

7 April 2014 in International Journal of Parallel, Emergent and Distributed Systems
Verified
Journal Article
Closed access
NANana Yaw Asabere
Nana Yaw Asabere
FXFeng Xia
Feng Xia
QMQinxue Meng
Qinxue Meng
FLFengqi Li
Fengqi Li
HLHaifeng Liu
Haifeng Liu
The significant proliferation of research papers in both conferences and journals has made it difficult for researchers to easily access relevant scholarly papers for academic learning. This has been a substantial problem for many researchers. Conferences, in comparison with journals, have an aspect of social learning and networking, which leads to personal familiarisation through various interactions among researchers. In this paper, we improve the social awareness of conference participants by proposing a novel folksonomy-based paper recommendation algorithm, called socially aware recommendation of scholarly papers (SARSP). SARSP recommends papers issued by active participants (APs), to other Group Profile Participants at the same conference based on preference similarity of their research interests. In addition, SARSP computes the social ties between an AP and other conference participants to effectively generate social recommendations of scholarly papers. We evaluate our proposed algorithm using a real-world data-set. Our experimental results confirm that SARSP has significant improvement over other existing methods.