2017
DOI: 10.1007/978-3-319-68121-4_11
|View full text |Cite
|
Sign up to set email alerts
|

Power Control in D2D Network Based on Game Theory

Abstract: This paper considers power control problem based on Nash equilibrium (NE) to eliminate interference in multi-cell device-to-device (D2D) network. The power control problem is modeled as a non-cooperative game model, and a user residual energy factor is introduced in the formulation. Based on the proof of the existence and uniqueness of Nash equilibrium, a distributed iterative game algorithm is proposed to realize power control. Simulation results show that the proposed algorithm can converge to Nash equilibri… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 7 publications
0
3
0
Order By: Relevance
“…In addition, the power control problem has been considered based on Nash equilibrium to eliminate the interference in [27]. The problem modeled as a non-cooperative game model; whereas, by adjusting the residual energy factor, the algorithm obtained a better equilibrium income, and the power control problem has been adopted for successive interference cancellation.…”
Section: Related Workmentioning
confidence: 99%
“…In addition, the power control problem has been considered based on Nash equilibrium to eliminate the interference in [27]. The problem modeled as a non-cooperative game model; whereas, by adjusting the residual energy factor, the algorithm obtained a better equilibrium income, and the power control problem has been adopted for successive interference cancellation.…”
Section: Related Workmentioning
confidence: 99%
“…Hybrid methods proposed joint centralized‐distributed RA [28–30] to address these issues. However, fully distributed approaches have gained more merit [31–58]. They generally perform a utility function that represents every device's preference [31].…”
Section: Introductionmentioning
confidence: 99%
“…Then develop distributed resource allocation algorithms via: pricing, auctions [32], cooperative [33], and non‐cooperative games [34]. They combine the advantages of low information sharing, traffic offload, and low complexity [35, 37].…”
Section: Introductionmentioning
confidence: 99%