Skip to main content

Advertisement

Log in

Unlicensed Assisted Ultra-Reliable and Low-Latency Communications

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

The ultra-reliable and low-latency communication (URLLC) in the fifth generation (5G) communication has emerged many potential applications, which promotes the development of the internet of things (IoTs). In this paper, the URLLC system adopts the duty-cycle muting (DCM) mechanism to share unlicensed spectrums with the WiFi network, which guarantees the fair coexistence. Meanwhile, we use the mini-slot, user grouping, and finite block length regime to satisfy the low latency and high reliability requirements. We establish a non-convex optimization model with respect to power and spectrum, and solve it to minimize the power consumption at the devices, where the closed-form expressions are given by several mathematical derivations and the Lagrangian multiplier method. Numerical simulation results are provided to verify the feasibility and effectiveness of the proposed scheme, which improves the system spectrum efficiency and energy efficiency.

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.

Institutional subscriptions

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

Similar content being viewed by others

References

  1. 3GPP (2020) Study on scenarios and requirements for next generation access technologies. 3GPP TR 38913, V16 00

  2. Sutton GJ, Zeng J, Liu RP et al (2019) Enabling technologies for ultra-reliable and low latency communications: From phy and mac layer perspectives. IEEE Commun Surv Tutorials 21(3):2488–2524. https://doi.org/10.1109/COMST.2019.2897800

    Article  Google Scholar 

  3. 3GPP (2017) Study on new radio access technology; physical layer aspects. 3GPP TR 38802, V14 20

  4. She C, Yang C, Quek TQ (2018) Joint uplink and downlink resource configuration for ultra-reliable and low-latency communications. IEEE Trans Commun 66(5):2266–2280. https://doi.org/10.1109/TCOMM.2018.2791598

    Article  Google Scholar 

  5. Deghel M, Elayoubi SE, Galindo-Serrano A et al (2018) Joint optimization of link adaptation and harq retransmissions for urllc services. In: 2018 25th international conference on telecommunications (ICT). https://doi.org/10.1109/ICT.2018.8464906. IEEE, pp 21–26

  6. Shirvanimoghaddam M, Khayami H, Li Y et al (2020) Dynamic harq with guaranteed delay. In: 2020 IEEE wireless communications and networking conference (WCNC). https://doi.org/10.1109/WCNC45663.2020.9120547. IEEE, pp 1–6

  7. Doğan S, Tusha A, Arslan H (2019) Noma with index modulation for uplink urllc through grant-free access. IEEE J Sel Top Signal Process 13(6):1249–1257. https://doi.org/10.1109/JSTSP.2019.2913981

    Article  Google Scholar 

  8. Shahab MB, Abbas R, Shirvanimoghaddam M et al (2020) Grant-free non-orthogonal multiple access for iot: a survey. IEEE Commun Surv Tutorials 22(3):1805–1838. https://doi.org/10.1109/COMST.2020.2996032

    Article  Google Scholar 

  9. Ye N, Li X, Yu H et al (2019) Deep learning aided grant-free noma toward reliable low-latency access in tactile internet of things. IEEE Trans Ind Inf 15(5):2995–3005. https://doi.org/10.1109/TII.2019.2895086

    Article  Google Scholar 

  10. Americas G (2018) New services & applications with 5g ultra-reliable low latency communications. Tech. rep., 5G Americas, Tech. Rep

  11. Polyanskiy Y, Poor HV, Verdú S (2010) Channel coding rate in the finite blocklength regime. IEEE Trans Inf Theory 56(5):2307–2359. https://doi.org/10.1109/TIT.2010.2043769

    Article  MathSciNet  MATH  Google Scholar 

  12. Rao J, Vrzic S (2018) Packet duplication for urllc in 5g: Architectural enhancements and performance analysis. IEEE Netw 32(2):32–40. https://doi.org/10.1109/MNET.2018.1700227

    Article  Google Scholar 

  13. Suer MT, Thein C, Tchouankem H et al (2020) Reliability and latency performance of multi-connectivity scheduling schemes in multi-user scenarios. In: 2020 32nd international teletraffic congress (ITC 32). https://doi.org/10.1109/ITC3249928.2020.00017. IEEE, pp 73–80

  14. Rabitsch A, Grinnemo KJ, Brunstrom A et al (2022) Utilizing multi-connectivity to reduce latency and enhance availability for vehicle to infrastructure communication. IEEE Trans Mob Comput 21 (5):1874–1891. https://doi.org/10.1109/TMC.2020.3028306

    Article  Google Scholar 

  15. Sutton GJ, Zeng J, Liu RP et al (2018) Enabling ultra-reliable and low-latency communications through unlicensed spectrum. IEEE Netw 32(2):70–77. https://doi.org/10.1109/MNET.2018.1700253

    Article  Google Scholar 

  16. Zeng Y, Wang Y, Sun S et al (2019) Feasibility of urllc in unlicensed spectrum. In: 2019 IEEE VTS asia pacific wireless communications symposium (APWCS). https://doi.org/10.1109/VTS-APWCS.2019.8851608. IEEE, pp 1–5

  17. Le TK, Salim U, Kaltenberger F (2020) Channel access enhancements in unlicensed spectrum for nr urllc transmissions. In: GLOBECOM 2020-2020 IEEE global communications conference. https://doi.org/10.1109/GLOBECOM42002.2020.9322160. IEEE, pp 1–6

  18. Cuevas RM, Rosa C, Frederiksen F et al (2018) Uplink ultra-reliable low latency communications assessment in unlicensed spectrum. In: 2018 IEEE Globecom Workshops (GC Wkshps). https://doi.org/10.1109/GLOCOMW.2018.8644217, IEEE, pp 1–6

  19. Chen HY, Lee PF, Chiang TW et al (2020) Hmc: a hopping-based multi-channel coordination scheme for urllc in unlicensed spectrum. In: 2020 IEEE Wireless Communications and Networking Conference (WCNC). https://doi.org/10.1109/WCNC45663.2020.9120845. IEEE, pp 1–6

  20. Gashema G, Bhardwaj S, Abdukhakimov A et al (2018) Spatial diversity to support urllc through unlicensed spectrum in industrial wireless network systems. In: 2018 IEEE 3rd international conference on communication and information systems (ICCIS). https://doi.org/10.1109/ICOMIS.2018.8644841. IEEE, pp 141–145

  21. Pocovi G, Pedersen KI, Mogensen P (2018) Joint link adaptation and scheduling for 5g ultra-reliable low-latency communications. IEEE Access 28:912–28:922:6. https://doi.org/10.1109/ACCESS.2018.2838585

    Google Scholar 

  22. Shafi M, Molisch AF, Smith PJ et al (2017) 5g: A tutorial overview of standards, trials, challenges, deployment, and practice. IEEE J Sel Areas Commun 35(6):1201–1221. https://doi.org/10.1109/JSAC.2017.2692307

    Article  Google Scholar 

  23. Pocovi G, Pedersen KI, Soret B et al (2016) On the impact of multi-user traffic dynamics on low latency communications. In: 2016 international symposium on wireless communication systems (ISWCS). https://doi.org/10.1109/ISWCS.2016.7600901, IEEE, pp 204–208

  24. Yuan J, Yu G, Yin R et al (2020) Group-based data transmission protocol for small-sized urllc services. IEEE Wireless Commun Lett 9(9):1432–1436. https://doi.org/10.1109/LWC.2020.2993194

    Article  Google Scholar 

  25. Yin R, Zou Z, Wu C et al (2021a) Learning-based wifi traffic load estimation in nr-u systems. IEICE T Fund Electr 104(2):542–549. https://doi.org/10.1587/transfun.2020EAP1063

    Article  Google Scholar 

  26. Yin R, Zou Z, Wu C et al (2021b) Distributed spectrum and power allocation for d2d-u networks: a scheme based on nn and federated learning. Mobile Netw Appl 26 (5):2000–2013. https://doi.org/10.1007/s11036-021-01736-2

    Article  Google Scholar 

  27. She C, Yang C, Quek TQ (2017) Radio resource management for ultra-reliable and low-latency communications. IEEE Commun Mag 55(6):72–78. https://doi.org/10.1109/MCOM.2017.1601092

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China (Grant No. 61771429), in part by the Okawa Foundation for Information and Telecommunications, in part by G-7 Scholarship Foundation, in part by the Zhejiang Lab Open Program under Grant 2021LC0AB06, in part by the Academy of Finland under Grant 319759, Zhejiang University City College Scientific Research Foundation (No. JZD18002), in part by ROIS NII Open Collaborative Research 21S0601, and in part by JSPS KAKENHI (Grant No. 18KK0279, 19H04093, 20H00592, and 21H03424).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rui Yin.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendix A: Proof of convexity

