A hierarchical federated learning framework with FedNova, game-theoretic matching, and QKD-assisted privacy for the internet of vehicles
TL;DR
A hierarchical federated learning framework for software-defined vehicular fog computing that combines FedNova, RBPS, and matching to enable faster model adaptation to evolving attacks and support real-time safety applications where delays above 400 ms can compromise road safety.
Abstract
The Internet of Vehicles (IoV) supports essential intelligent transportation applications but encounters challenges in federated learning (FL) due to non-independent and identically distributed (non-IID) data, vehicle mobility, resource heterogeneity, and strict privacy requirements in latency-sensitive scenarios such as misbehavior detection and accident response. Traditional FL methods, such as random client selection and standard FedAvg, often experience slow convergence and reduced performance under non-IID conditions. We introduce a hierarchical federated learning framework for software-defined vehicular fog computing. The framework incorporates FedNova (a normalized-averaging aggregation method for heterogeneous federated optimization) to produce normalized model updates under data heterogeneity, a Reward-Based Payoff Strategy (RBPS) for incentive-aware client selection, and game-theoretic vehicle-aggregator matching based on the college admissions problem. Privacy is strengthened through quantum key distribution (QKD)-assisted secure key establishment and classical gradient masking, with quantum circuit simulation used to assess future enhancements. The three-layer architecture includes vehicles, Roadside Unit (RSU)/ Base Station (BS)-level aggregators, and a Software-Defined Network Controller (SDNC) global aggregator. The framework uses both monetary and service-based incentives, such as toll exemptions, to encourage vehicle participation. Hybrid simulations using OMNeT++, Veins, SUMO, and the VeReMi misbehavior detection dataset show that the proposed approach achieves 94.8% classification accuracy [95% Confidence Interval (CI): 92.7–97.0 over 10 runs], converges in 120 rounds (33% faster than FedAvg), and reduces average latency by 29% (320 ms compared to 450 ms for FedAvg), with statistically significant improvements (p < 0.05). These gains enable faster model adaptation to evolving attacks (5–10 min shorter training cycles) and support real-time safety applications where delays above 400 ms can compromise road safety. Ablation studies confirm the complementary roles of FedNova, RBPS, and matching. Although quantum operations are currently simulated classically, the design remains compatible with future quantum hardware.