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 with Sequential Updates in Spectrum Sharing Scenarios
Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg.
KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
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), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0003-2298-6774
2011 (English)In: 2011 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2011, 3216-3219 p.Conference paper, Published paper (Refereed)
Abstract [en]

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.
Series
International Conference on Acoustics Speech and Signal Processing ICASSP, ISSN 1520-6149
Keyword [en]
cognitive radio, convergence, distributed algorithms, game theory, iterative methods, Couplings, Frequency division multiaccess, Resource management, Signal processing
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-63160DOI: 10.1109/ICASSP.2011.5946706ISI: 000296062403157Scopus ID: 2-s2.0-80051631914ISBN: 978-1-4577-0539-7 (print)OAI: oai:DiVA.org:kth-63160DiVA: diva2:481725
Conference
IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP). Prague Congress Ctr, Prague, CZECH REPUBLIC. MAY 22-27, 2011
Note
QC 20120123Available from: 2012-01-22 Created: 2012-01-22 Last updated: 2012-01-23Bibliographically 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, M. R. Bhavanivon Wrycza, PeterBengtsson, MatsOttersten, Björn
By organisation
Signal ProcessingACCESS Linnaeus Centre
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 68 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