Path selection algorithms for fault tolerance in wireless mesh networks

Recently Wireless Mesh Networks (WMNs) have emerged as a key technology for providing high-bandwidth networking among peer nodes over a specific coverage area. Features such as low cost, ease of deployment, self-configuration and self-healing make them one of the most promising global telecommunication systems. Despite their advantages, however, several research challenges remain in all protocol layers. In this paper, we address the main challenging issues related to the routing aspects in a WMN. Routing in such networks is performed through multi-hop paths where intermediate nodes cooperatively make forwarding decisions based on their knowledge regarding the network topology. However, in an unideal dynamic environment due to frequent or rare node failures/misbehavior, traditional ad-hoc routing protocols suffer from high routing overhead or energy consumption. Motivated by this, we propose several path selection algorithms which adapt to such topology dynamics. The main objective of these routing schemes is to provide fault tolerance without sacrificing the energy and computational complexity efficiency. Numerical investigations, based on extensive simulations, validate the effectiveness of our proposals even when faulty nodes subsist in the environment.

[1]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[2]  Diego Klabjan,et al.  Topology Formation for Wireless Mesh Network Planning , 2009, IEEE INFOCOM 2009.

[3]  Marco Conti,et al.  Mesh networks: commodity multihop ad hoc networks , 2005, IEEE Communications Magazine.

[4]  Alain Greiner,et al.  A reconfigurable routing algorithm for a fault-tolerant 2D-Mesh Network-on-Chip , 2008, 2008 45th ACM/IEEE Design Automation Conference.

[5]  Nick McKeown,et al.  Designing a Fault-Tolerant Network Using Valiant Load-Balancing , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[6]  Klara Nahrstedt,et al.  Fault tolerant routing in mobile ad hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[7]  Alhussein A. Abouzeid,et al.  Reactive routing overhead in networks with unreliable nodes , 2003, MobiCom '03.

[8]  Rakesh Kawatra,et al.  A hop constrained min-sum arborescence with outage costs , 2003, 36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the.

[9]  B. John Oommen,et al.  A Fault-Tolerant Routing Algorithm for Mobile Ad Hoc Networks Using a Stochastic Learning-Based Weak Estimation Procedure , 2006, 2006 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications.

[10]  Dharma P. Agrawal,et al.  Multipath Routing in Wireless Mesh Networks , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[11]  Ian F. Akyildiz,et al.  A survey on wireless mesh networks , 2005, IEEE Communications Magazine.

[12]  F. Vejrazka.  Galileo and the Other Satellite Navigation Systems , 2007, 2007 17th International Conference Radioelektronika.

[13]  Martin May,et al.  Routing Packets into Wireless Mesh Networks , 2007, Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2007).

[14]  Robin Kravets,et al.  Designing routing metrics for mesh networks , 2005 .

[15]  Mario Gerla,et al.  Robust MANET routing using adaptive path redundancy and coding , 2009, 2009 First International Communication Systems and Networks and Workshops.

[16]  Stephen B. Wicker,et al.  The energy-robustness tradeoff for routing in wireless sensor networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..