A Broadcast Disk scheme for mobile information system


  • Putra Sumari School of Computer Sciences, Universiti Sains Malaysia, Minden, 11800, Penang, Malaysia
  • Rozaida Mat Darus School of Computer Sciences, Universiti Sains Malaysia, Minden, 11800, Penang, Malaysia
  • Amir Rizaan Rahiman School of Computer Sciences, Universiti Sains Malaysia, Minden, 11800, Penang, Malaysia


Data broadcasting, Broadcast Disk, Broadcast Schedule, Latency, Mobile Information System


The rapidly expanding technology of cellular communications, wireless local area network (LAN), wireless data networks and satellite gives mobile users the ability of accessing information anywhere and anytime. Data broadcasting algorithm plays an important role as it instructs the server to disseminate large amount of data at a fast rate to many mobile clients. One of the work known as the Broadcast Disk method creates a sequence of slots containing data and broadcasts them in a circular manner on the air. Mobile clients keep listening to the air and catch those slots that interest them. However in the Broadcast Disk method, some slots are empty, which results to waste of resources and increase in clients' average waiting time. Empty slots are randomly generated and difficult to be located. In this paper we present a scheme called the Optimum Broadcast Disk, which is an enhancement of the Broadcast Disk method to overcome the empty slots issue and hence reduce the users' waiting time. We manage to locate these empty slots and fill them with popular data. We demonstrate by case studies and simulation that our scheme eliminates empty slots and minimizes clients' average waiting time.


Download data is not yet available.


[1] B.A. Myers, M. Beigl, “Handheld Computing”, IEEE Computer Magazine, Vol. 36, No. 9, 2003, pp. 27 – 29.
[2] D. Barbara, “Mobile Computing and Database–A survey,” IEEE Trans. Knowledge and Data Engineering, Vol. 11, 1999, pp. 108 – 117.
[3] J. Jing, A. Helal, and A.A. Elmagarmid, ”Client-server Computing In Mobile Environments,” ACM Computing Surveys, Vol. 31, No. 2, 1999, pp. 117 – 157.
[4] W. Wei, and V.R. Chinya, “Adaptive data broadcasting in Asymmetric Communication Environment”, Proceeding of the International Database Engineering and Application Symposyium (IDEAS’04), 2004.
[5] Y.-I. Chang and C.–N. Yang, “A Complementary Approach to Data Broadcasting in Mobile Information System. A survey,” IEEE Trans. Knowledge and Data Engineering, Vol. 40, No. 2, 2002, pp. 181 – 194.
[6] V. Liberatore, “Circular arrangement and cyclic broadcast scheduling”, Journal of Algorithm, Vol. 51, No. 2, 2004, pp. 185 – 215.
[7] A. Acharya, M. Franklin and S. Zdonik, “Prefetching from a broadcast disk”, Proc. of the International Conference on Data Engineering, New Orleans, LA, 1996, pp. 276 – 285.
[8] G. Herman et al., “The datacycle architecture for very large high throughput database systems,” In Proceeding ACM SIGMOD Conference, San Francisco, 1997, pp. 97 – 103.
[9] Y.D. Chung, and M.H. Kim, “Effective data placement for wireless broadcast”, Distributed and Parallel Databases, Vol. 9, No. 2, 2001.
[10] C. H. Hsu. G. Chen, A.L.P. Chen, “A Near Optimal Algorithm for Generating Broadcast program on multiple channels”, Proceeding of the ACM International Conference on Information and Knowledge Management (CKIM), 2001, pp. 303 – 309.
[11] D. Katsaros, Y. Manolopoulos, “Broadcast program generation for webcasting”, Data Knowledge and Engineering, Vol. 49, No. 1 2004, pp. 1 – 21.
[12] K. Stathatos, N. Rousopoulos and J.S. Baras, “Adaptive data broadcast in hybrid networks”, in Proc. 23rd International Conference on Very Large Databases, September 1997.
[13] J. Juran, A.R. Hurson, N. Vijaykrishnan, and S. Kim, “Data organization and retrieval on parallel air channels:Performance and energy issues”, ACM/Kluwer Wireless Networks, Vol. 10, No, 2, 2004, pp. 183 – 195.
[14] D.P. Agrawal, and Q.A. Zeng “Introduction to wireeless and mobile systems”, Florance Brooks/Cole (Thompson Leaarning centre Inc), 2003.
[15] G. Lee, S.C. Lo, and A.L.P. Chen “Data allocation on wireless broadcast channels for effieciemt querry processing”, IEEE Transaction on Computer, Vol. 51 No. 10, 2002, pp. 1237 – 1252.
[16] N.H. Vaida and S. Hameed, “Scheduling data broadcast in asymmetric communication with nonuniform environments”, Wireless Network, Vol. 5, No. 3, 1999, pp. 171 – 182.
[17] W.C. Peng, and M.S. Chen, “Efficient channel allocation tree generation for data broadcasting in a mobile computing environment’ ACM/Kluwer Wireless Network, Vol. 9, No, 2, 2003, pp. 17 – 129.
[18] W.G. Yee, E. Omiecinski, and S.B. Navathe, “Efficient data broadcasting for broadcast disk arrays”, (Tech. Rep. No. GIT-CC-02-20) Gergia Institute of Technology, Atlanta 2001.
[19] J.H. Hu, K. Yeung, G. Peng, and K. Leung” A Novel Push and pull hybrid data broadcast scheme for wireless information networks, In IEEE Int. Conf. on Communication, Vol. 3, 2000, pp. 1778 – 1782.
[20] A. B. Waluyo, B. Srinivasan, and D. Taniar, “Optimal broadcast channel for data dissemination in mobile database environment”, In Proc. Of the APPT’03, LNCS, 2003, pp. 655 – 664.
[21] H.P. Hung, M.S. Chen, “On Exploring Channel allocation in the diverse data broadcasting environment IEEE ICDCS, 2005.
[22] H. Schwetman, CSIM18 - The simulation Engine in Mesquite Software, Inc, Austin, TX., 1996.




How to Cite

Sumari, P., Mat Darus, R., & Rahiman, A. R. (2010). A Broadcast Disk scheme for mobile information system. Journal of Computer Science and Technology, 10(01), p. 8–13. Retrieved from https://journal.info.unlp.edu.ar/JCST/article/view/709



Original Articles