Routing Algorithm Based on Multi-Community Evolutionary Game for VANET
Vehicular Ad Hoc Network (VANET) is a special application of Mobile Ad Hoc Networks in road traffic, which can autonomously organize networks without infrastructure. VANET that consists of many community nodes is characterized by lack of guaranteed connectivity. The right operation of such a network requires nodes to cooperate on the level of packet forwarding. When a node wants to transmit a message to another node, the message can be opportunistically routed through relay nodes under the hypothesis that each node is willing to participate to forward. However, nodes belonging to different communities may choose selfish behavior when considering their limited resources such as energy, storage space and so on. Their purpose is maximizing their own payoff. Thus, a new routing algorithm specifying certain message forwarding strategies is a necessity in such networks. In this work, we study main properties of sparse VANET. We presents a routing algorithm based on the evolutionary game, Multi-Community Evolutionary Game Routing algorithm (MCEGR), to solve the selfish routing problem. The theoretical analysis and simulation results show that the proposed routing has better feasibility and effectiveness.