Robustness and Scalability Improvements for Distance Vector Routing in Large WMNs

IEEE 802.11s enables rapid deployment of Wireless Mesh Networks (WMNs) to supply basic wireless connectivity for client hardware. Application of distance vector based routing protocols proved advantageous in WMNs for efficiency, i.e., low overhead. However, it remains unclear, if plain distance vector routing protocols allow for adequate robustness against outages in large installations. Particularly, the required time for routing re-convergence may be too long, as in practice, the count-to-infinity phenomenon needs to be dealt with. This paper proposes Spare Forwarding Entries (SFEs), resulting in a proactive mechanism improving robustness against outages when compared to the reactive behavior of distance vector protocols. It works as an extension of distance vector operation, i.e., efficiency can be preserved. We integrate SFE into the well-known Babel routing protocol and also propose measures to increase scalability. Simulation studies indicate that SFEs improve robustness against node outages significantly. In certain scenarios, the Packet Delivery Ratio (PDR) was doubled with our mechanisms in place. Further modifications let Babel-based WMNs scale up to 300 nodes. Moreover, convergence times and overhead are significantly smaller.

[1]  J. J. Garcia-Luna-Aceves,et al.  MDVA: a distance-vector multipath routing protocol , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[2]  Bernd Freisleben,et al.  Proactive Distance-Vector Multipath Routing for Wireless Ad Hoc Networks , 2003 .

[3]  George F. Riley,et al.  The ns-3 Network Simulator , 2010, Modeling and Tools for Network Simulation.

[4]  Rute C. Sofia,et al.  Distributed Path Computation Without Transient Loops: An Intermediate Variables Approach , 2007, ITC.

[5]  J. J. Garcia-Luna-Aceves,et al.  A simple approximation to minimum-delay routing , 1999, SIGCOMM '99.

[6]  Peter Paluch,et al.  Cisco's Enhanced Interior Gateway Routing Protocol (EIGRP) , 2016, RFC.

[7]  Rakesh Kumar,et al.  AODV-MBR: A New Routing Protocol with Modified Backup Approach , 2012 .

[8]  Terry Koziniec,et al.  An experimental comparison of routing protocols in multi hop ad hoc networks , 2010, 2010 Australasian Telecommunication Networks and Applications Conference.

[9]  Francisco Vasques,et al.  A review of scalability and topological stability issues in IEEE 802.11s wireless mesh networks deployments , 2016, Int. J. Commun. Syst..

[10]  Miroslaw Malek,et al.  NPART - node placement algorithm for realistic topologies in wireless multihop network simulation , 2009, SimuTools.

[11]  David L. Johnson,et al.  Simple pragmatic approach to mesh routing using BATMAN , 2008 .

[12]  Martin Backhaus,et al.  Robust and Scalable Routing in Wireless Mesh Networks Using Interference-Disjoint Backup Paths , 2019, 2019 12th IFIP Wireless and Mobile Networking Conference (WMNC).

[13]  J. J. Garcia-Luna-Aceves,et al.  An algorithm for multipath computation using distance-vectors with predecessor information , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[14]  Leandro Navarro-Moldes,et al.  Enabling individually entrusted routing security for open and decentralized community networks , 2018, Ad Hoc Networks.

[15]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[16]  J. J. Garcia-Luna-Aceves,et al.  Loop-free routing using diffusing computations , 1993, TNET.

[17]  Juliusz Chroboczek,et al.  The Babel Routing Protocol , 2021, RFC.

[18]  Günter Schäfer,et al.  A Comprehensive Framework to Evaluate Wireless Networks in Simulation and Real Systems , 2018, 2018 IEEE/ACM 22nd International Symposium on Distributed Simulation and Real Time Applications (DS-RT).