BUFFER ADAPTIVE DISTANCE BASED ROUTING PROTOCOL FOR DTN

Abstract

Delay Tolerant network has the characteristics of being dynamic, spontaneous and have a number of mobile node. The Delay tolerant network uses the dynamic nature of its mobile nodes to transmit data from one place to another place and to gain access to internet. Epidemic is the simplest routing protocol used in the DTN networks. It floods the bundle (message) to other nodes in its coverage area until it reaches the destination. We have modified the epidemic protocol it will send bundle only to those nodes who have at least two connections, is close to destination and with minimum buffer load. Along with this sending strategy we have implemented and compared buffer strategies in epidemic. As we know that epidemic follows First In First Out algorithm. In this thesis, the implementation and comparison of three more strategies based on the encounter age of the node, first is to delete the bundle whose destination has been encountered by the this node most recently and second is to delete the bundle whose destination has been encountered by the this node least recently and the third one deletes the bundle whose destination is farthest. All three algorithms performed far better than the conventional epidemic protocol.