Cooperative waiting-time reduction for cognitive radio networks using Stackelberg game

2014 ◽  
Vol 8 (17) ◽  
pp. 3072-3080 ◽  
Author(s):  
Fengchen Ouyang ◽  
Jun Hou ◽  
Jianhua Ge
Author(s):  
Chungang Yang ◽  
Pengyu Huang ◽  
Jia Xiao ◽  
Lingxia Wang ◽  
Jiandong Li

Game theory has found an extensive application in wireless communication networks including cognitive radio networks, heterogeneous cellular networks, cooperative relay networks. Also, cognitive radio networks, green communications and heterogeneous cellular networks have attracted a wide attention on improve the spectrum efficiency and energy efficiency; therefore, the capacity, the coverage and the energy consumption. However, interference problem and energy consumption are critical for these networks. Introducing hierarchy among different decision-making players in cognitive, heterogeneous, green, cooperative cellular networks can both save energy and mitigate interference, thus enhance throughput. Stackelberg game suits to model, analyze and design the distributed algorithms in these hierarchical decision-making networking scenarios. In this chapter, we introduce basics of Stackelberg game and survey the extensive applications of Stackelberg game in cognitive, heterogeneous, cooperative cellular networks with the emphasis on resource management, green commutations design and interference management. This chapter highlights the potentials and applications with the promising vision of Stackelberg game theoretic framework for future cognitive green heterogeneous cellular networks.


2014 ◽  
Vol 5 (2) ◽  
pp. 61-74 ◽  
Author(s):  
Fatemeh Afghah ◽  
Abolfazl Razi

In this paper, a novel property-right spectrum leasing solution based on Stackelberg game is proposed for Cognitive Radio Networks (CRN), where part of the secondary users present probabilistic dishonest behavior. In this model, the Primary User (PU) as the spectrum owner allows the Secondary User (SU) to access the shared spectrum for a fraction of time in exchange for providing cooperative relaying service by the SU. A reputation based mechanism is proposed that enables the PU to monitor the cooperative behavior of the SUs and restrict its search space at each time slot to the secondary users that do not present dishonest behavior in the proceeding time slots. The proposed reputation-based solution outperforms the classical Stackelberg games from both primary and reliable secondary users' perspectives. This novel method of filtering out unreliable users increases the PU's expected utility over consecutive time slots and also encourages the SUs to follow the game rule.


2018 ◽  
Vol 17 (8) ◽  
pp. 5606-5622 ◽  
Author(s):  
Wenbo Wang ◽  
Dinh Thai Hoang ◽  
Dusit Niyato ◽  
Ping Wang ◽  
Dong In Kim

Sign in / Sign up

Export Citation Format

Share Document