S-modular games and power control in wireless networks

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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on automatic control Ročník 48; číslo 5; s. 839 - 842
Hlavní autori: Altman, E., Altman, Z.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York, NY IEEE 01.05.2003
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Applied sciences
Computer science; control theory; systems
Control theory. Systems
Convergence
Distributed decision making
Exact sciences and technology
Game theory
Games
Intelligent networks
Joining
Miscellaneous
Noise level
Power control
Signal analysis
Synchronous
Uniqueness
Wireless communication
Wireless networks
Working environment noise
Asynchronism
Power control
Wireless telecommunication
Distributed algorithm
Control program
Telecommunication network
Distributed control
Radio communication
ISSN:0018-9286, 1558-2523
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2003.811264