Research On The Opportunistic Network Routing Mechanism Based On Message Copy Control

With the rapid development of science and technology,it becomes more and more frequent to use mobile devices for information exchange,which makes the prospects of opportunity network wider.The opportunistic network is a kind of delay network whose nodes are unevenly distributed and whose position changes at any time,characterized by unique operation model of "storage-carrying-forwarding" that ensures it can complete the information transmission when the network topology is constantly changing and the link is interrupted.Its features make the traditional network that relies on the fixed link transmission far from meeting the demands of the information transmission.Therefore,it is crucial to design a routing algorithm for opportunistic networks to solve that problem.Opportunity Network's resource consumption is the main criterion for determining the performance of routing,and the message copy amount is the main aspect of determining the cost of network resources.There are two routing algorithms.One is forwarding strategy based on single message replicas,and the other one is replication strategy based on multi-message replicas.The former one saves network resources,but it has low rate of message delivery and high rate of delay.The latter one can improve the delivery rate and reduce the delay to a certain degree,but the network will be filled with a large number of message copies,which causes network redundancy.Based on the existing routing algorithm,this paper focuses on the network resource consumption problem,and proposes two routing algorithms—a message replica adaptive routing algorithm based on the transfer depth control and the message replica dynamic control routing algorithm based on network coding.The thesis discusses from the following two aspects:(1)This paper proposes a message replica adaptive routing algorithm from the controlling the total number of message copies and reducing resource consumption,combined with social network transmission characteristics and K fork tree routing and transmission strategy.Relying on the depth of network operation,the algorithm dynamically selects the number of nodes carried by the replica of the network topology on each layer,and limits the total amount of the message replicas in combination with the social network six degree spatial transmission theory.Simulation results show that this algorithm can improve network transmission and success rate of delivery under the condition of controlling the total message copy amount and reducing the consumption of network resources compared with similar algorithms.(2)Network coding can increase the amount of information carried by nodes to achieve the maximum network information flow.The way of mixing Network Coding with Opportunity Routing can control the total number of message replicas and reduce network resource consumption.Starting from the integration of coding strategy,this article proposes the routing algorithm of message replica dynamic control which combines with network coding,aiming to further reduce the network resources.According to the depth of the network topology to determine the timing of coding,the algorithm dynamically selects the number of nodes participating in the encoding,and uses random linear coding for information fusion.Compared with other similar algorithms,simulation results show that this algorithm can improve network transmission and success rate of delivery on the basis of reducing the consumption of network resources.On the issues of reducing the resource consumption of Opportunity network routing,this paper proposes two routing algorithms from controlling the total number of message replicas.The former has comparative advantages in the delivery success rate and transmission delay;while the latter can further save network resources through the integration of coding strategies.Both algorithms have advantages in terms of network resource consumption,delivery rate,and transmission latency,so people can apply them into different fields.