By Topic

Scheduling algorithm for multi-item requests with time constraints in mobile computing environments

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

3 Author(s)
Jun Chen ; Sch. of Comput. Sci., Wuhan Univ., Wuhan ; Ganping Huang ; Lee, V.C.S.

On-demand broadcast is an effective wireless data dissemination technique to enhance system scalability and capability to handle dynamic user access patterns. Previous studies on time-critical on-demand data broadcast were under the assumption that each client requests only one data item at a time. Little work, however, has considered the on- demand broadcast with time-critical multi-item requests. In this paper, we study the problem arising in this new environment and observe that existing single item based scheduling algorithms are unable to manage multi-item requests efficiently. Thus, a new scheduling algorithm that combines the benefit of data item scheduling and request scheduling is proposed. The performance results show that the proposed algorithm is superior to other classical algorithms under a variety of factors. Our algorithm not only reduces deadline-missing ratio of requests, but also saves broadcast channel bandwidth.

Published in:

Parallel and Distributed Systems, 2007 International Conference on  (Volume:2 )

Date of Conference:

5-7 Dec. 2007