Skip to main content

Dynamic Resource Allocation in High-Speed Railway Fog Radio Access Networks with Delay Constraint

  • Conference paper
  • First Online:
Book cover Communications and Networking (ChinaCom 2019)

Abstract

By applying caching resource at the remote radio heads (RRHs), the fog radio access network (Fog-RAN) has been considered as an promising wireless architecture in the future network to reduce the transmission delay and release the heavy burden of backhaul link for huge data delivery. In this paper, we propose to use the Fog-RAN to assist the data transmission in the high-speed railway scenario. In specific, we investigate the dynamic resource allocation in high-speed railway Fog-RAN systems by considering the delay constraint. The instantaneous power allocation at the RRHs and the instantaneous content delivery rate over the backhaul links are jointly optimized with an aim to minimize the total power consumed at the RRHs and over the backhaul links. An alternating optimization (AO) approach is used to find solutions of the instantaneous power and instantaneous content delivery rate in two separate subproblems. The closed-form solutions are derived in two subproblems under certain special conditions. Simulation results demonstrate that the proposed dynamic resource allocation is significantly superior to the constant resource allocation scheme.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Yan, D., Wang, R., Liu, E., Hou, Q.: ADMM-based robust beamforming design for downlink cloud radio access networks. IEEE Access 6, 27912–27922 (2018)

    Article  Google Scholar 

  2. Peng, M., Zhang, K.: Recent advances in fog radio access networks: performance analysis and radio resource allocation. IEEE Access 4, 5003–5009 (2016)

    Article  Google Scholar 

  3. Liu, J., Sheng, M., Quek, T.Q.S., Li, J.: D2D enhanced co-ordinated multipoint in cloud radio access networks. IEEE Trans. Wirel. Commun. 15(6), 4248–4262 (2016)

    Article  Google Scholar 

  4. Wang, R., Li, R., Wang, P., Liu, E.: Analysis and optimization of caching in fog radio access networks. IEEE Trans. Veh. Technol. 68(8), 8279–8283 (2019)

    Article  Google Scholar 

  5. Zhang, H., Zhu, L., Long, K., Li, X.: Energy efficient resource allocation in millimeter-wave-based fog radio access networks. In: 2nd URSI Atlantic Radio Science Meeting (AT-RASC), Meloneras, pp. 1–4 (2018)

    Google Scholar 

  6. Tao, M., Chen, E., Zhou, H., You, W.: Content-centric sparse multicast beamforming for cache-enabled cloud RAN. IEEE Trans. Wirel. Commun. 15(9), 6118–6131 (2016)

    Article  Google Scholar 

  7. Ai, B., et al.: Future railway services-oriented mobile communications network. IEEE Commun. Mag. 53(10), 78–85 (2015)

    Article  MathSciNet  Google Scholar 

  8. Wu, J., Fan, P.: A survey on high mobility wirless communications: challenges, oppportunities and solutions. IEEE Access 4, 450–476 (2016)

    Article  Google Scholar 

  9. Muneer, P., Sameer, S.M.: Joint ML estimation of CFO and channel, and a low complexity turbo equalization technique for high mobility OFDMA uplinks. IEEE Trans. Wirel. Commun. 14(7), 3642–3654 (2015)

    Article  Google Scholar 

  10. Wang, J., Zhu, H., Gomes, N.J.: Distributed antenna systems for mobile communications in high speed trains. IEEE J. Sel. Areas Commun. 30(4), 675–683 (2012)

    Article  Google Scholar 

  11. Li, T., Xiong, K., Fan, P., Letaief, K.B.: Service-oriented power allocation for high-speed railway wireless communications. IEEE Access 5, 8343–8356 (2017)

    Article  Google Scholar 

  12. Zhang, C., Fan, P., Xiong, K., Fan, P.: Optimal power allocation with delay constraint for signal transmission from a moving train to base stations in high-speed railway scenarios. IEEE Trans. Veh. Technol. 64(12), 5775–5788 (2015)

    Article  Google Scholar 

  13. Liu, X., Qiao, D.: Location-fair beamforming for high speed railway communication systems. IEEE Access 6, 28632–28642 (2018)

    Article  Google Scholar 

Download references

Acknowledgement

This work was supported in part by the National Science Foundation China under Grant 61771345 and Grant 61831018, in part by the fund of the State Key Laboratory of Integrated Services Networks, Xidian University, under Project ISN19-01, and in part by Guangdong Province Key Research and Development Program Major Science and Technology Projects under Grant 2018B010115002.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rui Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, R., Wu, J., Yu, J. (2020). Dynamic Resource Allocation in High-Speed Railway Fog Radio Access Networks with Delay Constraint. In: Gao, H., Feng, Z., Yu, J., Wu, J. (eds) Communications and Networking. ChinaCom 2019. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 312. Springer, Cham. https://doi.org/10.1007/978-3-030-41114-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-41114-5_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-41113-8

  • Online ISBN: 978-3-030-41114-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics