Energy-Efficient Blockchain Consensus Mechanisms for Scalable Smart Contract Execution in IoT Networks

Aarav Mehta, Nisha Verma, Rohan Kulshreshtha, Kavita Rao

Abstract


Internet of Things (IoT) deployments generate large volumes of sensor and
actuator events, while many devices operate under strict energy, memory,
bandwidth, and latency constraints. Blockchain-based systems can support
tamper-evident coordination and smart-contract automation across
organizations, but consensus and replicated execution can add
communication, computation, storage, and energy overhead. This paper
reviews the design trade-offs of common consensus families—including proof of work (PoW), proof of stake (PoS), proof of authority (PoA), practical
Byzantine fault-tolerant (PBFT-style) protocols, crash-fault-tolerant leaderbased protocols, and directed acyclic graph (DAG)-oriented approaches—in IoT contexts. It proposes a reference architecture in which constrained devices perform sensing and lightweight validation, edge gateways aggregate and batch events, and appropriately selected validator nodes order transactions and execute smart contracts. The paper defines a reproducibleevaluation plan using energy per confirmed transaction, throughput, end-toend latency, communication overhead, fault tolerance, and contract executioncost. Because no experimental measurements were supplied or collected for this manuscript, comparative descriptions are qualitative and no numerical performance advantage is claimed. The central conclusion is that consensus selection should be driven by the trust model and workload rather than by a single universal ranking.

KEYWORDS: Blockchain; Internet of Things; consensus mechanisms; energy efficiency; smart contracts; edge computing; scalability; PBFT; proof of authority.


Full Text:

PDF 57-69

Refbacks

  • There are currently no refbacks.