Segmented routing method based on Markov decision process and network node

Abstract

The disclosure relates to a segmented routing method based on a Markov decision process and a network node. Aiming at the node encounter randomness of an opportunity network, the message forwarding is divided into a multi-copy forwarding phase and a single-copy forwarding phase on the basis of considering the balance between the delivery rate and the network load when the message is forwarded in the opportunity network according to the disclosure. In the multi-copy forwarding phase, the node which carries the message forwards the self-carried message copy to the encountered neighbor node according to the message copy transfer probability, the message copy forwarding process meets the Markov process, the parallel and efficient transmission among multiple copies can be guaranteed, and the network overhead and resource consumption can also be effectively controlled; when the number of the carried message copy is 1, the single-copy forwarding phase is entered; and in the single-copy forwarding phase, the probability that each node successfully submits the message is calculated based on the Markov decision process and is taken as the measurement index so as to ensure that the message can be forwarded to a more excellent relay node and then can reach the destination node more quickly.

Description

technical field [0001] The present disclosure relates to communication routing in a wireless communication network, in particular, to a segment routing method based on a Markov decision process and a network node. Background technique [0002] Due to the mobility and sparsity of nodes in mobile opportunistic networks, the topology of the network often changes, so there is rarely an end-to-end communication link between the destination node and the source node. This makes the traditional routing algorithm of "routing first-transmission later" in the traditional cellular mobile network relying on fixed facilities invalid. Considering the weak connectivity of mobile opportunistic networks, opportunistic routing currently adopts the store-carry-forward working mode. In this working mode, when a node receives a message forwarded by a node that meets randomly in the network, it first stores the message in its own cache, carries the message and continues to move randomly in the ne...

AI Technical Summary

Problems solved by technology

Due to the increase in the number of copies, the multi-copy routing strategy can be independently delivered to the destination node among multiple message copies in the network, which is equivalent to a single-copy routing strategy. The delivery rate and message delay of the multi-copy routing strategy have been greatly improved. , however, the increase in the number of replicas will also lead to an increase in network load, and the consumption of network resources is often large

Images