Conditional shortest path routing in delay tolerant networks

2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks", WoWMoM 2010 - Digital Proceedings

Volumn , Issue , 2010, Pages

  Bulut, Eyuphan ^a   Geyik, Sahin Cem ^a   Szymanski, Boleslaw K ^a  

^a Rensselaer Polytechnic Institute   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DELAY TOLERANT NETWORKS; END TO END DELAY; END-TO-END PATH; HUMAN MOBILITY; NETWORK CHARACTERISTICS; OPPORTUNISTIC FORWARDING; SHORTEST PATH; SHORTEST PATH ROUTING; TRACE DRIVEN SIMULATION;

BLOCK CODES; WIRELESS SENSOR NETWORKS;

GRAPH THEORY;

EID: 77955873710     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WOWMOM.2010.5534960     Document Type: Conference Paper

References (26)

1. Delay tolerant networking research group, http://www.dtnrg.org.
2. T. Spyropoulos, K. Psounis,C. S. Raghavendra, Efficient routing in intermittently connected mobile networks: The single-copy case, IEEE/ACM Transactions on Networking, vol. 16, no. 1, Feb. 2008.
3. J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine, MaxProp: Routing for Vehicle-Based Disruption- Tolerant Networks, In Proc. IEEE Infocom, April 2006.
4. A. Vahdat and D. Becker, Epidemic routing for partially connected ad hoc networks, Duke University, Tech. Rep. CS-200006, 2000.
5. T. Spyropoulos, K. Psounis,C. S. Raghavendra, Efficient routing in intermittently connected mobile networks: The multi-copy case, IEEE/ACM Transactions on Networking, 2008.
6. Y. Wang, S. Jain, M. Martonosi, and K. Fall, Erasure coding based routing for opportunistic networks, in Proceedings of ACM SIGCOMM workshop on Delay Tolerant Networking (WDTN), 2005.
7. S. Jain, K. Fall, and R. Patra, Routing in a delay tolerant network, in Proceedings of ACM SIGCOMM, Aug. 2004.
8. T. Spyropoulos, K. Psounis,C. S. Raghavendra, Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks, ACM SIGCOMM Workshop, 2005.
9. A. Lindgren, A. Doria, and O. Schelen, Probabilistic routing in intermittently connected networks, SIGMOBILE Mobile Computing and Communication Review, vol. 7, no. 3, 2003.
10. E. P. C. Jones, L. Li, and P. A. S. Ward, Practical routing in delay tolerant networks, in Proceedings of ACM SIGCOMM workshop on Delay Tolerant Networking (WDTN), 2005.
11. A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott, Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms, in Proceedings of INFOCOM, 2006.
12. X. Zhang, J. F. Kurose, B. Levine, D. Towsley, and H. Zhang, Study of a Bus-Based Disruption Tolerant Network: Mobility Modeling and Impact on Routing, In Proceedings of ACM MobiCom, 2007.
13. S. Srinivasa and S. Krishnamurthy, CREST: An Opportunistic Forwarding Protocol Based on Conditional Residual Time, in Proceedings of IEEE SECON, 2009.
14. P. U. Tournoux, J. Leguay, F. Benbadis, V. Conan, M. Amorim, J. Whitbeck, The Accordion Phenomenon: Analysis, Characterization, and Impact on DTN Routing, in Proceedings of Infocom, 2009.
15. C. Liu and J. Wu, Routing in a Cyclic Mobispace, In Proceedings of ACM Mobihoc, 2008.
16. H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli, Age Matters: Efficient Route Discovery in Mobile Ad Hoc Networks Using Encounter Ages, In Proceedings of ACM MobiHoc, 2003.
17. T. Spyropoulos, K. Psounis, and C. Raghavendra, Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility, In Proceedings of IEEE PerCom, 2007.
18. E. Daly and M. Haahr, Social network analysis for routing in disconnected delay-tolerant manets, In Proceedings of ACM MobiHoc, 2007.
19. P. Hui, J. Crowcroft, and E. Yoneki, BUBBLE Rap: Social Based Forwarding in Delay Tolerant Networks, In Proc. of ACM MobiHoc, 2008.
20. A European Union funded project in Situated and Autonomic Communications, www.haggleproject.org.
21. D. Bertsekas, and R. Gallager, Data networks (2nd ed.), 1992.
22. C. Liu and J. Wu, An Optimal Probabilistically Forwarding Protocol in Delay Tolerant Networks, in Proceedings of MobiHoc, 2009.
23. J. Leguay, A. Lindgren, J. Scott, T. Friedman, J. Crowcroft and P. Hui, CRAWDAD data set upmc/content (v. 2006-11-17), downloaded from http://crawdad.cs.dartmouth.edu/upmc/content, 2006.
24. Y. Wang, P. Zhang, T. Liu, C. Sadler and M. Martonosi, http://crawdad.cs.dartmouth.edu/princeton/zebranet, CRAWDAD data set princeton/zebranet (v. 2007-02-14), 2007.
25. E. Bulut, Z. Wang, and B. Szymanski, Cost-Effective Multi-Period Spraying for Routing in Delay Tolerant Networks, to appear in IEEE/ACM Transactions on Networking, 2010.
26. S. Geyik, and B. Szymanski, Event Recognition in Sensor Networks by Means of Grammatical Inference, in Proceedings of INFOCOM, 2009.