Blockchain-Based Incentive-Compatible Reputation Management System in Vehicular Networks

Blockchain-Based Incentive-Compatible Reputation Management System in Vehicular Networks

Rui Men, Xiumei Fan, Xuguang Yang
Copyright: © 2022 |Pages: 16
DOI: 10.4018/IRMJ.291695
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

In Vehicular Networks, vehicles share information to improve traffic efficiency and safety. However, false information incurs severe damage or injuries because of malicious nodes. Althogh many schemes have been implemented for detection of false information,, there are problems concerning inadequate data security, large processing delay, weaker precision in detecting malicious nodes. In this paper, we put forward a Blockchain-based incentive-compatible trust management system. It provides a succinct and effective incentive mechanism to stimulate vehicles to broadcast road-related emergency information and vicinity vehicles to evaluate its timeliness. We also propose a novel method to calculate the reputation score to reflect the history behavior better. The transactions on the reputation scores are recorded in a consortium Blockchain consisted by Road Side Unit (RSU). The system has been experimentally validated to have a lower time delay and higher accuracy, and more accuracy reputation scores in Vehicular Networks.
Article Preview
Top

1. Introduction

It is estimated that the number of registered vehicles will reach 2 billion within the next 10 to 20 years (Jia et al, 2015). With the rapid increasement in the number of vehicles, the development of Vehicular Networks has attracted more and more attentions in recent years. However, the security issues of Vehicular Networks still exist and hinder its development (Contreras-Castillo et al., 2017; Indu, 2019; Lo and Tsai, 2007). In order to improve the security of the whole process of information transmission and sharing, the best method is to ensure the reliability of the devices in Vehicular Networks, such as forming a trusted execution environment (Gurung et al., 2013). Blockchain technology has shown great potential to solve these problems (Yang et al.,2019; Huang et al.,2020; Kang et al.,2019).

Nevertheless, the characteristics of the Vehicular Networks are different in the cryptocurrency. Firstly, Bitcoin and Ethereum can only handle 7 and 15 transactions per second respectively. They onlymeet the need of the reputation transactions in Vehicular Networks. Second, the participants in cryptocurrency’s transactions are deterministic and the transactions can be confirmed by the signatures of every participants. In contrast, the transactions in Vehicular Networks are the addition or subtraction of reputation score based on the vehicle’s action of sending or forwarding messages, so they are determined by the neighbors’ feedbacks about the message (Moreira, E.,2019). Lastly, the cryptocurrency transactions should exist permanently but of the vehicles’ reputation could be deleted because of some reasons such as the scrappage.

Considering the security issues and the abovementioned problems of the Vehicular Networks, we proposed a Vehicular Networks reputation system on Hyperledger Fabric2.0 (Fabric, H.,2019). In our system, a vehicle gets a reputation score from the actions verified by its neighbors and is punished by the selfish or malicious actions through lowering its reputation scores. Given in the scenario of a crash, a vehicle broadcasts this message to other vehicles and RSUs. RSU receives such message and opinions from other vehicles on this message, then calculate the accuracy score and decide whether it is true. If the affirmative score from the neighbors exceeds a certain threshold, a certain reputation score will be given. RSU will reduce reputation scores when the vehicles do some selfish or malicious actions leading the negative opinions from the neighbors exceed a certain threshold. After confirmation, these transactions will be recorded in the Blockchain through the Hyperledger Fabric project.

In Vehicular Network, some selfish nodes are reluctant to report events and evaluate the message it received because of resources or power constraint. This will severely hinder the development of the Intelligent Transportation System. Therefore, we design an effective incentive mechanism to encourage vehicles to send a message as soon as a road-related event is found and to make an objective evaluation of the authenticity of the message. Indu et al. (2019) speculated that a reputation system that combines data-based and entity-based would be best suited for Vehicular Networks. To improve the accuracy of verifying whether the message is correct or not, we combine the data-based method with the entity-based method together. The reputation score used to show the trustworthiness of a vehicle will create a very secure environment in Vehicular Network, but there is no specific calculation method of reputation value so far, we propose an AIMD (Additive Increase Multiplicative Decrease) method to calculate the reputation score. To preserve the privacy information of user’s identity, we store and share the reputation scores and related behaviors of vehicles in a distributed Consortium Blockchain.

The rest of the paper is structured as follows: A review of related works on reputation system in Vehicular Networks and the Blockchain technology in Vehicular Networks’ security is presented in Sections II-a, II-b respectively. Section III describes the system model. Analysis on the system performance and security issues has been presented in section IV. Section V presents the details of the experiment. Moreover, the conclusion is contained in Section VI.

Complete Article List

Search this Journal:
Reset
Volume 37: 1 Issue (2024)
Volume 36: 1 Issue (2023)
Volume 35: 4 Issues (2022): 3 Released, 1 Forthcoming
Volume 34: 4 Issues (2021)
Volume 33: 4 Issues (2020)
Volume 32: 4 Issues (2019)
Volume 31: 4 Issues (2018)
Volume 30: 4 Issues (2017)
Volume 29: 4 Issues (2016)
Volume 28: 4 Issues (2015)
Volume 27: 4 Issues (2014)
Volume 26: 4 Issues (2013)
Volume 25: 4 Issues (2012)
Volume 24: 4 Issues (2011)
Volume 23: 4 Issues (2010)
Volume 22: 4 Issues (2009)
Volume 21: 4 Issues (2008)
Volume 20: 4 Issues (2007)
Volume 19: 4 Issues (2006)
Volume 18: 4 Issues (2005)
Volume 17: 4 Issues (2004)
Volume 16: 4 Issues (2003)
Volume 15: 4 Issues (2002)
Volume 14: 4 Issues (2001)
Volume 13: 4 Issues (2000)
Volume 12: 4 Issues (1999)
Volume 11: 4 Issues (1998)
Volume 10: 4 Issues (1997)
Volume 9: 4 Issues (1996)
Volume 8: 4 Issues (1995)
Volume 7: 4 Issues (1994)
Volume 6: 4 Issues (1993)
Volume 5: 4 Issues (1992)
Volume 4: 4 Issues (1991)
Volume 3: 4 Issues (1990)
Volume 2: 4 Issues (1989)
Volume 1: 1 Issue (1988)
View Complete Journal Contents Listing