Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Convergence of the iterative water-filling algorithm in multiple user spectrum sharing scenarios
Interdisciplinary Centre for Security, Reliability and Trust, University of Luxembourg, Luxembourg.
Ericsson Research, Stockholm, Sweden.
KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-3599-5584
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Signal Processing.ORCID iD: 0000-0003-2298-6774
2011 (English)In: IEEE Swedish Communication Technologies Workshop (Swe-CTW), 2011, 2011, 80-85 p.Conference paper, Published paper (Refereed)
Abstract [en]

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.
Keyword [en]
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;
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-80891DOI: 10.1109/Swe-CTW.2011.6082494Scopus ID: 2-s2.0-83755172298OAI: oai:DiVA.org:kth-80891DiVA: diva2:496897
Conference
IEEE Swedish Communication Technologies Workshop (Swe-CTW). Stockholm. 19 October 2011 - 21 October 2011
Note
QC 20120213Available from: 2012-02-10 Created: 2012-02-10 Last updated: 2012-05-29Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Bengtsson, MatsOttersten, Björn

Search in DiVA

By author/editor
Shankar, Mysore Rama Rao Bhavanivon Wrycza, PeterBengtsson, MatsOttersten, Björn
By organisation
Signal ProcessingACCESS Linnaeus Centre
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 91 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf