TY - GEN
T1 - A distributed algorithm for multi-constrained anypath routing in wireless mesh networks
AU - Fang, Xi
AU - Yang, Dejun
AU - Xue, Guoliang
PY - 2011/9/2
Y1 - 2011/9/2
N2 - Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In this paper, we study the problem of finding an anypath subject to multiple (K) constraints, which has been proved to be NP-hard. We present a polynomial distributed K-approximation routing algorithm. Our algorithm is as simple as Bellman-Ford's shortest path algorithm. Extensive experiments show that our algorithm is very efficient and its result is as good as that obtained by the best centralized algorithm which requires the global information.
AB - Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In this paper, we study the problem of finding an anypath subject to multiple (K) constraints, which has been proved to be NP-hard. We present a polynomial distributed K-approximation routing algorithm. Our algorithm is as simple as Bellman-Ford's shortest path algorithm. Extensive experiments show that our algorithm is very efficient and its result is as good as that obtained by the best centralized algorithm which requires the global information.
UR - http://www.scopus.com/inward/record.url?scp=80052180185&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80052180185&partnerID=8YFLogxK
U2 - 10.1109/icc.2011.5962584
DO - 10.1109/icc.2011.5962584
M3 - Conference contribution
AN - SCOPUS:80052180185
SN - 9781612842332
T3 - IEEE International Conference on Communications
BT - 2011 IEEE International Conference on Communications, ICC 2011
T2 - 2011 IEEE International Conference on Communications, ICC 2011
Y2 - 5 June 2011 through 9 June 2011
ER -