A Game-Theoretic Approach to Relay Selection in Cooperative Wireless Networks

被引:0
作者
Baidas, Mohammed W. [1 ]
Bahbahani, Mohammed S. [2 ]
机构
[1] Kuwait Univ, Coll Engn & Petr, Dept Elect Engn, Kuwait, Kuwait
[2] Univ Manchester, Sch Elect & Elect Engn, Manchester, Lancs, England
来源
2014 INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING CONFERENCE (IWCMC) | 2014年
关键词
Amplify-and-forward; centralized; cooperation; distributed; game-theory; Nash Equilibrium; relay selection;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, distributed relay selection in cooperative wireless networks is modeled as a Chinese restaurant game (CRG). Specifically, the CRC; is used to model strategic relay selection decisions of source nodes, taking into account negative network externality due to the potential sharing of relay nodes among source nodes. In turn, a distributed relay selection algorithm is proposed and shown to converge to a Nash Equilibrium grouping. Simulation results verify the efficiency of the proposed distributed algorithm when compared with other relay selection schemes, and demonstrate that it yields a network sum-rate that is comparable with that of centralized relay selection.
引用
收藏
页码:375 / 380
页数:6
相关论文
共 14 条
[1]  
[Anonymous], 1985, Ecole d'Ete de Probabilites de Saint-Flour XIII
[2]  
[Anonymous], P IEEE WCNC
[3]  
[Anonymous], MIDACO NEW GLOBAL OP
[4]  
Atapattu S., 2012, IEEE J SEL AREA COMM, V31, P1
[5]  
Bonami P, 2009, 1664 U WISC MAD COMP
[6]   Single and Multiple Relay Selection Schemes and their Achievable Diversity Orders [J].
Jing, Yindi ;
Jafarkhani, Hamid .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2009, 8 (03) :1414-1423
[7]  
Liang XD, 2011, INT WIREL COMMUN, P1557, DOI 10.1109/IWCMC.2011.5982770
[8]  
Liu K.J.R., 2008, Cooperative Communications and Networking
[9]  
Nowak I., 2005, RELAXATION DECOMPOSI
[10]   A Game Theoretical Approach to Distributed Relay Selection in Randomized Cooperation [J].
Sergi, Simone ;
Vitetta, Giorgio M. .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2010, 9 (08) :2611-2621