The robust joint solution for channel assignment and routing for wireless mesh networks with time partitioning

被引:21
作者
Wellons, Jonathan [1 ]
Xue, Yuan [1 ]
机构
[1] Vanderbilt Univ, Dept Elect Engn & Comp Sci, Nashville, TN USA
关键词
Wireless mesh network; Routing; Dynamic traffic demand; Channel assignment;
D O I
10.1016/j.adhoc.2011.05.002
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Joint channel assignment and routing is an essential yet challenging issue for multi-radio multi-channel wireless mesh networks. Though several works are presented in the existing literature to approach this problem, the key question - how to ensure that the resulting network performance can closely track the optimal solution under high traffic variability without incurring too much overhead, remains unanswered. In this work, we present a new solution called "Robust joint Channel Assignment and Routing with Time partitioning (RCART)" for WMNs. RCART consists of three steps: (1) Time Partitioning and Traffic Characterization, which accomplishes the goal of partitioning time into periodic intervals with consistent properties which can be routed efficiently, (2) Robust Routing, which finds a robust routing scheme that provides an upper bound on the worst-case network performance for traffic demands that fall into a convex region, (3) Channel Assignment, which allocates radios to fixed channels during the time interval identified in step 1 and based on the knowledge of traffic distribution from step 2, using the worst-case congestion ratio as a robustness metric in its objective. Introducing time partitions as an additional control variable in the robust mesh routing RCART solution significantly improves average-case performance. Performance evaluation is conducted for RCART using real traffic demand traces. The results show that our RCART solution significantly outperforms the existing works without time partitioning or with simpler traffic profile models. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:210 / 221
页数:12
相关论文
共 16 条
[1]  
[Anonymous], P ACM MOBICOM
[2]  
Applegate D, 2003, ACM SIGCOMM COMP COM, V33, P313, DOI 10.1145/972426.944770
[3]  
DAI L, 2008, P IEEE INFOCOM
[4]   THRESHOLD ACCEPTING - A GENERAL-PURPOSE OPTIMIZATION ALGORITHM APPEARING SUPERIOR TO SIMULATED ANNEALING [J].
DUECK, G ;
SCHEUER, T .
JOURNAL OF COMPUTATIONAL PHYSICS, 1990, 90 (01) :161-175
[5]  
Gopalan K., 2004, ACM MOBILE COMPUTING, V8, P50, DOI DOI 10.1145/997122.997130
[6]   The capacity of wireless networks [J].
Gupta, P ;
Kumar, PR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) :388-404
[7]  
KODIALAM M, 2005, P ACM MOB
[8]  
Kravitz S., 1967, Mathematics Magazine, V40, P65, DOI [DOI 10.2307/2688509, DOI 10.1080/0025570X.1967.11975768]
[9]  
LIN X, 2007, IEEE J SELECTED AREA
[10]  
Meng Xiaoqiao., 2004, P ACM MOBICOM