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
A Game Theoretic Approach to Multi-User Spectrum Allocation
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.
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. (Signal Processing)ORCID iD: 0000-0003-2298-6774
2009 (English)In: GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference / [ed] Ulema M, IEEE , 2009, 5425963- p.Conference paper, Published paper (Refereed)
Abstract [en]

We consider the interaction of several transmit-receive pairs coexisting in the same area and communicating using the same portion of the spectrum. Using a game theoretic framework, each pair is regarded as a player whose payoff function is the individual link rate and power is allocated using the iterative water-filling algorithm. We find properties of the resulting Nash equilibria and derive conditions for when various operating points are achievable. The analysis presented herein extends previous work by characterizing the set of stable solutions for a multi-user system. Also, we show how the game can be modified to obtain better operating points in terms of sum rate compared to the iterative water-filling algorithm. The increase in performance corresponding to one such modification is evaluated and compared to the iterative water-filling algorithm by numerical simulations.

Place, publisher, year, edition, pages
IEEE , 2009. 5425963- p.
Series
IEEE Global Telecommunications Conference (Globecom), ISSN 1930-529X
Keyword [en]
game theory, iterative methods, multi-access systems, Nash equilibria, individual link rate, iterative water-filling algorithm, multiuser spectrum allocation, numerical simulations, payoff function, power allocation, transmit-receive pairs
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-29616DOI: 10.1109/GLOCOM.2009.5425963ISI: 000280579100345Scopus ID: 2-s2.0-77951533515ISBN: 978-1-4244-4147-1 (print)OAI: oai:DiVA.org:kth-29616DiVA: diva2:409465
Conference
2009 IEEE Global Telecommunications Conference, GLOBECOM 2009; Honolulu, HI; United States; 30 November 2009 through 4 December 2009
Note

QC 20110408

Available from: 2011-04-08 Created: 2011-02-11 Last updated: 2014-09-26Bibliographically 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
von Wrycza, PeterShankar, M. R. BhavaniBengtsson, 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: 57 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