JOURNAL ARTICLE

A probability based adaptive multicast routing scheme for delay tolerant networks

Abstract

Many Delay Tolerant Networks (DTNs) applications need multicast service, thus making efficient multicast communication support essential. In this paper, we propose a Probability-based Adaptive Multicast Routing scheme (PAMR) to address the challenges of intermittent link connectivity and frequent partitions in DTNs. PAMR relies on node encounter histories rather than the global knowledge or the summary of link states of the network topology, which makes PAMR be more flexible and practical than the existing multicast routing schemes. Furthermore, PAMR can handle different DTNs application scenarios by adjusting network parameters. Extensive simulations have been conducted to verify the performance of PAMR and the results indicate that the PAMR scheme can achieve a higher bundle delivery ratio and incur much smaller end-to-end delay at the cost of comparatively lower delivery efficiency.

Keywords:
Multicast Computer science Computer network Distributed computing Protocol Independent Multicast Distance Vector Multicast Routing Protocol Xcast Source-specific multicast Pragmatic General Multicast Scheme (mathematics) Node (physics) Routing (electronic design automation) Engineering

Metrics

3
Cited By
0.00
FWCI (Field Weighted Citation Impact)
19
Refs
0.15
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Opportunistic and Delay-Tolerant Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
Mobile Ad Hoc Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
Caching and Content Delivery
Physical Sciences →  Computer Science →  Computer Networks and Communications

Related Documents

© 2026 ScienceGate Book Chapters — All rights reserved.