Maximum throughput and fair bandwidth allocation in multi-channel wireless mesh networks

被引:0
作者
Tang, Jian [1 ]
Xue, Guoliang [1 ]
Zhang, Weiyi [1 ]
机构
[1] Arizona State Univ, Dept Comp Sci & Engn, Tempe, AZ 85287 USA
来源
25TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-7, PROCEEDINGS IEEE INFOCOM 2006 | 2006年
关键词
multi-channel wireless mesh network; bandwidth allocation; fairness; throughput maximization; QoS;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Wireless mesh network is designed as an economical solution for last-mile broadband Internet access. In this paper, we study bandwidth allocation in multi-channel multihop wireless mesh networks. Our optimization goals are to maximize the network throughput and, at the same time, to enhance fairness. First, we formulate and present an Linear Programming (LP) formulation to solve the Maximum throughput Bandwidth Allocation (MBA) problem. However, simply maximizing the throughput may lead to a severe bias on bandwidth allocation among wireless mesh nodes. In order to achieve a good tradeoff between fairness and throughput, we consider a simple max-min fairness model which leads to high throughput solutions with guaranteed maximum minimum bandwidth allocation values, and the well-known Lexicographical Max-Min (LMM) model. Correspondingly, we formulate the Max-min guaranteed Maximum throughput Bandwidth Allocation (MMBA) problem and the Lexicographical Max-Min Bandwidth Allocation (LMMBA) problem. For the former one, we present an LP formulation to provide optimal solutions and for the later one, we propose a polynomial time optimal algorithm.
引用
收藏
页码:1942 / 1951
页数:10
相关论文
共 32 条
  • [1] [Anonymous], 2005, ELSEVIER J COMPUTER, DOI DOI 10.1016/J.COMNET.2004.12.001
  • [2] BAHL P, P ACM MOBICOM 2004, P216
  • [3] Bazaraa M. S., 2005, LINEAR PROGRAMMING N
  • [4] Bertsekas D. P., 1991, Data Networks, V2nd
  • [5] Boyd S., 2004, CONVEX OPTIMIZATION
  • [6] Burkhart M., 2004, P ACM MOBIHOC 2004, P9
  • [7] Chandra R., P IEEE ICNP 2004, P271
  • [8] DRAVES R, P ACM MOBICOM 2004, P114
  • [9] Ford L. R, 1962, FLOWS NETWORKS
  • [10] GAMBIROZA V, P ACM MOBICOM 2004, P289