Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Efficient approximation algorithm for data retrieval with conflicts in wireless networks|
|Citation:||Proceedings of the 11th International Conference on Advances in Mobile Computing and Multimedia (MoMM2013), 2013 / R. Mayrhofer, L. Chen, M. Steinbauer, I. Khalil, G. Kotsis (eds.): pp.1-10|
|Conference Name:||International Conference on Advances in Mobile Computing and Multimedia (11th : 2013 : Vienna, Austria)|
|Ping He, Hong Shen, Hui Tian|
|Abstract:||Given a set of data items broadcasting at multiple parallel channels, where each channel has the same broadcast pattern over a time period, and a set of client’s requested data items, the data retrieval problem requires to find a sequence of channel access to retrieve the requested data items among the channels such that the total access latency is minimized, where both channel access (to retrieve a data item) and channel switch are assumed to take a single time slot. As an important problem of information retrieval in wireless networks, this problem arises in many applications such as e-commerce and ubiquitous data sharing, and is known two conflicts: requested data items are broadcast at same time slots or adjacent time slots in different channels. Although existing studies focus on this problem with one conflict, there is little work on this problem with two conflicts. So this paper proposes efficient algorithms from two views: single antenna and multiple antennae. Our algorithm adopts a novel approach that wireless data broadcast system is converted to DAG, and applies set cover to solve this problem. Through Experiments, this result presents currently the most efficient algorithm for this problem with two conflicts.|
|Keywords:||Wireless data broadcast; Data retrieval; Indexing|
|Rights:||Copyright 2013 ACM|
|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.