Statistical QoS provisioning for MTC networks under finite blocklength
Shehab, Mohammad; Dosti, Endrit; Alves, Hirley; Latva-aho, Matti (2017-08-10)
Shehab, M., Dosti, E., Alves, H., Latva-aho, M. (2018) Statistical QoS provisioning for MTC networks under finite blocklength. EURASIP Journal on Wireless Communications and Networking, 2018:194. doi:10.1186/s13638-018-1213-3
© The Author(s) 2018. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License(http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
https://creativecommons.org/licenses/by/4.0/
https://urn.fi/URN:NBN:fi-fe2018101138092
Tiivistelmä
Abstract
This paper analyzes the effective capacity of delay-constrained machine-type communication (MTC) networks operating in the finite blocklength regime. First, we derive a closed-form mathematical approximation for the effective capacity in quasi-static Rayleigh fading channels. We characterize the optimum error probability to maximize the concave effective capacity function with reliability constraint and study the effect of signal-to-interference-plus-noise ratio (SINR) variations for different delay constraints. The trade-off between reliability and effective capacity maximization reveals that we can achieve higher reliability with limited sacrifice in effective capacity specially when the number of machines is small. Our analysis reveals that SINR variations have less impact on effective capacity for strict delay-constrained networks. We present an exemplary scenario for massive MTC access to analyze the interference effect proposing three methods to restore the effective capacity for a certain node which are power control, graceful degradation of delay constraint, and joint compensation. Joint compensation combines both power control and graceful degradation of delay constraint, where we perform the maximization of an objective function whose parameters are determined according to the delay and SINR priorities. Our results show that networks with stringent delay constraints favor power controlled compensation, and compensation is generally performed at higher costs for shorter packets.
Kokoelmat
- Avoin saatavuus [37205]