Rui Zhang
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
Research Subjects
Rui Zhang has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Libing Wu
Wuhan University
3 shared publications - Shuqin Cao
School of Computer Science and Technology, Wuhan University of Science and Technology, Wuhan, China
3 shared publications Dan Wu
School of Computer Science, University of Windsor, Windsor, Canada
2 shared publications- Dan Wu
School of Computer Science, University of Windsor, Windsor, Ontario, Canada
2 shared publications - Di Wu
Nanjing University of Science and Technology
2 shared publications - Jianxin Li
Edith Cowan University
2 shared publications
Latest Publications
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (10) , 24595-24605
Secure and Resilient Cluster Head Election for UAV-Assisted IoV: A Synergistic Approach With Trust Fusion and Dynamic Fitness
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (10) , 24595-24605
Secure and Resilient Cluster Head Election for UAV-Assisted IoV: A Synergistic Approach With Trust Fusion and Dynamic Fitness
- 23 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (6) , 11436-11445
An ECC-Based Three-Factor Authentication and Key Management Protocol for Session Key Leakage Resilience in Internet of Drones
As a network with dynamic network topology and limited on-board resource, the Internet of Drones(IoD) suffers various cyber attacks, such as real-time data tampering, clogging, jamming and etc.. The real-time data tampering, especially the session key leakage, in the IoD can distort time-sensitive information and disrupt system operations. Many existing works based on authentication and key agreement perform low efficient and not secure enough for real-time data transmitting in the system. In this manuscript, we proposed a three-factor authentication and key agreement protocol (HEAT) to solve these issues. The HEAT can solve session key leakage during data transmission by refining the user authentication mechanism and introducing the Elliptic Curve Cryptography into communications between drones and users. Compared with existing protocols, the HEAT achieves less authentication delay and higher data efficiency. The HEAT is proven secure with numerous experiments under the extended Canetti-Krawczyk model.
- 23 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (6) , 11436-11445
An ECC-Based Three-Factor Authentication and Key Management Protocol for Session Key Leakage Resilience in Internet of Drones
As a network with dynamic network topology and limited on-board resource, the Internet of Drones(IoD) suffers various cyber attacks, such as real-time data tampering, clogging, jamming and etc.. The real-time data tampering, especially the session key leakage, in the IoD can distort time-sensitive information and disrupt system operations. Many existing works based on authentication and key agreement perform low efficient and not secure enough for real-time data transmitting in the system. In this manuscript, we proposed a three-factor authentication and key agreement protocol (HEAT) to solve these issues. The HEAT can solve session key leakage during data transmission by refining the user authentication mechanism and introducing the Elliptic Curve Cryptography into communications between drones and users. Compared with existing protocols, the HEAT achieves less authentication delay and higher data efficiency. The HEAT is proven secure with numerous experiments under the extended Canetti-Krawczyk model.
- 19 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (2) , 1760-1774
Hypergraph Attention Recurrent Network for Cellular Traffic Prediction
Cellular traffic prediction provides significant support for the management of intelligent networks. Existing models commonly combine recurrent neural networks (RNNs) with attention mechanisms, convolutional neural networks (CNNs), or graph convolutional networks (GCNs) to capture spatial-temporal correlations of cellular traffic. However, attention mechanisms lack sensitivity to local information; CNNs ignore the interaction among distant regions with similar semantics; GCNs exhibit limitations in exploring high-order (beyond pairwise) spatial correlations. To this end, we develop a hypergraph attention recurrent network (HARN) that exploits locality, semantics, and high-order correlations for cellular traffic prediction. Specifically, we first propose a spatial trend-aware attention to perceive local trends, thus easing the mismatching problem of attention mechanisms. Then, we construct a hypergraph to characterize the interactions between distant regions with similar semantics, and leverage a hypergraph convolution network to extract high-order correlations. More importantly, to extract heterogeneous and varying spatial patterns, we further enhance the hypergraph convolution network by incorporating spatial-temporal representations. Last, extensive experiments on three real-world datasets demonstrate the superiority of HARN over state-of-the-art baselines in terms of mean absolute error and root mean square error, with specific improvements of 1.83% and 5.79% on SMS (short message service) dataset, 3.05% and 11.27% on Call dataset, and 1.36% and 1.65% on Internet dataset, respectively.
- 19 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (2) , 1760-1774
Hypergraph Attention Recurrent Network for Cellular Traffic Prediction
Cellular traffic prediction provides significant support for the management of intelligent networks. Existing models commonly combine recurrent neural networks (RNNs) with attention mechanisms, convolutional neural networks (CNNs), or graph convolutional networks (GCNs) to capture spatial-temporal correlations of cellular traffic. However, attention mechanisms lack sensitivity to local information; CNNs ignore the interaction among distant regions with similar semantics; GCNs exhibit limitations in exploring high-order (beyond pairwise) spatial correlations. To this end, we develop a hypergraph attention recurrent network (HARN) that exploits locality, semantics, and high-order correlations for cellular traffic prediction. Specifically, we first propose a spatial trend-aware attention to perceive local trends, thus easing the mismatching problem of attention mechanisms. Then, we construct a hypergraph to characterize the interactions between distant regions with similar semantics, and leverage a hypergraph convolution network to extract high-order correlations. More importantly, to extract heterogeneous and varying spatial patterns, we further enhance the hypergraph convolution network by incorporating spatial-temporal representations. Last, extensive experiments on three real-world datasets demonstrate the superiority of HARN over state-of-the-art baselines in terms of mean absolute error and root mean square error, with specific improvements of 1.83% and 5.79% on SMS (short message service) dataset, 3.05% and 11.27% on Call dataset, and 1.36% and 1.65% on Internet dataset, respectively.
- 13 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (7) , 9546-9559
A Spatial-Temporal Gated Hypergraph Convolution Network for Traffic Prediction
As one of the most significant components of Intelligent Transportation Systems (ITS), traffic prediction has gained much popularity given its enormous application value in vehicular communications, traffic management, and traffic control. As such, many traffic prediction models have been proposed. The current methods commonly adopt graph convolution networks (GCNs) to capture spatial correlations. GCN-based approaches mainly focus on pair-wise interactions between road vertices (i.e. dyadic relations). However, the interactions between road vertices are not necessarily dyadic, but also can be high-order (i.e., multivariate relations). Further, few existing works focus on how to mine correlations between different types of traffic data. To this end, we develop STGHCN, a spatial-temporal gated hypergraph convolution network, that not only captures pair-wise and high-order spatial patterns between vertices but also characterizes the type-aware traffic data influences. Specifically, we adopt a spatial gated graph convolution and a hypergraph convolution to explore pair-wise and high-order interactions. More importantly, we design a spatial-temporal aware channel attention mechanism to mine hidden patterns between cross-type traffic features. Extensive experiments conducted on four real-world traffic datasets validate the effectiveness of STGHCN, with STGHCN's MAE, RMSE, and MAPE at between 6.91%-10.00%, 5.42%-8.90%, and 2.54%-5.03% lower than the state-of-the-art methods.
- 13 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (7) , 9546-9559
A Spatial-Temporal Gated Hypergraph Convolution Network for Traffic Prediction
As one of the most significant components of Intelligent Transportation Systems (ITS), traffic prediction has gained much popularity given its enormous application value in vehicular communications, traffic management, and traffic control. As such, many traffic prediction models have been proposed. The current methods commonly adopt graph convolution networks (GCNs) to capture spatial correlations. GCN-based approaches mainly focus on pair-wise interactions between road vertices (i.e. dyadic relations). However, the interactions between road vertices are not necessarily dyadic, but also can be high-order (i.e., multivariate relations). Further, few existing works focus on how to mine correlations between different types of traffic data. To this end, we develop STGHCN, a spatial-temporal gated hypergraph convolution network, that not only captures pair-wise and high-order spatial patterns between vertices but also characterizes the type-aware traffic data influences. Specifically, we adopt a spatial gated graph convolution and a hypergraph convolution to explore pair-wise and high-order interactions. More importantly, we design a spatial-temporal aware channel attention mechanism to mine hidden patterns between cross-type traffic features. Extensive experiments conducted on four real-world traffic datasets validate the effectiveness of STGHCN, with STGHCN's MAE, RMSE, and MAPE at between 6.91%-10.00%, 5.42%-8.90%, and 2.54%-5.03% lower than the state-of-the-art methods.
- 31 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (8) , 8705-8718
A Spatiotemporal Multiscale Graph Convolutional Network for Traffic Flow Prediction
Traffic prediction is vital to traffic planning, control, and optimization, which is necessary for intelligent traffic management. Existing methods mostly capture spatiotemporal correlations on a fine-grained traffic graph, which cannot make full use of cluster information in coarse-grained traffic graph. However, the flow variation of clusters in the coarse-grained traffic graph is more stable compared with nodes in the fine-grained traffic graph. And the flow variation of a fine-grained node is generally consistent with the trend of the cluster to which the node belongs. Thus information in the coarse-grained traffic graph can guide feature learning in the fine-grained traffic graph. To this end, we propose a Spatiotemporal Multiscale Graph Convolutional Network (SMGCN) that explores spatiotemporal correlations on a multiscale graph. Specifically, given a fine-grained traffic graph, we first generate a coarse-grained traffic graph by graph clustering, and extract spatiotemporal correlations on both fine-grained and coarse-grained traffic graphs. Then we propose a cross-scale fusion (CF) to implement information diffusion between the fine-grained and coarse-grained traffic graphs. Moreover, we employ an adaptive dynamic graph convolution network to mine both static and dynamic spatial features. We evaluate SMGCN on real-world datasets and obtain a $1.18\% -3.32\%$ improvement over state-of-the-arts.
- 31 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (8) , 8705-8718
A Spatiotemporal Multiscale Graph Convolutional Network for Traffic Flow Prediction
Traffic prediction is vital to traffic planning, control, and optimization, which is necessary for intelligent traffic management. Existing methods mostly capture spatiotemporal correlations on a fine-grained traffic graph, which cannot make full use of cluster information in coarse-grained traffic graph. However, the flow variation of clusters in the coarse-grained traffic graph is more stable compared with nodes in the fine-grained traffic graph. And the flow variation of a fine-grained node is generally consistent with the trend of the cluster to which the node belongs. Thus information in the coarse-grained traffic graph can guide feature learning in the fine-grained traffic graph. To this end, we propose a Spatiotemporal Multiscale Graph Convolutional Network (SMGCN) that explores spatiotemporal correlations on a multiscale graph. Specifically, given a fine-grained traffic graph, we first generate a coarse-grained traffic graph by graph clustering, and extract spatiotemporal correlations on both fine-grained and coarse-grained traffic graphs. Then we propose a cross-scale fusion (CF) to implement information diffusion between the fine-grained and coarse-grained traffic graphs. Moreover, we employ an adaptive dynamic graph convolution network to mine both static and dynamic spatial features. We evaluate SMGCN on real-world datasets and obtain a $1.18\% -3.32\%$ improvement over state-of-the-arts.
- 26 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 20 (1) , 456-470
A Vehicular Task Offloading Method With Eliminating Redundant Tasks in 5G HetNets
The combination of mobile edge computing and 5G heterogeneous networks (5G HetNets) provides new vehicular task offloading research solutions. Most existing task offloading studies assume that vehicle tasks are unique and there are no redundant tasks between vehicles. However, there is a duplication of tasks for vehicles within the same base station. That causes a waste of computing resources and increases task offloading costs. To address this problem, this paper proposes the task offloading algorithm TOERT to eliminate redundant tasks in 5G HetNets. The TOERT algorithm is designed to eliminate redundant tasks, improve vehicle task completion rates and reduce offloading costs. Specifically, we consider two cases of redundant tasks within the macro cell base station (MCBS). When the task results have been stored in the MCBS, vehicles directly agree on the transaction price with the MCBS to obtain the task results. The MCBS first eliminates redundant tasks between vehicles when task results are not stored. Then, the MCBS determines the appropriate small cell base station (SCBS) to participate in the partial offloading. Finally, the vehicles negotiate with the MCBS to obtain task results. Against the other five algorithms considered for comparison purposes, the TOERT algorithm effectively eliminates redundant tasks, improves the task completion rate and increases the benefits of both the vehicles and the MCBS.
- 26 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 20 (1) , 456-470
A Vehicular Task Offloading Method With Eliminating Redundant Tasks in 5G HetNets
The combination of mobile edge computing and 5G heterogeneous networks (5G HetNets) provides new vehicular task offloading research solutions. Most existing task offloading studies assume that vehicle tasks are unique and there are no redundant tasks between vehicles. However, there is a duplication of tasks for vehicles within the same base station. That causes a waste of computing resources and increases task offloading costs. To address this problem, this paper proposes the task offloading algorithm TOERT to eliminate redundant tasks in 5G HetNets. The TOERT algorithm is designed to eliminate redundant tasks, improve vehicle task completion rates and reduce offloading costs. Specifically, we consider two cases of redundant tasks within the macro cell base station (MCBS). When the task results have been stored in the MCBS, vehicles directly agree on the transaction price with the MCBS to obtain the task results. The MCBS first eliminates redundant tasks between vehicles when task results are not stored. Then, the MCBS determines the appropriate small cell base station (SCBS) to participate in the partial offloading. Finally, the vehicles negotiate with the MCBS to obtain task results. Against the other five algorithms considered for comparison purposes, the TOERT algorithm effectively eliminates redundant tasks, improves the task completion rate and increases the benefits of both the vehicles and the MCBS.
- 24 August 2022
- Published by Elsevier in Journal of Systems Architecture
- Vol. 131
MPTO-MT: A multi-period vehicular task offloading method in 5G HetNets
- 24 August 2022
- Published by Elsevier in Journal of Systems Architecture
- Vol. 131
MPTO-MT: A multi-period vehicular task offloading method in 5G HetNets