Optimal routing strategy in throw-box based delay tolerant network

Proceedings of the 2011 6th International ICST Conference on Communications and Networking in China, CHINACOM 2011

Volumn , Issue , 2011, Pages 501-506

  Gu, Bo ^a   Hong, Xiaoyan ^a  

^a Department of Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION DEVICE; CRITICAL ISSUES; DELAY TOLERANT NETWORKS; EXPECTED DELAY; INTERMITTENTLY CONNECTED NETWORKS; MESSAGE DELIVERY; MOBILE DESTINATIONS; MOBILE NODES; MOBILE RECEIVER; MOBILITY PATTERN; NETWORK GRAPH; OPTIMAL POLICIES; OPTIMAL ROUTING; POLICY ITERATION ALGORITHMS; ROUTING SCHEME; ROUTING STRATEGIES; TIME-VARYING DELAY; VIRTUAL LINK;

ALGORITHMS; MARKOV PROCESSES; NETWORK ROUTING; ROUTERS; TRACE ANALYSIS; WIRELESS NETWORKS;

ROUTING ALGORITHMS;

EID: 84858255757     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ChinaCom.2011.6158205     Document Type: Conference Paper

References (14)

1. A. Balasubramanian, Y. Zhou, B. Levine, A. Venkataramani, and B. Croft. CRAWDAD trace umass/diesel/transfer/ap-connectivity v.2007-12-02. Downloaded from http://crawdad.cs.dartmouth.edu/umass/diesel/transfer/ap-connectivity, Dec. 2007.
2. S. Gao and I. Chabini. Optimal routing policy problems in stochastic time-dependent networks. Transportation Research Part B: Methodological, 40(2):93-122, February 2006. (Pubitemid 41350088)
3. W. Gao, Q. Li, B. Zhao, and G. Cao. Multicasting in delay tolerant networks: a social network perspective. In Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing, 2009.
4. B. Gu, X. Hong, P. Wang, and B. Richard. Latency Analysis for Thrown Box Based Message Dissemination. In GLOBECOM 2010: 2010 IEEE Global Telecommunications Conference, MIAMI, Florida, USA, 2010.
5. S. Jain, K. Fall, and R. Patra. Routing in a Delay Tolerant Network. In Proc. ACM Sigcomm, pages 145-158, 2004.
6. A. Keränen, J. Ott, and T. Kärkkäinen. The ONE Simulator for DTN Protocol Evaluation. In SIMUTools '09: Proceedings of the 2nd International Conference on Simulation Tools and Techniques, New York, NY, USA, 2009. ICST.
7. A. Lindgren, A. Doria, and O. Schelen. Probabilistic routing in intermittently connected networks. SIGMOBILE Mobile Computing and Communications Review, 7(3), 2003.
8. C. Liu and J. Wu. Routing in a cyclic mobispace. In Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing, 2008.
9. H. N. Psaraftis and J. N. Tsitsiklis. Dynamic shortest paths in acyclic networks with markovian arc costs. Operations Research, 41(1):91-101, 1993.
10. T. Spyropoulos, K. Psounis, and C. S. Raghavendra. Efficient routing in intermittently connected mobile networks:The multiple-copy case. IEEE/ACM Trans. on Networking, 16(1), 2008.
11. A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. In Technical Report CS-200006, Duke University, 2000.
12. G. M. Viswanathan, V. Afanasyev, S. V. Buldyrev, E. J. Murphy, P. A. Prince, and H. E. Stanley. Levy flights search patterns of wandering albatrosses. Nature, 381:413-415, 1996.
13. W. Zhao, M. Ammar, and E. Zegura. A Message Ferrying Approach for Data Delivery in sparse Mobile Ad Hoc Networks. In Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing, pages 187-198, 2004.
14. W. Zhao, Y. Chen, M. Ammar, M. D. Corner, B. N. Levine, and E. Zegura. Capacity Enhancement using Throwboxes in DTNs. In IEEE MASS, 2006.