DAGIoV: A Framework for Vehicle to Vehicle Communication Using Directed Acyclic Graph and Game Theory

Data sharing and content offloading among vehicles is an imperative part of the Internet of Vehicles (IoV). A peer-to-peer connection among vehicles in a distributed manner is a highly promising solution for fast communication among vehicles. To ensure security and data tracking, existing studies use blockchain as a solution. The Blockchain-enabled Internet of Vehicles (BIoV) requires high computation power for the miners to mine the blocks and let the chain grow. Over and above, the blockchain consensus is probabilistic and the block generated today can be eventually declared as a fork and can be pruned from the chain. This reduces the overall efficiency of the protocol because the correct work done initially is eventually not used if it becomes a fork. To address these challenges, in this paper, we propose a Directed Acyclic Graph enabled IoV (DAGIoV) framework. We make use of a tangle data structure where each node acts as a miner and eventually the network achieves consensus among the nodes. A game-theoretic approach is used to model the interactions between the vehicles providing and consuming offloading services. The proposed model is proven to be highly scalable and well suited for microtransactions or frequent data transfer among the nodes in the vehicular network.This work was supported in part by the National Key Research and Development Program under Grant 2017YFE0125300, in part by the National Natural Science Foundation of China-Guangdong Joint Fund under Grant U1801264, in part by the JiangsuKey Research andDevelopment Program under Grant BE2019648, in part by FCT/MCTES through national funds and when applicable cofunded EU funds under Project UIDB/EEA/50008/2020, and in part by Brazilian NationalCouncil for Scientific andTechnologicalDevelopment (CNPq) under Grant 309335/2017-5