Skip to main content
Log in

OCSM: an optimized channel split method—towards real-time and on-demand data broadcast scheduling

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

In recent years, it has been witnessed a boom in the development of mobile networks and a great increase in the computing ability of mobile devices. The rapid booming in client requests lead to some new challenges for real-time on-demand data broadcasting: (1) the dynamic diversity of the data characteristics; (2) the dynamic diversity of real-time clients’ demand greatly increase the volume of hot-spot data (the most access data); and (3) the clients’ demands for high service quality. To date, the current research has focused on the fixed-channel models (i.e. the bandwidth and number of channels are unchangeable) and algorithms. To adapt to the characteristics of the real-time requests, an optimized channel split method (OCSM) is proposed for automatic channel split and data allocation in this paper. The experiments undertaken in this study included two aspects: (1) determining the different strategies under different data sizes and deadlines; and (2) verifying the validity of the automatic channel split and data allocation through a series of experiments with the general performance matrics. The results show that the proposed method outperforms some of the state-of-the-art scheduling algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Li, L. J., Liu, H. F., Yang, Z. Y., et al. (2010). Broadcasting methods in vehicular ad hoc networks. Journal of Software, 21(7), 1620–1634.

    Google Scholar 

  2. Wang, H., Xiao, Y., & Shu, L. C. (2012). Scheduling periodic continuous queries in real-time data broadcast environments. IEEE Transactions on Computers, 61(9), 1325–1340.

    Article  MathSciNet  MATH  Google Scholar 

  3. Jung, H., Chung, Y., & Liu, L. (2012). Processing generalized k-nearest neighbor queries on a wireless broadcast stream. Information Sciences, 188(4), 64–79.

    Article  MathSciNet  Google Scholar 

  4. Yu, C., Yao, D., Li, X., Zhang, Y., Yang, L., Xiong, N., et al. (2012). Location-aware private service discovery in pervasive computing environment. Information Sciences, 230(5), 78–93.

    Google Scholar 

  5. Simunic, T., Boyd, S., & Glynn, P. (2004). Managing power consumption in networks on chips. IEEE Transactions on Very Large Scale Integration Systems, 2(1), 96–107.

    Article  Google Scholar 

  6. Cheng, H. J., Huang, X. B., & Xiong, N. X. (2014). Minimum-energy broadcast algorithm for wireless sensor networks with unreliable communication. Journal of Software, 25(5), 1101–1112.

    Google Scholar 

  7. Zhao, R. Q., Liu, Z. J., & Wen, A. J. (2009). An efficient energy-saving broadcast mechanism for wireless sensor networks. Acta Electronica Sinica, 37(11), 2457–2462.

    Google Scholar 

  8. Waluyo, A., Srinlvasan, B., Taniar, D., et al. (2005). Incorporating global index multi data placement scheme for multi channels mobile broadcast environment. Lecture Notes in Computer Science, 3824, 755–764.

    Article  Google Scholar 

  9. Lee, S., Carney, D. P., Zdonik, S. (2003). Index hint for on-demand broadcasting. In Proceedings of the 19th IEEE international conference on data engineering (pp. 726–728).

  10. 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.

    Article  Google Scholar 

  11. Wu, X., & Lee, V. C. S. (2005). Wireless real-time on-demand data broadcast scheduling with dual deadlines. Journal of Parallel and Distributed Computing, 65(6), 714–728.

    Article  Google Scholar 

  12. Saxena, N., & Pinottti, M. (2005). On-line balanced k-channel data allocation with hybrid schedule per channel. In Proceedings of the 6th International conference on mobile data management (pp. 239–246). ACM.

  13. Anticaglia, S. S., Barsi, F., Bertossi, A. A., et al. (2008). Efficient heuristics for data broadcasting on multiple channels. Wireless Networks, 14(2), 219–231.

    Article  Google Scholar 

  14. Waluyo, A., Srinlvasan, B., Taniar, D., et al. (2005). Incorporating global index multi data placement scheme for multi channels mobile broadcast environment. Lecture Notes in Computer Science, 3824, 755–764.

    Article  Google Scholar 

  15. Chung, Y., Chen, C., & Lee, C. (2008). Design and performance evaluation of broadcast algorithms for time-constrained data retrieval. IEEE Transactions on Knowledge and Data Engineering, 18(11), 1526–1543.

    Article  Google Scholar 

  16. Lee, W., Hu, Q., & Lee, D. (1999). A study on channel allocation for data dissemination in mobile computing environments. Mobile Networks and Applications, 1(2), 117–129.

    Article  Google Scholar 

  17. Gao, X., Yang, Y., Chen, G., et al. (2016). Global optimization for multi-channel wireless data broadcast with AH-tree indexing scheme. IEEE Transactions on Computers, 65(7), 2104–2117.

    Article  MathSciNet  MATH  Google Scholar 

  18. Lim, J. H., Naito, K., Yun, J. H. et al. (2015). Revisiting overlapped channels: Efficient broadcast in multi-channel wireless networks. In 2015 IEEE conference on computer communications (INFOCOM). IEEE.

  19. Nawaz Ali, G. G. M., Lee, V. C. S., Chan, E., et al. (2014). Admission control-based multichannel data broadcasting for real-time multi-item queries. IEEE Transactions on Broadcasting, 60(4), 589–605.

    Article  Google Scholar 

  20. Hu, C., & Chen, M. (2002). Adaptive balanced hybrid data delivery for multi-channel data broadcast. In Proceedings of IEEE international conference on communications (pp. 960–964).

  21. Zheng, B., Wu, X., Jin, X., et al. (2005). TOSA: A near-optimal scheduling algorithm for multi-channel data broadcast. In Proceedings of the 6th international conference on mobile data management (pp. 20–37). ACM.

  22. Moulahi, T., Nasri, S., & Guyennet, H. (2012). Broadcasting based on dominated connecting sets with MPR in a realistic environment for WSNS & ad hoc. Journal of Network and Computer Applications, 35(6), 1720–1727.

    Article  Google Scholar 

  23. Zheng, Q., Zheng, K., Zhang, H., et al. (2016). Delay-optimal virtualized radio resource scheduling in software-defined vehicular networks via stochastic learning. IEEE Transactions on Vehicular Technology, 65(10), 7857–7867.

    Article  Google Scholar 

  24. Ma, W. M., Zhang, H. J., Wen, X. M., et al. (2012). A novel QoS guaranteed cross-layer scheduling scheme for downlink multiuser OFDM systems. Applied Mechanics and Materials, 182–183, 1352–1357.

    Article  Google Scholar 

  25. Utility-Based Cross-Layer Multiple Traffic Scheduling for MU-OFDMA. (2012). Advances in Information Sciences and Service Sciences, 3(8), 122–131.

    Google Scholar 

  26. Zhang, H., Jiang, C., Beaulieu, N. C., Chu, X., Wen, X., & Tao, M. (2014). Resource allocation in spectrum-sharing OFDMA femtocells with heterogeneous services. IEEE Transactions on Communications, 62(7), 2366–2377.

    Article  Google Scholar 

  27. Zhang, H., Jiang, C., Beaulieu, N. C., Chu, X., Wang, X., & Quek, T. Q. (2015). Resource allocation for cognitive small cell networks: A cooperative bargaining game theoretic approach. IEEE Transactions on Wireless Communications, 14(6), 3481–3493.

    Article  Google Scholar 

  28. Xuan, P., et al. (1997). Broadcast on demand: efficient and timely dissemination of data in mobile environments. In Proceedings of the third IEEE real-time technology and applications symposium (pp. 350–350). IEEE.

  29. Fang, Q., Vrbsky, S., Dang, Y., & Ni, W. (2004). A pull-based broadcast algorithm that considers timing constraints. In Proceedings of the 2004 international conference on parallel processing workshops (pp. 46–53).

  30. Kalyanasundaram, B., & Velauthapillai, M. (2003). On-demand broadcasting under deadline. In Proceedings of the 11th annual European symposium on algorithms (pp. 313–324).

  31. Ng, J., Lee, V., & Hui, C. (2008). Client-side caching strategies and on-demand broadcast algorithms for real-time information dispatch system. IEEE Transactions on Broadcasting, 54(1), 24–35.

    Article  Google Scholar 

  32. Dykeman, H., & Wong, J. (1988). A performance study of broadcast information delivery systems. In Seventh annual joint conference of the IEEE computer and communications societies (pp. 739–745).

  33. Dewri, R., Ray, I., Ray, I., & Whitley, D. (2008). Optimizing on-demand data broadcast scheduling in pervasive environments. In Proceedings of the 11th international conference on extending database technology: Advances in database technology, Nantes, France (pp. 559–569).

  34. Hu, W., Fan, C., Luo, J., et al. (2015). An on-demand data broadcasting scheduling algorithm based on dynamic index strategy. Wireless Communications and Mobile Computing, 15(5), 947–965.

    Article  Google Scholar 

  35. Hu, W., Xia, C., Du, B., et al. (2015). An on-demanded data broadcasting scheduling considering the data item size. Wireless Networks, 21(1), 35–56.

    Article  Google Scholar 

  36. Hu, W., Qiu, Z., Wang, H., & Yan, L. (2016). A real-time scheduling algorithm for on-demand wireless xml data broadcasting. Journal of Network and Computer Applications, 68, 151–163.

    Article  Google Scholar 

  37. Ma, W. M. (2012). Utility-based fairness power control scheme in OFDMA femtocell networks. Journal of Electronics and Information Technology, 34(10), 2287–2292.

    Article  Google Scholar 

  38. Zhang, H., Jiang, C., Mao, X., et al. (2016). Interference-limited resource optimization in cognitive femtocells with fairness and imperfect spectrum sensing. IEEE Transactions on Vehicular Technology, 65(3), 1.

    Article  Google Scholar 

  39. Zhang, H., Chu, X., & Wen, X. (2013). 4G Femtocells: Resource Allocation and Interference Management. Berlin: Springer.

    Book  Google Scholar 

  40. Lv, J., Lee, V. C. S., Li, M., et al. (2012). Admission control and channel allocation of multi-item requests for real-time data broadcast. In 2013 IEEE 19th international conference on embedded and real-time computing systems and applications (pp. 202–211). IEEE.

  41. Viswanathan, S., & Imielinski, T. (1995). Pyramid broadcasting for video on-demand service. In Proceedings of SPIE (pp. 66–66).

  42. Stefano, C., Claudio, L., & Leonardo, T. (2014). Knowledge discovery by accuracy maximization. Proceedings of the National Academy of Sciences of the United States of America, 111(14), 5117–5122.

    Article  MathSciNet  MATH  Google Scholar 

  43. World Cup 98 Web Site Access Logs. (1998). http://ita.ee.lbl.gov/html/contribute/WorldCup.html[EB/OL].

  44. Lu, F., Du, N., & Wen, C. L. (2012). A fuzzy-evidential k nearest neighbor classification algorithm. Acta Electronica Sinica, 40(12), 2390–2395.

    Google Scholar 

Download references

Acknowledgements

This work is partially supported by National Natural Science Foundation of China (61572369); National Natural Science Foundation of Hubei Province (2015CFB423); Wuhan Major Science and Technology Program (2015010101010023).

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Wenbin Hu or Fu Lin.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hu, W., Qiu, Z., Nie, C. et al. OCSM: an optimized channel split method—towards real-time and on-demand data broadcast scheduling. Wireless Netw 25, 861–874 (2019). https://doi.org/10.1007/s11276-017-1598-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-017-1598-7

Keywords

Navigation