Probability and Receiver List based multicast routing in DTNs

Delay/Disruption Tolerant Networks (DNTs) enables nodes to communicate by means of asynchronous sending messages without the need for an end-to-end path. In this paper, we study the problem of multicasting in DTNs. Several schemes have been proposed for multicast routing assuming the group of message receivers is known by sender, and the group members do not change during the process of message delivery. In this paper, we propose a Probability and Receiver List based multicast routing scheme to address the message routing problem, which can handle multicast group members changing problem. Simulation results show that our routing strategies can achieve higher message delivery ratios and lower delivery latency than existing approaches.