Maximum Traffic Routing Problems in Wireless Mesh Networks

  • Authors:
  • Yu-Liang Kuo;Chia-Cheng Hu;Chun-Yuan Chiu

  • Affiliations:
  • Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan;Department of Information Management, Naval Academy, Kaohsiung, Taiwan;Information and Communications Research Laboratories, Industrial Technology Research Institute of Taiwan,

  • Venue:
  • PCM '08 Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.