Broadcast disks: Dynamic data scheduling in mobile communication

Abstract

Recently, lot of work was done on data dissemination for asymmetrical communication environments. However, majority of studies are confined to push based broadcast and that too in single channel data dissemination. Few studies are on multiple channel data dissemination, but again the access frequencies are assumed fixed for a particular period. Since mobile users data access patterns change dynamically, the allocation of broadcast disks (channels) generated separately by push-pull calculations are not optimal after changes in access patterns. This suggests that the number of broadcasting channels and organization of the data items in the broadcast disks should be continuously updated to match changing access patterns. Creating new broadcast disks from scratch is not feasible in terms of time and efforts. A better solution is to adjust the structure of broadcast disks incrementally to accommodate changes in access patterns. This paper proposed Adaptive Data Scheduling Algorithm for generating broadcast program for multiple channels and compared the results with the FLAT and DL algorithms. It is seen that the proposed incremental algorithm is performing better in terms of scalability and reducing the data access times.