Space Optimized Multicast in Delay Tolerant Networks

Abstract

Many multicast protocols for Delay Tolerant Networks fall in the class of tree based algorithms. Most of these tree computations aim to reduce the time taken by the message to reach its recipients. However, many scenarios have a greater demand to save on the space usage than on the time requirement. The present work proposes a tree computation technique that aims to reduce the duplication of messages in the network as a result of store-and-forward mechanism in tree based multicast. The proposed algorithm has been simulated on SLAW mobility model and shows a reduction in the number of copies of message in the network by as much as 75% (reducing to ¼ th of the number), compared to the Dynamic Tree Based Routing protocol.