Yuyang Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yuyang Zhang has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Ping Dong
State Key Laboratory of Advanced Rail Autonomous Operation, and the School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, China
21 shared publications - Wenxuan Qiao
State Key Laboratory of Advanced Rail Autonomous Operation, and the School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, China
15 shared publications - Hongke Zhang
Beijing Jiaotong University
14 shared publications - Xiaoya Zhang
State Key Laboratory of Advanced Rail Autonomous Operation, Beijing Jiaotong University, Beijing, China
9 shared publications - Chengxiao Yu
Peng Cheng Laboratory, Shenzhen, China
4 shared publications - Wenxiao Wang
State Key Laboratory of Advanced Rail Autonomous Operation, and the School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, China
3 shared publications
Latest Publications
- 9 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (11) , 23930-23947
CIFDM: A Fault Diagnosis Mechanism for Access Networks Based on Cause Inference in Heterogeneous Emergency Networks
In heterogeneous wireless emergency networks, network fault diagnosis plays a critical role in ensuring reliable and secure communication. To improve network transmission quality, the complexity of network equipment—both in hardware and software design—has increased, which inevitably gives rise to equipment failures with complex root causes, significantly elevating the difficulty of fault diagnosis. Current fault diagnosis algorithms are inadequate for addressing the challenges in fault diagnosis of complex emergency access networks, primarily due to their high diagnostic costs and low accuracy. In this study, we first propose a diagnosis framework and a deterministic fault propagation (DFP) model, and a hierarchical fault diagnosis framework (HFDF). Second, we develop three algorithms to construct a fault cause relationship graph (FCRG), which supports identifying the logical relationships among various fault causes associated with a specific fault. Third, we propose a fault diagnosis algorithm based on relational graph inference (FDRGI). Finally, we conduct extensive experiments in real-world wireless access networks. The experimental results demonstrate that our algorithm satisfies the requirements for root cause diagnosis of access failures in emergency networks, and outperforms other comparative algorithms in terms of diagnostic cost and accuracy: it reduces the average diagnostic cost by 13.71%–69.88% and improves the average diagnostic accuracy by 39.06%%–1.98-fold.
- 9 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (11) , 23930-23947
CIFDM: A Fault Diagnosis Mechanism for Access Networks Based on Cause Inference in Heterogeneous Emergency Networks
In heterogeneous wireless emergency networks, network fault diagnosis plays a critical role in ensuring reliable and secure communication. To improve network transmission quality, the complexity of network equipment—both in hardware and software design—has increased, which inevitably gives rise to equipment failures with complex root causes, significantly elevating the difficulty of fault diagnosis. Current fault diagnosis algorithms are inadequate for addressing the challenges in fault diagnosis of complex emergency access networks, primarily due to their high diagnostic costs and low accuracy. In this study, we first propose a diagnosis framework and a deterministic fault propagation (DFP) model, and a hierarchical fault diagnosis framework (HFDF). Second, we develop three algorithms to construct a fault cause relationship graph (FCRG), which supports identifying the logical relationships among various fault causes associated with a specific fault. Third, we propose a fault diagnosis algorithm based on relational graph inference (FDRGI). Finally, we conduct extensive experiments in real-world wireless access networks. The experimental results demonstrate that our algorithm satisfies the requirements for root cause diagnosis of access failures in emergency networks, and outperforms other comparative algorithms in terms of diagnostic cost and accuracy: it reduces the average diagnostic cost by 13.71%–69.88% and improves the average diagnostic accuracy by 39.06%%–1.98-fold.
- Open Access
- 23 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Vehicular Technology
- Vol. 7, 887-900
A Dynamic Traffic Camouflage Method Based on Adversarial Machine Learning for Connected Vehicles
While improving the convenience of Internet of Vehicles applications, its communication process faces serious privacy and security threats. Especially in the process of network layer transmission, the analysis of side-channel characteristics (such as packet size and traffic transmission mode) may lead to user privacy leakage. Most of the existing research focuses on website fingerprint camouflage or overall traffic statistical feature camouflage, and usually only designs a camouflage mechanism for a single application layer protocol, which is challenging to achieve unified protection in the multi-protocol scenario of the Internet of Vehicles. In this paper, we propose a method called LeakGAN Packets Traffic Camouflage (LPTC), which can provide traffic camouflage for multiple application-layer protocols simultaneously. The LPTC learns the sending pattern of target traffic packets and generates camouflaged traffic through an adversarial game between a generator and a discriminator, to effectively resist side-channel attacks without affecting communication performance. Experimental results indicate that the proposed LPTC scheme significantly degrades the classification performance of traffic transmission models based on K-Nearest Neighbors, Support Vector Machine, Bagged Trees, and Random Forest algorithms, reducing classification accuracy by 41.23%. In addition, the precision, recall, F1 score, and AUC value decreased by 41.82%, 61.85%, 49.57%, and 42.00%, respectively. Moreover, the LPTC can effectively withstand adaptive attackers who retrain deep learning classifiers on camouflaged traffic. The LPTC substantially enhances the indistinguishability between target and camouflaged traffic, thereby effectively mitigating user privacy leakage caused by side-channel analysis. Meanwhile, the system's bandwidth and delay performance is sufficient to support the transmission requirements of real-time vehicular networks.
- 23 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Vehicular Technology
- Vol. 7, 887-900
Open AccessA Dynamic Traffic Camouflage Method Based on Adversarial Machine Learning for Connected Vehicles
While improving the convenience of Internet of Vehicles applications, its communication process faces serious privacy and security threats. Especially in the process of network layer transmission, the analysis of side-channel characteristics (such as packet size and traffic transmission mode) may lead to user privacy leakage. Most of the existing research focuses on website fingerprint camouflage or overall traffic statistical feature camouflage, and usually only designs a camouflage mechanism for a single application layer protocol, which is challenging to achieve unified protection in the multi-protocol scenario of the Internet of Vehicles. In this paper, we propose a method called LeakGAN Packets Traffic Camouflage (LPTC), which can provide traffic camouflage for multiple application-layer protocols simultaneously. The LPTC learns the sending pattern of target traffic packets and generates camouflaged traffic through an adversarial game between a generator and a discriminator, to effectively resist side-channel attacks without affecting communication performance. Experimental results indicate that the proposed LPTC scheme significantly degrades the classification performance of traffic transmission models based on K-Nearest Neighbors, Support Vector Machine, Bagged Trees, and Random Forest algorithms, reducing classification accuracy by 41.23%. In addition, the precision, recall, F1 score, and AUC value decreased by 41.82%, 61.85%, 49.57%, and 42.00%, respectively. Moreover, the LPTC can effectively withstand adaptive attackers who retrain deep learning classifiers on camouflaged traffic. The LPTC substantially enhances the indistinguishability between target and camouflaged traffic, thereby effectively mitigating user privacy leakage caused by side-channel analysis. Meanwhile, the system's bandwidth and delay performance is sufficient to support the transmission requirements of real-time vehicular networks.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 12, 10405-10420
Enhancing Website Fingerprinting With Fluctuation-Resilient Traffic Representation
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 12, 10405-10420
Enhancing Website Fingerprinting With Fluctuation-Resilient Traffic Representation
- 17 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (2) , 3253-3272
Agreement-Free Encryption Tunnel in Public Safety Communication
Traditional key agreement-based encryption mechanisms in public security communications struggle to address increasingly sophisticated network attacks and real-time threats due to infrequent key updates and exposure risks. To overcome these limitations, this study proposes a Chaotic Encryption-based Tunneling Method (CETM) at the network layer. CETM integrates a six-dimensional (6D) hyperchaotic system with the AES-256 algorithm, leveraging the system’s extreme sensitivity to initial conditions to generate high-strength key sequences, eliminating the need for traditional negotiation. A self-synchronizing key update mechanism is also introduced, allowing both parties to update keys automatically without network transmission, thereby eliminating the risk of key leakage. The proposed system demonstrates strong complexity and randomness, as validated by multiple chaotic metrics including the Lyapunov exponent, Shannon entropy, correlation coefficient, permutation entropy, and key space. The generated keys pass both the SP800-22 and FIPS 140-2 tests, meeting established security standards. Performance evaluations across local, cloud, and satellite environments show that CETM significantly outperforms conventional methods in terms of bandwidth efficiency, latency, jitter, and packet loss.
- 17 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (2) , 3253-3272
Agreement-Free Encryption Tunnel in Public Safety Communication
Traditional key agreement-based encryption mechanisms in public security communications struggle to address increasingly sophisticated network attacks and real-time threats due to infrequent key updates and exposure risks. To overcome these limitations, this study proposes a Chaotic Encryption-based Tunneling Method (CETM) at the network layer. CETM integrates a six-dimensional (6D) hyperchaotic system with the AES-256 algorithm, leveraging the system’s extreme sensitivity to initial conditions to generate high-strength key sequences, eliminating the need for traditional negotiation. A self-synchronizing key update mechanism is also introduced, allowing both parties to update keys automatically without network transmission, thereby eliminating the risk of key leakage. The proposed system demonstrates strong complexity and randomness, as validated by multiple chaotic metrics including the Lyapunov exponent, Shannon entropy, correlation coefficient, permutation entropy, and key space. The generated keys pass both the SP800-22 and FIPS 140-2 tests, meeting established security standards. Performance evaluations across local, cloud, and satellite environments show that CETM significantly outperforms conventional methods in terms of bandwidth efficiency, latency, jitter, and packet loss.
- Open Access
- 10 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Vehicular Technology
- Vol. 7, 27-40
MGP: Multi-Stage Grouped Probe Detection for Fault Localization in Vehicle-to-Ground Communication Networks
The Vehicle-to-Ground (V2G) emergency communication network is a dedicated network established to respond to emergencies, such as natural disasters and traffic accidents, and it plays a crucial role in ensuring the safe and smooth operation of vehicles. Composed of numerous devices, this network is inevitably exposed to failure risks due to prolonged operation, complex designs, and insufficient management and maintenance. Faults in network nodes may undermine the reliability of vehicle-to-ground communication. Rapid fault localization is critical to the maintenance and management of network device. However, current localization methods face issues like excessively long probing paths, high localization costs, and low accuracy—all of which lead to subpar performance in real-world fault localization scenarios. To address these problems, we introduce a novel Multi-stage Group Probe (MGP) localization method, designed to balance localization cost and accuracy effectively. Specifically, we first present a network localization model and the concept of "uncertain information volume of network node states," which quantifies the cost and efficiency of localization. Second, leveraging graph theory, we propose the idea of network probing subgraphs and constrain the number of probing stations and probe lengths, while developing algorithms for selecting probing stations and planning probing paths. Additionally, we introduce a group probe localization method that incorporates information feedback to reduce costs. Finally, we evaluate the MGP against other probe localization approaches across different networks. Experimental results demonstrate that MGP outperforms comparative methods in terms of localization cost, accuracy, and efficiency.
- 10 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Vehicular Technology
- Vol. 7, 27-40
Open AccessMGP: Multi-Stage Grouped Probe Detection for Fault Localization in Vehicle-to-Ground Communication Networks
The Vehicle-to-Ground (V2G) emergency communication network is a dedicated network established to respond to emergencies, such as natural disasters and traffic accidents, and it plays a crucial role in ensuring the safe and smooth operation of vehicles. Composed of numerous devices, this network is inevitably exposed to failure risks due to prolonged operation, complex designs, and insufficient management and maintenance. Faults in network nodes may undermine the reliability of vehicle-to-ground communication. Rapid fault localization is critical to the maintenance and management of network device. However, current localization methods face issues like excessively long probing paths, high localization costs, and low accuracy—all of which lead to subpar performance in real-world fault localization scenarios. To address these problems, we introduce a novel Multi-stage Group Probe (MGP) localization method, designed to balance localization cost and accuracy effectively. Specifically, we first present a network localization model and the concept of "uncertain information volume of network node states," which quantifies the cost and efficiency of localization. Second, leveraging graph theory, we propose the idea of network probing subgraphs and constrain the number of probing stations and probe lengths, while developing algorithms for selecting probing stations and planning probing paths. Additionally, we introduce a group probe localization method that incorporates information feedback to reduce costs. Finally, we evaluate the MGP against other probe localization approaches across different networks. Experimental results demonstrate that MGP outperforms comparative methods in terms of localization cost, accuracy, and efficiency.
- 11 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 12, 2100-2114
ChebNet-LSTM-Based Secure Transmission Method in Multi-Cloud Networks
In the context of multi-cloud networks, enhancing transmission efficiency while maintaining security in communication relations is of paramount importance. Existing methods have been criticized for imposing high encryption overhead on the sender side and lacking effective short-term dynamic modeling of network performance. This paper proposes an optimization method that integrates a trusted obfuscation forwarding framework with the joint spatio-temporal network performance prediction. Firstly, to conceal communication relationships, we design a hop-by-hop encryption and proxy forwarding framework leveraging obfuscated forwarding nodes. Second, node selection is optimized by predicting network performance metrics. We extract the spatial correlations of the topology using a Chebyshev Network (ChebNet), and integrate this with Long Short-Term Memory (LSTM) models to capture temporal variations in performance. Experimental results show that the proposed method reduces the probability of communication relationship exposure to 3.57% from 100%, approaching the theoretical optimum. The prediction accuracies of bandwidth, delay, jitter and packet loss rate are significantly improved in terms of mean absolute error, root mean square error, and mean absolute percentage error metrics when compared to the graph convolutional network (GCN) and temporal convolutional network (TCN) benchmark models. Moreover, the node selection probability during obfuscated forwarding approaches a uniform distribution. The proposed method distributes the encryption load across intermediate nodes, thereby reducing the burden on the sender.
- 11 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 12, 2100-2114
ChebNet-LSTM-Based Secure Transmission Method in Multi-Cloud Networks
In the context of multi-cloud networks, enhancing transmission efficiency while maintaining security in communication relations is of paramount importance. Existing methods have been criticized for imposing high encryption overhead on the sender side and lacking effective short-term dynamic modeling of network performance. This paper proposes an optimization method that integrates a trusted obfuscation forwarding framework with the joint spatio-temporal network performance prediction. Firstly, to conceal communication relationships, we design a hop-by-hop encryption and proxy forwarding framework leveraging obfuscated forwarding nodes. Second, node selection is optimized by predicting network performance metrics. We extract the spatial correlations of the topology using a Chebyshev Network (ChebNet), and integrate this with Long Short-Term Memory (LSTM) models to capture temporal variations in performance. Experimental results show that the proposed method reduces the probability of communication relationship exposure to 3.57% from 100%, approaching the theoretical optimum. The prediction accuracies of bandwidth, delay, jitter and packet loss rate are significantly improved in terms of mean absolute error, root mean square error, and mean absolute percentage error metrics when compared to the graph convolutional network (GCN) and temporal convolutional network (TCN) benchmark models. Moreover, the node selection probability during obfuscated forwarding approaches a uniform distribution. The proposed method distributes the encryption load across intermediate nodes, thereby reducing the burden on the sender.
- 11 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (1) , 1536-1550
MultiS-IDRM: An Intelligent Disaster Recovery Mechanism for Multi-Interface Server in Emergency Communication Systems
Multi-interface servers can achieve high bandwidth and reliable transmission through multipath transmission and bandwidth aggregation technologies. These capabilities meet the transmission quality requirements of emergency communication systems. However, it is important that multi-interface servers come with the risk of single-point failures, which significantly limit the reliability of emergency communication systems. Currently, existing solutions encounter challenges in managing the single-point failures of multi-interface servers. In this paper, we analyze the complexity of emergency communication systems, and propose a novel intelligent disaster recovery mechanism called MultiS-IDRM to achieve intelligent disaster recovery for multi-interface servers for the first time. Firstly, we propose a multi-dimensional attribute joint decision model (MDAJD) as the basis for determining the working status of multi-interface servers. Secondly, we design a route encapsulation method applicable to multipath backup scenarios. This method achieves the failover of independent paths with mixed multiple network tunnels. Additionally, we design a server status detection algorithm and an intelligent switching mechanism to realize intelligent switching of multi-interface servers in different application scenarios. Finally, we compare MultiS-IDRM with other protocols, including the Virtual Router Redundancy Protocol, Gateway Loading Balance Protocol, and Hot Standby Redundancy Protocol, in real networks. The experimental results demonstrate that MultiS-IDRM effectively resolves the single-point failure issue of multi-interface servers while enhancing the reliability, invulnerability, and intelligence of emergency communication systems.
- 11 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (1) , 1536-1550
MultiS-IDRM: An Intelligent Disaster Recovery Mechanism for Multi-Interface Server in Emergency Communication Systems
Multi-interface servers can achieve high bandwidth and reliable transmission through multipath transmission and bandwidth aggregation technologies. These capabilities meet the transmission quality requirements of emergency communication systems. However, it is important that multi-interface servers come with the risk of single-point failures, which significantly limit the reliability of emergency communication systems. Currently, existing solutions encounter challenges in managing the single-point failures of multi-interface servers. In this paper, we analyze the complexity of emergency communication systems, and propose a novel intelligent disaster recovery mechanism called MultiS-IDRM to achieve intelligent disaster recovery for multi-interface servers for the first time. Firstly, we propose a multi-dimensional attribute joint decision model (MDAJD) as the basis for determining the working status of multi-interface servers. Secondly, we design a route encapsulation method applicable to multipath backup scenarios. This method achieves the failover of independent paths with mixed multiple network tunnels. Additionally, we design a server status detection algorithm and an intelligent switching mechanism to realize intelligent switching of multi-interface servers in different application scenarios. Finally, we compare MultiS-IDRM with other protocols, including the Virtual Router Redundancy Protocol, Gateway Loading Balance Protocol, and Hot Standby Redundancy Protocol, in real networks. The experimental results demonstrate that MultiS-IDRM effectively resolves the single-point failure issue of multi-interface servers while enhancing the reliability, invulnerability, and intelligence of emergency communication systems.
- 19 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (11) , 18179-18183
Risk-Driven Multipath Collaborative Transmission Enhancement for Next-Generation Reliable IoV
Multipath transmission enables path diversity and improves network resource utilization. However, suboptimal path selection can significantly increase the risk of degraded multipath transmission ability due to the inherent notable differences across multiple heterogeneous paths and the frequent jitter during vehicular mobility. To address this issue and achieve collaborative transmission enhancement in such heterogeneous jitter environments, this paper proposes a delay-difference-constrained packet scheduler (DDCPS) that incorporates both network risk and benefit. Specifically, network risk is quantified by the delay differences and variance, whereas network benefits encompass both the transmission ability and application adaptability. The DDCPS prioritizes paths with the lowest residual risk by minimizing the difference between network risk and benefit. We evaluate the DDCPS across six key dimensions, including a real-world IoV test, to ensure a comprehensive assessment. The results demonstrate that the DDCPS achieves an improvement of 44% in latency stability while simultaneously achieving a 4.81% increase in transmission ability compared to best-performing scheduler.
- 19 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (11) , 18179-18183
Risk-Driven Multipath Collaborative Transmission Enhancement for Next-Generation Reliable IoV
Multipath transmission enables path diversity and improves network resource utilization. However, suboptimal path selection can significantly increase the risk of degraded multipath transmission ability due to the inherent notable differences across multiple heterogeneous paths and the frequent jitter during vehicular mobility. To address this issue and achieve collaborative transmission enhancement in such heterogeneous jitter environments, this paper proposes a delay-difference-constrained packet scheduler (DDCPS) that incorporates both network risk and benefit. Specifically, network risk is quantified by the delay differences and variance, whereas network benefits encompass both the transmission ability and application adaptability. The DDCPS prioritizes paths with the lowest residual risk by minimizing the difference between network risk and benefit. We evaluate the DDCPS across six key dimensions, including a real-world IoV test, to ensure a comprehensive assessment. The results demonstrate that the DDCPS achieves an improvement of 44% in latency stability while simultaneously achieving a 4.81% increase in transmission ability compared to best-performing scheduler.