SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
The PIM architecture for wide-area multicast routing
IEEE/ACM Transactions on Networking (TON)
Multicast operation of the ad-hoc on-demand distance vector routing protocol
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
OSPF: Anatomy of an Internet Routing Protocol
OSPF: Anatomy of an Internet Routing Protocol
On-demand multicast routing protocol in multihop wireless mobile networks
Mobile Networks and Applications
Distributed QoS Routing with Imprecise State Information
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Multicasting in delay tolerant networks: semantic models and routing algorithms
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Handbook On Theoretical And Algorithmic Aspects Of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
Scalable routing in delay tolerant networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Efficient Interdomain Multicast Delivery in Disruption Tolerant Networks
MSN '08 Proceedings of the 2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks
An optimal probabilistic forwarding protocolin delay tolerant networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Multicasting in delay tolerant networks: a social network perspective
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Journal of Computer and System Sciences
The Journal of Supercomputing
Agent-based multicast opportunistic routing protocol for wireless networks
Proceedings of the 2nd ACM workshop on High performance mobile opportunistic systems
Hi-index | 0.00 |
Delay tolerant networks (DTNs) are a special type of wireless mobile networks which may lack continuous network connectivity. Multicast is an important routing function that supports the distribution of data to a group of users: a service needed for many potential DTN applications. While multicasting in the Internet and in mobile ad hoc networks has been studied extensively, efficient multicasting in DTNs is a considerably different and challenging problem due to the probabilistic nature of contact among nodes. This paper aims to provide a non-replication multicasting scheme in DTNs while keeping the number of forwardings low. The address of each destination is not replicated, but is assigned to a particular node based on its contact rate level and active level. Our scheme is based on a dynamic multicast tree where each leaf node corresponds to a destination. Each tree branch is generated at a contact based on the compare-split rule proposed in this paper. The compare part determines when a new search branch is needed, and the split part decides how the destination set should be partitioned. When only one destination is left in the destination set, we use either wait (no further relay) or focus (with further relay) to reach the final destination. The effectiveness of our approach is verified through extensive simulations. Ratio-based-split performs best in the compare-split step, both in synthetic and real traces. Using the wait scheme can reduce the number of forwardings, while using the focus scheme can reduce the latency.