Issue No. 10 - Oct. (2013 vol. 12)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2012.158
Xi Fang , Arizona State University, Tempe
Dejun Yang , Arizona State University, Tempe
Guoliang Xue , Arizona State University, Tempe
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.
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
X. Fang, D. Yang and G. Xue, "MAP: Multiconstrained Anypath Routing in Wireless Mesh Networks," in IEEE Transactions on Mobile Computing, vol. 12, no. , pp. 1893-1906, 2013.