Abstract
Recent advancement in IoT technology has boosted the healthcare domain with enormous usage of IoT devices to provide elevated services to patients with chronic disorders on a real-time basis by the incorporation of IoT sensors on patients’ bodies. However, providing services ensuring security and maintaining the privacy of patients is a challenging task. Blockchain technology promises security in a distributed environment but popular consensus algorithms such as Proof of Work (PoW) and Proof of Stake (PoS) require huge computational resources and energy by making the IoT environment inefficient. This paper introduces a secure Practical Byzantine Fault Tolerance (PBFT) consensus-based lightweight blockchain algorithm for healthcare applications. To strengthen the PBFT consensus, highly trusted nodes were allowed to participate in the consensus algorithm using the Eigen Trust model and Verifiable Random Function (VRF) to select a random primary node from a group of trusted consensus nodes. The proposed algorithm is tested in a simulated environment and evaluated against the traditional PBFT consensus algorithm considering throughput, latency, and fault tolerance.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
