Effective Capacity defines the maximum communication rate subject to a specific delay constraint, while effective energy efficiency (EEE) indicates the ratio between effective capacity and power consumption. We analyze the EEE of ultra-reliable networks operating in the finite blocklength regime. We obtain a closed form approximation for the EEE in quasi-static Nakagami-$m$ (and Rayleigh as sub-case) fading channels as a function of power, error probability, and latency. Furthermore, we characterize the QoS constrained EEE maximization problem for different power consumption models, which shows a significant difference between finite and infinite blocklength coding with respect to EEE and optimal power allocation strategy. As asserted in the literature, achieving ultra-reliability using one transmission consumes huge amount of power, which is not applicable for energy limited IoT devices. In this context, accounting for empty buffer probability in machine type communication (MTC) and extending the maximum delay tolerance jointly enhances the EEE and allows for adaptive retransmission of faulty packets. Our analysis reveals that obtaining the optimum error probability for each transmission by minimizing the non-empty buffer probability approaches EEE optimality, while being analytically tractable via Dinkelbach's algorithm. Furthermore, the results illustrate the power saving and the significant EEE gain attained by applying adaptive retransmission protocols, while sacrificing a limited increase in latency.
翻译:有效能力界定了受特定延迟限制的最大通信率,而有效的能效(EEEE)则指明了有效能力与电力消费之间的比例。我们分析了在有限区段制度下运行的超可靠网络的EEEEEE,我们获得了半静态中加热-美元(以及以Raylei为子情况)淡化通道的EEEEEE封闭式近似值,这是动力、误差概率和延缓性的一个函数。此外,我们把不同电力消费模式的QOS限制EEE优化的问题定性为QOS限制EEEE最大化问题,这显示出在EEEEE和最佳电力分配战略方面,有限和无限区段宽长的串联调差异很大。正如文献所断言的那样,使用一种传输实现超可靠程度的EEEEE, 耗了大量电力,这不适用于能源有限的IOT装置。在这方面,计算机型通信中的空缓冲概率,并延长最大延迟容忍度共同增强EEEEE,并允许对错误包进行适应性再传递。我们的分析表明,通过将EEEEEEE-E最优化的适应性方法进行最大程度的升级,同时进行分析,使EEEEE-E-E-E-E-E-E-E-E-E-E-E-E-E-E-E-E-E-E-L-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-A-C-C-C-C-C-C-C-C-C-C-C-C-C-C-A-A-A-A-A-A-A-A-A-A-A-A-A-C-C-C-C-C-C-C-A-A-A-A-C-C-C-A-A-A-C-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A-A