Appendix A: Proof of convexity

The objective function Eq. 9 includes three parts. We can replace the second part, \(\theta ^{(U)}_{i,k}\) and \(p^{(U)}_{i,k}\), with \(A^{(U)}_{i,k}\). And P(tot) can be written as

$$P^{(tot)} \!= \! \sum\limits_{i=1}^{N}\sum\limits_{j=1}^{J}p^{(L)}_{i,j} + \sum\limits_{i=1}^{N}\sum\limits_{k=1}^{K}A^{(U)}_{i,k} + \sum\limits_{i=1}^{N}\sum\limits_{k=1}^{K}(1 - \theta^{(U)}_{i,k})p^{(U)}_{s}.$$
(A1)

Therefore, the objection function is a linear and convex function with respect to \(p^{(L)}_{i,j}\), \(A^{(U)}_{i,k}\), and \(\theta ^{(U)}_{i,k}\). The data rate of the URLLC device i on licensed subchannel j can be written as

$$\begin{array}{cc} R^{(L)}_{i,j} &= \underbrace{\xi^{(L)}_{i,j}W^{(L)}\log\left( 1+\frac{p^{(L)}_{i,j}h^{(L)}_{i,j}}{\xi^{(L)}_{i,j}W^{(L)}N_{0}}\right)}_{C_{1}} \\ &-\underbrace{\xi^{(L)}_{i,j}W^{(L)}\sqrt{\frac{V^{(L)}_{i,j}}{l}}\frac{Q^{-1}(\varepsilon)}{\ln2}}_{C_{2}}, \end{array}$$
(A2)

