Optimal routing and scheduling for deterministic delay tolerant networks

WONS 2009 - 6th International Conference on Wireless On-demand Network Systems and Services

Volumn , Issue , 2009, Pages 27-34

  Hay, David ^a   Giaccone, Paolo ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONTACT TIME; DELAY TOLERANT NETWORKS; EQUIVALENT TIME; MOBILE AD-HOC NETWORKS; NETWORK PARTITIONING; NETWORK TOPOLOGIES; OBJECTIVE FUNCTIONS; OPTIMAL RESULTS; OPTIMAL ROUTING; OPTIMAL ROUTING ALGORITHMS; ROUTE INFORMATIONS;

AD HOC NETWORKS; APPROXIMATION ALGORITHMS; BLOCK CODES; ELECTRIC NETWORK TOPOLOGY; MOBILE TELECOMMUNICATION SYSTEMS; OPTIMIZATION; SCHEDULING ALGORITHMS;

ROUTING ALGORITHMS;

EID: 64849097605     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WONS.2009.4801844     Document Type: Conference Paper

References (18)

1. M. Grossglauser and D. Tse, "Mobility increases the capacity of ad hoc wireless networks," IEEE/ACM Trans. Netw., vol. 10, no. 4, pp. 477-486, 2002.
2. S. Jain, K. R. Fall, and R. K. Patra, "Routing in a delay tolerant network," in ACM SIGCOMM, 2004, pp. 145-158.
3. C. Liu and J. Wu, "Scalable routing in delay tolerant networks," in ACM MobiHoc, 2007, pp. 51-60.
4. -, "Routing in a cyclic mobispace," in ACM MobiHoc, 2008, pp. 351-360.
5. "Delay tolerant networking research group." [Online]. Available: http://www.dtnrg.org
6. J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine, "Maxprop: Routing for vehicle-based disruption-tolerant networks," in INFOCOM, 2006.
7. P. Hui, A. Chaintreau, J. Scott, R. Gass, J. Crowcroft, and C. Diot, "Pocket switched networks and human mobility in conference environments," in ACM WDTN, 2005, pp. 244-251.
8. M. C. Gonzalez, C. A. Hidalgo, and A.-L. Barabasi, "Understanding individual human mobility patterns," Nature, vol. 453, no. 7196, pp. 779-782, 2008.
9. "Crossbow technology, inc." [Online]. Available: http://www.xbow.com
10. A. Balasubramani, B. N. Levine, and A. Venkataramani, "DTN Routing as a Resource Allocation Problem," in ACM SIGCOMM, 2007.
11. S. Merugu, M. Ammar, and E. Zegura, "Routing in space and time in networks with predictable mobility," Georgia Institute of Technology, Tech. Rep., 2004.
12. L. R. Ford and D. R. Fulkerson, "Constructing maximal dynamic flow from static flows," Operation Research, vol. 6, pp. 419-433, 1958.
13. B. Hoppe, "Efficient dynamic network flow algorithms," Ph.D. dissertation, Cornell University, 1995.
14. M. Skutella, "An introduction to network flows over time," in Research Trends in Combinatorial Optimization. Springer, 2008, pp. 451-482.
15. A. Di Nicolò and P. Giaccone, "Performance limits of real delay tolerant networks," in IEEE WONS, 2008, pp. 149-155.
16. B. Awerbuch and F. T. Leighton, "Multicommodity flows: A survey of recent research," in ISAAC, 1993, pp. 297-302.
17. G. Karakostas, "Faster approximation schemes for fractional multicommodity flow problems," in ACM-SIAM SODA, 2002, pp. 166-173.
18. "Crawdad repository." [Online]. Available: http://crawdad.cs. dartmouth.edu