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


Guozhi Li has a total of 18 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • DPDCD: The Intelligent Prediction Strategy for the Course Development of Diabetic Kidney Disease

    by Jianfeng Wang, Guozhi Li, Jirui Li, Liang Liu

    Diabetic nephropathy (DKD) is a severe diabetes complication and a leading cause of mortality. While urine microalbuminuria and eGFR are common markers, some advanced cases may exhibit normal values. The progression from microalbuminuria to overt proteinuria in DKD is gradual and requires comprehensive physiological tests for diagnosis. This study employs deep reinforcement learning to predict DKD progression based on patients’ physiological data, aiming to assist clinical diagnosis and treatment. A multivariate logistic regression algorithm is used to describe the DKD prediction probability. An optimized DKD progression prediction algorithm (DPDCD) based on deep reinforcement learning determines the best model coefficients, enabling accurate prediction of DKD progression using routine clinical data. Experimental results demonstrate that DPDCD outperforms other algorithms in predicting DKD progression, providing valuable support for clinicians.

  • Open Access

    Load Balanced Data Transmission Strategy Based on Cloud–Edge–End Collaboration in the Internet of Things

    by Jirui Li, Xiaoyong Li, Jie Yuan, Guozhi Li

    To improve the response speed and quality of Internet of Things (IoT) services and reduce system operating costs, this paper refines the edge layer according to the different data transmission capabilities of different edge devices, constructs a four-layer heterogeneous IoT framework under cloud–edge–end (CEE) collaboration, and gives the corresponding data hierarchical transmission strategy, so as to effectively process sensitive data such as real-time, near-real-time, and non-real-time data. Meanwhile, the link based high-performance adaptive load balancing scheme is developed to achieve the dynamic optimal allocation of system resources. Simulation results demonstrate that the data hierarchical transmission strategy based on a CEE collaboration framework can not only make full use of resources and improve the successful delivery rate of packets but can also greatly reduce the end-to-end transmission delay of data. Especially, compared with the cloud-mist framework without refining the edge layer, the data transmission rate based on CEE collaboration architecture is increased by about 27.3%, 12.7%, and 8%, respectively, in three network environments of light-weight, medium, and heavy load.


  • Open Access

    Edge Blockchain Construction Efficiency Maximization for COVID-19 Detection in a Body Area Network

    by Guozhi Li, Xiaofei Li, Xuekun Song, Yue Zeng

    Detecting traces of patients with novel coronavirus pneumonia (COVID-19) is a prerequisite for avoiding the virus’s rapid spread. However, too much patient privacy data uploaded to the cloud centre will overwhelm the network and cause user information security not to be guaranteed. In this paper, we propose a personal prediction method for COVID-19 infections by perceiving the information of worn biosensors and monitoring equipment in a body area network (BAN). Edge computing and blockchain technology are introduced to solve the problems of user privacy protection and perceptual data transmission and storage. We first construct an edge body area network (EBAN) and characterize the edge blockchain cost’s maximization function by considering the bandwidth, storage space, and energy consumption constraints. Then we build a blockchain without redundant perception information and select effective transmission paths by using the edge blockchain construction efficiency maximization (EBCEM) algorithm. Finally, we use the network simulator (NS-2) to simulate the performance of the EBCEM algorithm and compare it with the excellent assignment game algorithm (AGA) in terms of the effective requester ratio (ERR), effective provider ratio (EPR), edge blockchain construction success ratio (EBCSR), and average storage usage ratio (ASUR) in the EBAN.


  • Open Access

    Non-Cooperative Game Forwarding Leveraging User Trustworthiness in Mobile Edge Networks

    by Jirui Li, Xiaoyong Li, Guozhi Li, Rui Zhang

    Given frequent changes of network topology caused by limited computing power, strong mobility and weak reliability of most nodes in mobile edge computing (MEC) networks, a Non-Cooperative Game forwarding strategy based on user Trustworthiness (NCGT) is proposed to deal with low security and efficiency of data transmission. NCGT firstly considers device residual energy ratio, contact probability, service degree and link stability between devices to measure the reliability of nodes. Then, leverages Entropy Weight (EW) method and Golden Section Ratio (GSR) to develop a security optimal neighbors screening model based on multi-attribute decision-making, which ensures that high-performance security nodes are selected as forwarding game objects. Third, NCGT takes forwarding and non-forwarding as the policy set, designs the benefit function, and gets forwarding probability of nodes through Nash equilibrium, to reduce a large number of redundancy, competition and conflict in forwarding requests and improve its broadcasting efficiency. The simulation results show, NCGT is more effective against black hole and witch attacks than S-MODEST and AODV+FDG when there exists malicious nodes. Meanwhile, with the increasing of network load, NCGT with or without GSR always performs best in the terms of data delivery rate, delay, transmission energy consumption and system throughput in MEC environment.


  • Open Access

    Data Distribution Optimization Strategy in Wireless Sensor Networks With Edge Computing

    by Guozhi Li, Xuekun Song

    Resource-constrained wireless sensor networks (WSNs) impose a substantial challenge to the transmission and processing of non-redundant perceptual data. Moreover, breakthroughs in this area have opened up a new dimension that integrates edge computing technology in wireless sensor networks. However, achieving reliable data distribution in wireless sensor networks with edge computing (EWSN) and balancing the link bandwidth and node energy resources have become challenging problems. In this article, we propose a joint bandwidth allocation and energy consumption (JBAEC) algorithm for distributing different perceptual data to different sensor nodes of the EWSN by considering the available transmission links between the source sensor and destination nodes under the condition of early perceived energy. Therefore, we first establish the model of different data packet types and energy detection costs. Second, we describe the problem of effective bandwidth allocation and prove its NP-hard feature. In addition, we formulate the bandwidth allocation problem as an optimization problem that is divided into the two states of sufficient energy and lack of energy. Afterwards, we present an available node selection (ANS) algorithm for sorting the available relay nodes under the condition of different energy-sufficient nodes. The effective transmission network construction (ETNC) algorithm selects the available transmission links based on the set of available nodes. Finally, we implement the JBAEC algorithm by using the NS-2 simulator and present extensive simulation results to verify the data distribution efficiency of the JBAEC algorithm in the EWSN.


  • Open Access

    Energy Consumption Averaging and Minimization for the Software Defined Wireless Sensor Networks With Edge Computing

    by Guozhi Li, Yulong Xu

    The software-defined (SD) and edge computing (EC) are emerging technologies that have been used to improve the network operation efficiency of wireless sensor networks (WSNs). Due to the advantages of the SD and EC technologies, the area of WSNs has achieved a new dimension and breakthrough. However, the limited energy allocation mechanism in edge-SD wireless sensor networks (ESDWSNs) makes the energy consumption of different nodes unbalanced. In this paper, we propose an energy allocation optimization (EAO) algorithm that solves the energy averaging and minimization (ECAM) problem in ESDWSNs by selecting appropriate relay nodes and de-duplicated data flows. Specifically, we first establish a novel three-layer network architecture based on the edge computing and software-defined technologies. Then we proposed the ECAM problem, which minimizes the energy consumption in ESDWSNs. Furthermore, we propose an adaptive Levenberg-Marquardt algorithm and derive the optimization value of energy cost function. The extensive simulation results based on the NS-2 simulator demonstrate the energy balance efficiency of the EAO algorithm in ESDWSNs.


  • Traffic Load Minimization in Software Defined Wireless Sensor Networks

    by Guozhi Li, Songtao Guo, Yuanyuan Yang

    The emerging software defined networking enables the separation of control plane and data plane and saves the resource consumption of the network. Breakthrough in this area has opened up a new dimension to the design of software defined method in wireless sensor networks (WSNs). However, the limited routing strategy in software defined WSNs (SDWSNs) imposes a great challenge in achieving the minimum traffic load. In this paper, we propose a flow splitting optimization (FSO) algorithm for solving the problem of traffic load minimization (TLM) in SDWSNs by considering the selection of optimal relay sensor node and the transmission of optimal splitting flow. To this end, we first establish the model of different packet types and describe the TLM problem. We then formulate the TLM problem into an optimization problem which is constrained by the load of sensor nodes and the packet similarity between different sensor nodes. Afterwards, we present a Levenberg-Marquardt algorithm for solving the optimization problem of traffic load. We also provide the convergence analysis of the Levenberg-Marquardt algorithm. Finally, we implement the FSO algorithm in the NS-2 simulator and give extensive simulation results to verify the efficiency of FSO algorithm in SDWSNs.


  • A traffic flow-based and dynamic grouping-enabled resource allocation algorithm for LTE-D2D vehicular networks

    by Guozhi Li, Zhihua Yang, Shoufeng Chen, Yunhe Li, Peng Yuan

    Nowadays, Device-to-Device (D2D) communication in LTE system has been proposed as a possible candidate for vehicle-to-vehicle(V2V) communication. As V2V communications share the same licensed frequency spectrum pool with typical UEs communications in one LTE cell, efficient radio resource allocation is a challenging issue. In this paper, we proposed a traffic flow based dynamic resource allocation algorithm for vehicular communication networks, which could make radio resource to be utilized in a more efficient way with a flexible node-grouping algorithm. The simulation results show, compared with random allocation and greedy allocation algorithms, the proposed algorithm can significantly reduce running time and significantly improve spectrum utilization efficiency.