Multi-Constrained Anypath Routing in Wireless Mesh Networks

Anypath routing has been proposed to improve the performance of unreliable wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In this paper, we focus on anypath routing subject to K constraints, and present a polynomial time K-approximation algorithm. When K = 1, our algorithm is the optimal polynomial time algorithm for the corresponding problem. When K >= 2, the corresponding problem is NP-hard. We are the first to present an O(1)-approximation algorithm. Furthermore, our algorithm is as simple as Dijkstra's shortest path algorithm, and is therefore suitable for implementation in actual wireless routing protocols.

[1]  Jeffrey M. Jaffe,et al.  Algorithms for finding paths with multiple constraints , 1984, Networks.

[2]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[3]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[4]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[5]  Klara Nahrstedt,et al.  On finding multi-constrained paths , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[6]  Marwan Krunz,et al.  A randomized algorithm for finding a path subject to multiple QoS requirements , 2001, Comput. Networks.

[7]  Danny Raz,et al.  A simple efficient approximation scheme for the restricted shortest path problem , 2001, Oper. Res. Lett..

[8]  Peter Larsson.  Selection diversity forwarding in a multihop packet radio network with fading channel and capture , 2001, MobiHoc '01.

[9]  Fernando A. Kuipers,et al.  An overview of constraint-based path selection algorithms for QoS routing , 2002 .

[10]  Xin Yuan.  Heuristic algorithms for multiconstrained quality-of-service routing , 2002, IEEE/ACM Trans. Netw..

[11]  Funda Ergün,et al.  An improved FPTAS for Restricted Shortest Path , 2002, Inf. Process. Lett..

[12]  Ariel Orda,et al.  Precomputation schemes for QoS routing , 2003, TNET.

[13]  Michele Zorzi,et al.  Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance , 2003, IEEE Trans. Mob. Comput..

[14]  Jitendra Padhye,et al.  Routing in multi-radio, multi-hop wireless mesh networks , 2004, MobiCom '04.

[15]  Nitin H. Vaidya,et al.  MAC-layer anycasting in ad hoc networks , 2004, Comput. Commun. Rev..

[16]  A. Orda,et al.  A comparison of exact and ε-approximation algorithms for constrained routing , 2005 .

[17]  Abbas Jamalipour,et al.  Wireless communications , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[18]  Samir Ranjan Das,et al.  Exploiting path diversity in the link layer in wireless ad hoc networks , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[19]  Robert Tappan Morris,et al.  ExOR: opportunistic multi-hop routing for wireless networks , 2005, SIGCOMM '05.

[20]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2005, Wirel. Networks.

[21]  Srihari Nelakuditi,et al.  On selection of candidates for opportunistic anypath forwarding , 2006, MOCO.

[22]  Piet Van Mieghem,et al.  A Comparison of Exact and epsilon-Approximation Algorithms for Constrained Routing , 2006, Networking.

[23]  Ratul Mahajan,et al.  Measurement-based models of delivery and interference in static wireless networks , 2006, SIGCOMM 2006.

[24]  Matthias Grossglauser,et al.  Least-Cost Opportunistic Routing , 2007 .

[25]  Arunabha Sen,et al.  Finding a Path Subject to Many Additive QoS Constraints , 2007, IEEE/ACM Transactions on Networking.

[26]  Sachin Katti,et al.  Trading structure for randomness in wireless opportunistic routing , 2007, SIGCOMM 2007.

[27]  Christos D. Zaroliagis,et al.  Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-Linear Objectives with Applications , 2006, Theory of Computing Systems.

[28]  Hongqiang Zhai,et al.  On End-to-End Throughput of Opportunistic Routing in Multirate and Multihop Wireless Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[29]  G. Xue,et al.  Polynomial time approximation algorithms for multi-constrained QoS routing , 2008, TNET.

[30]  H. Dubois-Ferriere,et al.  Multirate Anypath Routing in Wireless Mesh Networks , 2008, IEEE INFOCOM 2009.

[31]  François Ingelrest,et al.  Potentials of Opportunistic Routing in Energy-Constrained Wireless Sensor Networks , 2009, EWSN.