Jingxiao Ma

Jingxiao Ma

Auto-generated profile, based on publicly available information

Jingxiao Ma

College of Electronic and Information Engineering, Tongji University, Shanghai, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
9 December 2019 in IEEE Access
Verified
Journal Article
Open access
CZChunhua Zhang
Chunhua Zhang
XXXiaoping Xue
Xiaoping Xue
LFLijuan Feng
Lijuan Feng
XZXin Zeng
Xin Zeng
JMJingxiao Ma
Jingxiao Ma
Anonymous authentication has significant contribution to privacy protection in safety message dissemination for Vehicular Ad Hoc Networks (VANETs); however, it suffers from heavy workload of vehicle revocation check and message signature verification, which leads to unsatisfactory timeliness and high message loss rate in heavy traffic situations. To manage these challenging problems, this paper proposes an efficient safety message authentication protocol for VANETs by combining batch group signature verification and our proposed Group Session Key (GSK). Specifically, our signature verification method for safety message can both achieve computation efficiency by reducing the number of computation operations of bilinear pairing and resist impersonation attack by using tracking key implement. GSK is associated with the forward and backward keys and is only shared among unrevoked vehicle within a group. Performance analysis and simulations demonstrate that our protocol can provide promising security against various common types of attackers and is more efficient than traditional group-signature-based authentication protocols, in terms of computation time cost, authentication delay and message loss rate.

12 August 2024 in IEEE Transactions on Sustainable Computing
Verified
Journal Article
Closed access
XCXing Chang
Xing Chang
MOMohammad S. Obaidat
Mohammad S. Obaidat
JMJingxiao Ma
Jingxiao Ma
XXXiaoping Xue
Xiaoping Xue
YYYantao Yu
Yantao Yu
XWXuewen Wu
Xuewen Wu
In the Internet of Vehicles (IoV), data privacy concerns have prompted the adoption of Federated Learning (FL). Efficiency improvements in FL remain a focal area of research, with recent studies exploring model pruning to lessen both computation and communication overhead. However, in the IoV, model pruning presents unique challenges and remains underexplored. Pruning strategy design is critical as it directly impacts each vehicle's learning latency and capacity to participate in FL. Furthermore, FL performance and model pruning are intricately connected. Additionally, the fluctuating number and mobility states of vehicles per round complicate determining the optimal pruning ratio, closely intertwining pruning with vehicle selection. This study introduces Vehicular Federated Learning with Adaptive Model Pruning (VFed-AMP) to tackle these challenges by integrating adaptive pruning with dynamic vehicle selection and resource allocation. We analyze the impact of pruning ratios on learning latency and convergence rate. Then, guided by these findings, a joint optimization problem is formulated to maximize the convergence rate concerning optimal vehicle selection, bandwidth allocation, and pruning ratios. Finally, a low-complexity algorithm for joint adaptive pruning and vehicle scheduling is proposed to address this problem. Through theoretical analysis and system design, VFed-AMP enhances FL efficiency and scalability in the IoV, offering insights into optimizing FL performance through strategic model adjustments. Numerical results on various datasets show VFed-AMP achieves superior training accuracy (e.g., at least 13.4% improvement for BelgiumTS) and significantly reduces training time (e.g., at least up to 1.8x for CIFAR-10) compared to traditional FL methods.

20 February 2025 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
XCXing Chang
Xing Chang
MOMohammad S. Obaidat
Mohammad S. Obaidat
JMJingxiao Ma
Jingxiao Ma
XXXiaoping Xue
Xiaoping Xue
Recently, Federated Learning (FL) has been advanced for Vehicular Crowdsensing (VCS), termed F-VCS, to enable collaborative learning without sharing private data, thus promoting privacy. However, the mobility of Intelligent Connected Vehicles (ICVs) leads to dynamic changes among FL participants, becoming one of the main challenges limiting F-VCS performance, as these dynamics can affect model training stability and accuracy. Current research primarily addresses these dynamics through ICV selection and resource optimization mechanisms. However, due to the lack of an effective method for characterizing ICV mobility, these approaches often rely on making binary judgments based on certain constraints (e.g., learning delay) rather than comparing the ICVs' mobility characteristics. As a result, they may not yield the most efficient outcomes for adapting to vehicular network dynamics, affecting overall system performance. This paper introduces a Grid-Assisted FL framework for VCS, named VCS_GAFL, which measures ICV mobility using a grid-cell model. Unlike traditional binary selection methods, our approach utilizes participation probabilities to capture the mobility differences among individual ICVs, guiding more precise and effective ICV selection and enhancing the VCS system's overall performance and adaptability. Specifically, we introduce an MMP-V model to predict ICV participation probabilities in F-VCS tasks. We then derive expressions for the impact of ICV participation probabilities on expected FL loss and ineffective energy consumption and formulate an optimization problem to jointly optimize ICV participation probabilities, wireless resource allocation, and ICV selection to minimize these impacts. By solving this problem, we derive a closed-form solution for wireless resource allocation and propose a probability-guided ICV selection strategy. Experimental results demonstrate that VCS_GAFL significantly enhances global accuracy, highlighting its potential and value in improving F-VCS services.