we can divide \(R^{(L)}_{i,j}\) into two parts, denoted as C1 and C2. For the first part, in order to prove its convexity, we define a function

$$R_{1}(x,y) = -x\log\left( 1+\frac{y}{x}\right),$$
(A3)

the Hessian matrix of R1(x,y) can be derived as

$$H =\left\lvert \begin{array}{cc} \frac{y^{2}/x}{(x+y)^{2}} & -\frac{y}{(x+y)^{2}}\\ -\frac{y}{(x+y)^{2}} & \frac{x}{(x+y)^{2}} \end{array}\right\lvert ,$$
(A4)

which has two eigenvalues

$$\lambda_{1} = 0,~\lambda_{2} = \frac{x^{2}+y^{2}}{x^{3}+2x^{2}y+xy^{2}}.$$
(A5)

It is obvious that two eigenvalues are greater or equal to zero when x ≥ 0. Thus, the function R1(x,y) is a convex function when x ≥ 0. For the second part, when the SINR is greater than 10 dB, \(V^{(L)}_{i,j}\) is approximately equal to 1. Therefore, the second part can be written as

$$C_{2} = \xi^{(L)}_{i,j}W^{(L)}\sqrt{\frac{1}{l}}\frac{Q^{-1}(\varepsilon)}{\ln2},$$
(A6)

which is linear with respect to \(\xi ^{(L)}_{i,j}\). Then, \(R^{(L)}_{i,j}\) can be rewritten as

$$\hat{R}^{(L)}_{i,j}\!= \! - f\left( \xi^{(L)}_{i,j}W^{(L)},\frac{p^{(L)}_{i,j}h^{(L)}_{i,j}}{N_{0}}\right) - \xi^{(L)}_{i,j}W^{(L)}\sqrt{\frac{1}{l}}\frac{Q^{-1}(\varepsilon)}{\ln2},$$
(A7)

the combination of a concave function and a linear function is also a concave function. The data rate of the URLLC device i on unlicensed channel k can be expressed as

$$\begin{array}{cc} R^{(U)}_{i,k} &= \theta^{(U)}_{i,k}W^{(U)}\log\left( 1+\frac{p^{(U)}_{i,k}h^{(U)}_{i,k}}{N_{0}W^{(U)}}\right)\\ &-\theta^{(U)}_{i,k}W^{(U)}\sqrt{\frac{V^{(U)}_{i,k}}{l}}\frac{Q^{-1}(\varepsilon)}{\ln2}, \end{array}$$
(A8)

let \(A^{(U)}_{i,k} = \theta ^{(U)}_{i,k} \cdot p^{(U)}_{i,k}\), and \(R^{(U)}_{i,k}\) can be expressed as

$$\begin{array}{cc} R^{(U)}_{i,k} &= \theta^{(U)}_{i,k}W^{(U)}\log\left( 1+\frac{A^{(U)}_{i,k}h^{(U)}_{i,k}}{\theta^{(U)}_{i,k}N_{0}W^{(U)}}\right)\\ &-\theta^{(U)}_{i,k}W^{(U)}\sqrt{\frac{V^{(U)}_{i,k}}{l}}\frac{Q^{-1}(\varepsilon)}{\ln2}, \end{array}$$
(A9)

we can prove \(R^{(U)}_{i,k}\) is also a concave function in the same way as \({R}^{(L)}_{i,j}\). The data rate of the URLLC device i can be written as

$$R_{i} = \sum\limits_{j=1}^{J}{R^{(L)}_{i,j}}+\sum\limits_{k=1}^{K}{R^{(U)}_{i,k}},$$
(A10)

the combination of a concave function and a concave function is also a concave function. In brief, problem P1 is a convex optimization problem.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yuan, J., Xiao, Q., Yin, R. et al. Unlicensed Assisted Ultra-Reliable and Low-Latency Communications. Mobile Netw Appl 27, 2232–2243 (2022). https://doi.org/10.1007/s11036-022-02003-8

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-022-02003-8

Keywords

Navigation