Zhongyi Zhai

Dr. Zhongyi Zhai


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
27 July 2022 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
ZZZhongyi Zhai
Zhongyi Zhai
GLGuibing Lai
Guibing Lai
BCBo Cheng
Bo Cheng
JQJunyan Qian
Junyan Qian
LZLingzhong Zhao
Lingzhong Zhao
ZWZhinguo Wan
Zhinguo Wan
Sensors in wireless sensor network (WSN) are usually deployed in the wild or even hostile circumstance. What is worse, most of the sensors have limited communication bandwidth, computation resources and energy. Therefore, it is challenging to ensure the security of WSN without decreasing its network performance. Network coding (NC) is a promising way for improving communication capability in WSN, e.g., high throughput, robustness and low-energy. Nevertheless, network coding is vulnerable to malicious attacks. Presently, many secure detections, such as information theoretic-based or cryptographic-based techniques, have been proposed to deal with a single type of attack, but are incapable of resisting the joint attacks, e.g., the union of pollution attacks and replay attacks. In this paper, a secure detection service is presented. It is deployed on every node of WSN to monitor, manage and control the messages passing through them in real-time. In the service, a lightweight timestamp-based message authentication code, namely TMAC, is designed with Exclusive OR network coding. Based on TMAC and time synchronization technique, a joint detection is implemented to resist pollution attacks and replay attacks synchronously. The correctness of the detection service is proved. Finally, the performance evaluation shows that the detection scheme brings negligible extra-expense in communication bandwidth and computational complexity compared to MAC-based schemes, and consumes energy lowly compared to other joint detection schemes.

7 April 2021 in International Journal of Machine Learning and Cybernetics
Verified
Journal Article
Closed access
PDF file
ZZZhongyi Zhai
Zhongyi Zhai
PLPeipei Liu
Peipei Liu
LZLingzhong Zhao
Lingzhong Zhao
JQJunyan Qian
Junyan Qian
BCBo Cheng
Bo Cheng

17 April 2020 in Sensors
Verified
Journal Article
Open access
PDF file
ZZZhongyi Zhai
Zhongyi Zhai
XKXiang Ke
Xiang Ke
LZLingzhong Zhao
Lingzhong Zhao
BCBo Cheng
Bo Cheng
JQJunyan Qian
Junyan Qian
JWJinsong Wu
Jinsong Wu
The edge-based computing paradigm (ECP) becomes one of the most innovative modes of processing distributed Interneit of Things (IoT) sensor data. However, the edge nodes in ECP are usually resource-constrained. When more services are executed on an edge node, the resources required by these services may exceed the edge node’s, so as to fail to maintain the normal running of the edge node. In order to solve this problem, this paper proposes a resource-constrained smart service migration framework for edge computing environment in IoT (IoT-RECSM) and a dynamic edge service migration algorithm. Based on this algorithm, the framework can dynamically migrate services of resource-critical edge nodes to resource-rich nodes. In the framework, four abstract models are presented to quantificationally evaluate the resource usage of edge nodes and the resource consumption of edge service in real-time. Finally, an edge smart services migration prototype system is implemented to simulate the edge service migration in IoT environment. Based on the system, an IoT case including 10 edge nodes is simulated to evaluate the proposed approach. According to the experiment results, service migration among edge nodes not only maintains the stability of service execution on edge nodes, but also reduces the sensor data traffic between edge nodes and cloud center.

12 August 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
YYYuekang Yu
Yuekang Yu
ZZZhongyi Zhai
Zhongyi Zhai
WLWeikun Li
Weikun Li
JMJianyu Ma
Jianyu Ma
In target-oriented multi-agent tasks, agents collaboratively achieve goals defined by specific objects, or targets, in their environment. The key to success is the effective coordination between agents and these targets, especially in dynamic environments where targets may shift. Agents must adeptly adjust to these changes and re-evaluate their target interactions. Inefficient coordination can lead to resource waste, extended task times, and lower overall performance. Addressing this challenge, we introduce the regulatory hierarchical multi-agent coordination (RHMC), a hierarchical reinforcement learning approach. RHMC divides the coordination task into two levels: a high-level policy, assigning targets based on environmental state, and a low-level policy, executing basic actions guided by individual target assignments and observations. Stabilizing RHMC’s high-level policy is crucial for effective learning. This stability is achieved by reward regularization, reducing reliance on the dynamic low-level policy. Such regularization ensures the high-level policy remains focused on broad coordination, not overly dependent on specific agent actions. By minimizing low-level policy dependence, RHMC adapts more seamlessly to environmental changes, boosting learning efficiency. Testing demonstrates RHMC’s superiority over existing methods in global reward and learning efficiency, highlighting its effectiveness in multi-agent coordination.

1 January 2016 in IEEE Access
Verified
Journal Article
Open access
ZZZhongyi Zhai
Zhongyi Zhai
BCBo Cheng
Bo Cheng
YTYue Tian
Yue Tian
JCJunliang Chen
Junliang Chen
LZLingzhong Zhao
Lingzhong Zhao
MNMeng Niu
Meng Niu
Spurred by Web technologies and service computing paradigm, more and more Web services have been delivered via standardized interfaces on the Internet. Mashup is exactly an enabling technology for end-users to combine these services into applications. However, there are some issues of end-user service development with mashup techniques. It not only requires users that develop application logics equipped with more or less programming skills, but also lacks a lightweight mashup model and systematic development approach in the existing mashup tools. To address these issues, we propose a data-driven service creation approach to facilitate application development and deployment. In the approach, we propose the service data model (SDM) for adaptation of heterogeneous Web services, the service relation model (SRM) for representation and refinement of data interaction between services, and the service process graph (SPG) for describing business logics of mashup applications. We develop an IFrame implementation for SDM that can facilitate service providers to wrap heterogeneous Web services in a unified way and display a visual element for the service. Meanwhile, we implement a pipeline as an intuitive form of SRM that can be used by end-users to develop business logic more effectively. To adapt the dynamic application scenarios, we also construct an event-driven execution mechanism for SPG. A lightweight service creation environment is then implemented to support end-users to develop applications in a simulative way, and a corresponding development methodology is introduced for this tool. Finally, the end-user evaluation and performance evaluation are conducted to evaluate our platform.

8 September 2024 in Future Internet
Verified
Journal Article
Open access
PDF file
LLLihui Li
Lihui Li
HDHanwen Deng
Hanwen Deng
ZZZhongyi Zhai
Zhongyi Zhai
SPSheng-Lung Peng
Sheng-Lung Peng
The secret key is stored in an ideal tamper-proof device so that a vehicle can implement a secure authentication with the road-side units (RSUs) and other drivers. However, some adversaries can capture the secret key by physical attacks. To resist physical attacks, we propose a physical-preserving authentication based on a physical unclonable function for vehicular ad hoc networks. In the proposed scheme, a physical unclonable function is deployed on the vehicle and the RSU to provide a challenge–response mechanism. A secret key is only generated by the challenge–response mechanism when it is needed, which eliminates the need to store a long-term secret key. As a result, this prevents secret keys from being captured by adversaries, improving system security. In addition, route planning is introduced into the proposed scheme so that a vehicle can obtain the authentication key of RSUs on its route before vehicle-to-infrastructure authentication, which greatly speeds up the authentication when the vehicle enters the RSUs’ coverage. Furthermore, a detailed analysis demonstrates that the proposed scheme achieves security objectives in vehicular ad hoc networks. Ultimately, when contrasted with similar schemes, the performance assessment demonstrates that our proposed scheme surpasses others in terms of computational overhead, communication overhead and packet loss rate.