With the fast expanding scale of vehicular networks, vehicular edge computing (VEC) has emerged and attracted growing attention from both industry and academia. Parked vehicles (PVs) have great potential to join vehicular networks for sharing their idle computing and networking resources. However, due to the underlying security and privacy threats, it is challenging to fairly motivate PVs for resource sharing in an efficient and secure way. In this paper, we propose a permissioned vehicular blockchain for secure and efficient resource sharing in VEC, namely, Parkingchain. We first design smart contract to achieve secure resource sharing and efficient service provisioning between PVs and service requesters (SRs). A multi-weight subjective logic based delegated Byzantine Fault Tolerance (DBFT) consensus mechanism is presented to improve the consensus process in Parkingchain. Further, we design a contract theory-based incentive mechanism to model the interactions between SR and PVs under asymmetric information scenario. Finally, numerical results demonstrate that the proposed incentive mechanism is effective and efficient compared with existing schemes.
The paradigm of Internet of Things (IoT) is paving the way for a world, where many of our daily objects will be interconnected and will interact with their environment in order to collect information and automate certain tasks. Such a vision requires, among other things, seamless authentication, data privacy, security, robustness against attacks, easy deployment, and self-maintenance. Such features can be brought by blockchain, a technology born with a cryptocurrency called Bitcoin. In this paper, a thorough review on how to adapt blockchain to the specific needs of IoT in order to develop Blockchain-based IoT (BIoT) applications is presented. After describing the basics of blockchain, the most relevant BIoT applications are described with the objective of emphasizing how blockchain can impact traditional cloud-centered IoT applications. Then, the current challenges and possible optimizations are detailed regarding many aspects that affect the design, development, and deployment of a BIoT application. Finally, some recommendations are enumerated with the aim of guiding future BIoT researchers and developers on some of the issues that will have to be tackled before deploying the next generation of BIoT applications. This paper describes a new replication algorithm that is able to tolerate Byzantine faults. We believe that Byzantinefault-tolerant algorithms will be increasingly important in the future because malicious attacks and software errors are increasingly common and can cause faulty nodes to exhibit arbitrary behavior. Whereas previous algorithms assumed a synchronous system or were too slow to be used in practice, the algorithm described in this paper is practical: it works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude. We implemented a Byzantine-fault-tolerant NFS service using our algorithm and measured its performance. The results show that our service is only 3 slower than a standard unreplicated NFS.