Abstract
Wireless mesh networks (WMNs) consist of static wireless routers, some of which, called gateways, are directly connected to the wired infrastructure. User stations are connected to the wired infrastructure via wireless routers. This paper presents a simple and effective management architecture for WMNs, termed configurable access network (CAN). Under this architecture, the control function is separated from the switching function, so that the former is performed by an network operation center (NOC) which is located in the wired infrastructure. The NOC monitors the network topology and user performance requirements, from which it computes a path between each wireless router and a gateway, and allocates fair bandwidth for carrying the associated traffic along the selected route. By performing such functions in the NOC, we offload the network management overhead from wireless routers, and enable the deployment of simple/low-cost wireless routers. Our goal is to maximize the network utilization by balancing the traffic load, while providing fair service and quality of service (QoS) guarantees to the users. Since, this problem is NP-hard, we devise approximation algorithms that provide guarantees on the quality of the approximated solutions against the optimal solutions. The simulations show that the results of our algorithms are very close to the optimal solutions.
| Original language | English |
|---|---|
| Pages (from-to) | 2450-2466 |
| Number of pages | 17 |
| Journal | Computer Networks |
| Volume | 51 |
| Issue number | 10 |
| DOIs | |
| Publication status | Published - 2007 Jul 11 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
Cite this
}
Efficient load-balancing routing for wireless mesh networks. / Bejerano, Yigal; Han, Seung Jae; Kumar, Amit.
In: Computer Networks, Vol. 51, No. 10, 11.07.2007, p. 2450-2466.Research output: Contribution to journal › Article
TY - JOUR
T1 - Efficient load-balancing routing for wireless mesh networks
AU - Bejerano, Yigal
AU - Han, Seung Jae
AU - Kumar, Amit
PY - 2007/7/11
Y1 - 2007/7/11
N2 - Wireless mesh networks (WMNs) consist of static wireless routers, some of which, called gateways, are directly connected to the wired infrastructure. User stations are connected to the wired infrastructure via wireless routers. This paper presents a simple and effective management architecture for WMNs, termed configurable access network (CAN). Under this architecture, the control function is separated from the switching function, so that the former is performed by an network operation center (NOC) which is located in the wired infrastructure. The NOC monitors the network topology and user performance requirements, from which it computes a path between each wireless router and a gateway, and allocates fair bandwidth for carrying the associated traffic along the selected route. By performing such functions in the NOC, we offload the network management overhead from wireless routers, and enable the deployment of simple/low-cost wireless routers. Our goal is to maximize the network utilization by balancing the traffic load, while providing fair service and quality of service (QoS) guarantees to the users. Since, this problem is NP-hard, we devise approximation algorithms that provide guarantees on the quality of the approximated solutions against the optimal solutions. The simulations show that the results of our algorithms are very close to the optimal solutions.
AB - Wireless mesh networks (WMNs) consist of static wireless routers, some of which, called gateways, are directly connected to the wired infrastructure. User stations are connected to the wired infrastructure via wireless routers. This paper presents a simple and effective management architecture for WMNs, termed configurable access network (CAN). Under this architecture, the control function is separated from the switching function, so that the former is performed by an network operation center (NOC) which is located in the wired infrastructure. The NOC monitors the network topology and user performance requirements, from which it computes a path between each wireless router and a gateway, and allocates fair bandwidth for carrying the associated traffic along the selected route. By performing such functions in the NOC, we offload the network management overhead from wireless routers, and enable the deployment of simple/low-cost wireless routers. Our goal is to maximize the network utilization by balancing the traffic load, while providing fair service and quality of service (QoS) guarantees to the users. Since, this problem is NP-hard, we devise approximation algorithms that provide guarantees on the quality of the approximated solutions against the optimal solutions. The simulations show that the results of our algorithms are very close to the optimal solutions.
UR - http://www.scopus.com/inward/record.url?scp=34247552686&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34247552686&partnerID=8YFLogxK
U2 - 10.1016/j.comnet.2006.09.018
DO - 10.1016/j.comnet.2006.09.018
M3 - Article
AN - SCOPUS:34247552686
VL - 51
SP - 2450
EP - 2466
JO - Computer Networks
JF - Computer Networks
SN - 1389-1286
IS - 10
ER -