SearcharxivSearch

arXiv subjects

Tallha Akram

Publications and source records attributed to Tallha Akram.

3 recordsLinked to original sources

Amplitude-Belief Reinforcement Learning for Adaptive Cyber Defense in Partially Observable V2X Networks

The Internet of Vehicles (IoV) creates a partially observable and adversarial V2X communication environment in which malicious vehicles may evade defensive mechanisms. Existing IoV intrusion-detection methods provide limited support for sequential mitigation under adaptive attacker behavior. This paper formulates IoV cyber defense as a partially observable sequential decision problem and proposes Quantum Belief-Integrated Reinforcement Defense (Q-BIRD), an amplitude-belief reinforcement learning framework. Q-BIRD represents uncertainty over hidden attacker intent through a normalized complex-valued belief state and converts amplitudes into intent probabilities. The resulting belief features are used by a Proximal Policy Optimization defender to select cost-aware mitigation actions. Experiments are conducted in a SUMO-OMNeT++ and Veins V2X co-simulation environment. Q-BIRD reduces mean cumulative damage from 36.0 +- 5.5 to 28.0 +- 3.0 and damage variance from 12.0 +- 2.8 to 6.0 +- 1.5 compared with PPO using classical Bayesian belief. The attack success rate decreases to 0.05 +- 0.02, while survival probability increases to 0.96 +- 0.02. Communication-level results show that Q-BIRD maintains a packet delivery ratio of 0.94 +- 0.02, latency of 45 +- 6 ms, throughput of 3.60 +- 0.15 Mbps, and service availability of 0.95 +- 0.02. Explainability analysis using SHAP, LIME, and Grad-CAM suggests that belief-related features contribute strongly to mitigation decisions. These results indicate that amplitude-based belief modeling can improve both cyber-defense stability and V2X communication reliability under partial observability.

cs.CR

Communication-Aware Quantum-Inspired Reinforcement Learning for Cyber-Resilient V2X Intrusion Detection and Mitigation

Smart cities rely on Internet of Vehicles (IoV) networks for critical services. However, this vast connectivity enlarges the attack surface, exposing vehicular systems to evolving cyber threats. Conventional static defenses struggle to autonomously adapt to these dynamic, multi-stage intrusions. To address this, we propose the Communication Aware Quantum Inspired Reinforcement Learning (CA-QIRL) framework, built on a lightweight deep Q-Network architecture for autonomous cyber defense. V2X defense is formulated as a communication-aware Markov Decision Process (MDP). The agent observes intrusion, mobility, Road Side Unit (RSU), and communication metrics to select optimal mitigation actions. CA-QIRL integrates quantum-inspired encoding, rotation exploration, and an interference reward, combined with a cost function penalizing false negatives, false positives, delay, packet loss, and RSU overload. Experimental evaluations on vehicular intrusion datasets and a mobility-aware V2X simulation demonstrate robust performance. CA-QIRL achieves competitive detection accuracies of 97.89% on CICIDS2017 and 80.31% on CAN-MIRGU, outperforming state-of-the-art ensemble methods in inference latency. Furthermore, end-to-end delay and Channel Busy Ratio (CBR) drop by up to 95.7% and 90%. Statistical significance is confirmed on ROAD and VeReMi. These findings establish CA-QIRL as a highly practical and resilient defense mechanism for next-generation V2X and IoV networks.

cs.CR

Towards Prevention of Sportsmen Burnout: Formal Analysis of Sub-Optimal Tournament Scheduling

Scheduling a sports tournament is a complex optimization problem, which requires a large number of hard constraints to satisfy. Despite the availability of several such constraints in the literature, there remains a gap since most of the new sports events pose their own unique set of requirements, and demand novel constraints. Specifically talking of the strictly time bound events, ensuring fairness between the different teams in terms of their rest days, traveling, and the number of successive games they play, becomes a difficult task to resolve, and demands attention. In this work, we present a similar situation with a recently played sports event, where a suboptimal schedule favored some of the sides more than the others. We introduce various competitive parameters to draw a fairness comparison between the sides and propose a weighting criterion to point out the sides that enjoyed this schedule more than the others. Furthermore, we use root mean squared error between an ideal schedule and the actual ones for each side to determine unfairness in the distribution of rest days across their entire schedules. The latter is crucial, since successively playing a large number of games may lead to sportsmen burnout, which must be prevented.

math.NA