Reasearch On The Mechanism Of Data Distribution Based On Game Theory In Oppotunistic Networks

Opportunistic network is a new kind of network evolved from delay tolerant network. It has the most properties of delay tolerant network, such as the unexpected network environment, the limited storage ability of single node, loss of communication from end to end, long delay and so on. In addition, some of the nodes are not fixed. Because these nodes are often moving, we should make use of this mobility characteristic to accomplish the message delivery. Limited by the short contact, we need a fast and rational distribution policy to manage the network data.Opportunistic network mainly research content distribution mechanism, including the routing strategy and buffer management. This paper studi es data distribution mechanism based on game theory mechanism in opportunistic network. First we apply the multi-party game ideas of game space geometry in the distribution of network data, after that we map the multi-game problems into the game of space geometry; finally use the geometric principles to solve network data distribution problem.Meanwhile, for the extremely unstable characteristics of network topology underlying results, nodes often have to carry the packets, so we have to design a reasonable caching strategy. We consider status of nodes and congestion in opportunistic network, combining the activity of nodes and copies in network to aid the cache design, aimed at improving the performance of the data distribution network opportunities and better opportunity to improve the performance of the network, such as the successful data transfer rate, network overhead and network and delay.Finally, because of the design principles of the utility function, with more resources(such as sufficient energy, plenty of cache, etc.) of the node will have a higher utility value, so that more resources will be able to collaborate node forwards data to other nodes, thus further improve the performance of the network, to prevent denial of selfish nodes in the network to forward data to other nodes, affect the overall performance of the network.