Distributed Power Allocation for Multiuser Two-Way Relay Networks Using Stackelberg Game
Author(s) -
Fu Jiang,
Chaoliang Zhu,
Jun Peng,
Yong He,
Shuo Li,
Weirong Liu
Publication year - 2014
Publication title -
journal of advanced computational intelligence and intelligent informatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.172
H-Index - 20
eISSN - 1343-0130
pISSN - 1883-8014
DOI - 10.20965/jaciii.2014.p0048
Subject(s) - relay , stackelberg competition , computer science , mathematical optimization , nash equilibrium , game theory , transmitter power output , computer network , power (physics) , distributed computing , mathematics , channel (broadcasting) , physics , transmitter , mathematical economics , quantum mechanics
Recently, two-way relay networks have been regarded as a promising technique that can improve bandwidth utilization. In this paper, the power allocation problem for multiuser two-way relay networks with amplifyand-forward protocol is investigated. In order to describe the self-interestedness of nodes in two-way relay networks, a two-level Stackelberg game is introduced to jointly optimize the benefits of the source pair and the relay nodes, where the relay nodes are modeled as leaders and the source pair is modeled as a follower. To facilitate the power allocation process, a distributed game-theoretic power allocation algorithm is proposed. Then, the existence and optimization of the Stackelberg equilibrium for the proposed power allocation algorithm is proven. The convergence of the presented algorithm is also analyzed by proving that price update is a standard function. Simulation results indicate that the proposed power allocation algorithm can improve energy utilization by jointly optimizing the utilities of both source pair and relay nodes.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom