Social Coalition-Based V2V Broadcasting Optimization Algorithm in VANETs

摘要

V2V broadcasting is a data transmission mode covering a local area in vehicle ad-hoc networks (VANETs). It can reduce the channel competition in traditional cellular mobile networks by transferring transmission tasks to it. However, V2V broadcasting has the problems of data redundancy, serious conflicts, and resource waste. Therefore, this paper optimizes V2V broadcasting from the perspective of social relations based on the fact that the vehicle network just is the human network. We establish a probabilistic model for evaluating current relationship intensity with the encounter time as parameter, and introduces historical information to revise the current value for reducing occasionally. Vehicles with strong ties form cooperative broadcasting coalition. Considering the effectiveness of relay coverage, probabilistic relay broadcasting based on distance is adopted in the coalition. The simulation results show that the algorithm can not only ensure high reachability, but also further reduce data redundancy and transmission delay in open-field and urban environments respectively.