Using local speed information as routing metric for delay tolerant networks

In many practical situations, the mobility is critical factor for an intended message delivery. Recently studies have found that mobility itself affects the network performance (capacity of the network, security, connectivity, coverage, etc.). However, how to effective use these characteristics of mobility in design DTN routing protocol has not been well studied yet. In this paper, we proposed a routing protocol that uses speed of the local node as routing metric for opportunistic packet relay in DTN (Delay Tolerant Networks). Moreover, the choosing of the relay nodes is only based on the comparison of speed value. It does not require any history information, global knowledge or mobility patterns of other nodes. This makes our schemes ideal for resources limited (computational power, memory, etc.) and dynamic large-scale networks. The performance of our protocol is compared with several related works. Simulations show that our scheme has better performance. Key-Words: DTN, n-copy routing, mobility, resources, ONE

[1]  D. Stoyan,et al.  Stochastic Geometry and Its Applications , 1989 .

[2]  J. Seaman.  Introduction to the theory of coverage processes , 1990 .

[3]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[4]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[5]  Cauligi S. Raghavendra,et al.  Single-copy routing in intermittently connected mobile networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[6]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

[7]  Donald F. Towsley,et al.  Mobility improves coverage of sensor networks , 2005, MobiHoc '05.

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

[9]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[11]  Johny Jose,et al.  Routing Approaches in Delay Tolerant Networks: A Survey , 2010 .

[12]  Jian Shen,et al.  A Priority Routing Protocol Based on Location and Moving Direction in Delay Tolerant Networks , 2010, IEICE Trans. Inf. Syst..

[13]  Hossam S. Hassanein,et al.  Routing Schemes for Delay-Tolerant Networks - An Applications Perspective , 2012 .

[14]  Xinbing Wang,et al.  Mobility Increases the Connectivity of Wireless Networks , 2013, IEEE/ACM Transactions on Networking.

[15]  Young-Sik Jeong,et al.  An Efficient Routing Scheme Based on Social Relations in Delay-Tolerant Networks , 2014 .

[16]  Meenu Chawla,et al.  Survey of buffer management policies for delay tolerant networks , 2014 .

[17]  Jiangwen Wan,et al.  An Effective and Secure Epidemic Routing for Disruption-Tolerant Networks , 2014, 2014 Sixth International Conference on Intelligent Human-Machine Systems and Cybernetics.

[18]  R. S. D. Wahida Banu,et al.  Encounter based fuzzy logic routing in delay tolerant networks , 2015, Wirel. Networks.