Efficient Approximation Algorithm for Data Retrieval with Conflicts in Wireless Networks

Authors:
Ping He;Hong Shen;Hui Tian
Affiliations:
School of Computer and Information Technology Beijing, Jiaotong University, Beijing, China;School of Computer and Information Technology Beijing, Jiaotong University Beijing and China School of Computer Science, University of Adelaide Australia;School of Electronic and Information Engineering Beijing, Jiaotong University, Beijing, China
Venue:
Proceedings of International Conference on Advances in Mobile Computing & Multimedia
Year:
2013

Citing 14
Cited 0

Broadcast disks: data management for asymmetric communication environments

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Data on Air: Organization and Access

IEEE Transactions on Knowledge and Data Engineering
A Strategy for Efficient Access of Multiple Data Items in Mobile Environments

MDM '02 Proceedings of the Third International Conference on Mobile Data Management
Broadcast program generation for unordered queries with data replication

Proceedings of the 2003 ACM symposium on Applied computing
Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel

IEEE Transactions on Computers
TOSA: a near-optimal scheduling algorithm for multi-channel data broadcast

Proceedings of the 6th international conference on Mobile data management
TMBT: An Efficient Index Allocation Method for Multi-Channel Data Broadcast

AINAW '07 Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02
On Searching Continuous k Nearest Neighbors in Wireless Data Broadcast Systems

IEEE Transactions on Mobile Computing
On optimal scheduling for time-constrained services in multi-channel data dissemination systems

Information Systems
Power-aware data retrieval protocols for indexed broadcast parallel channels

Pervasive and Mobile Computing
Efficient parallel data retrieval protocols with MIMO antennae for data broadcast in 4G wireless communications

DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Scheduling Parallel Data Retrievals for Non-consecutive Broadcast in MIMO Wireless Networks

PAAP '12 Proceedings of the 2012 Fifth International Symposium on Parallel Architectures, Algorithms and Programming
Algebraic data retrieval algorithms for multi-channel wireless data broadcast

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.