Throughput-Optimal Configuration of Fixed Wireless Networks

被引:39
作者
Karnik, Aditya [1 ]
Iyer, Aravind [1 ]
Rosenberg, Catherine [2 ]
机构
[1] Gen Motors India Sci Lab, Bangalore 560066, Karnataka, India
[2] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada
基金
加拿大自然科学与工程研究理事会; 美国国家科学基金会;
关键词
Capacity; fixed wireless networks; IEEE; 802.16; mesh networks; optimal scheduling and routing;
D O I
10.1109/TNET.2007.909717
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we address the following two questions concerning the capacity and configuration of fixed wireless networks: (i) given a set of wireless nodes with arbitrary but fixed locations, and a set of data flows, what is the max-min achievable throughput? and (ii) how should the network be configured to achieve the optimum? We consider these questions from a networking standpoint assuming point-to-point links, and employ a rigorous physical layer model to model conflict relationships between them. Since we seek capacity results, we assume that the network is operated using an appropriate schedule of conflict-free link activations. We develop and investigate a novel optimization framework to determine the optimal throughput and configuration, i.e., flow routes, link activation schedules and physical layer parameters. Determining the optimal throughput is a computationally hard problem, in general. However, using a smart enumerative technique we obtain numerical results for several different scenarios of interest. We obtain several important insights into the structure of the optimal routes, schedules and physical layer parameters. Besides determining the achievable throughput, we believe that our optimization-based framework can also be used as a tool, for configuring scheduled wireless networks, such as those based on IEEE 802.16.
引用
收藏
页码:1161 / 1174
页数:14
相关论文
共 23 条
[1]   Wireless mesh networks: a survey [J].
Akyildiz, IF ;
Wang, XD ;
Wang, WL .
COMPUTER NETWORKS, 2005, 47 (04) :445-487
[2]   The medium time metric: High throughput route selection in multi-rate ad hoc wireless networks [J].
Awerbuch, Baruch ;
Holmer, David ;
Rubens, Herbert .
MOBILE NETWORKS & APPLICATIONS, 2006, 11 (02) :253-266
[3]   Guaranteeing fair service to persistent dependent tasks [J].
Bar-Noy, A ;
Mayer, A ;
Schieber, B ;
Sudan, M .
SIAM JOURNAL ON COMPUTING, 1998, 27 (04) :1168-1189
[4]  
Behzad A, 2006, IEEE T WIREL COMMUN, V5, P156, DOI 10.1109/TWC.2005.858364
[5]  
BERTSEKAS DP, 1995, NONLINEAR PROGRAMMIN
[6]  
Border K.C., 1985, FIXED POINT THEOREMS
[7]  
Cruz RL, 2003, IEEE INFOCOM SER, P702
[8]   An empirically based path loss model for wireless channels in suburban environments [J].
Erceg, V ;
Greenstein, LJ ;
Tjandra, SY ;
Parkoff, SR ;
Gupta, A ;
Kulic, B ;
Julius, AA ;
Bianchi, R .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1999, 17 (07) :1205-1211
[9]   MINIMUM DELAY ROUTING ALGORITHM USING DISTRIBUTED COMPUTATION [J].
GALLAGER, RG .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1977, 25 (01) :73-85
[10]   The capacity of wireless networks [J].
Gupta, P ;
Kumar, PR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) :388-404