Fair and efficient scheduling in wireless networks with successive interference cancellation

Abstract

Abstract-This paper considers the problem of uplink scheduling in wireless networks supporting successive interference cancellation (SIC) at the physical layer. By allowing concurrent interfering transmissions, SIC enables multi-packet reception at the receiver resulting in increased network throughput. Specifically, we consider maximum throughput scheduling and proportional fair scheduling problems and study optimal and heuristic algorithms for these problems. We prove that the maximum throughput scheduling problem is NP-hard and develop a throughput efficient polynomial time greedy algorithm for the problem. While being throughput efficient, the maximum throughput scheduling can lead to highly unfair rates among the users. The proportional fair scheduling, on the other hand, is not throughput optimal but achieves proportional fairness among the users. For scheduling multiple users in a single time-slot, we show that there exists an algorithm that solves the proportional fair scheduling problem in polynomial time. For scheduling in multiple time-slots, we develop a greedy algorithm that computes a highly fair schedule in polynomial time. Numerical results are also provided to show the utility and efficiency of the proposed scheduling algorithms in various simulated networks.

Modeling and Analysis of Uplink Non-Orthogonal Multiple Access (NOMA) in Large-Scale Cellular Networks Using Poisson Cluster Processes

“…SIC is among one of the best known interference cancellation methods as (i) the SIC receiver is architecturally similar to traditional non-SIC receivers in terms of hardware complexity and cost, (ii) it uses the traditional decoder to decode the composite signal at different stages and neither complicated decoders nor multiple antennas are required, and (iii) it can achieve the Shannon capacity for both the broadcast and multiple access networks [20], [21]. Typically, SIC is used to regenerate the interfering signals and subsequently cancel them from the received composite signal to improve the SINR of the desired signal.…”

CSNOMA: Carrier Sense Non-Orthogonal Multiple Access

“…The characteristics of scheduling schemes utilizing IC are investigated in [ 22 , 23 , 24 , 25 , 26 ]. However, they consider the low dense network, so the performance gain is not properly investigated as increasing the nodes in the network.…”

Towards optimal resource allocation in wireless powered communication networks with non-orthogonal multiple access

“…Under the SICD scheme, it is important to notice that although the decoding order, that is, the order by which the users' signals are decoded at the AP, doesn't affect the sum throughput of the network as shown in [32], it will certainly affect the fairness aspect. To achieve the highest fairness, it can be easily proven that the optimal decoding order w.r.t fairness is based on the received signal strength that is directly affected by the channel gain; from the strongest to the weakest signal [25].…”