By Topic

A new link scheduling algorithm for multi-radio interfaces Wireless Mesh Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhuyan Zhao ; Beijing Inst. of Technol., Beijing, China ; Jianhong Mou

The network throughput of a Wireless Mesh Network (WMN) can be improved by utilizing multiple channels, multiple radio interfaces and directional antenna technology. When the numbers of available channels and radio interfaces in a WMN system are constant, efficient time scheduling among links is essential to avoid potential interference and conflict. In this paper, we assume a WMN with multiple gateway nodes and each node is equipped with multiple radio interfaces and directional antenna. First, we propose an algorithm to divide scheduling procedure into several steps according to maximal independent sets in interference and conflict graph. Then we construct a linear program model to capture the end-to-end throughputs of source-destination pairs and link scheduling matrix which describe the active time fraction of each link in each scheduling step, and the minimum scheduled end-to-end throughput is maximized. The obtained link scheduling matrix may not make all the end-to-end throughputs achieve upper bounds. Thus we propose an algorithm to improve the link scheduling matrix to make all the end-to-end throughputs achieve upper bounds. Finally, we compared the proposed link scheduling algorithm with other link scheduling algorithms, and the numerical result shows performance of our proposed algorithm is much better.

Published in:

Computer Science and Automation Engineering (CSAE), 2011 IEEE International Conference on  (Volume:4 )

Date of Conference:

10-12 June 2011