University of Bahrain
Scientific Journals

Space Optimized Multicast in Delay Tolerant Networks

Show simple item record Tripathi,Anshuman 2018-07-31T08:49:34Z 2018-07-31T08:49:34Z 2013
dc.identifier.issn 2210-1519
dc.description.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. en_US
dc.language.iso en en_US
dc.publisher University of Bahrain en_US
dc.rights Attribution-NonCommercial-ShareAlike 4.0 International *
dc.rights.uri *
dc.subject Space Optimized
dc.subject Multicast
dc.subject Delay Tolerant Network
dc.subject Node importance
dc.subject Tree-based multicast
dc.title Space Optimized Multicast in Delay Tolerant Networks en_US
dc.type Article en_US
dc.volume 01
dc.issue 02
dc.source.title International Journal of Computing and Network Technology
dc.abbreviatedsourcetitle IJCNT

Files in this item

This item appears in the following Issue(s)

Show simple item record

Attribution-NonCommercial-ShareAlike 4.0 International Except where otherwise noted, this item's license is described as Attribution-NonCommercial-ShareAlike 4.0 International

All Journals

Advanced Search


Administrator Account