A game based routing algorithm for congestion control of multimedia transmission in VANETs

When transmitting multimedia files in urban Vehicle Ad hoc Networks (VANETs), the routing protocol will find multiple next hops with different quality because of the intensive nodes. Owing to the selfishness of the nodes, all of the multimedia streams try to seize the high quality nodes, attempting to maximize their usage of the high quality nodes. Consequently, it would inevitably lead to network congestion, affecting the QoS performance of the network, and even cause network paralysis. To solve the problem, this work presents a shunting of multimedia game model and a game based routing algorithm for congestion control of multimedia transmission in VANETs. In this game model, each stream carrying messages is a player, and its strategy is to select the percentage of the steam routed through the high quality nodes. A payoff function based on node metrics is proposed. The existence and uniqueness of a Nash Equilibrium is proved. Finally, the results of simulation demonstrate the effectiveness of GRCCM.