A group mobility model for ad hoc wireless networks
MSWiM '99 Proceedings of the 2nd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Using redundancy to cope with failures in a delay tolerant network
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Erasure-coding based routing for opportunistic 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
Contact-Based Mobility Metrics for Delay-Tolerant Ad Hoc Networking
MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Message ferry route design for sparse ad hoc networks with mobile nodes
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Performance analysis of mobility-assisted routing
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Context-aware multicast routing scheme for disruption tolerant networks
Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
Research challenges towards the Future Internet
Computer Communications
Quota-Based Multicast Routing in Delay-Tolerant Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.24 |
Some ad hoc network scenarios are characterized by frequent partitions and intermittent connectivity. Hence, existing ad hoc routing schemes that assume that an end-to-end path exists from a source to a destination do not work in such challenging environment. A store-and-forward network architecture known as the disruption tolerant network (DTN) has been designed for such challenging network environments. Several unicast and multicast routing schemes have been designed for DTNs. However, the existing multicast routing schemes assume a route discovery process that is similar to the existing ad hoc network routing approach. Thus, in this paper, we design an encounter-based multicast routing (EBMR) scheme for DTNs which uses fewer hops for message delivery. We first describe how the EBMR scheme works and then present an analytical framework to estimate the delivery performance of the EBMR scheme. Next, we present some comparisons of the analytical and simulation results to show that our analytical framework provides delivery performance estimates that match closely the observed simulation results. Last but not least, we present simulation results to study the delivery performance of EBMR in different scenarios, e.g. different mobility models, different multicast group size, different number of multicast groups and different node speed. We also compare the performance of the EBMR scheme with other DTN multicast strategies. Our simulation results indicate that the EBMR scheme can achieve higher delivery ratio while maintaining high data transmission efficiency compared to other multicast strategies.