Skip to content

MAPS‐PBFT: Mobility‐Aware Persistent‐Survivor PBFT for Vehicular Networks

Jul 2026 · Concurrency and Computation · Vol 38 · 0 citations · 28 references

TL;DR

MAPS‐PBFT is proposed, a mobility‐aware orchestration layer around unmodified PBFT, a mobility‐aware orchestration layer around unmodified PBFT that discriminates between viable and non‐viable committees.

Abstract

PBFT provides deterministic finality under Byzantine faults but assumes stable committee membership, an assumption that breaks in vehicular networks where mobility‐driven churn can render committee members unreachable mid‐protocol. Existing IoV adaptations filter participants by trust or reputation, or modify the protocol's internal structure, yet none assess whether a selected committee will survive the full consensus execution window. We propose MAPS‐PBFT, a mobility‐aware orchestration layer around unmodified PBFT. The framework explicitly partitions the fault budget into a Byzantine slice be$$ {b}_e $$ and a mobility‐loss slice he$$ {h}_e $$ , treating mobility‐induced unreachability as crash‐equivalent failure. Committee selection is formulated as a survivability‐constrained problem over a logical multi‐hop committee graph: candidates are scored by beacon freshness, multi‐hop communication delay, predicted displacement, and inter‐vehicle proximity, then assembled via greedy incremental construction that rewards intra‐committee reachability. A model‐based launch score, derived from a joint formulation of mobility and Byzantine‐membership risk, gates each consensus instance through a user‐configurable threshold. To make the scope of our claims explicit, we distinguish components that are theoretically developed (the joint Monte Carlo launch score, the mobility‐loss budget, and the view‐change–inclusive execution horizon), fully implemented (mobility‐aware committee selection and epoch orchestration around unmodified PBFT in a full IEEE 802.11p co‐simulation), and approximated in the present experiments (a deterministic proxy for the candidate score, with the launch gate evaluated post hoc and view changes disabled). A 756‐run co‐simulation using OMNeT++, INET, Veins, and SUMO across three topologies and four vehicle densities shows that MAPS outperforms six baselines, improving average success rate by +30.7% over random, +8.8% over nearest, and +10.2% over connectivity‐only selection, with advantages that widen as committee size grows. Post hoc threshold analysis confirms that the launch score discriminates between viable and non‐viable committees, raising conditional success from 76.0% to 92.8% at a moderate gate threshold.

View source

Similar papers

Aug 2026

Optimizing Real‐Time Vehicular Communications With a Cross‐Layer Model for Energy‐Efficient Clustering and Blockchain‐Based Congestion Control

This work introduced an integrated cross‐layer framework featuring three innovative algorithms: mobility‐aware black hole clustering (M‐BHC), energy‐aware piranha optimization algorithm (EPOA), and cross‐layer multi‐attribute blockchain routing with congestion control (CL‐MABRC).

K. Satheshkumar, S. Ramalingam, A. S. Babu et al. · 0 citations
Open access Sep 2026

BlockLLM-E2MR: Blockchain-attested LLM-guided energy-efficient multipath routing for mobile ad hoc networks

BlockLLM-E2MR, a blockchain-verified large-language-model-guided multipath routing framework where the language model cannot directly implant a route is proposed, a blockchain-verified large-language-model-guided multipath routing framework where the language model cannot directly implant a route.

H. S · 0 citations
Review Open access 2026

Rogue Base Station Detection in 5G/6G Vehicular Networks: A Comprehensive V2X-Oriented Taxonomy, Evaluation Framework, and Research Roadmap

A vehicular-oriented survey of RBS detection in 5G and beyond networks, explicitly addressing mobility-constrained detection, handover-security interactions, and V2X safety requirements that are not systematically addressed in prior surveys, which primarily focus on pre-5G threat models, IMSI-catcher attacks, or genera...

Roland Lamptey, Mohammad Saedi, V. Stankovic et al. · 0 citations
Jul 2026

Layered Trust-Aware Routing with Latency-Security Tradeoff Optimization in Maritime Networks

A layered trust-aware routing framework that couples task-hierarchical service control with security-aware deep reinforcement learning and uses a dynamic weighted fusion DQN to select the next hop from the screened candidates based on behavioral reputation, jurisdictional/policy attributes, geo-situational awareness, a...

Bo Lin, Lian-You Lai · 0 citations
Open access 2026

Lightweight TinyML-Enhanced Task Offloading in VANETs for Next-Generation Intelligent Transportation Systems

A Tiny Machine Learning-enhanced, credibility-based task offloading framework for real-time decision-making in vehicular networks, and the RF and TinyLSTM models fit automotive-grade microcontroller budgets, confirming practical deployability for next-generation Intelligent Transportation Systems (ITS).

Muhammad Ali, Tariq Qayyum, A. Tariq et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.