Probabilistic Routing Algorithm Based On Transmission Capability Of Nodes In DTN

DTN(Delay Tolerant Network)is a network of intermittent connectivity,which is no complete path to end to end between nodes most of the time,its main features are discontinuous connection,long delay,finite resource,and so on.It leads a great challenge for the efficient transmission of messages.In solving the connectivity between different network areas and network environments,the DTN system adopts a new protocol layer called the bundle layer between the application layer and the transport layer in the ISO model.Through the bundle layer,the nodes in the DTN can communicate in an intermittent environment.During the development of DTN,many classic routing algorithms are proposed,such as Epidemic,Spray and Wait,PROPHET,etc.These algorithms have their own advantages,but there are also some shortcomings and deficiencies.For example,when selecting the relay node,the probabilistic routing algorithm judges whether to send the message only by the probability routing table that the node meets the sink node without fully considering the property of the node.Therefore,in this paper,the concept of node transmission capacity is proposed based on the actual situation of the network and the node diversity,and then the probability routing algorithm based on node transmission capability is proposed.The algorithm combines the advantages of probabilistic routing,possesses better delivery and overhead performance.The main contents of this article structure and algorithm innovation is as follows:Firstly,this paper introduces the characteristics and architecture of DTN,expatiates the Bundle layer and its protocol and storage and transmission mechanism in DTN,and analyzes its routing mechanism and packet transmission strategy in detail.Introduce the classification of common routing algorithms,and analyze and demonstrate the principles and routing policies of common multi-copy routing algorithms.Secondly,we analyze the shortcomings of the probabilistic routing algorithm and the blindness that may exist in practice.We will focus on filling the missing areas and demonstrate the importance of measuring node characteristics.Combining these characteristics of the node with the constant transmission rate of the node to propose the concept of node transmission capability.Thirdly,based on the node transmission capabilities,a probabilistic routing algorithm based on node transmission capabilities is proposed.The node's transmission capacity in the past period of time is integrated into the traditional probabilistic routing update formula,resulting in a new routing algorithm.The new algorithm enables the node to measure the historical transmission capability of the next hop node when selecting the next hop node.The simulation results show that compared with the spread route and the probability route,the new algorithm reduces the network overhead while improving the delivery rate.In summary,based on the study of the nature of nodes,this paper proposes a probabilistic routing algorithm based on node transmission capabilities.The new algorithm fully integrates this important message carrier node into the routing strategy.This algorithm has a certain research significance by judging the transmission capability of nodes and selecting relay nodes more reasonably,thus increasing the delivery rate and reducing the network overhead.