DTN Routing Algorithm Based On Message Copies Control

The Delay Tolerant Network (DTN), which covers Wireless Sensor Network,Ad-hoc Network and Star Network, has a wide application in the military, terrestrial forcivilian and scientific detection. In addition, it’s one of the current emerging interests ofresearchers in the world. The delay of the DTN is large, the node connects intermittently,and the storage capacity of the node is limited, so the traditional routing algorithms arenot suitable for DTN. In view of this special network environment, in order to improvethe existing high energy consumption problem of the opportunistic routing algorithms,we propose a new algorithm named BCSNW. BCSNW is inspired by Simple Countingprotocol, which is able to improve the Binary Spray and Wait algorithm. It greatlyreduces the network load and ensures a higher message transmission rate and strongexpansibility by controlling the messages copies in the network.To solve the problems of DTN, we studied the DTN routing algorithms based onthe opportunistic routing. Just as follows:(1) Because of the uncertainty of the routing protocols without a priori knowledge,the opportunistic routings lack the quantitative analysis of these protocols. This paperquantified the message carriers to control the message copies in the network.(2) The routing performance depends on the density of nodes, node capacity andmovement models and so on, part of the protocols assume that the capacity of theconnections is finite, and the node capacity is unlimited, these are all not practical.Aiming at the limit of the buffer memory space of nodes and other network resources,this paper solved the problem of excessive network overhead by flooding routingalgorithm, and enhanced the practical applicability of the algorithm.(3) The existing routing protocols assume different environment for DTN and theirgoals are different, which result in problem in comparing the performances of differentprotocols and affect the application of these protocols. Based on Simple Countingprotocol and Spray and Wait algorithm, which aimed to reducing the network load, thispaper proposed a better algorithm.