Probability and receiver list based multicast routing in DTNS

Authors:
Minghui Ma;Zhaoxiang Zhang;Xudong An;Chao Li;Yuanda Cao
Affiliations:
School of Computer Science, Beijing Institute of Technology;Network Optimization Center, China Mobile Communications Corporation Beijing Co., Ltd.;Telecommunication Metrology Center of MIlT;School of Computer Science, Beijing Institute of Technology;School of Computer Science, Beijing Institute of Technology
Venue:
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Year:
2010

Citing 7
Cited 0

Multicast operation of the ad-hoc on-demand distance vector routing protocol

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
AMRoute: ad hoc multicast routing protocol

Mobile Networks and Applications
A delay-tolerant network architecture for challenged internets

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Multicasting in delay tolerant networks: semantic models and routing algorithms

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
DTN routing in a mobility pattern space

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
DTN routing as a resource allocation problem

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
The design, implementation, and performance evaluation of the on-demand multicast routing protocol in multihop wireless networks

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

-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.