This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Efficient Prediction-Based Routing in Disruption-Tolerant Networks
January 2012 (vol. 23 no. 1)
pp. 19-31
Quan Yuan, University of Wisconsin-Stevens Point, Stevens Point
Ionut Cardei, Florida Atlantic University, Boca Raton
Jie Wu, Temple University, Philadelphia
Routing is one of the most challenging, open problems in disruption-tolerant networks (DTNs) because of the short-lived wireless connectivity environment. To deal with this issue, researchers have investigated routing based on the prediction of future contacts, taking advantage of nodes' mobility history. However, most of the previous work focused on the prediction of whether two nodes would have a contact, without considering the time of the contact. This paper proposes predict and relay (PER), an efficient routing algorithm for DTNs, where nodes determine the probability distribution of future contact times and choose a proper next-hop in order to improve the end-to-end delivery probability. The algorithm is based on two observations: one is that nodes usually move around a set of well-visited landmark points instead of moving randomly; the other is that node mobility behavior is semi-deterministic and could be predicted once there is sufficient mobility history information. Specifically, our approach employs a time-homogeneous semi-Markov process model that describes node mobility as transitions between landmarks. Then, we extend it to handle the scenario where we consider the transition time between two landmarks. A simulation study shows that this approach improves the delivery ratio and also reduces the delivery latency compared to traditional DTN routing schemes.

[1] “Sensor Networking with Delay Tolerance (SeNDT),” http://down.dsg.cs.tcd.iesendt/, 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.

Index Terms:
Disruption-tolerant networks (DTNs), landmarks, time-related Markov model, prediction, routing.
Citation:
Quan Yuan, Ionut Cardei, Jie Wu, "An Efficient Prediction-Based Routing in Disruption-Tolerant Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 1, pp. 19-31, Jan. 2012, doi:10.1109/TPDS.2011.140
Usage of this product signifies your acceptance of the Terms of Use.