2017 International Symposium on Wireless Communication Systems (ISWCS) 2017
DOI: 10.1109/iswcs.2017.8108124
|View full text |Cite
|
Sign up to set email alerts
|

On the effective energy efficiency of ultra-reliable networks in the finite blocklength regime

Abstract: Effective Capacity (EC) indicates the maximum communication rate subject to a certain delay constraint while effective energy efficiency (EEE) denotes the ratio between EC and power consumption. In this paper, we analyze the EEE of ultra-reliable networks operating in the finite blocklength regime. We obtain a closed form approximation for the EEE in Rayleigh block fading channels as a function of power, error probability, and delay. We show the optimum power allocation strategy for maximizing the EEE in finit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
4
2

Relationship

4
2

Authors

Journals

citations
Cited by 10 publications
(17 citation statements)
references
References 17 publications
0
17
0
Order By: Relevance
“…The energy efficiency is defined as the ratio between the throughput and the power consumption and it tells us the number of bits that can be transmitted per Hertz while consuming a joule unit. Considering a linear power consumption model as in [22], [36], we can write the energy efficiency of the system as…”
Section: B Energy Efficiencymentioning
confidence: 99%
“…The energy efficiency is defined as the ratio between the throughput and the power consumption and it tells us the number of bits that can be transmitted per Hertz while consuming a joule unit. Considering a linear power consumption model as in [22], [36], we can write the energy efficiency of the system as…”
Section: B Energy Efficiencymentioning
confidence: 99%
“…where D is the queueing delay, d is the delay threshold, θ is the delay QoS constraint, apθq is the effective bandwidth and ζ is the probability of non-empty buffer. It is noted that larger value of θ means that stringent QoS constraint is imposed, while for lose QoS requirement the value θ is small [12].…”
Section: B Throughput Of Delay Constrained Networkmentioning
confidence: 99%
“…" θλ´pα`βq`apθλ´pα`βqq 2`4 αθλ ı , (12) where α shows the transition rate from OFF state to ON state and β is the transition rate from ON state to OFF state. Then, we attain the steady state probability of being ON as…”
Section: B Markov Fluid Sourcesmentioning
confidence: 99%
“…Proof: See Appendix A. Theorem 1 first proves that for the fading SU-SU channel, the achievable average rateR is a monotonically increasing function for sufficiently large power values. In order to obtain a more general conclusion, we further take an AWGN channel as an example, which indicates that under some reasonable assumptions on m and ǫ [2], [18], the instantaneous rate r i can be proved to be monotonically increasing with the transmit SNR ρ 0 , as long as ρ 0 is not extremely low [19]. In this context, we can note that for non-extremely low SNR values, the optimal power control policy which solves the maximization problem (9a)-(9b) is simply transmitting at the maximum instantaneous power limit, i.e., P gs,ĝp = P peak g p − σ 2 e ln P out .…”
Section: Throughput With Finite Blocklength Codesmentioning
confidence: 99%
“…. By applying (19), A 1 can be expressed in closed-form and the closed-form approximation for E √ V can then be obtained by inserting A 1 back into (18).…”
Section: Appendix B: Proof Of Theoremmentioning
confidence: 99%