Spectrum Allocation and Power Control for Non-Orthogonal Multiple Access in HetNets

Zhao, Jingjing; Liu, Yuanwei; Chai, Kok Keong; Nallanathan, Arumugam; Chen, Yue; Han, Zhu

doi:10.1109/twc.2017.2716921

Cited by 182 publications

(120 citation statements)

References 31 publications

Supporting

Mentioning

119

Contrasting

Order By: Relevance

“…Due to its appealingly low complexity, matching theory has been widely used for solving diverse resource optimization problems in wireless NOMA networks [155]- [158]. The resource allocation in NOMA systems, such as user grouping and subchannel allocation, can be viewed as a classical matching problem, as exemplified by one-to-one [155], many-to-one [156] [157], and many-to-many [158] scenarios. The simplest matching scenarios is one-to-one matching, where each user from a set can be matched with at most one user from the opposite set.…”

Section: User Grouping and Resource Allocationmentioning

confidence: 99%

“…The pair of users belonging to the matched user pair can share the same spectrum in oredr to improve each user's data rate and the entire system's sum rate. Regarding heterogeneous NOMA networks, a many-to-one matching solution was invoked for solving a challenging spectrum allocation problem in [156], where a swap-operation aided matching algorithm was proposed for matching a small base stations with a suitable resource block, whilst aiming for maximizing the small cell users throughput. In many-to-many matching, at least one player in one set can be matched to multiple players in the opposite set.…”

Section: User Grouping and Resource Allocationmentioning

confidence: 99%

See 1 more Smart Citation

A Survey of Non-Orthogonal Multiple Access for 5G

Dai

Wang

Ding

et al. 2018

IEEE Commun. Surv. Tutorials

1,095

664

View full text Add to dashboard Cite

Abstract-In the 5th generation (5G) of wireless communication systems, hitherto unprecedented requirements are expected to be satisfied. As one of the promising techniques of addressing these challenges, non-orthogonal multiple access (NOMA) has been actively investigated in recent years. In contrast to the family of conventional orthogonal multiple access (OMA) schemes, the key distinguishing feature of NOMA is to support a higher number of users than the number of orthogonal resource slots with the aid of non-orthogonal resource allocation. This may be realized by the sophisticated inter-user interference cancellation at the cost of an increased receiver complexity. In this article, we provide a comprehensive survey of the original birth, the most recent development, and the future research directions of NOMA. Specifically, the basic principle of NOMA will be introduced at first, with the comparison between NOMA and OMA especially from the perspective of information theory. Then, the prominent NOMA schemes are discussed by dividing them into two categories, namely, power-domain and code-domain NOMA. Their design principles and key features will be discussed in detail, and a systematic comparison of these NOMA schemes will be summarized in terms of their spectral efficiency, system performance, receiver complexity, etc. Finally, we will highlight a range of challenging open problems that should be solved for NOMA, along with corresponding opportunities and future research trends to address these challenges.

show abstract

Section: User Grouping and Resource Allocationmentioning

confidence: 99%

Section: User Grouping and Resource Allocationmentioning

confidence: 99%

A Survey of Non-Orthogonal Multiple Access for 5G

Dai

Wang

Ding

et al. 2018

IEEE Commun. Surv. Tutorials

1,095

664

View full text Add to dashboard Cite

show abstract

“…Similar problems to [5] are studied in [7,8]. In [9], the authors study the problem of channel allocation and power control in non-orthogonal multiple access networks. They use a matching game to design a two-sided exchange-stable algorithm to solve the channel allocation problem.…”

Section: A Related Workmentioning

confidence: 99%

“…They formulate a network utility maximization problem and they use stochastic geometry to obtain the analytical user association bias factors and the channel partition ratios. The works in [5,[7][8][9][10] solve the channel allocation or the user association problem without considering energy harvesting BSs nor the scheduling problem. In [11], the authors study multicast scheduling in cellular networks under deadline constraints.…”

Section: A Related Workmentioning

confidence: 99%

Resource Allocation in Green Dense Cellular Networks: Complexity and Algorithms

Mlika

Driouch

Ajib

2020

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

This paper studies the problem of user association, scheduling and channel allocation in dense cellular networks with energy harvesting base stations (EBSs). In this problem, the EBSs are powered solely by renewable energy and each user has a request for downloading data of certain size with a deadline constraint. The objective is to maximize the number of associated and scheduled users while allocating the available channels to the users and respecting the energy and deadline constraints. First, the computational complexity of this problem is characterized by studying its NP-hardness in different cases. Next, efficient algorithms are proposed in each case.The case of a single channel and a single EBS is solved using two polynomial-time optimal algorithms-one for arbitrary deadlines and a less-complex one for common deadlines. The case of a single channel and multiple EBSs is solved by proposing an efficient constant-factor approximation algorithm. The case of multiple channels is efficiently solved using a heuristic algorithm. Finally, our theoretical analysis is supplemented by simulation results to illustrate the performance of the proposed algorithms.

show abstract

“…Φ j i = {(i, Φ (j)) , (j, Φ (i))} ∪ {Φ\ {(i, Φ (i)) , (j, Φ (j))}} is defined as the swap matching function, in which only F-AP i and j switch. Compared with traditional swap operations in [9], which performs the swap if and only if the condition U s Φ j i ≥ U s (Φ) , ∀s ∈ {i, j, Φ i , Φ j } is satisfied, we propose a modified swap-enabled matching scheme. Since that M RUEs have been allocated to M RBs ahead of time, the interference to each RUE needs attention.…”

Section: A Rb Allocation Schemementioning

confidence: 99%

Joint Resource Block-Power Allocation for NOMA-Enabled Fog Radio Access Networks

Liu

Peng

2019

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

View full text Add to dashboard Cite

In order to achieve efficient communication in the fifth generation (5G) networks, non-orthogonal multiple access (NOMA) technique has been utilized in fog radio access networks (F-RANs). In this paper, we investigate the resource allocation problem in a NOMA-enabled downlink F-RAN. To maximize the weighted sum rate of NOMA users served by fog-computingbased access points (F-APs), the resource block (RB) allocation and power allocation are optimized. Specifically, we decouple the problem into RB allocation and power allocation problems. The former is modeled as a many-to-one matching game and we propose a modified swap-enabled matching algorithm to solve it, which takes interference threshold into consideration. The later is a non-convex problem, we transform it into a tractable one via some approximations and get the closed-form expressions of power allocation coefficients. Finally, we combine the both to propose a joint resource allocation algorithm, which is preformed iteratively to obtain the optimal result. Simulation results are provided to show the performance of the algorithm.

show abstract

Spectrum Allocation and Power Control for Non-Orthogonal Multiple Access in HetNets

Cited by 182 publications

References 31 publications

A Survey of Non-Orthogonal Multiple Access for 5G

A Survey of Non-Orthogonal Multiple Access for 5G

Resource Allocation in Green Dense Cellular Networks: Complexity and Algorithms

Joint Resource Block-Power Allocation for NOMA-Enabled Fog Radio Access Networks

Contact Info

Product

Resources

About