Research On Optimization Of Routing Protocol With Mobile Ad Hoc Networks Based On Game Theory

With the rapid development of wireless communication technology, Mobile Ad Hoc Networks (MANET) is widely applied in battlefield communications, sensor networks, and other fields. MANET has the characteristics of the fast, dynamic and distributed, etc. The communication system does not need fixed infrastructure. And the communication is relying on the mutual cooperation between the internal nodes. The factors such as routing overhead, resource sharing should be considered to realize load balancing because of the drawbacks of energy limitation, dynamic topology etc.Flooding is the basic method in Ad hoc network routing protocol, but it will produce a lot of redundant data which consume a lot of cyber resource. Therefore, the redundant packet should be limited to improve the routing performance. However, reducing the number of redundant flooding packets may lead to failure of network link. So, a delicate balance should be maintained between the routing overhead and network connectivity.This paper introduces a game theoretic method, called forwarding dilemma game (FDG), which controls routing overhead in dense multi-hop wireless ad hoc networks to minimize the flooding effect. Use the mixed Nash equilibrium strategy as a solution to the FDG to provide the forwarding probability for every node. The forwarding probability need to provide all the number of participants in the game, so this paper also proposes the neighbor discovery protocol.FDG with NDP is implemented in AODV protocol in Network Simulator NS2to verify its performance with simulations. At the basis of guarantee the basic network connectivity, FDG with NDP improves performance of the AODV compared to the same network with only AODV protocol in moderate and high node densities. FDG can be applied to any routing protocol that uses flooding in the route discovery phase.