An efficient prediction-based routing in disruption-tolerant networks

IEEE Transactions on Parallel and Distributed Systems

Volumn 23, Issue 1, 2012, Pages 19-31

  Yuan, Quan ^a   Cardei, Ionut ^b   Wu, Jie ^c  

^a UNIVERSITY OF WISCONSIN STEVENS POINT   (United States)

^b Florida Atlantic University   (United States)

^c Temple University   (United States)

Author keywords

Disruption tolerant networks (DTNs); landmarks; prediction; routing; time related Markov model

Indexed keywords

CONTACT TIME; DELIVERY RATIO; DISRUPTION TOLERANT NETWORKS; DTN ROUTING; EFFICIENT ROUTING; LANDMARKS; MARKOV MODEL; NEXT-HOP; NODE MOBILITY; OPEN PROBLEMS; PREDICTION-BASED ROUTING; ROUTING; SEMI MARKOV PROCESS; SIMULATION STUDIES; TRANSITION TIME; WIRELESS CONNECTIVITIES;

ALGORITHMS; FORECASTING; MARKOV PROCESSES; PROBABILITY DISTRIBUTIONS;

TELECOMMUNICATION NETWORKS;

EID: 82555168164     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2011.140     Document Type: Article

References (26)

1. "Sensor Networking with Delay Tolerance (SeNDT)," http://down. dsg.cs.tcd.ie/sendt/, 2011.
2. I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "A Survey on Sensor Networks," IEEE Comm. Magazine, vol. 40, no. 8, pp. 102-114, Aug. 2002.
3. A. Balasubramanian, B. N. Levine, and A. Venkataramani, "DTN Routing as a Resource Allocation Problem," Proc. SIGCOMM, 2007.
4. N. Banerjee, M. Corner, and B. Levine, "An Energy-Efficient Architecture for DTN Throwboxes," Proc. IEEE INFOCOM, 2007.
5. J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine, "Maxprop: Routing for Vehicle-Based Disruption-Tolerant Networks," Proc. IEEE INFOCOM, 2006.
6. B. Burns, O. Brock, and B. N. Levine, "Mv Routing and Capacity Building in Disruption Tolerant Networks," Proc. IEEE INFOCOM, 2005.
7. I. Cardei, C. Liu, J. Wu, and Q. Yuan, "DTN Routing with Probabilistic Trajectory Prediction," Proc. Int'l Conf. Wireless Algorithms, Systems and Applications (WASA'08), 2008.
8. H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli, "Age Matters: Efficient Route Discovery in Mobile Ad Hoc Networks Using Encounter Ages," Proc. Fourth ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc'03), 2003.
9. K. Fall, "A Delay-Tolerant Network Architecture for Challenged Internets," Proc. SIGCOMM, 2003.
10. J. Ghosh, S. J. Philip, and C. Qiao, "Sociological Orbit Aware Location Approximation and Routing (Solar) in DTN," Technical Report 2005-27, State Univ. of New York at Buffalo, Apr. 2005.
11. K. Harras, K. Almeroth, and E. Belding-Royer, "Delay Tolerant Mobile Networks (DTMNs): Controlled Flooding Schemes in Sparse Mobile Networks," Proc. IFIP Netwoking, 2005.
12. P. Hui, J. Crowcroft, and E. Yoneki, "Bubble Rap: Social Based Forwarding in Delay Tolerant Networks," Proc. Ninth ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc'08), 2008.
13. P. Juang, H. Oki, Y. Wang, M. Martonosi, L. Peh, and D. Rubenstein, "Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with Zebranet," Proc. 10th Int'l Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS-X), 2002.
14. J. LeBrun, C. Chuah, and D. Ghosal, "Knowledge Based Opportunistic Forwarding in Vehicular Wireless Ad Hoc Networks," Proc. IEEE 61st Vehicular Technology Conf. (VTC), 2005.
15. K. Lee, M. Le, J. Haerri, and M. Gerla, "Louvre: Landmark Overlays for Urban Vehicular Routing Environments," Proc. IEEE 68th Vehicular Technology Conf. (VTC), 2008.
16. J. Leguay, T. Friedman, and V. Conan, "Evaluating Mobility Pattern Space Routing," Proc. IEEE INFOCOM, 2006.
17. C. Liu and J. Wu, "Routing in a Cyclic Mobispace," Proc. Ninth ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc'08), 2008.
18. R. Shah, S. Jain, S. Roy, and W. Brunette, "Data Mules: Modeling a Three-Tier Architecture for Sparse Sensor Networks," Technical Report IRS-TR-03-001, Intel Research Seattle, 2003.
19. T. Small and Z. J. Haas, "Resource and Performance Tradeoffs in Delay Tolerant Wireless Networks," Proc. ACM SIGCOMM Workshop Delay-Tolerant Networking (WDTN'05), 2005.
20. T. Spyropoulos, K. Psounis, and C. Raghavendra, "Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks," Proc. ACM SIGCOMM Workshop Delay-Tolerant Networking (WDTN'05), 2005.
21. D. Tang and M. Baker, "CRAWDAD Data Set Stanford/Gates (v. 2003-10-16)," http://crawdad.cs.dartmouth.edu/stanford/gates, Oct. 2003.
22. A. Vahdat and D. Becker, "Epidemic Routing for Partially Connected Ad Hoc Networks," Technical Report CS-200006, Duke Univ., 2000.
23. J. Wu, M. Lu, and F. Li, "Utility-Based Opportunistic Routing in Multi-Hop Wireless Networks," Proc. 28th Int'l Conf. Distributed Computing Systems (ICDCS'08), 2008.
24. J. Yoon, B. Noble, M. Liu, and M. Kim, "Building Realistic Mobility Models from Coarse-Grained Traces," Proc. Fourth Int'l Conf. Mobile Systems, Applications and Services (MobiSys'06), June 2006.
25. Q. Yuan, I. Cardei, and J. Wu, "Predict and Relay: An Efficient Routing in Disruption-Tolerant Networks," Proc. 10th ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc'09), 2009.
26. X. Zhang, G. Neglia, J. Kurose, and D. Towsley, "Performance Modeling of Epidemic Routing," Proc. IFIP Networking, 2006.