By Topic

S-modular games and power control in wireless networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
E. Altman ; INRIA, France ; Z. Altman

This note shows how centralized or distributed power control algorithms in wireless communications can be viewed as S-modular games coupled policy sets (coupling is due to the fact that the set of powers of a mobile that satisfy the signal-to-interference ratio constraints depends on powers used by other mobiles). This sheds a new light on convergence properties of existing synchronous and asynchronous algorithms, and allows us to establish new convergence results of power control algorithms. Furthermore, known properties of power control algorithms allow us to extend the theory of S-modular games and obtain conditions for the uniqueness of the equilibrium and convergence of best response algorithms independently of the initial state.

Published in:

IEEE Transactions on Automatic Control  (Volume:48 ,  Issue: 5 )