iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://unpaywall.org/10.1007/S11276-016-1413-X
Resource allocation for real-time traffic in unreliable wireless cellular networks | Wireless Networks Skip to main content
Springer Nature Link
Log in

Resource allocation for real-time traffic in unreliable wireless cellular networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Providing reliable transmission for real-time traffic in wireless cellular networks is a great challenge due to the unreliable wireless links. This paper concentrates on the resource allocation problem aiming to improve the real-time throughput. First, the resource allocation problem is formulated as a Markov Decision Process and thus the optimal resource allocation policy could be obtained by adopting the value iteration algorithm. Considering the high time complexity of the optimal algorithm, we further propose an approximate algorithm which decomposes the resource allocation problem into two subproblems, namely link scheduling problem and packet scheduling problem. By this method, the unreliable wireless links are only constrained in the link scheduling problem, and we can focus on the real-time requirement of traffic in packet scheduling problem. For the link scheduling problem, we propose the maxRel algorithm to maximize the long-term network reliability, and we theoretically prove that the maxRel algorithm is optimal in scenarios with dynamic link reliabilities. The Least Laxity First algorithm is adopted for the packet scheduling problem. Extensive simulation results show that the proposed approximate resource allocation algorithm makes remarkable improvement in terms of time complexity, packet loss rate and delay.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

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

Similar content being viewed by others

