Study of a Routing Algorithm of Internet of Vehicles Based on Selfishness

摘要

The Internet of Vehicles (IoV) can aid driving and alleviate traffic congestion and reduce traffic accidents, which has attracted significant attention recently. However, the IoV faces many problems that must be solved due to its characteristics of self-organization, the limited bandwidth of wireless channels and the topological dynamics of nodes. The IOV involves communication among different types and combinations of nodes and requires relay nodes to participate in communication under different situations. However, nodes in the IOV often exhibit a certain selfishness as a result of the limitations of objective factors such as nodal resources and the influence of subjective attitudes. Therefore, it has become important to study how IOV can detect and stimulate the cooperation of selfish nodes. This paper designs an incentive cooperation model based on a punishment mechanism and a routing algorithm based on selfishness, called the Detect and Punish Selfishness (DPS) algorithm, which encourages nodes to cooperate and takes corresponding punitive measures when faced with harmful nodal selfish behaviors. The monitoring mechanism and the strict reward and punishment mechanism between nodes improves the effective communication among nodes. The results of a simulation show that the DPS can not only find the appropriate routing under limited node energy and rational selfishness conditions but also motivate excessively selfish nodes to participate in network activities.