Analysis of simple counting protocols for delay-tolerant networks

MobiCom'07 Co-Located Workshops - Proceedings of the 2nd ACM Workshop on Challenged Networks, CHANTS'07

Volumn , Issue , 2007, Pages 19-26

  Walker, Brenton D ^a   Glenn, Joel K ^a   Clancy, T Charles ^a  

^a ARMED FORCES INSTITUTE OF PATHOLOGY   (United States)

Author keywords

Carrier fraction; Delay tolerant networks; Epidemic routing; Intermediate immunity; Localized random walk; Simple counting; Time weighted network storage

Indexed keywords

INTERNET PROTOCOLS; WIRELESS NETWORKS;

CARRIER FRACTION; DELAY-TOLERANT NETWORK; EPIDEMIC ROUTING; INTERMEDIATE IMMUNITY; LOCALISED; LOCALIZED RANDOM WALK; NETWORK STORAGE; RANDOM WALK; SIMPLE COUNTING; SIMPLE++; TIME-WEIGHTED NETWORK STORAGE; WEIGHTED NETWORKS;

DELAY TOLERANT NETWORKS;

EID: 59349095124     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. K. Fall. A delay-tolerant network architecture for challenged internets. In ACM SIGCOMM 2003, 2003.
2. S. Jain, M. Demmer, R. Patra, and K. Fall. Using redundancy to cope with failures in a delay tolerant network. In SIGCOMM'05, 2005.
3. P. Juang, H. Oki, Y. Wang, M. Martonosi, L. Peh, and D. Rubenstein. Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with zebranet. In ASPLOS, San Jose, CA, Oct. 2002.
4. A. Lindgren, A. Doria, and O. Schelen. Probabilistic routing in intermittently connected networks. SIGMOBILE Mob. Comput. Commun. Rev., 7(3):19-20, 2003.
5. M. Musolesi, S. Hailes, and C. Mascolo. An ad hoc mobility model founded on social network theory. In MSWiM'04, 2004.
6. M. Musolesi, S. Hailes, and C. Mascolo. Adaptive routing for intermittently connected mobile ad hoc networks. In IEEE WOWMOM'05, 2005.
7. P. Nain, D. Towsley, B. Liu, and Z. Liu. Properties of random direction models. In INFOCOM 2005, 2005.
8. M. Seligman, K. Fall, and P. Mundur. Storage routing for dtn congestion control. Wireless Communications and Mobile Computing, 7(5), 2007.
9. R. C. Shah, S. Roy, S. Jain, and W. Brunette. Data mules: Modeling a three-tier architecture for sparse sensor networks. In Proceedings of the 2003 IEEE Workshop on Sensor Network Protocols and Applications, 2003.
10. T. Small and Z. J. Haas. Resource and performance tradeoffs in delay-tolerant wireless networks. In A CM SIGCOMM WDTN'05, 2005.
11. T. Spyropoulos, K. Psounis, and C. S. Raghavendra. Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In ACM SIGCOMM WDTN'05, 2005.
12. A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University, 2000.
13. B. Walker, T. C. Clancy, and J. Glenn. Using localized random walks to model delay-tolerant protocols. In submission.
14. W. Zhao, M. Ammar, and E. Zegura. A message ferrying approach for data delivery in sparse mobile ad hoc networks. In MobiHoc'04, 2004.