Yajun Ma
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yajun Ma has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Bingyi Liu
Wuhan University of Technology
1 shared publication - Enshu Wang
Wuhan University
1 shared publication - Hangxing Wei
Key Laboratory of Aerospace Information Security and Trusted Computing, Ministry of Education, School of Cyber Science and Engineering, Wuhan University, Wuhan, China
1 shared publication - Hongguang Sun
College of Information Engineering, Northwest AF University, Yangling, China
1 shared publication - Hongming Zhang
College of Information Engineering, Northwest A&F University, Yangling 712100, China
1 shared publication - Jing Wang
School of Cyber Science and Engineering, Huazhong University of Science and Technology, Wuhan, China
1 shared publication
Latest Publications
- 21 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (5) , 6292-6305
PV-STR: An Efficient Pseudonym Verification Scheme With Spatial-Temporal Revocation in IoVs
Pseudonym certificates play a crucial role in providing authorized access in vehicular networks with fine-grained privacy demands. However, the revocation of pseudonym certificates in large-scale, resource-constrained context has posed a significant challenge. The global revocation status is susceptible to disruption by localized anomalous events. Moreover, as the scale of revocation grows, the synchronization process becomes increasingly vulnerable to attacks and incurs high overhead. To decouple the global revocation status from local revocation events, we propose a spatial-temporal pseudonym revocation and verification framework that supports batch pseudonym revocation within resilient revocation cycles. Revoked pseudonyms within the event area are locally filtered, while other pseudonyms are characterized by maintaining a proof to attest their consistent and legitimate status. To improve the efficiency of revocation status updates and mitigate centralization risks, a distributed caching and proof update strategy assisted by edge nodes is presented. Extensive simulations based on real-world large-scale datasets demonstrate that PV-STR scheme significantly reduces the vulnerability window, communication overhead, and memory consumption compared to state-of-the-art approaches.
- 21 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (5) , 6292-6305
PV-STR: An Efficient Pseudonym Verification Scheme With Spatial-Temporal Revocation in IoVs
Pseudonym certificates play a crucial role in providing authorized access in vehicular networks with fine-grained privacy demands. However, the revocation of pseudonym certificates in large-scale, resource-constrained context has posed a significant challenge. The global revocation status is susceptible to disruption by localized anomalous events. Moreover, as the scale of revocation grows, the synchronization process becomes increasingly vulnerable to attacks and incurs high overhead. To decouple the global revocation status from local revocation events, we propose a spatial-temporal pseudonym revocation and verification framework that supports batch pseudonym revocation within resilient revocation cycles. Revoked pseudonyms within the event area are locally filtered, while other pseudonyms are characterized by maintaining a proof to attest their consistent and legitimate status. To improve the efficiency of revocation status updates and mitigate centralization risks, a distributed caching and proof update strategy assisted by edge nodes is presented. Extensive simulations based on real-world large-scale datasets demonstrate that PV-STR scheme significantly reduces the vulnerability window, communication overhead, and memory consumption compared to state-of-the-art approaches.
- 16 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Green Communications and Networking
- Vol. 7 (2) , 839-854
MDC Enhanced IoT Networks: Network Modeling and Performance Analysis
As a promising architecture, Mobile Data Collector (MDC) enhanced Internet of Things (IoT) exhibits broad prospects in efficient data collection and data aggregation especially for sparse deployment scenarios. Combining the tools from queueing theory and stochastic geometry, we propose an analytical framework to study the network performance of an MDC enhanced IoT network, in terms of coverage probability, end-to-end delay and energy consumption. We derive the closed-form expressions for average contact and inter-contact time between a sensor and its associated MDC. By modeling the data collection system between a sensor and its associated MDCs as an M/G/1 queue system with vacations and general limited (G-limited) service, we first derive the queueing delay at the tagged sensor, and further obtain the end-to-end delay. The proposed analytical framework enables us to quantify the effect on network performance of key system parameters, such as MDC velocity, packet arrival rate, densities of sensors and MDCs, and contact radius. This study reveals that the MDC velocity has little impact on the coverage probability, and provides guidelines to minimize the end-to-end delay by optimizing the density and contact radius of sensors, and the velocity and density of MDCs.
- 16 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Green Communications and Networking
- Vol. 7 (2) , 839-854
MDC Enhanced IoT Networks: Network Modeling and Performance Analysis
As a promising architecture, Mobile Data Collector (MDC) enhanced Internet of Things (IoT) exhibits broad prospects in efficient data collection and data aggregation especially for sparse deployment scenarios. Combining the tools from queueing theory and stochastic geometry, we propose an analytical framework to study the network performance of an MDC enhanced IoT network, in terms of coverage probability, end-to-end delay and energy consumption. We derive the closed-form expressions for average contact and inter-contact time between a sensor and its associated MDC. By modeling the data collection system between a sensor and its associated MDCs as an M/G/1 queue system with vacations and general limited (G-limited) service, we first derive the queueing delay at the tagged sensor, and further obtain the end-to-end delay. The proposed analytical framework enables us to quantify the effect on network performance of key system parameters, such as MDC velocity, packet arrival rate, densities of sensors and MDCs, and contact radius. This study reveals that the MDC velocity has little impact on the coverage probability, and provides guidelines to minimize the end-to-end delay by optimizing the density and contact radius of sensors, and the velocity and density of MDCs.