Sociality Tree Based Multicast Routing Protocol for Delay Tolerant Networks

Abstract

Delay Tolerant Network are a special class of wireless networks in which contact among the nodes are intermittent. The end to end path doesn't always exists, thus they follow the protocol of store and forward technique. Lately there has been a huge focus on DTNs and the applications of such networks. The major usage of such networks is during emergencies or after the natural calamities in the rehabilitation or in the battlefield or even in the deep space communication. Due to intermittent connection and node mobility two nodes may or may not be always able to communicate with each other. Also for changing positions of the node it is difficult task to group a set of nodes which creates multicasting a hard problem in DTN. Thus, selecting of the relay node, effective utilization and management of buffer highly effects the performance of the routing. In this we present a multicasting for DTNs. In this paper we are proposing a scheme which is based both on the actual interaction between the nodes as well as predicted ones. This helps in achieving better performance delivery for multicast routing in DTN.