2018
DOI: 10.1080/02533839.2017.1419075
|View full text |Cite
|
Sign up to set email alerts
|

Power control for interference mitigation by evolutionary game theory in uplink NOMA for 5G networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(8 citation statements)
references
References 23 publications
0
8
0
Order By: Relevance
“…Solutions to this problem run the gamut from classical optimization techniques [2] to information and game theory [3], [4]. As emerging applications demand growth in scale and complexity, modern machine learning techniques have also been explored as alternatives to solve RRM problems in the presence of model and/or algorithmic deficits [5].…”
Section: A Motivationmentioning
confidence: 99%
See 1 more Smart Citation
“…Solutions to this problem run the gamut from classical optimization techniques [2] to information and game theory [3], [4]. As emerging applications demand growth in scale and complexity, modern machine learning techniques have also been explored as alternatives to solve RRM problems in the presence of model and/or algorithmic deficits [5].…”
Section: A Motivationmentioning
confidence: 99%
“…We study the case in which where the number of nodes in the network, K τ , is fixed, but the topology changes across periods; as well as the case in which the number of nodes in the network is also time-varying. 2) Dynamic network size: In the second scenario, the size of the network is chosen uniformly at random as K τ ∼ Uniform ( [4,20]). Each meta-training data set D τ corresponds to a realization of the network size and to a random drop of the transmitter-receiver pairs as discussed above.…”
Section: Data Setsmentioning
confidence: 99%
“…Considering G=][N,thinmathspace}{Ai,thinmathspace}{Uifalse(false), where G denoting the non‐cooperative MIMO power control game (NMPCG), with N = { l , 2, …, i } is the directory set for the itinerant users presently in the cell [12–14], the total transmit power strategy Pi is selected by the i th user , such that PiAi, where Ai signifies the tactic space of the i th user. Let the end result of the game be denoted in terms of the suitable power levels by the vector P = ( P 1 , …, P n ) of all users, P −i denotes the vector comprising of fundamentals of P other than the i th element and let A −i expresses the strategy gap of all the users not including the i th user.…”
Section: Power Control Game For Mimomentioning
confidence: 99%
“…As the extensive variety of obstacles for the power enhancement, MAI switch into wide spreading and might be critically lessen the data inaccuracy speed of the model. so as to effectively reduce the MAI in a MC CDMA situation by calculating with Walsh spreading sequences leads to attain the aim (non‐cooperative power control game (NPGP) along with chaotic order) 15–21 . Optimization of interference parameter is done by reducing the MAI.…”
Section: Introductionmentioning
confidence: 99%
“…so as to effectively reduce the MAI in a MC CDMA situation by calculating with Walsh spreading sequences leads to attain the aim (non-cooperative power control game (NPGP) along with chaotic order). [15][16][17][18][19][20][21] Optimization of interference parameter is done by reducing the MAI.…”
mentioning
confidence: 99%