The Community for Technology Leaders
Green Image
Issue No. 07 - July (2009 vol. 8)
ISSN: 1536-1233
pp: 895-909
Xiang-Yang Li , Dept. of Comput. Sci., Illinois Inst. of Technol., Chicago, IL
A. Nusairat , Dept. of Comput. Sci., Illinois Inst. of Technol., Chicago, IL
Yanwei Wu , Dept. of Comput. Sci., Illinois Inst. of Technol., Chicago, IL
Yong Qi , Dept. of Comput. Sci. & Technol., Xi'an Jiaotong Univ., Xi'an
JiZhong Zhao , Dept. of Comput. Sci. & Technol., Xi'an Jiaotong Univ., Xi'an
Xiaowen Chu , Dept. of Comput. Sci., Hong Kong Baptist Univ., Hong Kong
Yunhao Liu , Dept. of Comput. Sci. & Eng., Hong Kong Univ. of Sci. & Technol., Hong Kong
ABSTRACT
In this paper, we address the problem of joint channel assignment, link scheduling, and routing for throughput optimization in wireless networks with multi-radios and multi-channels. We mathematically formulate this problem by taking into account the interference, the number of available radios the set of usable channels, and other resource constraints at nodes. We also consider the possible combining of several consecutive channels into one so that a network interface card (NIC) can use the channel with larger range of frequencies and thus improve the channel capacity. Furthermore, we consider several interference models and assume a general yet practical network model in which two nodes may still not communicate directly even if one is within the transmission range of the other. We designed efficient algorithm for throughput (or fairness) optimization by finding flow routing, scheduling of transmissions, and dynamic channel assignment and combining. We show that the performance, fairness and throughput, achieved by our method is within a constant factor of the optimum. Our model also can deal with the situation when each node will charge a certain amount for relaying data to a neighboring node and each flow has a budget constraint. Our extensive evaluation shows that our algorithm can effectively exploit the number of channels and radios. In addition, it shows that combining multiple channels and assigning them to a single user at some time slots indeed increases the maximum throughput of the system compared to assigning a single channel.
INDEX TERMS
wireless channels, channel allocation, channel capacity, scheduling, telecommunication network routing,dynamic channel assignment, joint throughput optimization, wireless mesh networks, channel assignment, link scheduling, multichannels, multiradios, network interface card, channel capacity, flow routing,Throughput, Wireless mesh networks, Routing, Interference constraints, Network interfaces, Frequency, Channel capacity, Algorithm design and analysis, Scheduling algorithm, Design optimization,channel combining., Wireless mesh networks, multichannels, multiradios, cross layer, scheduling, channel assignment, routing,Joint throughput, Channel assignment, Link scheduling, Channel combining, Mesh networks
CITATION
Xiang-Yang Li, A. Nusairat, Yanwei Wu, Yong Qi, JiZhong Zhao, Xiaowen Chu, Yunhao Liu, "Joint Throughput Optimization for Wireless Mesh Networks", IEEE Transactions on Mobile Computing, vol. 8, no. , pp. 895-909, July 2009, doi:10.1109/TMC.2008.160
653 ms
(Ver 3.1 (10032016))