An Efficient Algorithm for Near Optimal Data Allocation on Multiple Broadcast Channels

  • Authors:
  • Chih-Hao Hsu;Guanling Lee;Arbee L. Chen

  • Affiliations:
  • Department of Computer Science, National Tsing Hua University, Hsinchu, Republic of China 300;Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien, Republic of China 973;Department of Computer Science, National Chengchi University, Taipei

  • Venue:
  • Distributed and Parallel Databases
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In a wireless environment, the bandwidth of the channels and the energy of the portable devices are limited. Data broadcast has become an excellent method for efficient data dissemination. In this paper, the problem for generating a broadcast program of a set of data items with the associated access frequencies on multiple channels is explored. In our approach, a minimal expected average access time of the broadcast data items is first derived. The broadcast program is then generated, which minimizes the minimal expected average access time. Simulation is performed to compare the performance of our approach with two existing approaches. The result of the experiments shows that our approach outperforms others and is in fact close to the optimal.