Elements of information theory
Elements of information theory
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Fundamentals of wireless communication
Fundamentals of wireless communication
Analysis of iterative waterfilling algorithm for multiuser power control in digital subscriber lines
EURASIP Journal on Applied Signal Processing
A jamming game in wireless networks with transmission cost
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Capacity of fading channels with channel side information
IEEE Transactions on Information Theory
The Water-Filling Game in Fading Multiple-Access Channels
IEEE Transactions on Information Theory
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
Distributed multiuser power control for digital subscriber lines
IEEE Journal on Selected Areas in Communications
Fair resource allocation in wireless networks in the presence of a jammer
Performance Evaluation
A two-users transmission game in OFDM wireless networks with resource cost
MACOM'10 Proceedings of the Third international conference on Multiple access communications
Hi-index | 0.00 |
We study power control in optimization and game frameworks. In the optimization framework there is a single decision maker who assigns network resources and in the game framework players share the network resources according to Nash equilibrium. The solution of these problems is based on so-called water-filling technique, which in turn uses bisection method for solution of non-linear equations for La-grange multiplies. Here we provide a closed form solution to the water-filling problem, which allows us to solve it in a finite number of operations. Also, we produce a closed form solution for the Nash equilibrium in symmetric Gaussian interference game. In addition, to its mathematical beauty, the explicit solution allows one to study limiting cases when the crosstalk coefficient is either small or large. We provide an alternative simple proof of the convergence of the Iterative Water Filling Algorithm. Furthermore, it turns out that the convergence of Iterative Water Filling Algorithm slows down when the crosstalk coefficient is large. Using the closed form solution, we can avoid this problem. Finally, we compare the non-cooperative approach with the cooperative approach and show that the non-cooperative approach results in a more fair resource distribution.