References

  1. Sadi, Y., & ColeriErgen, S. (2015). Energy and delay constrained maximum adaptive schedule for wireless networked control systems. IEEE Transactions on Wireless Communications, 14(7), 3738–3751.

    Article  Google Scholar 

  2. Song, J., Han, S., Mok, A. K., Chen, D., Lucas, M., & Nixon, M. (2008). WirelessHART: Applying Wireless Technology in real-time industrial process control. RTAS, 2008, pp. 377–386.

  3. Yan, M., Lam, K. Y., Han, S., Chan, E., Chen, Q., Fan, P., et al. (2014). Hypergraph-based data link layer scheduling for reliable packet delivery in wireless sensing and control networks with end-to-end delay constraints. Information Sciences, 278, 34–55.

    Article  MathSciNet  MATH  Google Scholar 

  4. Shakkottai, S., & Srikant, R. (2002). Scheduling real-time traffic with deadlines over a wireless channel. Wireless Networks, 8(1), 13–26.

    Article  MATH  Google Scholar 

  5. Li, Y., Zhang, H., Huang, Z., & Albert, M. (2014). Optimal link scheduling for delay-constrained periodic traffic over unreliable wireless links. INFOCOM, 2014, pp. 1465–1473

  6. Hou, I. H., Borkar, V., & Kumar, P. R. (2009). A theory of QoS for wireless. INFOCOM, 2009, pp. 486–494

  7. Nan, F., Yu, F. R., Sun, H., & Li, M. (2016). Adaptive power allocation schemes for spectrum sharing in interference-alignment-based cognitive radio networks. IEEE Transactions on Vehicular Technology, 65(5), 3700–3714.

    Article  Google Scholar 

  8. Jiang, H., Zhou, C., Wu, L., et al. (2015). TDOCP: A two-dimensional optimization integrating channel assignment and power control for large-scale WLANs with dense users. Ad Hoc Networks, 26, 114–127.

    Article  Google Scholar 

  9. Gabale, V., Raman, B., Dutta, P., & Kalyanraman, S. (2013). A classification framework for scheduling algorithms in wireless mesh networks. IEEE Communications Surveys and Tutorials, 15(1), 199–222.

    Article  Google Scholar 

  10. Tassiulas, L., & Ephremides, A. (1992). Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 37(12), 1936–1948.

    Article  MathSciNet  MATH  Google Scholar 

  11. Hou, I. H., & Kumar, P. R. (2011). A survey of recent results on real-time wireless networking. In Proceedings of the real-time wireless for industrial applications, pp. 1–6.

  12. Hou, I. H., & Kumar, P. R. (2009). Scheduling heterogeneous real-time traffic over fading wireless channels. IEEE/ACM Transactions on Networking, 22(5), 1631–1644.

    Article  Google Scholar 

  13. Puterman, M. L. (1994). Markov decision processes: Discrete stochastic dynamic programming. New Jersey: Wiley.

    Book  MATH  Google Scholar 

  14. Abu Alsheikh, M., Hoang, D. T., Niyato, D., Tan, H. P., & Lin, S. (2015). Markov decision processes with applications in wireless sensor networks: A survey. IEEE Communications Surveys and Tutorials, 17(3), 1239–1267.

    Article  Google Scholar 

  15. Willig, A., & Uhlemann, E. (2014). Deadline-aware scheduling of cooperative relayers in TDMA-based wireless industrial networks. Wireless Networks, 20(1), 73–88.

    Article  Google Scholar 

  16. Wang, R., & Lau, V. K. (2013). Delay-aware two-hop cooperative relay communications via approximate MDP and stochastic learning. IEEE Transactions on Information Theory, 59(11), 7645–7670.

    Article  MathSciNet  MATH  Google Scholar 

  17. Zhou, B., Cui, Y., & Tao, M. (2015). Stochastic throughput optimization for two-hop systems with finite relay buffers. IEEE Transactions on Signal Processing, 63(20), 5546–5560.

    Article  MathSciNet  Google Scholar 

  18. Moghadari, M., Hossain, E., & Le, L. B. (2013). Delay-optimal distributed scheduling in multi-user multi-relay cellular wireless networks. IEEE Transactions on Communications, 61(4), 1349–1360.

    Article  Google Scholar 

  19. Niafar, S., Tan, X., & Tsang, D. H. (2016). Optimal downlink scheduling for heterogeneous traffic types in LTE-A based on MDP and chance-constrained approaches. Mobile Networks and Applications, 21(3), 390–401.

    Article  Google Scholar 

  20. Xu, J., Yang, J., Xie, Y., Guo, C., & Yu, Y. (2016). MDP based link scheduling in wireless networks to maximize the reliability. Wireless Networks, 22(5), 1659–1671.

    Article  Google Scholar 

  21. Lei, L., Kuang, Y., Cheng, N., Shen, X., & Lin, C. (2016). Delay-optimal dynamic mode selection and resource allocation in device-to-device communications-Part I: Optimal policy. IEEE Transactions on Vehicular Technology, 65(5), 3474–3490.

    Article  Google Scholar 

  22. Lei, L., Kuang, Y., Cheng, N., Shen, X., & Lin, C. (2015). Delay-optimal dynamic mode selection and resource allocation in device-to-device communications-Part II: Practical algorithm. IEEE Transactions on Vehicular Technology, 65(5), 3491–3505.

    Article  Google Scholar 

  23. Wu, H., Lin, X., Liu, X., Tan, K., & Zhang, Y. (2014). Decomposition of large-scale MDPs for wireless scheduling with load-and channel-awareness. In IEEE information theory and applications workshop, pp. 1–10

  24. Gilbert, E. N. (1960). Capacity of a burst-noise channel. Bell System Technical Journal, 39(5), 1253–1265.

    Article  MathSciNet  Google Scholar 

  25. Elliott, E. O. (1963). Estimates of error rates for codes on burst-noise channels. The Bell System Technical Journal, 42(5), 1977–1997.

    Article  Google Scholar 

  26. Hong, S. W., & Moayeri, N. (1995). Finite-state Markov channel-a useful model for radio communication channels. IEEE Transactions on Vehicular Technology, 44(1), 163–171.

    Article  Google Scholar 

  27. Liu, J. W. (2000). Real-time systems. New York: Prentice Hall.

    Google Scholar 

  28. Jain, R., Hawe W., & Chiu D. (1984). A Quantitative measure of fairness and discrimination for resource allocation in Shared Computer Systems. DEC-TR-301, September, 1984.

Download references

Acknowledgements

This work is supported by Grant No. 413000016 from Wuhan University.

Author information

Authors and Affiliations

  1. Electronic Information School, Wuhan University, Wuhan, Hubei, China

    Jun Xu, Chengcheng Guo & Jianfeng Yang

  2. State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan, Hubei, China

    Hao Zhang

Authors
  1. Jun Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chengcheng Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jianfeng Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jun Xu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xu, J., Guo, C., Zhang, H. et al. Resource allocation for real-time traffic in unreliable wireless cellular networks. Wireless Netw 24, 1405–1418 (2018). https://doi.org/10.1007/s11276-016-1413-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-016-1413-x

Keywords

Search

Navigation