Self-adaptive multi-injection waiting routing method based on social circle

Abstract

The invention discloses a self-adaptive multi-injection waiting routing method based on a social circle. The self-adaptive multi-injection waiting routing algorithm based on the social circle comprises an injection stage and a waiting stage, according to the method, a message carried by a node vi is forwarded to a destination node vd, a social circle of the node is constructed based on similarityin an injection stage, and different relay node selection strategies are adopted according to whether the node carrying the message is in the social circle of the destination node or not. In the waiting stage, an adaptive multi-injection strategy based on the delivery prediction value is carried out, and the strategy selectively carries out multi-injection on some messages with the copy number being 1. And after a certain message in the network is successfully delivered to the destination node, the node in the network is notified to delete the message successfully delivered to the destinationnode by using an ACK confirmation mechanism algorithm. The self-adaptive multi-injection waiting routing method based on the social circle is an efficient routing algorithm of a delay tolerant network.

Description

technical field [0001] The invention belongs to the technical field of delay-tolerant networks, and in particular relates to a social circle-based self-adaptive multi-spray waiting routing method. Background technique [0002] The delay-tolerant network does not require a complete link between the source node and the destination node, which is more in line with the actual requirements of the ad hoc network. It has a wide range of application prospects and use value in the fields of earthquake disaster emergency response, network communication in remote areas lacking infrastructure, sensor networks, etc., and has very important research significance. Due to the lack of stable connection paths between nodes, designing an efficient routing algorithm is the primary problem to be solved in the field of delay-tolerant network research. [0003] In most delay-tolerant network application scenarios, mobile devices with communication functions are mostly carried by humans, and human...

AI Technical Summary

Problems solved by technology

In most of the improved Spray and Wait algorithms, the initial number of copies of the message is fixed, which will make the algorithm unable to adaptively adjust the number of message copies according to the actual situation of the network, which has a certain blindness

When a message in the network is successfully delivered to the destination node, some relay nodes in the network still have a large number of copies of the message, and these redundant message copies are stored in the limited cache space of the node. If these relay nodes Nodes continue to perform forwarding operations on these useless redundant copies, which will greatly waste limited network resources, increase the network overhead of routing algorithms, and easily cause network congestion

Images