Game Theoretic Analysis of Post Handoff Target Channel Sharing in Cognitive Radio Networks

被引:0
作者
Gupta, Nitin [1 ]
Dhurandher, Sanjay Kumar [2 ]
Woungang, Isaac [3 ]
Rodrigues, Joel J. P. C. [4 ,5 ,6 ,7 ]
机构
[1] Univ Delhi, NSIT, Div Comp Engn, New Delhi, India
[2] Univ Delhi, NSIT, Div Informat Technol, New Delhi, India
[3] Ryerson Univ, Dept Comp Sci, Toronto, ON, Canada
[4] Natl Inst Telecommun Inatel, Santa Rita Do Sapucai, MG, Brazil
[5] Univ Beira Interior, Inst Telecomunicacoes, Covilha, Portugal
[6] ITMO Univ, St Petersburg, Russia
[7] Univ Fortaleza UNIFOR, Fortaleza, CE, Brazil
来源
GLOBECOM 2017 - 2017 IEEE GLOBAL COMMUNICATIONS CONFERENCE | 2017年
关键词
Cognitive radio networks; game theory; target channel; cooperative game; non-cooperative game; mixed strategy game; Nash equilibrium; Nash bargaining solution; OFDMA NETWORKS; ALLOCATION; ALGORITHM;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Handoff in cognitive radio networks (CRNs) is a situation that arises whenever a secondary user (SU) has to switch from its current channel to a new target channel in case the primary user (PU) reclaims the current channel. Often when a SU switches to a target channel, it finds that it has to share the target channel with the coexistent users. These coexistent users can either be the interrupted or non-interrupted SUs who also wish to share the same channel. Long waiting in a queue or simultaneous access to the channel may decrease the SU's and network's throughput considerably. The SUs may even behave selfishly to maximize their own throughput. This paper analyzes the interactions and behavior of the SUs during the target channel sharing through non-cooperative, mixed strategic, and cooperative games. The benefits of the SUs and the overall network is analyzed by finding the Nash equilibrium and the Nash bargaining solution (NBS) for the non-cooperative, mixed strategy, and cooperative game respectively.
引用
收藏
页数:6
相关论文
共 24 条
[1]  
Akyildiz I. F., 2008, J COMPUTER NETWORKS, V50, P2127
[2]  
Akyildiz IF, 2009, AD HOC NETW, V7, P811
[3]  
[Anonymous], 1984, TR301
[4]  
[Anonymous], 2011, Game Theory for Wireless Communications and Networking
[5]  
[Anonymous], 2000, COGNITIVE RADIO INTE
[6]  
Boche Holger, 2007, 2007 15th European Signal Processing Conference (EUSIPCO), P1317
[7]  
Dixit AvinashK., 2015, Games of strategy: Fourth International Student Edition
[8]   Fair-QoS Broker Algorithm for Overload-State Downlink Resource Scheduling in LTE Networks [J].
Ferdosian, Nasim ;
Othman, Mohamed ;
Ali, Borhanuddin Mohd ;
Lun, Kweh Yeah .
IEEE SYSTEMS JOURNAL, 2018, 12 (04) :3238-3249
[9]   Multi-Targeted Downlink Scheduling for Overload-States in LTE Networks: Proportional Fractional Knapsack Algorithm With Gaussian Weights [J].
Ferdosian, Nasim ;
Othman, Mohamed ;
Ali, Borhanuddin Mohd ;
Lun, Kweh Yeah .
IEEE ACCESS, 2017, 5 :3016-3027
[10]   Fair multiuser channel allocation for OFDMA networks using nash bargaining solutions and coalitions [J].
Han, Z ;
Ji, Z ;
Liu, KJR .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2005, 53 (08) :1366-1376