By Topic

Adaptive scheduling algorithm based on link condition in heterogeneous 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 $31
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

5 Author(s)
Gan Liu ; Wuhan Nat. Lab. for Optoelectron., Huazhong Univ. of Sci. & Technol., Wuhan ; Xin Zhou ; Bo Yu ; Biao Wang
more authors

Nowadays, numbers of wireless interfaces can be used by mobile users to access Internet, such as WLAN, WiMAX, WIFI and even 3G. If a mobile terminal is equipped with multiple interfaces, we prefer to use them simultaneously to improve the performance in the hot point where different RANs (radio access networks) overlap. We call it simultaneous service model. This idea has been proposed in some researches [1], which also give us an available scheduling algorithm to pursue the minimum delay. But they ignore the influence of the transmission link condition, which will make the performance result not so good when the differences of link qualities between RANs become evident. In this paper, we propose a scheduling algorithm based on the link condition (SABLC) to handle this problem. Simulations validate this model and comparisons with other mechanisms show that our algorithm can improve the whole network throughput obviously especially when the transmission link is dirty.

Published in:

Wireless, Mobile and Sensor Networks, 2007. (CCWMSN07). IET Conference on

Date of Conference:

12-14 Dec. 2007