SIC vs. JD: Uplink NOMA techniques for M2M random access

Zhang, Yushu; Peng, Kewu; Chen, Zhangmei; Song, Jian

doi:10.1109/icc.2017.7996497

Cited by 21 publications

(16 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Due to the complicated expression of the objective function T P A (I, q) as shown in (32) and (35), our formulated problem cannot be easily solved. Consequently, we employ a two-step scheme to solve efficiently the throughput maximization problem.…”

Section: Pso Algorithm Based Solutionmentioning

confidence: 99%

“…If the MTCD requires high target data rate, e.g., future smart grid requires data rate larger than 3.072 bps/Hz [45], we have that β = 2 R0 − 1 is usually much larger than one. In this case, we can know that the interval [1/β, 1) occupies most part of the domain for the back-off factor q as indicated by (32). Consequently, the optimal solution for q ∈ [1/β, 1) should achieve the near-optimal performance when the target data rate is high, i.e., we can regard the optimal solution within the interval q ∈ [1/β, 1) as the suboptimal solution within the entire interval q ∈ (0, 1) under the high data rate requirement.…”

Section: Analysis Under High Data Rate Requirementmentioning

confidence: 99%

“…However, for a large number of MTCDs, these methods cannot satisfy the performance requirements of future mMTC networks. As the successive interference cancelation (SIC) technique enables multiple MTCDs that choose the identical PA to have the opportunity for successful transmissions, non-orthogonal multiple access (NOMA) is a promising approach to enhance the throughput of the mMTC network [32]- [35]. A power domain multiplexing based uplink NOMA scheme was proposed in [37] by adopting the power back-off.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Throughput-Oriented Non-Orthogonal Random Access Scheme for Massive MTC Networks

Wang

Yang

et al. 2020

IEEE Trans. Commun.

View full text Add to dashboard Cite

Machine-type communications (MTC) technology, which enables direct communications among devices, plays an important role in realizing Internet-of-Things. However, a large number of MTC devices can cause severe collisions. As a result, the network throughput is decreased and the access delay is increased. To address this issue, a throughput-oriented non-orthogonal random access (NORA) scheme is proposed for massive machine-type communications (mMTC) networks. Specifically, by employing the technique of tagged preambles (PAs), multiple MTC devices (MTCDs) choosing the same PA can be distinguished and regarded as a non-orthogonal multiple access (NOMA) group, which enables multiple MTCDs to share the same physical uplink shared channel for transmissions by multiplexing in the power domain. The Sukhatme's classic theory and the characteristic function approach are adopted to formulate an optimization problem. The aim is to maximize the throughput subject to the constraints on the power back-off factor, the number of MTCDs included in a NOMA group, and the successful transmission probability. Based on the particle swarm optimization (PSO) algorithm, the formulated optimization problem is efficiently solved. The derived solution can be used to adjust the access class barring factor such that more MTCDs can obtain the access opportunities. Moreover, a lowcomplexity suboptimal solution is also developed, which can achieve near-PSO performance under high data rate requirement. Simulation results show that the proposed scheme can efficiently improve the network performance and comparison is made with the existing schemes. Index Terms-Massive machine-type communications (MTC) networks, non-orthogonal random access, power back-off.

show abstract

Section: Pso Algorithm Based Solutionmentioning

confidence: 99%

Section: Analysis Under High Data Rate Requirementmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Throughput-Oriented Non-Orthogonal Random Access Scheme for Massive MTC Networks

Wang

Yang

et al. 2020

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…Likewise sequential algorithms, the order in which the system operates is a critical factor. With regard to SIC, however, setting the user-decoding order (UO) requires some knowledge of the received user strengths (powers or symbol energies) [2].…”

Section: Introductionmentioning

confidence: 99%

Asymptotic Performance Analysis of Successive Interference Cancellation With Dynamic User-Decoding Order

Molina

Sala-Alvarez

2020

IEEE Commun. Lett.

View full text Add to dashboard Cite

We address the evaluation of dynamic (estimationbased) user-decoding order in successive interference cancellation (SIC) in a proof-of-concept multiple access satellite setting in which many code-division multiple access users employ nonorthogonal spreading codes and the same encoder. We consider the practical setting where user symbol energies, unknown to the receiver, are estimated by preamble cross-correlations. Thereafter, SIC proceeds in non-increasing order of the former estimates. In contrast with small networks evaluated in the literature, we analyze the large-user regime and derive a simple system model to analyze the asymptotic network performance. Monte Carlo simulations validate our infinite-user analysis for hundreds of users and report the benefits of their application.

show abstract

“…Information theory analyses have proved the benefit of SIC, which relies on successive decoding and subtraction of usersignals, in interference-limited scenarios [4]. SIC attains the corner points of the Gaussian channel's capacity region, and, in contrast to joint detection, decoding complexity is reduced at the exchange of enabling CSI [5], [6]. Hence, the practical application of SIC needs the design of an appropriate power control scheme featuring user-power imbalance, under the specific SIC implementation and energy-aware user constraints.…”

Section: Introductionmentioning

confidence: 99%

Channel-Aware Energy Allocation for Throughput Maximization in Massive Low-Rate Multiple Access

Molina

Sala-Alvarez

Micolau

et al. 2019

ICC 2019 - 2019 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

A multiple access (MA) optimization technique for massive low-rate direct-sequence spread spectrum communications is analyzed in this work. A dense network of users transmitting at the same rate to a common central node under channelaware energy allocation is evaluated. At reception, successive interference cancellation (SIC) aided by channel decoding is adopted. Our contribution focuses on wireless scenarios involving a vast number of users for which the provided user-asymptotic model holds. Variational calculus (VC) is employed to derive the energy allocation function that, via user-power imbalance, maximizes the network spectral efficiency (SE) when perfect channel state information at transmission (CSIT) is available and both average and maximum per-user energy constraints are set. Monte Carlo simulations at chip-level of a SIC receiver using a real decoder assess the proposed optimization method.

show abstract

SIC vs. JD: Uplink NOMA techniques for M2M random access

Cited by 21 publications

References 16 publications

Throughput-Oriented Non-Orthogonal Random Access Scheme for Massive MTC Networks

Throughput-Oriented Non-Orthogonal Random Access Scheme for Massive MTC Networks

Asymptotic Performance Analysis of Successive Interference Cancellation With Dynamic User-Decoding Order

Channel-Aware Energy Allocation for Throughput Maximization in Massive Low-Rate Multiple Access

Contact Info

Product

Resources

About