By Topic

Low-complexity Channel-Aware Scheduling for multichannel wireless local area 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

4 Author(s)
Yihan Li ; Dept. of Electr. & Comput. Eng., Auburn Univ., Auburn, AL ; Shiwen Mao ; Agrawal, P. ; Midkiff, S.F.

In multi-channel wireless networks, effective scheduling algorithms are indispensable for fully harvesting the benefit of multiple channels. Since scheduling decisions need to be made quickly under time-varying wireless channels and traffic dynamics, low-complexity algorithms are especially appealing. In this paper, we study the problem of scheduling in multichannel wireless local area networks. We present a new class of polling service-based channel-aware scheduling algorithms, termed Channel-Aware Scheduling with Exhaustive Service and Hamiltonian Walk (CESH). The three proposed scheduling schemes are shown to have significantly reduced computational complexity, but achieve comparable delay performance as Maximum Weight Matching scheduling, the well-known optimal scheme, under various traffic patterns via simulation studies. The proposed schemes provide practical and effective solutions to the scheduling in multi-channel wireless networks.

Published in:

Automation Science and Engineering, 2008. CASE 2008. IEEE International Conference on

Date of Conference:

23-26 Aug. 2008