Abstract
Mobile data delivery is a critical issue in the mobile computing area. One of the most important problems is the efficient access to data. A proposed solution to this problem is the prefetching technique which consists in putting in reserving the information before the users need it. Low bandwidth, unreliable wireless links, and frequent disconnections of mobile environments make it difficult to satisfy the timing requirements of traditional strategies. This paper investigates broadcast scheduling strategies for push-based broadcast with timing constraints in the form of deadlines ,and proposes a prediction algorithm based on Kalman filter theory for this study. The proposed dissemination policy and adaptive bandwidth allocation scheme obtain sufficient conditions such that all the time-bounded traffic sources satisfy their timing constraints to provide various quality of service guarantees in the broadcast period. Our goal is to identify scheduling algorithms for broadcast systems that ensure requests meeting their deadlines. Our approach examines the performance of traditional real-time strategies and mobile broadcasting strategies, and demonstrates that traditional real-time algorithms do not always perform the best in mobile environments. The proposed design indeed achieves good performance in mobile environments.
Similar content being viewed by others
References
Aksoy, D., & Franklin, M. (1999). Rxw: A scheduling approach for large-scale on-demand data broadcast. IEEE/ACM Transactions on Networking, 7(6), 846–860.
Baruah, S., & Bestavros., A.: Pinwheel scheduling for fault-tolerant broadcast disks in real-time database systems. In Proceedings of the 13th international conference on data, engineering, pp. 543–551 (1997).
Bestavros, A. (1996). Aida-based real-time fault-tolerant broadcast disks. In Proceedings of real-time technology and applications symposium, pp. 49–58.
Chiang, D. J., Lin, H. J., & Shih, T. K. (2008). Providing data items with time constraints in multi-channel broadcasting environments. Journal of Software, 3(8), 65–72.
Cormen, T. H., Leiserson, C. E. & Rivest., R. L. (1992). Introduction to algorithms. Cambridge: The MIT.
Cottet, F., Delacroix, J., Kaiser, C., & Mammeri, Z. (2002). Scheduling in real-time systems. New York: Wiley.
Fernandez-Conde, J., & Ramamritham., K. (1999). Adaptive dissemination of data in time-critical asymmetric communication environments. In Proceedings of the 11th Euromicro conference on real-time systems, pp. 195–203.
Zipf, G. K. (1949). Human behaviour and the principle of the least effort. Boston: Addison-Wesley.
Herring, K., Holloway, J., Staelin, D., & Bliss, D. (2010). Path-loss characteristics of urban wireless channels. IEEE Transactions on Antennas and Propagation, 58(1), 171–177.
Kalman, R. E. (1960). A new approach to linear filtering and prediction problems. Transactions of the ASMEVJournal of Basic, Engineering, D(82), 35–45.
Ktata, I., Ghaffari, F., Granado, B., & Abid, M. (2010). Prediction performance method for dynamic task scheduling, case study: The ollaf architecture. In Design and test workshop (IDT), 2010 5th, international, pp. 97–102.
Liu, C., & Layland, J. (1973). Scheduling algorithms for multiprogramming in hard real-time traffic environments. Journal of the Association for Computing Machinery, 20(1), 179–194.
Liu, T., & Choudary, C. (2004). Realtime content analysis and adaptive transmission of lecture videos for mobile applications. ACM Multimedia, 2004, 400–403.
Manolache, S., Eles, P., & Peng, Z. (2006). Task mapping and priority assignment for soft real-time applications under deadline miss ratio constraints. ACM Transactions on Embedded Computing Systems, 7(2), 19:1–19:35.
Marojevic, V., Balleste, X. R., & Gelonch, A. (2008). A computing resource management framework for software-defined radios. IEEE Transactions on Computers, 57(10), 1399–1412.
Prabhakara, K., Hua, K. A., & Oh., J. H. (2000). Multi-level multi-channel air cache designs for broadcasting in a mobile environment. In Proceeding of the 16th international conference on data engineering, pp. 167–176.
Rathnayake, U., Iftikhar, M., Ott, M., & Seneviratne, A. (2010). Mobile data transfer scheduling with uncertainty. In 2010 IEEE international conference on communications (ICC), pp. 1–6.
Sivasankaran, R. M., Stankovic, J. A., Towsley, D., Purimetla, B., & Ramamritham, K. (1996). Priority assignment in real-time active databases. The International Journal on Very Large Data Bases, 5(1), 019–034.
Sun, Y., Belding-Royer, E. M., Gao, X., & Kempf, J. (2007). Real-time traffic support in heterogeneous mobile networks. ACM Wireless Networks, 13(4), 431–445.
Wang, Z. (2001). Internet QoS architecture and mechanisms for quality of service. Burlington: Morgan Kaufmann.
Xu, J., Tang, X., & Lee, W. (2006). Time-critical on-demand data broadcast: algorithms, analysis, and performance evaluation. IEEE Transactions on Parallel and Distributed Systems, 17(1), 3–14.
Yen, Y. S., Chen, W., Zhhuang, J. C., & Chao, H. C. (2005). A novel sliding weighted fair queueing scheme for real-time applications. IEE Proceedings V Communications, 152(3), 320–326.
Zhifeng, J., & Leung, V. C. M. (2005). End-to-end quality of service provisioning for nternet access via third generation wireless networks. Journal of Internet Technology, 6(4), 367–374. Object-Oriented Technology and Applications.
Acknowledgments
We are grateful to the support of National Science Council, R.O.C. under contract number 102-2221-E-149-006.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chiang, DJ., Wang, CS., Chen, CL. et al. Real-Time Data Delivery Using Prediction Mechanism in Mobile Environments. Wireless Pers Commun 74, 1345–1362 (2014). https://doi.org/10.1007/s11277-013-1581-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-013-1581-2