11 August 2025 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
XCXing Chang
Xing Chang
MOMohammad S. Obaidat
Mohammad S. Obaidat
XXXiaoping Xue
Xiaoping Xue
JMJingxiao Ma
Jingxiao Ma
Under non-independent and identically distributed (non-IID) data conditions, static weighted aggregation strategies in Federated Learning (FL) often fail to reflect each client's effective contribution to the global objective. This limitation may induce gradient conflicts, leading to unstable convergence and model performance degradation. To address this issue, we propose a Gradient Projection-guided Adaptive aggregation strategy for Federated Learning (GPAFed). We derive a novel convergence bound that explicitly incorporates the projection of local gradients onto the global gradient, revealing its quantitative influence on global loss reduction in FL. Building on this insight, we formulate a projection-based client contribution metric and design an adaptive aggregation weighting strategy inspired by the softmax mechanism. This approach strengthens the influence of high-contribution clients while attenuating the adverse effects of low-quality updates. Finally, we provide a theoretical guarantee that the proposed strategy achieves a tighter convergence bound. Extensive experiments under diverse non-IID conditions demonstrate that GPAFed consistently outperforms strong baselines in terms of model accuracy, convergence speed, and robustness.

30 April 2024 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
YYYantao Yu
Yantao Yu
XXXiaoping Xue
Xiaoping Xue
JMJingxiao Ma
Jingxiao Ma
SZSongnian Zhang
Songnian Zhang
YGYunguo Guan
Yunguo Guan
RLRongxing Lu
Rongxing Lu
The proliferation of intelligent connected vehicles (ICVs) has catalyzed the emergence of vehicular crowdsensing (VCS) applications, wherein sensing tasks are assigned to ICVs with abundant sensing resources and high mobility. To select workers whose future trajectories have sufficient spatio-temporal similarity with the target sensing area, workers unavoidably need to upload their trajectories to the VCS platform that is not fully trusted, thereby triggering location privacy concerns. Recently, numerous privacy-preserving worker selection schemes have been put forth. Nevertheless, they either fail to enable flexible arbitrary query ranges or incur substantial communication and computation costs, which severely limits their suitability for VCS applications. To tackle the above two issues simultaneously, we propose a novel efficient and privacy-preserving VCS worker selection scheme that supports flexible arbitrary spatial ranges. By utilizing the Bloom filter technique and lightweight cryptographic tools, our proposed scheme allows the VCS platform to efficiently collaborate with the fog server to compute the spatio-temporal similarity without leaking location-derived Bloom filters. Rigid security analysis shows that our scheme effectively preserves the location privacy of both workers and the query user. Extensive experiments are conducted and the results demonstrate that our scheme is significantly more efficient in both communication and computation compared with the state-of-the-art scheme.

2 July 2025 in IEEE Systems Journal
Verified
Journal Article
Closed access
XCXing Chang
Xing Chang
MOMohammad S. Obaidat
Mohammad S. Obaidat
CXChenbin Xu
Chenbin Xu
JMJingxiao Ma
Jingxiao Ma
XXXiaoping Xue
Xiaoping Xue
YYYantao Yu
Yantao Yu
Vehicular crowdsensing (VCS) leverages data exchange among intelligent connected vehicles (ICVs) to support diverse intelligent applications, making privacy protection essential due to the sensitivity of shared data. Federated learning (FL) combined with differential privacy (DP) has emerged as a powerful approach for safeguarding privacy in such distributed systems. Due to the unique characteristics of vehicular networks, many VCS tasks are inherently linked to spatial and temporal factors. This article focuses on these VCS tasks within the context of a complex system, where ICV mobility serves as a central factor that dynamically influences interconnected aspects such as task matching accuracy, participation rates, and DP noise consistency. The multifaceted impact of ICV mobility on these elements requires a comprehensive analysis to understand its cascading effects on privacy protection and model performance within FL-based VCS. To address these complexities, we propose DFed-ADP, a dynamic FL framework with an adaptive DP mechanism tailored for VCS. DFed-ADP includes a rigorous theoretical derivation to quantify the influence of ICV mobility on the DP noise scale and a dynamic ICV selection strategy that prioritizes data importance and adapts to mobility patterns. Specifically, we introduce an adaptive user-level DP and derive a closed-form expression to quantify the impact of ICV mobility on noise variance. Then, based on theoretical analysis, we propose an efficient ICV selection scheme that ensures participating ICVs can provide high-value data and complete training tasks on time. These designs ensure a robust balance between privacy and model performance. Experimental results demonstrate the adaptability and efficiency of DFed-ADP, achieving significant accuracy improvements under independent and identically distributed (IID) and non-IID settings in VCS.