NECTAR: A DTN routing protocol based on neighborhood contact history

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2009, Pages 40-46

  De Oliveira, Etienne C R ^a   De Albuquerque, Célio V N ^a  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

DTN; Neighborhood; Routing protocol

Indexed keywords

DELAY AND DISRUPTION; DTN; DTN ROUTING; NETWORK RESOURCE; PARTITIONED NETWORKS; RESOURCE CONSTRAINED NODES; WIRELESS ENVIRONMENT;

COMPUTER SCIENCE; COMPUTER SIMULATION; ROUTING PROTOCOLS; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS NETWORKS;

EID: 72949103692     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1529282.1529290     Document Type: Conference Paper

References (19)

1. A. Balasubramanian, B. N. Levine, and A. Venkataramani. DTN Routing as a Resource Allocation Problem. In Proc. ACM Sigcomm, 2007.
2. J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine. Maxprop: Routing for vehicle-based disruption-tolerant networks. In Proc. IEEE Infocom, pages 1-11, 2006.
3. 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, 41(6):128-136, 2003.
4. T. Camp, J. Boleng, and V. Davies. A survey of mobility models for ad hoc network research. In Proc. IEEE IWCMC, 2(5):483-502, 2002.
5. A. Doria, M. Uden, and D. P. Pandey. Providing connectivity to the saami nomadic community. In Proc. Open Collaborative Design for Sustainable Development, 2002.
6. S. Jain, K. Fall, and R. Patra. Routing in a delay tolerant network. In Proc. ACM Sigcomm, pages 145-158, 2004.
7. D. Kotz, T. Henderson, and I. Abyzov. Downloaded from http://crawdad.cs.dartmouth.edu/dartmouth/ campus/syslog/01-04, Dec. 2004.
8. J. Leguay, T. Friedman, and V. Conan. Evaluating mobility pattern space routing for DTNs. In Proc. IEEE Infocom, pages 1-10, 2006.
9. C.-S. Lin, W.-S. C. and; Ling-Jyh Chen, and C.-F. Chou. Performance study of routing schemes in delay tolerant networks. In Proc. IEEE AINAW, pages 1702-1707, 2008.
10. A. Lindgren and A. Doria. Probabilistic routing protocol for intermittently connected networks. RFC Draft, Internet Engineering Task Force, Fev 2008.
11. A. Lindgren, A. Doria, and O. Schelén. Probabilistic routing in intermittently connected networks. In Proc. ACM SigMobile, 7(3):19-20, 2003.
12. OLPC. One laptop per child, 2008. Available at: http://laptop.org/.
13. R. Ramanathan, R. Hansen, P. Basu, R. Rosales-Hain, and R. Krishnan. Prioritized epidemic routing for opportunistic networks. In Proc. ACM MobiOpp, pages 62-66, 2007.
14. L. Song, D. Kotz, R. Jain, and X. He. Evaluating location predictors with extensive wi-fi mobility data. Proc. ACM SigMobile, 7(4):64-65, 2003.
15. T. Spyropoulos, K. Psounis, and C. S. Raghavendra. Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In Proc. ACM Sigcomm WDTN, pages 252-259, 2005.
16. UMass. Umass trace repository, 2007. Available at: http://traces.cs. umass.edu/.
17. A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University, April 2000.
18. X. Zhang, G. Neglia, J. Kurose, and D. Towsley. Performance modeling of epidemic routing. Computer Networks, 51(10):2867-2891, 2007.
19. W. Zhao, M. Ammar, and E. Zegura. A message ferrying approach for data delivery in sparse mobile ad hoc networks. In Proc. ACM MobiHoc, pages 187-198, 2004.