By Topic

An efficient scheduling method for query-set-based broadcasting in mobile 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
$33 $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)
Ye-In Chang ; Dept. of Comput. Sci. Eng., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan ; Wu-Han Hsieh

Most of the previous researches assume that each mobile client needs only one data item. However, in many situations, a mobile client might need more than one data item. In this paper, we propose an efficient scheduling method for query-set-based broadcasting, which integrates with query expansion method (QEM) and the mining association rules technique. The mining association rules can globally find the data item sets (large itemsets) which are requested by clients frequently. From our simulation results, we show that, as compared to the local optimal approach in the previous methods, our improved-QEM can construct the schedule with the smaller TQD than QEM and modified-QEM, where TQD denotes total query distance and is proportional to the average access time.

Published in:

Distributed Computing Systems Workshops, 2004. Proceedings. 24th International Conference on

Date of Conference:

23-24 March 2004