Game Theoretic Power Control under Rician Slow-Flat Fading Channels in Cognitive Radios Networks

Author(s):  
Mahmoud A. Alayesh ◽  
Nasir Ghani
Author(s):  
Mohammad Suleiman Hayajneh ◽  
Chaouki Abdallah

<p>In this paper we present a game-theoretic power control algorithms for wireless data in CDMA cellular systems under two realistic channels: (a1) Fast flat fading channel and (a2) Slow flat fading channel. The fading coefficients under both (a1) and (a2) are studied for three appropriate small scale channel models that are used in the CDMA cellular systems: Rayleigh channel, Rician channel and Nakagami channel. This work is inspired by the results presented by [1] under nonfading channels. In other words, we study the impact of the realistic channel models on the findings in [1] through the followings: we evaluate the average utility function, the average number of bits received correctly at the receiver per one Joule expended, for each channel model. Then, using the average utility function we study the existence, uniqueness of Nash equilibrium (NE) if it exists, and the social desirability of NE in the Pareto sense. Results show that in a non-cooperative game (NPG) the best policy for all users in the cell is to target a fixed signal-to-interference and noise ratio (SINR) similar to what was shown in [1] for non-fading channel. The difference however is that the target SINR in fading channels is much higher than that in a non-fading channel. Also, for spreading gain less than or equal to 100, both NPG and non-cooperative power control game with pricing (NPGP) perform poorly, where all the terminals except the nearest one were not able to attain their corresponding minimum SINR even if sending at the maximum powers in their strategy spaces.</p>


Author(s):  
Waqas Gulzar ◽  
Abdullah Waqas ◽  
Hammad Dilpazir ◽  
Anwar Khan ◽  
Ashfaq Alam ◽  
...  

AbstractIn communication industry one of the most rapidly growing area is wireless technology and its applications. The efficient access to radio spectrum is a requirement to make this communication feasible for the users that are running multimedia applications and establishing real-time connections on an already overcrowded spectrum. In recent times cognitive radios (CR) are becoming the prime candidates for improved utilization of available spectrum. The unlicensed secondary users share the spectrum with primary licensed user in such manners that the interference at the primary user does not increase from a predefined threshold. In this paper, we propose an algorithm to address the power control problem for CR networks. The proposed solution models the wireless system with a non-cooperative game, in which each player maximize its utility in a competitive environment. The simulation results shows that the proposed algorithm improves the performance of the network in terms of high SINR and low power consumption.


2014 ◽  
Vol 62 (8) ◽  
pp. 2665-2680 ◽  
Author(s):  
Bin Li ◽  
Chenglin Zhao ◽  
Mengwei Sun ◽  
Zheng Zhou ◽  
Arumugam Nallanathan

Author(s):  
Mohammad Hayajneh

We propose a game theoretic non-cooperative algorithm to optimize theinduced outage probability in an uplink cellular interference limited wireless Rayleighand Nakagami fading channels. We achieve this target by maximizing the certaintyequivalent margin (CEM). We derive a closed-form formula of the outage probabilityin Nakagami flat-fading channels, then we show that minimizing the induced outagefading probability for both Rayleigh and Nakagami channels is equivalent to maxi-mizing CEM. We present a non-cooperative power control algorithm using the gametheory framework. Through this non-cooperative game, we argue that the best de-cision in such an environment is for all users to transmit at the minimum power intheir corresponding strategy profiles. This finding considerably simplifies the imple-mentation of the proposed game.


Sign in / Sign up

Export Citation Format

Share Document