Jun 2026· International Conference on Mobile Data Management· pp. 76-86· 0 citations· 18 references
Abstract
Ensuring SLA-compliant service delivery in decentralized Edge–IoT environments remains challenging due to the lack of integration between SLA enforcement and consensus mechanisms. Existing approaches rely on external monitoring or rule-based enforcement, limiting effectiveness under dynamic and adversarial conditions. We present Proof of Game-Token Redistribution (PoGTR), a blockchain consensus protocol that embeds SLA-related outcomes into consensus decisions through incentive-driven token redistribution. Instead of explicit misbehavior detection, PoGTR regulates validator behavior based on observed service performance, enabling robustness under noisy and variable conditions. We evaluate PoGTR using a discrete-event blockchain simulator with realistic IoT workloads and network variability, comparing it with Avalanche, BECP, and Paxos with priority preemption. Using SLA-aware metrics, results show that PoGTR achieves the highest overall throughput (up to $3. 7 \mathrm{K}$ tx/s under multilayer hashing) while maintaining competitive SLA throughput under strict latency constraints, and the highest SLA throughput under relaxed objectives. Under adversarial scenarios, PoGTR maintains stable performance and consistent SLA satisfaction. Moreover, the sensitivity analysis of the approval-cluster size parameter $(k)$ further shows stable SLA-aware throughput across typical configurations, with limited variability only under extreme settings. These results demonstrate that integrating SLA evaluation into consensus enables effective decentralized SLA enforcement in Edge-IoT systems. To support reproducibility, the implementation and experimental framework are available by request at: https://github.com/TasneemMuneera/PyChainSiM.git.
The rapid growth of Internet of Things (IoT) systems has introduced significant challenges related to privacy, trust, scalability, and attack resilience, particularly in resource-constrained and location-sensitive environments. Existing blockchain consensus mechanisms provide decentralised trust, but they often suffer from high communication overhead, weak physical-context awareness, and limited privacy protection when deployed in large-scale IoT networks. This paper proposes Elastic Proof-of-Location Byzantine Fault Tolerance (EPoLBFT), a privacy-preserving and location-aware blockchain consensus framework for IoT systems. The proposed design enables IoT nodes to prove regional eligibility without revealing exact coordinates while restricting consensus participation to trusted and geographically verified validators. EPoLBFT is evaluated using the Blockchain IoT Consensus Algorithm (BICA) simulator under normal, high-load, Byzantine, Sybil, location-spoofing, and denial-of-service scenarios. The evaluation considers latency, throughput, communication overhead, energy consumption, and attack resilience. The results show that EPoLBFT reduces communication overhead and improves consensus efficiency compared with conventional PBFT-based approaches while strengthening resilience against location-based and identity-based attacks. The study also discusses the privacy–latency trade-off introduced by zk-PoL, the assumptions related to trusted location anchors, and the limitations of simulation-based evaluation.
Yunus Kareem, D. Djenouri, Essam Ghadafi· Future Internet· 0 citations
Blockchain consensus mechanisms are critical for ensuring security, efficiency, and scalability in decentralized networks. This study qualitatively examines ten widely used consensus algorithms—Proof of Work (PoW), Proof of Stake (PoS), Delegated PoS (DPoS), PBFT, Raft, Proof of Authority (PoA), Hybrid PoW/PoS, DAG/IOTA, Hashgraph, and Tendermint—within the research context of Bintan, Riau Islands, Indonesia. Performance was evaluated through literature review and simulated network observations, focusing on transaction throughput (TPS), latency, energy consumption, and network stability. Results indicate that DAG/IOTA and Hashgraph achieve the highest throughput with minimal latency, making them suitable for IoT and enterprise-scale applications. PoS and PoA offer energy-efficient alternatives, while PoW provides high security at the cost of high energy usage. Hybrid PoW/PoS demonstrates balanced performance across multiple metrics. Qualitative analysis highlights trade-offs among energy efficiency, throughput, latency, and decentralization. These findings provide practical guidance for selecting consensus mechanisms according to network requirements, operational constraints, and sustainability considerations, contributing a consolidated perspective on blockchain efficiency and scalability.
Dodi Setiawan¹, Sri Sutjiningtyas², A. Eka et al.· West Science Information Sys...· 0 citations
The introduction of blockchain technology has revolutionized decentralized systems. Blockchain enables peer-to-peer (P2P) transactions to be trustworthy and transparent. However, existing traditional consensus mechanisms such as Proof of Work (PoW) and Proof of Stake (PoS) have significant issues regarding computational costs, efficiency, and centralization, which severely limit their adoption in resource-constrained environments. For instance, in an industrial Internet of Things (IoT) network or a smart metering infrastructure, devices operate on strict energy budgets and cannot participate in compute-heavy PoW mining. They also lack the capital to lock up financial stakes for PoS. To address those limitations, randomized consensus mechanisms such as Pure Proof of Stake (PPoS) and Proof of Luck (PoL) were introduced. Yet these methods have issues with fairness, secure randomness generation, and cost efficiency. This paper proposes a new randomized proposer selection mechanism for blockchain consensus called Proof of Proximity (PoP) that enhances unpredictability, fairness, decentralization, and security. PoP replaces cryptographic randomness beacons with transaction-derived entropy and distance minimization. This enables fair, unpredictable proposer selection without relying on Verifiable Random Functions (VRFs), trusted hardware, or stakebased weighting, maintaining low computational overhead. The mechanism is ideal for IoT networks where resource consumption and security are critical. Experimental and comparative analysis results prove that PoP achieves improved fairness, decentralization, security, and low resource consumption, making it suitable for resource-constrained decentralized systems.
Nelum Ranawaka, L.A.M.S. Gawesh, G.O. Sundarasekara et al.· Annual International Compute...· 0 citations
The Internet of Vehicles (IoV) enhances road safety and supports autonomous driving through real-time communication, but current methods face key challenges: rigid resource allocation due to static architectures, communication failures in low-signal areas from infrastructure reliance, and passive defense mechanisms struggle to counter coordinated attacks, while high-latency encryption algorithms further compromise framework real-time performance. To address this, we propose a blockchain-based dynamically adaptive restructuring framework. It enables real-time IoV cluster restructuring by splitting overloaded IoVs to reduce communication overhead, or merging nearby IoVs to optimize resource utilization. In infrastructure-sparse zones, vehicles establish temporary multi-hop communication links based on relative mobility to ensure continuous connectivity. A multi-layered security mechanism integrates physical validation, event verification, and majority voting, achieving over 95% resistance to data tampering. Compared to Raft, PoS, and PBFT, our framework improves consensus speed by 27.06%–38.56%, and reduces transaction latency by 7%–35%, 15%–54%, and 27%–66%, respectively. It also maintains high robustness under dense traffic, high mobility, and weak signals, offering a proactive, adaptive security paradigm for intelligent transportation frameworks.
Jiawei Shi, Yebo Feng, Konglin Zhu et al.· ACM Transactions on Internet...· 0 citations
The integration of blockchain technology into Internet of Things (IoT) environments presents a fundamental conflict between the demand for robust, decentralized security and the severe computational constraints of IoT devices. While Proof-of-Authority (PoA) has emerged as an efficient consensus mechanism for permissioned networks, its inherent security model remains vulnerable to valid transactions from compromised or malicious nodes, a critical gap in existing protocols. This paper introduces PoA-TG Chain, a novel framework that enhances PoA with an integrated, lightweight Trust-Gating (PoA-TG) mechanism. This system assigns a dynamic, behavior-based trust score to each node, using it as a rapid pre-filter to reject transactions from untrusted actors before they enter the consensus process. Through a comprehensive simulation study, we conducted a rigorous comparative analysis of a standard PoA model against our proposed PoA-TG framework. The findings are definitive: the PoA-TG Chain framework reduced the success rate of malicious transactions from 25.35% in the standard PoA model to a mere 0.28%. This constitutes a 98.9% reduction in the remaining vulnerability, demonstrating the profound effectiveness of the trust-gating mechanism. This critical security hardening is achieved with remarkable efficiency, incurring only a 7.2% reduction in network throughput and a marginal 0.02% increase in average CPU load per transaction. Our work demonstrates that a dynamic, reputation-based security layer can provide near-total protection against the modeled threats at negligible performance cost, offering a viable, highly effective solution for securing resource-constrained IoT deployments.
N. N. A., A. T, Bhuvaneswari M.· Discover Internet of Things· 0 citations
To address the risks of centralized single-point failures and data privacy leaks associated with massive data storage in Intelligent Transportation Systems (ITS) and Vehicle-to-Everything (V2X) environments, this paper proposes a distributed secure storage architecture based on blockchain. However, traditional Practical Byzantine Fault-Tolerant (PBFT) algorithms suffer from scalability bottlenecks in large-scale dynamic networks, such as high communication overhead and low consensus efficiency. Therefore, this paper designs a hierarchical and reputation-aware improved consensus mechanism (H-PBFT). First, this mechanism introduces a geographical location grouping strategy, dividing all network nodes into several local consensus groups and leveraging edge computing characteristics to achieve rapid consensus within each group. Second, a multi-dimensional reputation evaluation model (comprehensively considering historical behavior, performance, and availability) is constructed to dynamically elect representative nodes from each group to participate in global consensus, thereby significantly reducing the communication complexity from O(N2). Simulation results show that compared with standard PBFT, Q-PBFT, and APBFT, H-PBFT exhibits significant advantages in consensus latency, throughput, and view switching recovery time, and maintains high system robustness even in complex network environments with malicious nodes.
Zhenhua Wang, Jiangang Hu, Xinmeng Wang et al.· Future Internet· 0 citations