Convergence of the Iterative Water-Filling Algorithm with Sequential Updates in Spectrum Sharing Scenarios
2011 (English)In: 2011 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2011, 3216-3219 p.Conference paper (Refereed)
Spectrum sharing between two independent, co-existing transmit-receive pairs (TRPs) is formulated as a non-cooperative game with the TRPs as players, their individual link rates as payoffs and power allocation over the utilized spectral bands as the strategy. A Nash Equilibrium (NE) corresponds to the outcome of such a game and TRPs iteratively use the water-filling algorithm according to an agreed order for achieving the NE. Dynamics of this distributed algorithm is studied to determine the conditions for convergence and characterize the resulting NE. A sufficient condition on global convergence is derived and is shown to be tighter than existing ones. Further, a novel characterization of the globally achievable NE based on necessary conditions is presented. Some of these results are also extended to multiple NE scenarios where local convergence is exhibited.
Place, publisher, year, edition, pages
2011. 3216-3219 p.
, International Conference on Acoustics Speech and Signal Processing ICASSP, ISSN 1520-6149
cognitive radio, convergence, distributed algorithms, game theory, iterative methods, Couplings, Frequency division multiaccess, Resource management, Signal processing
IdentifiersURN: urn:nbn:se:kth:diva-63160DOI: 10.1109/ICASSP.2011.5946706ISI: 000296062403157ScopusID: 2-s2.0-80051631914ISBN: 978-1-4577-0539-7OAI: oai:DiVA.org:kth-63160DiVA: diva2:481725
IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP). Prague Congress Ctr, Prague, CZECH REPUBLIC. MAY 22-27, 2011
QC 201201232012-01-222012-01-222012-01-23Bibliographically approved