Spacial Mobility Prediction Based Routing Scheme in Delay/Disruption-Tolerant Networks

Routing is a challenging issue in Delay/Disruption Tolerant Networks (DTNs) due to the characteristics of high mobility of nodes and high dynamicity of network topology. The previous works did not consider the spacial information of nodes, such as dwelling time at a location when predicting the future contact of two nodes. In this paper, a novel Spacial Mobility Prediction based Routing (SMPR) scheme is proposed for DTNs, in which the spacial information of nodes and contact transitivity are both taken into account. Specifically, a time homogeneous semi-Markov process model is proposed to describe the mobility of nodes. The simulation results show that the proposed SMPR scheme substantially improves delivery ratio and reduces delivery latency compared with traditional DTN routing schemes.

[1]  Thomas F. La Porta,et al.  On Exploiting Transient Social Contact Patterns for Data Forwarding in Delay-Tolerant Networks , 2013, IEEE Transactions on Mobile Computing.

[2]  Anne-Marie Kermarrec,et al.  Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks , 2009, IEEE INFOCOM 2009.

[3]  Mario Gerla,et al.  Geo-opportunistic routing for vehicular networks [Topics in Automotive Networking] , 2010, IEEE Communications Magazine.

[4]  Mohan Kumar,et al.  Opportunities in Opportunistic Computing , 2010, Computer.

[5]  Guohui Lin,et al.  Improved Approximation Algorithms for the Capacitated Multicast Routing Problem , 2005, COCOON.

[6]  Peiyan Yuan,et al.  Impact of Strangers on Opportunistic Routing Performance , 2013, Journal of Computer Science and Technology.

[7]  Mohan Kumar,et al.  LOOP: A location based routing scheme for opportunistic networks , 2012, 2012 IEEE 9th International Conference on Mobile Ad-Hoc and Sensor Systems (MASS 2012).

[8]  Jianzhong Li,et al.  Approximate Physical World Reconstruction Algorithms in Sensor Networks , 2014, IEEE Transactions on Parallel and Distributed Systems.

[9]  Zhi-Zhong Chen,et al.  A 3.4713-approximation algorithm for the capacitated multicast tree routing problem , 2009, Theor. Comput. Sci..

[10]  Jie Wu,et al.  TOUR: Time-sensitive Opportunistic Utility-based Routing in delay tolerant networks , 2013, 2013 Proceedings IEEE INFOCOM.

[11]  Arun Venkataramani,et al.  Replication Routing in DTNs: A Resource Allocation Approach , 2010, IEEE/ACM Transactions on Networking.

[12]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[13]  Amarsinh Vidhate,et al.  Routing in Delay Tolerant Network , 2016 .

[14]  Keping Long,et al.  Spray and forward: Efficient routing based on the Markov location prediction model for DTNs , 2011, Science China Information Sciences.

[15]  Robin Kravets,et al.  Encounter-Based Routing in DTNs , 2009, INFOCOM.

[16]  Kevin C. Lee.  Geo-Opportunistic Routing for Vehicular Networks , 2010 .

[17]  Xiuzhen Cheng,et al.  TPS: a time-based positioning scheme for outdoor wireless sensor networks , 2004, IEEE INFOCOM 2004.

[18]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[19]  Deying Li,et al.  A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks , 2003, Networks.

[20]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[21]  Dong Xuan,et al.  P3-coupon: A probabilistic system for Prompt and Privacy-preserving electronic coupon distribution , 2011, 2011 IEEE International Conference on Pervasive Computing and Communications (PerCom).

[22]  Jie Wu,et al.  An Efficient Prediction-Based Routing in Disruption-Tolerant Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

[23]  Azzedine Boukerche,et al.  Energy-aware data-centric routing in microsensor networks , 2003, MSWIM '03.

[24]  Jianzhong Li,et al.  Curve Query Processing in Wireless Sensor Networks , 2015, IEEE Transactions on Vehicular Technology.

[25]  Robin Kravets,et al.  Encounter: based routing in DTNs , 2009, MOCO.

[26]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.