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.
Elastic Proof-of-Location Byzantine Fault Tolerance is proposed, a privacy-preserving and location-aware blockchain consensus framework for IoT systems that reduces communication overhead and improves consensus efficiency compared with conventional PBFT-based approaches while strengthening resilience against location-based and identity-based attacks.
Yunus Kareem, D. Djenouri, Essam Ghadafi· Future Internet· 0 citations
This study qualitatively examines ten widely used consensus algorithms within the research context of Bintan, Riau Islands, Indonesia and indicates that DAG/IOTA and Hashgraph achieve the highest throughput with minimal latency, making them suitable for IoT and enterprise-scale applications.
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
A blockchain-based dynamically adaptive restructuring framework that enables real-time IoV cluster restructuring by splitting overloaded IoVs to reduce communication overhead, or merging nearby IoVs to optimize resource utilization, offering a proactive, adaptive security paradigm for intelligent transportation frameworks.
Jiawei Shi, Yebo Feng, Konglin Zhu et al.· ACM Transactions on Internet...· 0 citations
This 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
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