Research On Mobile AD Hoc Network Node Cooperation Strategy Based On Game Theory

Mobile Ad Hoc Networks is a multi-hop self-organizing wireless network composed of mobile nodes equipped with the transceivers and receivers, both terminal nodes in the network are routers and terminals, and the network communication is based on all the nodes are willing to forward routing information to other nodes. However, in the actual Ad Hoc network, due to the restrictions of its own resources, there are conflicts between the energy consumption and overall energy consumption of the whole network. When forwarding data, some nodes in order to reduce their energy consumption and refuse to forward data, this may lead to the link interruption as well as the increase of the overall energy consumption. Therefore, the design of a safe and efficient node cooperation strategy is an effective method to solve the uncooperative behavior of the selfish nodes.In respect of the issues for Selfish nodes in Mobile Ad Hoc Networks, on the basis of the understanding of the domestic and foreign research to Mobile Ad Hoc Networks routing protocol, we combined the knowledge of the game theory and cooperation strategy network node. Suppressing the behavior of selfish nodes, prompting the honest cooperation of the nodes to improve the performance of the network. The main work and results of this paper are as follows:1. Analysis of the security problem of mobile Ad Hoc network faces, and then focuses on the performance, causes and classification of selfish nodes in the Ad Hoc network, finally analyzes the performance of the selfish nodes in whole network by experiment simulation.2. According to the characteristics of the selfishness of nodes, combined with the game theory, this paper proposes the prisoner’s dilemma model of node cooperation, and from the single game to repeated game process, and puts forward a kind of effective punishment to the selfish nodes, combined the behavior of long-term benefits with the behavior of node together, guide the nodes cooperate actively, and improve the performance of network, finally gives the analysis of Ad Hoc network node repeated prisoner’s dilemma game algorithm flow and the corresponding simulation.3. In respect of the practical applications for mobile Ad Hoc network, based on the "tit-for-tat" strategy (Tit-for-tat) based on TFT, this paper proposes an improved fault tolerance strategy of FTTFT (Fault-tolerant Tit-for-tat), and show that the method can avoid the impact due to network failure in a certain extent, and can reach a stable state of cooperation again after the failure occurs a period of time. The simulation results show that, FTTFT strategy can effectively suppress the selfish behavior of nodes, causes the nodes to reach stable cooperation.