Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On performance of PBFT for IoT-applications with constrained devices (2104.05026v2)

Published 11 Apr 2021 in cs.CR, cs.NI, and cs.PF

Abstract: Cyber-physical systems and the Internet of things (IoT) is becoming an integral part of the digital society. The use of IoT services improves human life in many ways. Protection against cyber threats is an important aspect of the functioning of IoT devices. Malicious activities lead to confidential data leakages and incorrect performance of devices are becoming critical. Therefore, development of effective solutions that can protect both IoT devices data and data exchange networks turns in to a real challenge. This study provides a critical analysis of the feasibility of using blockchain technology to protect constrained IoT devices data, justifies the choice of Practical Byzantine Fault Tolerance (PBFT) consensus algorithm for implementation on such devices, and simulates the main distributed ledger scenarios using PBFT. The simulation results demonstrate the efficiency of the blockchain technology for constrained devices and make it possible to evaluate the applicability limits of the chosen consensus algorithm.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Yaroslav Meshcheryakov (1 paper)
  2. Anna Melman (3 papers)
  3. Oleg Evsutin (2 papers)
  4. Vladimir Morozov (3 papers)
  5. Yevgeni Koucheryavy (42 papers)
Citations (4)

Summary

We haven't generated a summary for this paper yet.