An encounter-based multicast scheme for disruption tolerant networks

Xi, Yong; Chuah, Mooi Choo

doi:10.1016/j.comcom.2008.09.031

Cited by 31 publications

(11 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The tree-based scheme is more cost-saving than others, but the maintenance of the tree structure is tough in DTNs. OS-Multicast [30], EBMR [31], and Delegation-Multicast [32] are all tree-based schemes. This paper considers another multicast application according to user interests.…”

Section: Related Workmentioning

confidence: 99%

Quota-control routing in delay-tolerant networks

Lo¹,

Tsai²,

Lai³

2015

Ad Hoc Networks

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

Quota-control routing in delay-tolerant networks

Lo¹,

Tsai²,

Lai³

2015

Ad Hoc Networks

View full text Add to dashboard Cite

“…There are probability-based multicast protocols (EBMR [9], CAMR [10]), two hop-relay multicast protocols (RELAYCAST [17]), etc. Because social characteristics are more stable than the mobility features in DTNs.…”

Section: Related Workmentioning

confidence: 99%

“…In order to design a robust multicast approach, the mobility features of DTNs have been explored, such as the forwarding probability-based protocols [9] [10]. However, DTNs usually have social characteristics which are more stable than their mobility features.…”

Section: Introductionmentioning

confidence: 99%

Sociality-Based Buffer Management for Multicast in DTNs

Deng

Chang

2013

2013 Fourth International Conference on Emerging Intelligent Data and Web Technologies

View full text Add to dashboard Cite

In Delay Tolerant Networks (DTNs), multicastis widely adopted for emergency notification in crisis environments and data scattering under military rescue situations, due to its robustness and high resource utilization. Although the topology of DTNs is highly dynamic, they also demonstrate relatively stable social characteristics, e.g., the social centrality. In this paper we propose a sociality-based buffer management for multicast routing (SBMR), where nodes with high social centrality are selected in priority as relay nodes. As choosing nodes with high centrality may result in large transmission workload on these nodes, and consequently they have to drop messages frequently when the buffer space is limited. We design a corresponding buffer management strategy that drops the buffered messages with most replicas in the network. This will save the buffer space for the messages with fewer replicas, which has not been well-distributed in the network. Through extensive simulation, we verify that SBMR can increase the data delivery ratio significantly without compromising the transmission cost and delay.

show abstract

“…Ye et al [27] proposed on-demand situation-aware multicast (OS-multicast) in which a node dynamically maintains a multicast tree rooted at itself to all the receivers using local knowledge of the network topology. Xi and Chuah [28] proposed an encounter-based multicast routing scheme (EBMR), which uses the encounter history based on PROPHET DTN unicast routing [18] to disseminate a packet to the neighbors, each of which has the highest delivery predictability (within two hops) to one of the multicast receivers. In [29], the throughput and delay scaling properties of multicasting in DTNs are discussed, and mobility-assisted routing is used to improve the throughput bound of wireless multicast.…”

Section: Multicasting In Dtnsmentioning

confidence: 99%

“…For statistical convergence, we repeat each simulation 20 times. We evaluate TLMR against two existing DTN multicast routing schemes: single-copy EBMR [28] and multiple-copy Epidemic routing [16]. EBMR performs tree branching dynamically in a manner similar to our level-1 routing strategy.…”

Section: A Simulation Setupmentioning

confidence: 99%

A two-level multicast routing strategy for delay tolerant networks

Le¹,

Kalantarian²,

Gerla³

2015

2015 14th Annual Mediterranean Ad Hoc Networking Workshop (MED-HOC-NET)

View full text Add to dashboard Cite

Delay Tolerant Networks (DTNs) are sparse mobile ad-hoc networks in which there is typically no complete path between the source and destination. Multicast is an important group communication paradigm that is required by many potential DTN applications, such as data dissemination during military and rescue operations. While multicasting has been studied extensively in the context of the Internet and Mobile Ad-Hoc Networks (MANETs), efficient multicasting in DTNs is a significantly different and challenging problem due to frequent partitions and intermittent connectivity among nodes. In this paper, we propose a two-level single-copy multicast routing strategy that optimizes both the computing resource usage and the delivery rate. Furthermore, our scheme minimizes the transmission cost by bundling multiple multicast receivers into a single copy of the data packet, and forwarding it to an encounter node that has high delivery probabilities to those multicast receivers. This dynamic tree branching technique allows routing paths to be efficiently shared among multicast destinations. Lastly, we propose new methods to compute one-hop and multihop delivery probabilities that are used in forwarder selection. Through extensive simulation studies using a real-world mobility trace, we show that our scheme achieves a high delivery ratio, low delay, and low (or comparable) transmission cost compared to other multicast strategies.

show abstract

An encounter-based multicast scheme for disruption tolerant networks

Cited by 31 publications

References 13 publications

Quota-control routing in delay-tolerant networks

Quota-control routing in delay-tolerant networks

Sociality-Based Buffer Management for Multicast in DTNs

A two-level multicast routing strategy for delay tolerant networks

Contact Info

Product

Resources

About