The impact of the mobility model on delay tolerant networking performance analysis

Proceedings - Simulation Symposium

Volumn , Issue , 2007, Pages 177-184

  Abdulla, Muhammad ^a   Simon, Robert ^a  

^a George Mason University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DELAY TOLERANT NETWORKS; DTN ROUTING; PERFORMANCE ANALYSIS; STATISTICAL PROPERTIES;

COMPUTER SIMULATION; MATHEMATICAL MODELS; ROUTING ALGORITHMS; STATISTICAL METHODS;

ROUTING PROTOCOLS;

EID: 34547293627     PISSN: 1080241X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ANSS.2007.40     Document Type: Conference Paper

References (14)

1. Burton H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7):422-426, 1970.
2. Scott Burleigh and Kevin Fall. Delay tolerant networking: An approach for interplanetary internet. IEEE Communications Magazine, June 2003.
3. Kevin Fall. A delay-tolerant network architecture for challenged internets, pages 27-34, Karlsruhe, Germany, August 2003. ACM SIGCOMM'03.
4. Matthias Grossglauser and David N. C. Tse. Mobility increases the capacity of ad-hoc wireless networks. In INFOCOM, pages 1360-1369, 2001.
5. Sushant Jain, Kevin Fall, and Rabin Patra. Routing in a delay tolerant network. Portlan, Oregon, USA., August 2004. ACM SIGCOMM'04.
6. A. Lindgren, A. Doria, and O. Scheln. Probabilistic routing in intermittently connected networks. Proceedings of the Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2003), 2003.
7. R. Shah, S. Roy, S. Jain, and W. Brunette. Data mules: Modeling a three-tier architecture for sparse sensor networks. IEEE SNPA Workshop, May 2003.
8. T. Spyropoulos, K. Psounis, and C. Raghavendra. Single-copy routing in intermittently connected mobile networks. In Sensor and Ad Hoc Communications and Networks, pages 235-244. IEEE, Oct 2004.
9. T. Spyropoulos, K. Psounis, and C. Raghavendra. Spray and wait: An efficient routing scheme for intermittently connected mobile networks. Philadelphia, PA, USA, August 2005. ACM SIGCOMM'05 Workshops.
10. A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University, April 2000.
11. Yong Wang, Sushant Jain, Margaret Martonosi, and Kevin Fall. Erasure-coding based routing for opportunistic networks. Philadelphia, PA, USA, August 2005. ACM SIGCOMM'05 Workshops.
12. J. Yoon, M. Liu, and B. Noble. Random waypoint considered harmful. INFOCOM, 2003.
13. Wenrui Zhao, Mostafa Ammar, and Ellen Zegura. A message ferrying approach for data delivery in sparse mobile ad hoc networks. ACM MobiHoc, ACM, May 2004.
14. Wenrui Zhao, Mostafa Ammar, and Ellen Zegura. Multicasting in delay tolerant networks: Semantic models and routing algorithms. In SIGCOMM'05 Workshops, pages 268-275. ACM, August 2005.