Mobility Tolerant Firework Routing for Improving Reachability in MANETs

In this paper, we investigate our mobility-assisted and adaptive broadcast routing mechanism, called Mobility Tolerant Firework Routing (MTFR), which utilizes the concept of potentials for routing and improves node reachability, especially in situations with high mobility, by including a broadcast mechanism. We perform detailed evaluations by simulations in a mobile environment and demonstrate the advantages of MTFR over conventional potential-based routing. In particular, we show that MTFR produces better reachability in many aspects at the expense of a small additional transmission delay and intermediate traffic overhead, making MTFR a promising routing protocol and feasible for future mobile Internet infrastructures.

[1]  Stavros Toumpis,et al.  Delay tolerant firework routing: a geographic routing protocol for wireless delay tolerant networks , 2013, EURASIP J. Wirel. Commun. Netw..

[2]  Liam Murphy,et al.  An Evaluation of Parameterized Gradient Based Routing With QoE Monitoring for Multiple IPTV Providers , 2011, IEEE Transactions on Broadcasting.

[3]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

[4]  Martin May,et al.  HEAT: Scalable Routing in Wireless Mesh Networks Using Temperature Fields , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[5]  Mathew D. Penrose,et al.  On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.

[6]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[7]  Stan Ratliff,et al.  Dynamic MANET On-demand (AODVv2) Routing , 2013 .

[8]  Anindya Basu,et al.  Routing using potentials: a dynamic traffic-aware routing algorithm , 2003, SIGCOMM '03.

[9]  Stavros Toumpis,et al.  Mother nature knows best: A survey of recent results on wireless networks based on analogies with physics , 2008, Comput. Networks.

[10]  John Domingue,et al.  The Future of the Internet , 1999, Academia Letters.

[11]  Leandros Tassiulas,et al.  Packetostatics: deployment of massively dense sensor networks as an electrostatics problem , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[12]  M. Penrose.  The longest edge of the random minimal spanning tree , 1997 .

[13]  Kenji Leibnitz,et al.  MTFR: Mobility Tolerant Firework Routing , 2011, 2011 IEEE 30th Symposium on Reliable Distributed Systems Workshops.

[14]  Vincent Lenders,et al.  Link-Diversity Routing: A Robust Routing Paradigm for Mobile Ad Hoc Networks , 2008, 2008 IEEE Wireless Communications and Networking Conference.

[15]  Won-Gyu Lee,et al.  A Potential Based Routing Protocol for Mobile Ad Hoc Networks , 2009, 2009 11th IEEE International Conference on High Performance Computing and Communications.

[16]  Xavier Pérez-Giménez,et al.  Large Connectivity for Dynamic Random Geometric Graphs , 2009, IEEE Transactions on Mobile Computing.

[17]  Stavros Toumpis,et al.  DTFR: A geographic routing protocol for wireless Delay Tolerant Networks , 2011, 2011 The 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop.