Flow-based transmission scheduling in constrained delay tolerant networks

Journal of Computers

Volumn 7, Issue 1, 2012, Pages 179-186

  Yang, Zhenguo ^a   Huang, Liusheng ^a   Xiao, Mingjun ^a   Liu, Wang ^a  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

DTNs; Flow; Routing; Scheduling

Indexed keywords

BUFFER SIZES; DATA SETS; DELAY TOLERANT NETWORKS; DELIVERY DELAY; DTNS; FLOW; INTERMITTENT CONNECTIVITY; LIMITED BANDWIDTH; NETWORK PARTITIONING; PACKET SCHEDULING; ROUTING; SOURCE NODES; TIME INTERVAL; TRANSMISSION SCHEDULING;

BANDWIDTH; SCHEDULING ALGORITHMS; WIRELESS NETWORKS;

SCHEDULING;

EID: 84863016350     PISSN: 1796203X     EISSN: None     Source Type: Journal    
DOI: 10.4304/jcp.7.1.179-186     Document Type: Article

References (20)

1. K. Fall, "A delay-tolerant network architecture for challenged internets," in ACM SIGCOMM, 2003.
2. "Delay Tolerant Network Research Group," http://www.dtnrg.org/.
3. A. Vahdate and D. Becker, "Epidemic routing for partiallyconnected ad hoc networks," Duke University, Tech. Rep. CS-2000-06, June 2000.
4. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Spray and wait: an efficient routing scheme for intermittently connected mobile networks," in Proceedings WDTN, 2005.
5. E. P. C. Jones, L. Li, and P. A. S. Ward, "Practical routing in delay-tolerant networks," in Proceedings WDTN, 2005.
6. J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine, "Maxprop: Routing for vehicle-based disruption-tolerant networks," in IEEE INFOCOM, 2006.
7. A. Balasubramanian, B. N. Levine, and A. Venkataramani, "Dtn routing as a resource allocation problem," in ACM SIGCOMM, 2007.
8. S. Nelson, M. Bakht, and R. Kravets, "Encounter-based routing in DTNs," in IEEE INFOCOM, 2009.
9. M. Xiao, L. Huang, Q. Dong, A. Liu, and Z. Yang, "Optimal opportunistic routing in probabilistically contacted delay tolerant networks," Journal of Computer Science and Technology, vol. 24, no. 5, pp. 975-986, 2009.
10. X. Zhang, J. Kurose, B. N. Levine, D. Towsley, and H. Zhang, "Study of a Bus-Based Disruption Tolerant Network: Mobility Modeling and Impact on Routing," in ACM MobiCom, 2007.
11. V. Srinivasan, M. Motani, and W. T. Ooi, "Analysis and Implications of Student Contact Patterns Derived from Campus Schedules," in ACM MobiCom, 2006.
12. P. U. Tournoux, J. Leguay, F. Benbadis, V. Conan, M. D. de Amorim, and J. Whitbeck, "The accordion phenomenon: Analysis, characterization, and impact on dtn routing," in IEEE INFOCOM, 2009.
13. "CRAWDAD data set," http://crawdad.cs.dartmouth.edu/.
14. C. Liu and J. Wu, "Routing in a cyclic mobispace," in ACM MobiHoc, 2007.
15. C. Liu and J. Wu, "An optimal probabilistic forwarding protocol in delay tolerant networks," in ACM MobiHoc, 2009.
16. W. Gao, Q. Li, B. Zhao, and G. Cao, "Multicasting in delay tolerant networks: a social network perspective," in ACM MobiHoc, 2009.
17. I. C. Q. Yuan and J. Wu, "Predict and relay: an efficient routing in disruption-tolerant networks," in ACM MobiHoc, 2009.
18. S. Z. Q. Li and G. Cao, "Routing in socially selfish delay tolerant networks," in IEEE INFOCOM, 2010.
19. V. Conan, J. Leguay, and T. Friedman, "Fixed point opportunistic routing in delay tolerant networks," IEEE Journal on Selected Areas in Communications, vol. 26, no. 5, pp. 773-782, 2008.
20. D. Hay and P. Giaccone, "Optimal routing and scheduling for deterministic delay tolerant networks," in Wireless On- Demand Network Systems and Services, 2009.