Please use this identifier to cite or link to this item: http://hdl.handle.net/2440/95303
Citations
Scopus Web of Science® Altmetric
?
?
Type: Journal article
Title: Tree-based data retrieval algorithm for multi-item request with deadline in wireless networks
Author: He, P.
Shen, H.
Li, Y.
Citation: Peer-to-Peer Networking and Applications, 2016; 9(1):92-107
Publisher: Springer US
Issue Date: 2016
ISSN: 1936-6442
1936-6450
Statement of
Responsibility: 
Ping He, Hong Shen, Yidong Li
Abstract: The data retrieval problem in wireless communication has attracted increasing attentions in many applications such as electronic information sharing and e-business. However, most existing studies do not consider how to retrieve the requested data items in their deadlines. In this paper, we discuss the so-called deadline-based multi-item data retrieval problem, which aims at finding an access pattern for retrieving requested data items in certain deadlines such that the access latency and data miss rate are minimized. We propose two algorithms, named EDFS and UR, to deal with the above problem. The EDFS algorithm gives priority to retrieve the requested data item with the least deadline, while the UR algorithm introduces the urgent rate that is computed by the broadcast time and deadline of requested data item for further reducing the access latency and data miss ratio. Moreover, we design a tree-based data retrieval algorithm that finds the longest downloading sequence of data items in one broadcast cycle and is applied to EDFS and UR for finding data retrieval sequence of requested data items. The efficiency of our proposed schemes has been validated by the extensive experiments.
Keywords: Mobile computing; Wireless data broadcast; Data retrieval; Time constraint
Rights: © Springer Science+Business Media New York 2014
RMID: 0030029344
DOI: 10.1007/s12083-014-0316-9
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.