A Multiple-Data Multicast Routing Protocol for DTN

In DTNs, due to the unique characteristic of frequent partitioning, multicasting is a considerably different and challenging problem. Moreover, the single data multicast is different from multiple data multicast. In this paper, The mathematics model of multiple data multicast for DTNs is established, and the ant colony optimization algorithm introduce to solve the multiple data multicast problem. Simulation results show that the our multicast routing can not only have a higher delivery ratio and lower delay, but also have a lower data forwarding cost, in terms of the number of relays used.