Convergence of the iterative water-filling algorithm in multiple user spectrum sharing scenarios
2011 (English)In: IEEE Swedish Communication Technologies Workshop (Swe-CTW), 2011, 2011, 80-85 p.Conference paper (Refereed)
Spectrum sharing between multiple independent, coexisting transmit-receive pairs (TRPs, also termed as users) is formulated as a non-cooperative game with the TRPs as players, their individual link rates as payoffs and the iterative water-filling algorithm (IWFA) as the strategy for each TRP. The dynamics of this distributed algorithm are studied for sequential and simultaneous update mechanisms to determine the nature of convergence. Global convergence to unique Nash Equilibrium (NE) is considered and sufficient conditions tighter than those in the literature are derived. Necessary conditions are also derived to complement the sufficient conditions. The necessary conditions serve as tools for characterizing the structure of NE and also highlight the sensitivity of convergence to update orders in sequential IWFA.
Place, publisher, year, edition, pages
2011. 80-85 p.
IWFA;Nash equilibrium;TRP;distributed algorithm;global convergence;iterative water filling algorithm;non cooperative game;transmit-receive pairs;user spectrum sharing;convergence of numerical methods;game theory;iterative methods;radio spectrum management;
IdentifiersURN: urn:nbn:se:kth:diva-80891DOI: 10.1109/Swe-CTW.2011.6082494ScopusID: 2-s2.0-83755172298OAI: oai:DiVA.org:kth-80891DiVA: diva2:496897
IEEE Swedish Communication Technologies Workshop (Swe-CTW). Stockholm. 19 October 2011 - 21 October 2011
QC 201202132012-02-102012-02-102012-05-29Bibliographically approved