Abstract
The new IoT apps will not be able to inspire people to utilize them and may ultimately lose all their potential if an interoperable and trustworthy ecosystem is not provided. IoT has its extra security difficulties such as information storage, administration, privacy concerns, and authentication. The presently deployed IoT apps have encountered various security and privacy assaults globally. Due to being less secure and low powered, the IoT devices present a simple entryway to the adversaries to obtain access to the corporate networks, leading to giving easy control over all of the data of the users. The objective of this doctorate proposed work will be to solve the security associated difficulties in multiple IoT domains like the e-commerce, vehicular ad hoc networks (VANET), mobile ad hoc networks (MANET), and Internet of Drones (IoD). The proposed study focuses on the development of a distributed framework for IoT based on blockchain. The framework includes the usage of Ethereum-based smart contracts and auction models to increase the income and QoS for both the seller and the buyer and the development of a DAG chain-based distributed framework for parking lot allocation in a network of automobiles. The suggested model includes the requirement of obtaining agreement among the nodes with probability one in such a circumstance. The suggested model demonstrates to be predictable as typical voting-based consensus protocols like Practical Byzantine Fault Tolerance (PBFT) and at the same time can accommodate a high number of nodes even in an asynchronous setting. Research on Byzantine fault-tolerant systems has been ongoing for more than four decades, and although the solutions were shown to be feasible early on, they remained unworkable for a long time. With PBFT, the first feasible solution was provided in 1999, and this sparked fresh research that has resulted in unique applications that are still being developed today employing this technology. Despite the fact that the safety and liveness properties of PBFT-type protocols have been thoroughly investigated, when it comes to practical performance, only empirical results—often obtained in artificial environments—are known, and imperfections in the communication channels are not explicitly considered. It is our goal in this paper to propose the first performance model for PBFT that takes into account the effect of unreliable channels as well as the usage of alternative transport protocols across those channels. We also performed a large number of simulations to test the model and acquire a better understanding of the influence of different deployment factors on the total transaction timeframe.