On the effective capacity of MTC networks in the finite blocklength regime

Shehab, Mohammad; Dosti, Endrit; Alves, Hirley

doi:10.1109/eucnc.2017.7980731

Cited by 17 publications

(22 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We observe that higher power gains can be achieved when the power saving factor µ and the delay constraint θ increase. This occurs due to the fact that rising the transmit power renders limited gain in EC for delay strict networks as pointed in Proposition 1 in [13]. Notice that as the power saving parameter µ becomes higher, we obtain higher power gain.…”

Section: ´mentioning

confidence: 89%

See 1 more Smart Citation

Effective Capacity and Power Allocation for Machine-Type Communication

Shehab

Alves

2019

IEEE Trans. Veh. Technol.

Self Cite

View full text Add to dashboard Cite

Effective capacity (EC) determines the maximum communication rate subject to a particular delay constraint. In this work, we analyze the EC of ultra reliable Machine Type Communication (MTC) networks operating in the finite blocklength (FB) regime. First, we present a closed form approximation for EC in quasi-static Rayleigh fading channels. Our analysis determines the upper bounds for EC and delay constraint when varying transmission power. Finally, we characterize the powerdelay trade-off for fixed EC and propose an optimum power allocation scheme which exploits the asymptotic behavior of EC in the high SNR regime. The results illustrate that the proposed scheme provides significant power saving with a negligible loss in EC.Index Terms-Effective capacity, finite blocklength, ultra reliable communication, optimal power allocation. I. INTRODUCTIONCommunication systems have become everyday use equipments everywhere around us. In these systems, information is commonly conveyed in the form of data bits which are then transformed to coded packets. Packets are then transmitted in noisy mediums which are affected by fading. For a certain communication channel, Shannon capacity determines the attainable rate by which information can be transmitted with almost no error. Conventionally, communication systems are designed based on Shannon theory, which resorts to the transmission of relatively long data packages when there is a large number of channel uses per packet. Machine type communication (MTC) systems ranging from sensor to vehicular networks often have strict delay constraints, where packets are relatively short and required to be transmitted at minimum latency and a high level of reliability (i.e, >99.99%). This is not merely achieved via conventional coding with long blocklength. Meanwhile, ultra reliable communication (URC) has evolved to propose solutions for reliable and low latency communication. The next generations of mobile communication are expected to support such demands via MTC [1]-[3].To achieve minimum latency and ultra reliability as envisioned for real time applications and emerging technologies such as e-health and road safety, these networks communicate on short messages. Transmission of short packets does not M. Shehab, H. Alves, and M. Latva-aho are with Centre for Wireless Communications (CWC), University of Oulu, Finland Email: firstname.lastname@oulu.fi

show abstract

Section: ´mentioning

confidence: 89%

“…Proof. The expectation given by (13) was proven to be convex in in [5] for any distribution of the channel coefficients. Note that J is a function of as indicated in Lemma 1, in (7) and the auxiliary variable β.…”

Section: Effective Capacity In Quasi-static Rayleigh Fadingmentioning

confidence: 99%

Effective Capacity and Power Allocation for Machine-Type Communication

Shehab

Alves

2019

IEEE Trans. Veh. Technol.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Notice that for the NOMA case, we set β " 1 in (17) and (19). While, in (18) and (20) we set β " 0 to guarantee full sharing of resources. Further, in (21) and (22), i P t1, 2u for user 1 and user 2, respectively.…”

Section: Quasi-static Fading Channelmentioning

confidence: 99%

On the performance of non-orthogonal multiple access in the finite blocklength regime

2019

Self Cite

View full text Add to dashboard Cite

In this paper, we present a finite-block-length comparison between the orthogonal multiple access (OMA) scheme and the non-orthogonal multiple access (NOMA) for the uplink channel. First, we consider the Gaussian channel, and derive the closed form expressions for the rate and outage probability. Then, we extend our results to the quasi-static Rayleigh fading channel. Our analysis is based on the recent results on the characterization of the maximum coding rate at finite block-length and finite block-error probability. The overall system throughput is evaluated as a function of the number of information bits, channel uses and power. We find what would be the respective values of these different parameters that would enable throughput maximization. Furthermore, we analyze the system performance in terms of reliability and throughput when applying the type-I ARQ protocol with limited number of retransmissions. The throughput and outage probability are evaluated for different blocklengths and number of information bits. Our analysis reveals that there is a trade-off between reliability and throughput in the ARQ. While increasing the number of retransmissions boosts reliability by minimizing the probability of reception error, it results in more delay which decreases the throughput. Nevertheless, the results show that NOMA always outperforms OMA in terms of throughput, reliability and latency regardless of the users priority or the number of retransmissions in both Gaussian and fading channels.Keywords: non-orthogonal multiple access (NOMA), finite blocklength, ultra reliable communication (URC).

show abstract

“…In [16], a general model is developed for the RACH procedure. The impact of short packets of machinetype services on the achievable rate is considered in [17]. In traditional communications, the Shannon's channel coding theorem is employed under the assumption of infinity blocklength, while for a finite block-length, a novel effective capacity is developed to guarantee statistical QoS for MTC.…”

Section: Introductionmentioning

confidence: 99%

Game-Theoretic Optimization for Machine-Type Communications Under QoS Guarantee

Gü

Cui

et al. 2019

IEEE Internet Things J.

View full text Add to dashboard Cite

Massive machine-type communication (mMTC) is a new focus of services in fifth generation (5G) communication networks. The associated stringent delay requirement of endto-end (E2E) service deliveries poses technical challenges. In this paper, we propose a joint random access and data transmission protocol for mMTC to guarantee E2E service quality of different traffic types. First, we develop a priority-queueingbased access class barring (ACB) model and a novel effective capacity is derived. Then, we model the priority-queueingbased ACB policy as a non-cooperative game, where utility is defined as the difference between effective capacity and access penalty price. We prove the existence and uniqueness of Nash equilibrium (NE) of the non-cooperative game, which is also a sub-modular utility maximization problem and can be solved by a greedy updating algorithm with convergence to the unique NE. To further improve the efficiency, we present a price-update algorithm, which converges to a local optimum. Simulations demonstrate the performance of the derived effective capacity and the effectiveness of the proposed algorithms. IndexTerms-Massive machine-type communications (mMTC), random access, effective capacity, quality of service (QoS), non-cooperative game, sub-modular function.

show abstract

On the effective capacity of MTC networks in the finite blocklength regime

Cited by 17 publications

References 12 publications

Effective Capacity and Power Allocation for Machine-Type Communication

Effective Capacity and Power Allocation for Machine-Type Communication

On the performance of non-orthogonal multiple access in the finite blocklength regime

Game-Theoretic Optimization for Machine-Type Communications Under QoS Guarantee

Contact Info

Product

Resources

About