Routing Methods in Opportunistic Networks

Abstract

The invention discloses a routing method for an opportunity network. The method comprises the following steps: determining other all neighbor nodes N for a message carried by a current message carrying node C before transmission; determining moving speeds of the message carrying node C, all the neighbor nodes N and a destination node D at a current moment; and acquiring moving speed included angles theta<C> and theta<N> between the message carrying node C and the destination node D as well as between the neighbor nodes N and the destination node D at the current moment, selecting a relay node R, acquiring the position of the node D at a next moment through a transition probability matrix in a node position prediction model, determining a distance between the message carrying node C and the destination node D and a distance between the relay node and the destination node D at the next moment, acquiring forwarding priorities P<m> of different messages in node buffer, and making a decision of forwarding to a relay node R by the message carrying node C. As proved by a simulation experiment, compared with an existing routing method, the method has the advantages that a priority buffer management strategy is provided, so that efficient utilization of buffer space is realized; the message successful delivery rate is increased; and the overhead ratio and average transmission delay are reduced.

Description

Technical field [0001] The present invention relates to the technical field of opportunistic networks, in particular to a routing method based on node meeting position prediction in opportunistic networks. Background technique [0002] The opportunistic network is a self-organizing network that does not require a complete link between the source node and the target node, and uses the encounter opportunities brought by node movement to achieve communication. Due to the high latency, sparse node density, node mobility and other factors, its topology is dynamic and changeable. In order to realize the communication between the source node and the destination node under the changeable network topology, a "storage" is adopted. The "carry-forward" strategy delivers the message to the destination node hop by hop. [0003] It is precisely because there is no need for a complete communication path between nodes, opportunistic networks can handle some problems that wireless network technolog...

AI Technical Summary

Problems solved by technology

But at present, it is difficult for them to be directly applied to opportunistic networks. Due to the dynamic changes of the topological structure of opportunistic networks, the actual location of nodes changes all the time, which makes the accuracy of routing selection worse, and the performance of such algorithms will decline.

[0006] The nodes in the opportunistic network are constantly moving, which leads to the inability to accurately predict the location of the destination node. At the same time, most of the existing routing algorithms consider the historical encounter information such as the encounter probability and contact time between nodes, and ignore the actual location change caused by the movement of nodes in the network. Case

Images