Using cross-system diversity in heterogeneous networks: Throughput optimization
Performance Evaluation
Introducing hierarchy in energy-efficient power control games
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Introducing hierarchy in energy games
IEEE Transactions on Wireless Communications
Physical layer security game: how to date a girl with her boyfriend on the same table
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
An information-theoretic look at MIMO energy-efficient communications
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Physical layer security game: interaction between source, eavesdropper, and friendly jammer
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless physical layer security
| Hi-index | 0.07 |
In this contribution, the performance of a multiuser system is analyzed in the context of frequency selective fading channels. Using game theoretic tools, a useful framework is provided in order to determine the optimal power allocation when users know only their own channel (while perfect channel state information is assumed at the base station). This scenario illustrates the case of decentralized schemes, where limited information on the network is available at the terminal. Various receivers are considered, namely the matched filter, the MMSE filter and the optimum filter. The goal of this paper is to extend previous work, and to derive simple expressions for the non-cooperative Nash equilibrium as the number of mobiles becomes large and the spreading length increases. To that end two asymptotic methodologies are combined. The first is asymptotic random matrix theory which allows us to obtain explicit expressions of the impact of all other mobiles on any given tagged mobile. The second is the theory of non-atomic games which computes good approximations of the Nash equilibrium as the number of mobiles grows.