Efficient transmission schemes for low-latency networks: NOMA vs. relaying

In this work, we focus on a low-latency multiuser broadcast network operating in the finite blocklength regime and employing a non-orthogonal multiple-access (NOMA) scheme. By letting the user with the stronger channel from the source act as a relay, we propose two relay-assisted transmission schemes, namely relaying and NOMA-relay. We study the finite blocklength performance of the proposed schemes in comparison with the NOMA scheme. Both the average performance of and fairness between users are considered. Our results show that the NOMA scheme is not preferred in the low-latency scenario in comparison to the proposed schemes. In particular, the relaying scheme generally provides the best fairness between users, while the NOMA-relay scheme is able to achieve a higher average throughput by setting the packet size relatively aggressively.

[1]  Shuangfeng Han,et al.  Non-orthogonal multiple access for 5G: solutions, challenges, opportunities, and future research trends , 2015, IEEE Communications Magazine.

[2]  Martin Maier,et al.  The tactile internet: vision, recent progress, and open challenges , 2016, IEEE Communications Magazine.

[3]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[4]  Arumugam Nallanathan,et al.  Performance Analysis of NOMA With Fixed Gain Relaying Over Nakagami- $m$ Fading Channels , 2017, IEEE Access.

[5]  Nihar Jindal,et al.  Coding versus ARQ in Fading Channels: How Reliable Should the PHY Be? , 2011, IEEE Trans. Commun..

[6]  Xin-Ping Guan,et al.  Ubiquitous Monitoring for Industrial Cyber-Physical Systems Over Relay- Assisted Wireless Sensor Networks , 2015, IEEE Transactions on Emerging Topics in Computing.

[7]  Xiaoli Chu,et al.  Simultaneous Information and Energy Flow for IoT Relay Systems with Crowd Harvesting , 2016, IEEE Communications Magazine.

[8]  Giuseppe Durisi,et al.  Quasi-Static Multiple-Antenna Fading Channels at Finite Blocklength , 2013, IEEE Transactions on Information Theory.

[9]  Zhiguo Ding,et al.  Short-Packet Communications in Non-Orthogonal Multiple Access Systems , 2017, ArXiv.

[10]  James Gross,et al.  Blocklength-Limited Performance of Relaying Under Quasi-Static Rayleigh Channels , 2016, IEEE Transactions on Wireless Communications.

[11]  Behrooz Makki,et al.  Finite Block-Length Analysis of the Incremental Redundancy HARQ , 2014, IEEE Wireless Communications Letters.

[12]  James Gross,et al.  On the Performance Advantage of Relaying Under the Finite Blocklength Regime , 2015, IEEE Communications Letters.

[13]  H. Vincent Poor,et al.  Dispersion of the Gilbert-Elliott Channel , 2011, IEEE Trans. Inf. Theory.

[14]  Mustafa Cenk Gursoy,et al.  Throughput of cognitive radio systems with finite blocklength codes , 2012, 2012 46th Annual Conference on Information Sciences and Systems (CISS).

[15]  Mustafa Cenk Gursoy Throughput analysis of buffer-constrained wireless systems in the finite blocklength regime , 2013 .

[16]  Ekram Hossain,et al.  Dynamic User Clustering and Power Allocation for Uplink and Downlink Non-Orthogonal Multiple Access (NOMA) Systems , 2016, IEEE Access.

[17]  James Gross,et al.  On the Capacity of Relaying With Finite Blocklength , 2016, IEEE Transactions on Vehicular Technology.

[18]  Andreas Willig,et al.  Scheduling for Source Relaying With Packet Aggregation in Industrial Wireless Networks , 2016, IEEE Transactions on Industrial Informatics.

[19]  Kwang-Cheng Chen,et al.  Statistical QoS Control of Network Coded Multipath Routing in Large Cognitive Machine-to-Machine Networks , 2016, IEEE Internet of Things Journal.

[20]  Gerhard Fettweis,et al.  5G-Enabled Tactile Internet , 2016, IEEE Journal on Selected Areas in Communications.

[21]  Behrooz Makki,et al.  Finite Block-Length Analysis of Spectrum Sharing Networks Using Rate Adaptation , 2015, IEEE Transactions on Communications.

[22]  H. Vincent Poor,et al.  Dispersion of the Gilbert-Elliott Channel , 2009, IEEE Transactions on Information Theory.