Abstract
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.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings - IEEE INFOCOM |
| DOIs | |
| State | Published - 2006 |
| Event | INFOCOM 2006: 25th IEEE International Conference on Computer Communications - Barcelona, Spain Duration: Apr 23 2006 → Apr 29 2006 |
Other
| Other | INFOCOM 2006: 25th IEEE International Conference on Computer Communications |
|---|---|
| Country | Spain |
| City | Barcelona |
| Period | 4/23/06 → 4/29/06 |
Fingerprint
Keywords
- Bandwidth allocation
- Fairness
- Multi-channel wireless mesh network
- QoS
- Throughput maximization
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Hardware and Architecture
Cite this
Maximum throughput and fair bandwidth allocation in multi-channel wireless mesh networks. / Tang, Jian; Xue, Guoliang; Zhang, Weiyi.
Proceedings - IEEE INFOCOM. 2006. 4146902.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Maximum throughput and fair bandwidth allocation in multi-channel wireless mesh networks
AU - Tang, Jian
AU - Xue, Guoliang
AU - Zhang, Weiyi
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
KW - Bandwidth allocation
KW - Fairness
KW - Multi-channel wireless mesh network
KW - QoS
KW - Throughput maximization
UR - http://www.scopus.com/inward/record.url?scp=35449000704&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=35449000704&partnerID=8YFLogxK
U2 - 10.1109/INFOCOM.2006.249
DO - 10.1109/INFOCOM.2006.249
M3 - Conference contribution
AN - SCOPUS:35449000704
SN - 1424402212
SN - 9781424402212
BT - Proceedings - IEEE INFOCOM
ER -