Study On Game-theory Based Routing Protocol With Pediction

The wireless network is gradually replacing the traditional wired network in people’s daily life. Because of its independence, mobility and distribution.As the realization of the cost of mobility and independence, wireless network, especially the node of Ad Hoc Networks are usually restricted in computing power, storage capacity, battery capacity, etc. Therefore, compared with the fixed nodes in a network, mobile nodes are more incentives for selfish purposes. It may refuse to provide network services to other nodes. This selfish behavior caused adverse effect to the overall performance of the network. It also limits the normal work of the node itself.In order to reduce the impact of selfishness brings wireless nodes, In order to reduce the effects of wireless node selfish, the researchers introduced game theory in the study of the routing protocol. By setting reasonable incentive and restriction mechanism, game routing algorithm can effectively eliminate the motivation for node’s selfishness and keeping normal network node working.According to the Nash solution concepts and Ad-hoc VCG algorithm, we introduced a Gametheory-based routing-algorithm with pridiction(GRWP). This algorithm reduced The computational difficulty of the trust value to improve the efficiency of routing,and introduced the Predictive reservation mechanism to control the selfishness of wireless nodes. In the simulation, by contrast with the VCG algorithms and LSTOP algorithms show that the GRWP algorithm provides a higher packet delivery ratio than VCG algorithm. On the other hand, due to the prediction algorithm is independent, so it can be adjusted by changing the prediction algorithm for routing performance, leading to a more flexible routing function.