Opportunistic Network Routing Protocol Based On Cooperative Game

In recent years,with the rapid development of Io T technology,the massive popularity of mobile smart devices in life and the increasing number of smart terminals,opportunity social networks are receiving wider and wider attention.In the context of today’s big data era,the number of messages generated in opportunity networks is growing exponentially,and the network resources required to consume them are also increasing,which plays a great test on the congestion control of opportunity networks.At the same time,more and more terminal devices are put into the opportunity network,and the terminal devices are under human control and have certain social attributes,among which the selfishness of the nodes plays a greater impact on the network performance.This paper establishes a comprehensive node effectiveness model and proposes an opportunity network routing algorithm based on the node effectiveness model,and introduces the idea of cooperative game in economics on this basis to propose a cooperative game-based incentive algorithm for opportunity networks,which is used to solve the current situation that the traditional routing protocol can hardly meet the forwarding demand under the extreme environment of high network load.The main work of this paper can be summarised as the following three points:1.based on the "store,carry and forward" characteristics of the opportunity network,a comprehensive performance model of nodes is established,and the NPM algorithm is proposed based on the comprehensive performance as the basis for forwarding.the NPM algorithm uses the performance value to represent the ability of nodes to forward messages,and based on this,cache control is applied to each node in three stages to avoid nodes from being overloaded with messages,which leads to network congestion.The NPM algorithm uses the performance value to represent the node’s ability to forward messages.2.The BCG algorithm is based on the NPM algorithm and introduces the cooperative game theory in economics to address the selfishness of the nodes in the actual use scenario of the opportunity network,and focuses on solving the problem of unsatisfactory performance of message delivery delay in the NPM algorithm.This paper introduces the integrated node performance model described in Chapter 3,which is oriented towards the success rate of forwarding,and focuses on maximizing the success rate of message forwarding for the cooperating nodes.3.Based on The ONE platform,this paper simulates the above algorithm in the platform,and sets up different simulation environments to simulate the performance of the algorithm in the process of practical application in different occasions.According to the simulation results of this paper,both the NPM algorithm and the BCG algorithm have high universality and can meet the requirements of the preset network.