1,149 research outputs found
A Comprehensive Survey of Potential Game Approaches to Wireless Networks
Potential games form a class of non-cooperative games where unilateral
improvement dynamics are guaranteed to converge in many practical cases. The
potential game approach has been applied to a wide range of wireless network
problems, particularly to a variety of channel assignment problems. In this
paper, the properties of potential games are introduced, and games in wireless
networks that have been proven to be potential games are comprehensively
discussed.Comment: 44 pages, 6 figures, to appear in IEICE Transactions on
Communications, vol. E98-B, no. 9, Sept. 201
Review on Radio Resource Allocation Optimization in LTE/LTE-Advanced using Game Theory
Recently, there has been a growing trend toward ap-plying game theory (GT) to various engineering fields in order to solve optimization problems with different competing entities/con-tributors/players. Researches in the fourth generation (4G) wireless network field also exploited this advanced theory to overcome long term evolution (LTE) challenges such as resource allocation, which is one of the most important research topics. In fact, an efficient de-sign of resource allocation schemes is the key to higher performance. However, the standard does not specify the optimization approach to execute the radio resource management and therefore it was left open for studies. This paper presents a survey of the existing game theory based solution for 4G-LTE radio resource allocation problem and its optimization
Spectral Efficiency of Multi-User Adaptive Cognitive Radio Networks
In this correspondence, the comprehensive problem of joint power, rate, and
subcarrier allocation have been investigated for enhancing the spectral
efficiency of multi-user orthogonal frequency-division multiple access (OFDMA)
cognitive radio (CR) networks subject to satisfying total average transmission
power and aggregate interference constraints. We propose novel optimal radio
resource allocation (RRA) algorithms under different scenarios with
deterministic and probabilistic interference violation limits based on a
perfect and imperfect availability of cross-link channel state information
(CSI). In particular, we propose a probabilistic approach to mitigate the total
imposed interference on the primary service under imperfect cross-link CSI. A
closed-form mathematical formulation of the cumulative density function (cdf)
for the received signal-to-interference-plus-noise ratio (SINR) is formulated
to evaluate the resultant average spectral efficiency (ASE). Dual decomposition
is utilized to obtain sub-optimal solutions for the non-convex optimization
problems. Through simulation results, we investigate the achievable performance
and the impact of parameters uncertainty on the overall system performance.
Furthermore, we present that the developed RRA algorithms can considerably
improve the cognitive performance whilst abide the imposed power constraints.
In particular, the performance under imperfect cross-link CSI knowledge for the
proposed `probabilistic case' is compared to the conventional scenarios to show
the potential gain in employing this scheme
- …