Probability routing algorithm based on historical throughput in DTN network

2013 3rd International Conference on Consumer Electronics, Communications and Networks, CECNet 2013 - Proceedings

Volumn , Issue , 2013, Pages 450-453

  Huang, Hongcheng ^a   Mao, Yiding ^a   Zhang, Xi ^a  

^a CHONGQING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

DTN; Probabilistic Routing; Throughput

Indexed keywords

EID: 84894208021     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CECNet.2013.6703366     Document Type: Conference Paper

References (7)

1. THOMAS D C L, ASHISH A. An information propagation scheme for VANETS [C]. IEEE Conference on Intelligent Transportation Systems. Washington, DC: IEEE, 2005:155-160.
2. Disruption tolerant networking [EB/OL]. 2008-06-01.http://www.darpa.mil/ ato/solicit/DTN/.
3. Fall K. A delay-tolerant network architecture for challenged internets [C]. In Proceedings ACM SIGCOMM. 2003, August 2003,25-29.
4. VAHDAT A, BECKER D. Epidemic routing for partially-connected Ad Hoc networks, Technical Report CS-2000-06 [R]. North Carolina: Duke University, 2000.
5. Lindgren A, Doria A, Scheln O. Probabilistic routing in intermittently connected networks [J]. Mobile Computing and Communications Review, 2003, 7(3):19-20.
6. SPYROPOULOS T, PSOUNIS K,RAGHAVENDRA C S. Spray and wait: an efficient routing scheme for intermittently connected mobile networks [C]. Proc of ACM SIGCOMM Workshop on Delay-Tolerant Networking. New York: ACM Press,2005:252-259.
7. KERÄNEN A, OTT J, KÄRKKÄINEN T. The ONE simulator for DTN protocol evaluation [C] Proceedings of the 2nd International Conference on Simulation Tools and Techniques. New York:ACM Press, 2009:1-10.