A data partition based near optimal scheduling algorithm for wireless multi-channel data broadcast

  • Authors:
  • Ping Yu;Weiwei Sun;Yongrui Qin;Zhuoyao Zhang;Bole Shi

  • Affiliations:
  • Department of Computing & Information Technology, Fudan University, Shanghai, China;Department of Computing & Information Technology, Fudan University, Shanghai, China;Department of Computing & Information Technology, Fudan University, Shanghai, China;Department of Computing & Information Technology, Fudan University, Shanghai, China;Department of Computing & Information Technology, Fudan University, Shanghai, China

  • Venue:
  • DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data broadcast is an efficient way to disseminate information to large numbers of users in wireless environments. The Square Root Rule (SRR) is the theoretical basis for the single channel broadcast scheduling. In this paper, we extend the SRR and propose the Multi-channel Square Root Rule (MSRR) for scheduling variable-length data with skewed access probabilities on variable-bandwidth channels. The theoretical optimal average access latency is also provided. However, this optimal value can not be achieved in reality. Based on MSRR, we provide a two-phase scheduling algorithm which achieves near optimal access latency. First data are partitioned and allocated to different channels according to MSRR. Second, different scheduling strategies are adopted on each channel according to the skewness of data subset allocated on that channel. Experiments show that the difference of average access latency between our results and the optimal value is below five percent in most situations.