Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

Scheduling for ordered query services in multi-channel data broadcast systems

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)
Yu-Hsien Lin ; Dept. of Electron. Eng., Nat. Taiwan Univ. of Sci. & Technol., Taipei, Taiwan ; Yi-Syuan Jiang ; Wei-Mei Chen

In wireless mobile environments, the bandwidth and client capability are limited. Data broadcasting is an efficient and scalable method to disseminate information to a large amount of mobile clients. In recent years, several research has engaged in scheduling dependent data on multiple broadcast channels. However, most of the previous research focused on unordered queries and only few of them on ordered queries. In this paper, we study the problem of data allocation for ordered queries on multiple broadcast channels and devise an efficient algorithm based on a local search strategy. The experimental results show that the proposed algorithm outperforms the existing algorithms when the query distribution is known. Moreover, our algorithm with minor modification can also be applied efficiently when the query distribution is unknown.

Published in:

Computer Symposium (ICS), 2010 International

Date of Conference:

16-18 Dec. 2010