Paper Info
Title
Distributed Power Allocation Game For Uplink Ofdm Systems
Abstract
In this paper, we consider the uplink of a single cell network with K users simultaneously communicating with a base station using OFDM modulation over N carriers. In such a scenario, users can decide their power allocation based on three possible Channel State Information (CSI) levels, which are called complete, partial and statistical. The optimal solutions for maximizing the average capacity with complete and statistical knowledge are known to be the water-filling game and the uniform power allocation respectively. We study the problem in the partial knowledge case. We formulate it as a strategy game, where each player (user) selfishly maximizes his own average capacity. The information structure that we consider is such that each player, at each time instant, knows his own channel state, but does not know the states of other players. We study the existence and uniqueness of Nash equilibrium. We find the optimal solution for the symmetric case considering two positive channel states, and we show the optimization problem for any L states.
Year
DOI
Venue
2008
10.1109/WIOPT.2008.4586120
2008 6TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC AND WIRELESS NETWORKS AND WORKSHOPS, VOLS 1 AND 2
Keywords
Field
DocType
base stations,base station,scheduling algorithm,channel state information,fading,games,gain,optimization problem,downlink,resource management,nash equilibrium,game theory,feedback,helium,ofdm modulation,cellular network,optimization,channel allocation
Mathematical optimization,Computer science,Computer network,Communication channel,Cellular network,Game theory,Nash equilibrium,Channel allocation schemes,Optimization problem,Telecommunications link,Channel state information
Conference
Citations 
PageRank 
References 
4
0.43
6
Authors
4
Name
Order
Citations
PageRank
Gaoning He116513.79
Sophie Gault2697.02
Merouane Debbah365034.40
Eitan Altman45085516.73