Efficient routing algorithm in opportunistic network

Abstract

The invention provides an efficient routing algorithm (PMSF algorithm) in an opportunistic network. Improvement is performed based on SAW. The transmission performance of a relay node is fully considered in the distribution phase. An improved Prophet delivery prediction function is applied to act as a utility value for allocation of message copies. The success rate of message transmission of the relay node is higher when the transmission prediction value indicated by the delivery prediction function is higher so that more message copies are allocated to the node, and the blind equal distribution mechanism in the classic SAW message distribution phase can be eliminated. Meanwhile, a Direct Delivery passive routing mode of the waiting phase is changed into active routing, and the waiting phase is named as a forwarding phase so as to be better fit with the message multi-hop forwarding mechanism of the active routing phase, and the message is forwarded to the relay node capable of rapidly meeting with a destination node as much as possible by utilizing a Markov time interval prediction model. The principles of efficiency and trustiness are both considered so that the copies can be rapidly distributed and effectively transmitted, and transmission stability and reliability can also be guaranteed.

Description

technical field [0001] The invention belongs to the technical field of Internet communication, and in particular relates to an efficient routing algorithm and device in an opportunistic network. Background technique [0002] In an opportunistic network environment, network resources are relatively scarce and difficult to schedule. The traditional Epidemic routing algorithm based on the flooding strategy often consumes excessive network resources. In order to solve this problem, the Spray and Wait (SAW) routing algorithm came into being. . The SAW routing algorithm not only has the advantages of the rapid diffusion of Epidemic algorithm message copies, but also has the characteristics of the simplicity of the design idea of ​​the DirectDelivery algorithm. The whole process can be described as: the source node and the intermediate node that obtains part of the message The network environment distributes message copies. After meeting the conditions of direct delivery, it activ...

AI Technical Summary

Problems solved by technology

[0004] From the entire message delivery process, it can be analyzed that the routing protocol has the following defects: the difference of relay nodes is ignored in the dissemination stage, such as the transmission potential of relay nodes, transmission reliability, and resource utilization of nodes themselves. The number of copies of the message is allocated, ignoring the impact of the difference of the nodes; the nodes in the waiting phase just silently wait for the appearance of the destination node, and will not consider using other nodes with good performance to forward the message in the process, and cannot Make good use of existing network resources to achieve the final delivery goal

As far as the frequently used BinarySprayandWait classic algorithm is concerned, in the distribution process, only half of the message copies are simply and blindly copied to the meeting nodes. The strategy of fixedly allocating message copies makes the process inflexible, blind and random

Secondly, the network in the real world is often heterogeneous, and the energy that the network environment can provide to each node cannot be exactly the same, so the model of distributing message copies equally is also unreasonable

[0006] The message transmission mode of direct delivery used in the waiting phase is also not flexible enough. Assuming that during this process, the relay node or source node with a partial copy of the message is confined to a narrow active area, it will appear in the lifetime of the message. In the case of being unable to meet the destination node, the message can only be discarded, so that the destination node cannot be reached, which makes the performance of the routing algorithm decline in some specific network scenarios

Images