Routing in a cyclic mobispace

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Volumn , Issue , 2008, Pages 351-360

  Liu, Cong ^a   Wu, Jie ^a  

^a Florida Atlantic Univ   (United States)

Author keywords

Cyclic mobiSpace; Delay tolerant networks (DTNs); Simulation; Trace

Indexed keywords

CYCLIC MOBISPACE; DELAY TOLERANT NETWORKS; DELAY TOLERANT NETWORKS (DTNS); DELIVERY PROBABILITIES; DELIVERY RATES; MARKOV DECISION PROCESSES; PRIOR KNOWLEDGES; REAL OBJECTS; REPETITIVE MOTIONS; RESEARCH WORKS; SIMULATION; SPACE GRAPHS; TIME DIMENSIONS; TRACE;

AD HOC NETWORKS; BLOCK CODES; COMPUTATIONAL GEOMETRY; PROBABILITY; RANDOM PROCESSES; ROUTING PROTOCOLS; TELECOMMUNICATION NETWORKS; WIRELESS NETWORKS;

COMPUTER NETWORKS;

EID: 57349123463     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374618.1374665     Document Type: Conference Paper

References (26)

1. V. Cerf, S. Burleigh, A. Hooke, L. Torgerson, R. Durst, K. Scott, K. Fall, and H. Weiss. Delay-tolerant Network Architecture. In Internet draft: draft-irrf-dtnrg-arch.txt, DTN Research Group, 2006.
2. S. Jain, K. Fall, and R. Patra. Routing in a Delay Tolerant Network. In Proc. of ACM SIGCOMM, 2004.
3. S. Merugu, M. Ammar, and E. Zegura. Routing in Space and Time in Network with Predictable Mobility. In Technical report: GIT-CC-04-07, College of Computing, Georgia Tech, 2004.
4. J. Haas, J. Y. Halpern, and L. Li. Gossip-Based Ad Hoc Routing. In Proc. of IEEE INFOCOM, 2002.
5. A. Lindgren, A. Doria, and O. Schelen. Probabilistic Routing in Intermittently Connected Networks. Lecture Notes in Computer Science, 3126:239-254, August 2004.
6. D. Elizabeth and H. Mads. Social Network Analysis for Routing in Disconnected Delay-Tolerant MANETs. In Proc. of ACM MobiHoc, 2007.
7. C. Liu and J. Wu. Scalable Routing in Delay Tolerant Networks. In Proc. of ACM MobiHoc, 2007.
8. J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine. MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networking. In Proc. of IEEE INFOCOM, 2006.
9. 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 Proc. of ACM MobiCom, 2007.
10. R. Bellman. Dynamic Programming. Princeton Univerity Press, 1957.
11. R. A. Howard. Dynamic Programming and Markov Processes. The MIT Press, 1960.
12. B. Bonet and H. Geffner. Faster Heuristic Search Algorithms for Planning with Uncertainty and Full Feedback. In Proc. of IJCAI, 2003.
13. P. Dai and J. Goldsmith. Topological Value Iteration Algorithm for Markov Decision Processes. In Proc. of IJCAI, 2007.
14. A. J. Briggs, C. Detweiler, D. Scharstein, and A. Vandenberg-Rodes. Expected Shortest Paths for Landmark-Based Robot Navigation. International Journal of Robotics Research, 23(7-8):717-728, July-August 2004.
15. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. The MIT Press, 2001.
16. A. Vahdate and D. Becker. Epidemic Routing for Partially-connected Ad Hoc Networks. In Technical Report, Duke University, 2002.
17. T. Spyropoulos, K. Psounis, and C. Raghavendra. Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks. In Proc. of ACM WDTN, 2005.
18. T. Spyropoulos, K. Psounis, and C. Raghavendra. Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility. In Proc. of IEEE PerCom, 2007.
19. A. Balasubramanian, B. N. Levine, and A. Venkataramani. DTN Routing as a Resource Allocation Problem. In Proc. ACM SIGCOMM, 2007.
20. U. Acer, S. Kalyanaraman, and A. Abouzeid. Weak State Routing for Large Scale Dynamic Networks. In Proc. of ACM MobiCom, 2007.
21. V. Srinivasan, M. Motani, and W. T. Ooi. Analysis and Implications of Student Contact Patterns Derived from Campus Schedules. In Proc. of ACM MobiCom, 2006.
22. CRAWDAD data set. Downloaded from http://crawdad.cs.dartmouth.edu/.
23. H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli. Age Matters: Efficient Route Discovery in Mobile Ad Hoc Networks Using Encounter Ages. In Proc. of ACM MobiHoc, 2003.
24. M. Grossglauser and M. Vetterli. Locating Nodes with Ease: Last Encounter Routing in Ad Hoc Networks through Mobility Diffusion. In Proc. of IEEE INFOCOM, 2003.
25. J. Leguay, T. Friedman, and V. Conan. DTN Routing in a Mobility Pattern Space. In Proc. of ACM WDTN, 2005.
26. L. Song and D. F. Kotz. Evaluating Opportunistic Routing Protocols with Large Realistic Contact Traces. In Proc. of ACM CHANTS, 2007.