Effective data placement for wireless broadcast

Abstract

This paper investigates how to place data objects on air for wireless broadcast such that mobile clients can access the data in short latency. We first define and analyze the problem of wireless data placement, and also propose a measure, named Query Distance (QD),which represents the coherence degree of data set accessed by a query. We show that the problem is NP-complete, and then propose an effective data placement method that constructs the broadcast schedule by appending each query's data set in greedy way. We show through performance experiments that the proposed method reduces the access time of mobile query.