Abstract
This paper studies two NP-hard problems, the maximum bandwidth routing problem (MBRP) and the maximum flow routing problem (MFRP) in multi-hop wireless mesh networks (WMNs) to support diverse Quality-of-Service (QoS). First, upper bounds on their optimal values are derived, and a lower bound is derived on the feasible value obtained for the MBRP. Then, heuristic algorithms for the two problems are proposed. With the upper bound and the lower bound, an approximation ratio for the heuristic algorithm of the MBRP is obtained. © 2008 Springer.
Cite
CITATION STYLE
Kuo, Y. L., Hu, C. C., & Chiu, C. Y. (2008). Maximum traffic routing problems in wireless mesh networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5353 LNCS, pp. 802–806). https://doi.org/10.1007/978-3-540-89796-5_86
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
