A two-level multicast routing strategy for delay tolerant networks

Abstract

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.

Current State of Multicast Routing Protocols for Disruption Tolerant Networks: Survey and Open Issues

“…The epidemic protocol usually stands out from others in terms of delivery ratio due to its flooding-based nature which can achieve a high rate in delivery. SDM, MDM [34], Cloud-based Multicasting [35], and TLMR [36] focus on social centrality and community to select the most suitable forwarding node based on the contact probability of a node. SDM and MDM are cost-effective because a minimum number of relays in multicast data forwarding are utilized, and hence they have a lower delivery cost.…”

“…Two-Level Multicast Routing: Two-Level Multicast Routing (TLMR) is a single-copy multicast routing approach that bundles multiple multicast recipients into a single copy of the data packet. Le et al [36] intended to reduce transmission costs and achieve an optimal delivery rate and efficient Two-Level Multicast Routing: Two-Level Multicast Routing (TLMR) is a single-copy multicast routing approach that bundles multiple multicast recipients into a single copy of the data packet. Le et al [36] intended to reduce transmission costs and achieve an optimal delivery rate and efficient computing resource usage at the same time.…”

“…Le et al [36] intended to reduce transmission costs and achieve an optimal delivery rate and efficient Two-Level Multicast Routing: Two-Level Multicast Routing (TLMR) is a single-copy multicast routing approach that bundles multiple multicast recipients into a single copy of the data packet. Le et al [36] intended to reduce transmission costs and achieve an optimal delivery rate and efficient computing resource usage at the same time. This approach switches between one-hop delivery probability and multi-hop delivery probability when selecting the forwarding nodes.…”

Improved Provoking Trustworthy Routing using Warning Packet Arising Algorithm In Wireless Ad Hoc Network

“…Table 1 shows Simulation setup is Estimation. Figure 3 show that the proposed IPTRmethod obtainsprotection and connection based efficient routingcompared with existing ERLC [15] and TLMR [16]. IPTRcheck and detect the fake node behavior in routing path, while any fake node available, it generates the warning message given to neighbor node in routing path.…”

“…Le, Tuan, HaikKalantarian, et al, [16] presentdual stage broadcastingMethod which optimize each the estimateconsumption of energy with transmission rate. This reducestheCommunication cost by bunchmany acceptor node into aIndividual data packet copies, also broadcaster countsthe transmission possibilities.…”