Message Cooperative Sharing Based On Coalition Formation Game For Vehicular Ad Hoc Networks

The intelligent development of the transportation system can effectively alleviate the existing traffic problems.VANETs has attracted extensive attention in industry and academia as the intersection of intelligent transportation systems and the Internet of Things.The high-speed movement of vehicle nodes and the dynamic changes of the network topology in VANETs causes a delay in node communication and even to be interrupted.In this case,the cooperative communication sharing technology is applied to the node communication of VANETs.The service messages are distinguished from each other according to the application type.Nodes form coalitions based on the type of service messages they process.And that cannot be accessed adopt relay cooperation to retransmit messages.which can improve the efficiency of nodes receiving data packets and reduce the intermittent connection problems between nodes.The problem of intermittent connection that occurs when nodes are communicated in VANETs.We model The relationship between the type of messages they process in VANETs and coalitions is regarded as a cooperative sharing problem as a coalition formation game among nodes.Coalitions formation function is a distributed mechanism model that runs on each node in the network.Service messages are categorized according to types and nodes associate with a coalition based on the type of service-message they process.If nodes are interested in a certain type of service message,coalition formation function decides whether the node will leave the coalition through the partition principle or re-select the new coalition by using the incentive it acquired in the coalition.The dynamic mobility of vehicle nodes and the random switching of message access in VANETs,And make the nodes constantly use the principle of segmentation and merging to determine the optimal response alliance.There are many factors that affect the incentive changes of coalition nodes.In this paper,we mainly analyzes the performance of the in-vehicle network under the coalition formation game algorithm based on three types of factors:message type,node speed and number of coalitions.Theoretical analysis and simulation show that this algorithm can effectively improve the efficiency of receiving data on the network.According to the problem of the communication interrupt in the cooperative sharing coalitions,a cooperative algorithm based on cooperative game is proposed.When nodes in the coalitions cannot be accessed,the neighboring nodes near the node can retransmit the message as a relay cooperating node.In the coalition partition,a network topology structure with the sending node as the root is created,and the node selects through autonomous decision.Responsive nodewith the best response.The theoretical analysis and simulation results show that the cooperative game based relay cooperation algorithm can significantly improve the transmission delay in the cooperative sharing alliance.