The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - Oct. (2013 vol.12)
pp: 1893-1906
Xi Fang , Arizona State University, Tempe
Dejun Yang , Arizona State University, Tempe
Guoliang Xue , Arizona State University, Tempe
ABSTRACT
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. Previous studies on anypath routing have concentrated on finding an anypath, which optimizes a single quality of service (QoS) parameter. In this paper, we study anypath routing subject to multiple constraints. We first prove that the problem is NP-hard when the number of constraints is larger than one. We then present a polynomial time K--approximation algorithm MAP, where K is the number of constraints. Our algorithm is as simple as Dijkstra's shortest path algorithm. Therefore, it is suitable for implementation in wireless routing protocols.
INDEX TERMS
Routing, Approximation algorithms, Quality of service, Approximation methods, Delay, Energy consumption, Wireless communication, multiple constraints, Routing, Approximation algorithms, Quality of service, Approximation methods, Delay, Energy consumption, Wireless communication, provably good approximation algorithms, Wireless mesh networks, anypath routing
CITATION
Xi Fang, Dejun Yang, Guoliang Xue, "MAP: Multiconstrained Anypath Routing in Wireless Mesh Networks", IEEE Transactions on Mobile Computing, vol.12, no. 10, pp. 1893-1906, Oct. 2013, doi:10.1109/TMC.2012.158
REFERENCES
[1] S. Biswas and R. Morris, "ExOR: Opportunistic Multi-Hop Routing for Wireless Networks," Proc. ACM Special Interest Group on Data Comm. (SIGCOMM '05), pp. 133-143, Aug. 2005.
[2] S. Chachulski, M. Jennings, S. Katti, and D. Katabi, "Trading Structure for Randomness in Wireless Opportunistic Routing," Proc. ACM Special Interest Group on Data Comm. (SIGCOMM '07), 2007.
[3] S. Chen and K. Nahrstedt, "On Finding Multi-Constrained Paths," Proc. IEEE Int'l Conf. Comm. (ICC '98), pp. 874-879, 1998.
[4] S. Chen and K. Nahrstedt, "An Overview of Quality of Service Routing for Next-Generation High-Speed Networks: Problems and Solutions," IEEE Network, vol. 12, no. 6, pp. 64-79, Nov. 1998.
[5] R.R. Choudhury and N.H. Vaidya, "MAC-Layer Anycasting in Ad Hoc Networks," Proc. ACM SIGCOMM Computer Comm. Rev., 2004.
[6] Cisco, "Cisco Aironet 802.11a/b/g Wireless LAN Client Adapters (CB21AG and PI21AG) Installation and Configuration Guide," technical specification, 2007.
[7] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms. MIT, 2001.
[8] D.D. Couto, D. Aguayo, J. Bicket, and R. Morris, "A High-Throughput Path Metric for Multi-Hop Wireless Routing," Proc. ACM MobiCom, pp. 134-146. Sept. 2003.
[9] R. Draves, J. Padhye, and B. Zill, "Routing in Multi-Radio, Multi-Hop Wireless Mesh Networks," Proc. ACM MobiCom, pp. 114-128, Sept. 2004.
[10] H. Dubois-Ferrière, "Anypath Routing," PhD dissertation, Ecole Poly-technique Fédérale de Lausanne, Nov. 2006.
[11] H. Dubois-Ferrière, M. Grossglauser, and M. Vetterli, "Least-Cost Opportunistic Routing," Proc. Allerton Conf., Sept. 2007.
[12] X. Fang, D. Yang, P. Gundecha, and G. Xue, "Multi-Constrained Anypath Routing in Wireless Mesh Networks," Proc. IEEE CS Seventh Ann. Conf. Sensor Mesh and Ad Hoc Comm. and Networks (SECON '10), pp. 475-483, June 2010.
[13] A. Goldsmith, Wireless Communications. Cambridge Univ., Aug. 2005.
[14] J.M. Jaffe, "Algorithms for Finding Paths with Multiple Constraints," Networks, vol. 14, no. 1, pp. 95-116, Oct. 2006.
[15] S. Jain and S.R. Das, "Exploiting Path Diversity in the Link Layer in Wireless Ad Hoc Networks," Ad Hoc Networks, vol. 6, no. 5, pp. 805-825, July 2008.
[16] T. Korkmaz and M. Krunz, "A Randomized Algorithm for Finding a Path Subject to Multiple QoS Requirements," Computer Networks, vol. 36, pp. 251-268, 2001.
[17] F.A. Kuipers, A. Orda, D. Raz, and P. Van Mieghem, "A Comparison of Exact and A-Approximation Algorithms for Constrained Routing," Proc. IFIP Networking Conf., May 2006.
[18] F. Kuipers, P. Van Mieghem, T. Korkmaz, M. Krunz, "An Overview of Constraint-Based Path Selection Algorithms for QoS Routing," IEEE Comm. Magazine, vol. 40, no. 12, pp. 50-55, Dec. 2002.
[19] P. Larsson, "Selection Diversity Forwarding in a Multihop Packet Radio Network with Fading Channel and Capture," SIGMOBILE Mobile Computing Comm. Rev., vol. 5, no. 4, pp. 47-54, Oct. 2001.
[20] R. Laufer, H. Dubois-Ferrière, and L. Kleinrock, "Multirate Anypath Routing in Wireless Mesh Networks," Proc. IEEE INFOCOM, pp. 37-45, Apr. 2009.
[21] R. Laufer and L. Kleinrock, "Multirate Anypath Routing in Wireless Mesh Networks," Technical Report UCLA-CSD-TR080025, Univ. of California, Los Angeles, Computer Science Dept., Aug. 2008.
[22] D.H. Lorenz and D. Raz, "A Simple Efficient Approximation Scheme for the Restricted Shortest Path Problem," Operations Research Letters, vol. 28, no. 5, pp. 213-219. June 2001.
[23] A. Orda and A. Sprintson, "Precomputation Schemes for QoS Routing," IEEE/ACM Trans. Networking, vol. 11, no. 4, pp. 578-591, Aug. 2003.
[24] C. Reis, R. Mahajan, M. Rodrig, D. Wetherall, and J. Zahorjan, "Measurement-Based Models of Delivery and Interference in Static Wireless Networks," Proc. ACM Special Interest Group on Data Comm. (SIGCOMM '06), pp. 51-62, Sept. 2006.
[25] G. Schaefer, F. Ingelrest, and M. Vetterli, "Potentials of Opportunistic Routing in Energy-Constrained Wireless Sensor Networks," Proc. Sixth European Conf. Wireless Sensor Networks (WSNs), pp. 118-133, Feb. 2009.
[26] G. Tsaggouris and C. Zaroliagis, "Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-Linear Objectives with Applications," Theory of Computing Systems, vol. 45, no. 1, pp. 162-186, Apr. 2009.
[27] Z. Wang and J. Crowcroft, "Quality-of-Service Routing for Supporting Multimedia Applications," IEEE J. Selected Areas in Comm., vol. 14, no. 7, pp. 1228-1234, Sept. 1996.
[28] G. Xue, A. Sen, W. Zhang, J. Tang, and K. Thulasiraman, "Finding a Path Subject to Many Additive QoS Constraints," IEEE/ACM Trans. Networking, vol. 15, no. 1, pp. 201-211, Feb. 2007.
[29] G. Xue, W. Zhang, J. Tang, and K. Thulasiraman, "Polynomial Time Approximation Algorithms for Multi-Constrained QoS Routing," IEEE/ACM Trans. Networking, vol. 16, no. 3, pp. 656-669, June 2008.
[30] X. Yuan, "Heuristic Algorithms for Multiconstrained Quality-of-Service Routing," IEEE/ACM Trans. Networking, vol. 10, no. 2, pp. 244-256, Apr. 2002.
[31] K. Zeng, W. Lou, and H. Zhai, "On End-to-End Throughput of Opportunistic Routing in Multirate and Multihop Wireless Networks," Proc. IEEE INFOCOM, Apr. 2008.
[32] Z. Zhong, J. Wang, S. Nelakuditi, and G.-H. Lu, "On Selection of Candidates for Opportunistic AnyPath Forwarding," ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 10, no. 4, pp. 1-2, Oct. 2006.
[33] M. Zorzi and R.R. Rao, "Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance," IEEE Trans. Mobile Computing, vol. 2, no. 4, pp. 337-348. Oct. 2003.
28 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool