DocumentCode
3395793
Title
A nash equilibrium based fair user pairing algorithm for the cooperative network coding in multiple access relay systems
Author
Xie, Xinqian ; Peng, Mugen ; Zhao, Zhongyuan ; Ji, Xiaodong ; Wang, Wenbo
Author_Institution
Key Lab. of Universal Wireless Commun. (Minist. of Educ.), Beijing Univ. of Posts & Telecommun., Beijing, China
fYear
2011
fDate
17-19 Aug. 2011
Firstpage
1137
Lastpage
1141
Abstract
In this paper, user pairing within network coding for multiple access relaying systems is studied. Focusing on the scenario that consists of multiple users, one relay and one base station, the relay helps two users transmit messages to base station sharing the same resource block. A proper user pairing approach within network coding is necessary to further improve the system performance. Game theory is utilized to model the user pairing problem as a non-cooperative game. The Nash equilibrium (NE) provides a theoretical solution for the referred problem. Since the NE is not always unique, a heuristic algorithm is proposed to approach a quasi-equilibrium. Simulation results demonstrate that the proposed algorithm can improve the pairing fairness and the worst user´s performance.
Keywords
cooperative communication; game theory; multi-access systems; network coding; Nash equilibrium-based fair user pairing algorithm; base station sharing; cooperative network coding; game theory; heuristic algorithm; message transmission; multiple access relay system; noncooperative game; quasiequilibrium approach; resource block; system performance; user pairing approach; Complexity theory; Electronics packaging; Games; Nash equilibrium; Network coding; Relays; Wireless communication; Nash equilibrium; Network coding; user pairing;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications and Networking in China (CHINACOM), 2011 6th International ICST Conference on
Conference_Location
Harbin
Print_ISBN
978-1-4577-0100-9
Type
conf
DOI
10.1109/ChinaCom.2011.6158327
Filename
6158327
Link To Document