GAME based radio resource management in wideband CDMA networks

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, 2007

In this paper, we formulate the SINR-constrained power control problem in the wideband CDMA cellular system as a game. Using the cooperative theory and Nash bargaining model, we compared it to the non-cooperative game scheme proposed in (S. Koskie and Z. Gajic, 2005). We show that the resulting operating point using Nash bargaining model is fair and Pareto optimal, however, the Nash equilibrium operating point obtained in the non-cooperative game scheme is not in general Pareto optimal.

2007 IEEE International Conference on Signal Processing and Communications, 2007

In this paper, We formulate the SINR-constrained power allocation problem in the wideband Multiantenna CDMA cellular system as a game. Using the cooperative theory and Nash bargaining model, we compared it to the noncooperative game scheme proposed in (S. Koskie, Z. Gajic, IEEE trans. on Networking, 2005). We define a utility function which considers both power usage and QoS. We show that the resulting operating point using Nash bargaining model is fair and Pareto optimal, however, the Nash equilibrium operating point obtained in the noncooperative game scheme is not in general Pareto optimal. Also, we proposed a centralized power control algorithm based on conjugate gradient algorithm for multiantenna CDMA cellular systems, when the transmitted power and SINR which each user experience is constrained. In addition, we can extend the result to a fair rate optimization in a multiuser multiple antenna regime through a power control problem subject to SINR constraints.

2002

Abstract We present a game-theoretic treatment of distributed power control in CDMA wireless systems. We make use of the conceptual framework of noncooperative game theory to obtain a distributed and market-based control mechanism. Thus, we address not only the power control problem, but also pricing and allocation of a single resource among several users. A cost function is introduced as the difference between the pricing and utility functions, and the existence of a unique Nash equilibrium is established.

2008 Third International Conference on Broadband Communications, Information Technology & Biomedical Applications, 2008

Physical Communication, 2013

The problem of noncooperative resource allocation in a multipoint-tomultipoint cellular network is considered in this paper. The considered scenario is general enough to represent several key instances of modern wireless networks such as a multicellular network, a peer-to-peer network (interference channel), and a wireless network equipped with femtocells. In particular, the problem of joint transmit waveforms adaptation, linear receiver design, and transmit power control is examined. Several utility functions to be maximized are considered, and, among them, we cite the received SINR, and the transmitter energy efficiency, which is measured in bit/Joule, and represents the number of successfully delivered bits for each energy unit used for transmission. Resorting to the theory of potential games, noncooperative games admitting Nash equilibria in multipoint-to-multipoint cellular networks regardless of the channel coefficient realizations are designed. Computer simulations confirm that the considered games are convergent, and show the huge benefits that resource allocation schemes can bring to the performance of wireless data networks.

A major challenge to enhance the performance of multiuser multiple-input multiple-output (MIMO) multi-carrier direct sequence code division multiple access (MC-DS/ CDMA) system relies on the effective multiple access interference suppression. In this work a novel distributed non cooperative power control game with pricing (NPGP) is considered for utilizing the system resource more efficiently. The ratio of throughput versus power is referred to as the utility function which should be maximized by combating the multiple access interference (MAI). Simulation results show that the propounded scheme achieves significant performance improvement, compared with the conventional system without NPGP.

Acta Universitatis Sapientiae Electrical and Mechanical Engineering, 2017

The goal of Radio Resource Management (RRM) mechanisms is to allocate the transmission resources to the users such that the transmission requests are satisfied while several constraints are fulfilled. These constraints refer to low complexity and power consumption and high spectral efficiency and can be met by multidimensional optimization. This paper proposes a Game Theory (GT) based suboptimal solution to this multidimensional optimization problem. The results obtained by computer simulations show that the proposed RRM algorithm brings significant improvement in what concerns the average delay and the throughput, compared to other RRM algorithms, at the expense of somewhat increased complexity.

Power control is of great importance in reducing cochannel interference and increasing the capacity of mobile telecommunications systems. The aim of optimum power control procedure is to achieve a maximum carrier-to-interference ratios (CIR) in all active communication links (i.e. CIR balancing). Optimum power control with CIR balancing has been widely studied for frequency-division/time-division multiple access (FDMA/TDMA) cellular systems. In these systems, the CIR-balanced optimum power control was transformed to an eigenvalue problem using link-gain matrix. The same method was proposed to CDMA systems. However, the size of the link-gain matrix is proportional to the square of the number of communication links in the system. Thus, the computation of the eigenvalue may be infeasible in CDMA systems with high load. Moreover, optimum power control has never been studied in crossed slots where some mobiles are active in downlink and other in uplink. A simplified optimum power control...

Wireless Personal Communications, 2013

This work proposes a radio resource management framework employing game theoretic concepts for orthogonal frequency division multiple access, the most prevalent multiple access technique for the next generation wireless networks. The subcarrier allocation problem is encountered as a combinatorial auction, where the base station auctions the subcarriers and the users bid for and buy bundles of subcarriers, aiming at minimising their required transmit power. Subsequently, each allocated subcarrier is loaded with a number of bits, decided by each user independently, and the power control process is set up as a non-cooperative game. Each user responds to the interference sensed in his environment and, through a best responses process, the game converges to the unique, Pareto optimal, Nash equilibrium. In order to guarantee convergence, a limit is imposed to the maximum modulation level for each subcarrier. Simulation results show that the auction algorithm follows closely the performance of the optimal algorithm, whereas it is of lower computational complexity and requires less feedback information. Similarly, the proposed distributed bit loading and power control scheme achieves lower transmit power per offered bit rate unit. However, the distributed nature of the algorithm results in lower total offered bit rate, because of the partial knowledge and exploitation of channel state information.