An Adaptive Approach to Data Broadcasting in Mobile Information Systems

Abstract

Broadcast data delivery rapidly becomes the choice for disseminating information to a massive user population. The main advantage of broadcast delivery is its scalability. Acharya et al.'s Broad- cast Disks is one of well-known static algorithms for ecient broadcast delivery. However, based on Acharya et al.'s algorithm, some broadcast slots may be unused, which results in the waste of band- width and the increase of access time. Therefore, in this paper, we propose an ecient broadcast program, the adaptive approach, which prevents the occurrence of empty slots. The basic idea of the adaptive approach is to dynamically arrange the number of slots in each chunk on a disk so that it is impossible for empty slots to occur, where a chunk is the unit for broadcast from a disk per time. From the simulation results, our adaptive approach generates a smaller number of slots in a broadcast cycle and shorter mean access time than Acharya et al.'s algorithm.