Delay tolerant network (DTN) routing strategy under light-weight infantry combat brigade scene

Abstract

The invention belongs to the technical field of wireless communication and discloses a delay tolerant network (DTN) routing strategy under light-weight infantry combat brigade scene and based on a messenger directly under data. The messenger directly under the data comprises a routing sequence and a transmission information sequence, the routing sequence represents a moving sequence and is composed of serial numbers of transmission nodes, and a first number and a last number of the routing sequence are only a source node. The transmission sequence represents information which a transmitted by digital distribution frame (DDF) to each node, when the DDF reaches one target node and after the DDF finishes transmitting the information which a given by a data source to the node, the information is removed from the information sequence, the data source controls the messenger directly under the data, the other nodes can not request the DDF to conduct independent transmission, the DDF moves according to the routing sequence provided by a list, and finally the DDF returns to the data source. The DNT routing strategy of the messenger directly under the data has the advantages of being high in transmission efficiency and little in transmission interference.

Description

technical field [0001] The invention belongs to the technical field of wireless communication, and in particular relates to a DTN routing strategy in the scene of a light mechanized field brigade. Background technique [0002] DTN (Delay Tolerant Networks) is a delay tolerant network. In some specific network environments, such as interstellar networks, military Ad hoc networks, sensor networks, and vehicle Ad hoc networks, network disconnections often occur, causing messages to be disconnected during transmission. The end-to-end path cannot be guaranteed in the network, so DTN is usually used to realize wireless data transmission in harsh or interfered environments. [0003] The light mechanized field brigade scenario is a special communication scenario in which the routing path is partially known, there is no end-to-end link, communication resources are scarce, and communication confidentiality is extremely high. For this scenario, many previous studies have not obtained ...

AI Technical Summary

Problems solved by technology

In the known DTN routing strategies based on "data mule" and "postal" agents, it is inevitable to encounter a problem: these units that undertake inter-node communication tasks are often shared by all nodes, so the corresponding algorithm must Balance the communication needs between all nodes

[0005] In the light mechanized field brigade scenario, first of all, the infection routing strategy cannot be used, because each action team has a strict order of travel, and it is also deliberately arranged to be out of the direct communication area with each other; the jet waiting routing strategy requires the information source, that is, the command The headquarters sends out multiple copies of data at a time and moves randomly within the area. In this scenario, the headquarters has extremely limited communication resources, and multiple data copies are likely to expose the location of the headquarters to the outside world during the waiting process.

In addition, some routing strategies based on historical information cannot be deployed in this scenario due to the limitations of the scenario and the inability to communicate directly between group nodes.

Images