Data organization for broadcasting in mobile computing

The rapidly expanding technology of cellular communications, wireless LAN (local area network), wireless data networks and satellite will give mobile users capability of accessing information anywhere and anytime. One of the important components of this environment is the server with broadcasting capabilities. Data are fetched from the server and being broadcast to the air. Mobile users keep listening within the air and catch those data that interest him. In one of the work known as the Acharya algorithm (Acharya et al., 1995) has focused on developing algorithm for arranging the sequence order of data to be broadcasted. The work has generated the sequence of data to be broadcast with the policy of broadcasting more popular data compare to the less popular one. However, the work does not covers the overhead issue incurred by the disk during actual data retrieval task in order to satisfy the broadcasting order. In this paper, we present a data organization called sequence to be used as a data storing method in the server to support broadcasting environments. Our scheme, the sequence order of data to be stored on physical disk, is basically similar in pattern to the sequence order of data to be broadcasted. Having this approach the server´s disk incurs less overhead (seek and latency). We show by simulation result that our scheme has reduced the overhead of Acharya scheme by average 60%. We also work on multiple disks with the same speed and configuration as opposed by the Acharya scheme, which used different disk speed and configuration.