Please use this identifier to cite or link to this item: http://hdl.handle.net/2440/108538
Citations
Scopus Web of Science® Altmetric
?
?
Type: Conference paper
Title: Efficient data retrieval algorithm for multi-item request in wireless broadcast environments
Author: He, P.
Shen, H.
Citation: Proceedings of the International Conference on Multimedia and Expo Workshops, 2014 / pp.1-6
Publisher: IEEE
Issue Date: 2014
Series/Report no.: IEEE International Conference on Multimedia and Expo
ISBN: 9781479947171
ISSN: 1945-7871
1945-788X
Conference Name: IEEE International Conference on Multimedia and Expo Workshops (ICMEW) (14 Jul 2014 - 18 Jul 2014 : Chengdu, Peoples Republic of China)
Statement of
Responsibility: 
Ping He, Hong Shen
Abstract: Data retrieval problem is an efficient way to assist disseminating public information in wireless data broadcast. It refers that a set of data items is orderly broadcast at multiple parallel channels and the client that requires multiple data items retrieves these parallel channels (find an optimal data retrieval sequence) to download their required information at a minimized access latency. Currently, although many schemes have been proposed to study on data retrieval problem with single request which includes multiple data items, the most efficient scheme with lower time complexity is not found. In this paper, we define data retrieval problem with multiple requests denoted as DRMR problem. Our algorithm adopts a novelty scheme to convert a wireless data broadcast system into a DAG, and applies topological sorting to address the DRMR problem. We have validated the performance of our proposed algorithm, and show that the proposed algorithm can obtain the best performance among all existing algorithms as far as we know.
Keywords: Mobile computing; Data broadcast; Indexing; Data schedule; Data retrieval
Rights: Copyright © 2014, IEEE
RMID: 0030011986
DOI: 10.1109/ICMEW.2014.6890686
Appears in Collections:Computer Science publications

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.