ACM Home Page
Please provide us with feedback. Feedback
Multicasting in delay tolerant networks: semantic models and routing algorithms
Full text PdfPdf (220 KB)
Source Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking table of contents
Philadelphia, Pennsylvania, USA
Pages: 268 - 275  
Year of Publication: 2005
ISBN:1-59593-026-4
Authors
Wenrui Zhao  Georgia Institute of Technology, Atlanta, GA
Mostafa Ammar  Georgia Institute of Technology, Atlanta, GA
Ellen Zegura  Georgia Institute of Technology, Atlanta, GA
Sponsors
SIGCOMM: ACM Special Interest Group on Data Communication
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 139,   Citation Count: 16
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1080139.1080145
What is a DOI?

ABSTRACT

Delay tolerant networks (DTNs) are a class of emerging networks that experience frequent and long-duration partitions. These networks have a variety of applications in situations such as crisis environments and deep-space communication. In this paper, we study the problem of multicasting in DTNs. Multicast supports the distribution of data to a group of users, a service needed for many potential DTN applications. While multicasting in the Internet and mobile ad hoc networks has been studied extensively, due to the unique characteristic of frequent partitioning in DTNs, multicasting in DTNs is a considerably different and challenging problem. It not only requires new definitions of multicast semantics but also brings new issues to the design of routing algorithms. In this paper, we propose new semantic models for DTN multicast and develop several multicast routing algorithms with different routing strategies. We present a framework to evaluate these algorithms in DTNs. To the best of our knowledge, this is the first study of multicasting in DTNs. Our objectives are to understand how routing performance is affected by the availability of knowledge about network topology and group membership and to guide the design of DTN routing protocols. Using ns simulations, we find that efficient multicast routing for DTNs can be constructed using only partial knowledge. In addition, accurate topology information is generally more important in routing than up-to-date membership information. We also find that routing algorithms that forward data along multiple paths achieve better delivery ratios, especially when available knowledge is limited.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
DARPA Disruption Tolerant Networking Program: http://www.darpa.mil/ato/solicit/dtn.
2
3
 
4
S. Burleigh, A. Hooke, L. Torgerson, K. Fall, V. Cerf, B. Durst, K. Scott, and H. Weiss. Delay-tolerant networking -- an approach to interplanetary internet. IEEE Communications Magazine, June 2003.
 
5
A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott. Pocket switched networks: Real-world mobility and its consequences for opportunistic forwarding. Technical Report UCAM-CL-TR-617, University of Cambridge, Computer Lab, February 2005.
 
6
7
8
9
 
10
A. A. Hasson, R. Fletcher, and A. Pentland. DakNet: A road to universal broadband connectivity. Wireless Internet UN ICT Conference Case Study, 2003.
11
12
 
13
D. Johnson and D. Maltz. Dynamic source routing in ad-hoc wireless networks. In ACM SIGCOMM, August 1996.
14
 
15
S. Lee, M. Gerla, and C. Chiang. On-demand multicast routing protocol (ODMRP) for ad hoc networks. Internet draft, June 1999.
 
16
J. Moy. Multicast extensions to OSPF. RFC 1584, Mar. 1994.
 
17
Network simulator 2. http://www.isi.edu/nsnam/ns/.
18
 
19
R. Shah, S. Roy, S. Jain, and W. Brunette. Data MULEs: Modeling a three-tier architecture for sparse sensor networks. In IEEE SNPA Workshop, 2003.
 
20
A. Vahdat and D. Becker. Epidemic routing for partially-connected ad hoc networks. Technical report, Duke University, 2000.
21
 
22
H. Wu, R. Fujimoto, and G. Riley. Analytical models for data dissemination in vehicle-to-vehicle networks. In IEEE VTC 2004/Fall.
23
 
24
W. Zhao, M. Ammar, and E. Zegura. Multicasting in delay tolerant networks: Semantic models and routing algorithms. Technical report, College of Computing, Georgia Institute of Technology, 2005.

CITED BY  16

Collaborative Colleagues:
Wenrui Zhao: colleagues
Mostafa Ammar: colleagues
Ellen Zegura: colleagues