Research On The Key Techniques Of Routing For Opportunistic Network

With the rapid development of mobile Internet, more and more opportunity network applications.Opportunistic network is a self-organizing network which nodes communicate by moving nodes havechance to meet without the existence of a complete link between the source node and the destination node.In opportunistic networks, nodes move frequently and the links between nodes are frequently broken. Sothe node adopt “store-carry-forward” mode to communicate. While network routing protocols andcongestion control brought great challenges by the intermittent and mobility of opportunistic networks. Andtraditional routing protocols and congestion control strategies are unable to adapt to the opportunisticnetworks.Therefore, research on routing protocols and congestion control are key points in opportunisticnetworks. For data delivery and network congestion problems based on the analysis of existing methods,and we proposed based on forwarding strategy clustering opportunistic routing algorithms and based oncongestion control strategy opportunistic routing algorithm. The main contributions of the thesis are asfollows.Firstly, to improve the data delivery ratio in opportunistic networks, according to the characteristics ofthe relationship between the node and the node itself, we proposed a cluster-based opportunistic networkdata delivery algorithm.According to the characteristics of the node itself and we designed clustering withthe number of successful transmission of information between the nodes and the other, and forwardmessages based on the relationship between the encounter node and the destination cluster in order toefficiently deliver the message to the destination node, and improve the success rate of transmissionbetween nodes of information. The simulation results show that the algorithm can improve messagedelivery ratio and reduce information delays.Secondly, In order to solve congestion problems that opportunistic routing forwarding node prioritysetting resulting, and we propose a routing algorithm based on chance Congestion Control. According tothe delivery value of the information in congestion node and the characters of neighbor nodes，theinformation in congestion node is transferred to the neighbor nodes. If the congestion node have notneighbor nodes, and discard high delivery value information，thus easing congestion. Simulation results demonstrate that the algorithm can effectively improve the success rate of message delivery and effectivesolution to the congestion problem.For the data delivery and network congestion study in opportunistic networks,we proposed thecorresponding solution for the data delivery and congestion control technology. These proposed methodsabove will promote the study and provide a valuable reference in this area.