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
Distributed Channel Assignment in Cognitive Radio Networks: Stable Matching and Walrasian Equilibrium
KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0003-0995-9835
Fraunhofer Heinrich Herz Institute, Berlin.
Fraunhofer Heinrich Herz Institute, Berlin.
2015 (English)In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 14, no 7, 3924-3936 p.Article in journal (Refereed) Published
Abstract [en]

We consider a set of secondary transmitter-receiver pairs in a cognitive radio setting. Based on channel sensing and access performances, we consider the problem of assigning channels orthogonally to secondary users through distributed coordination and cooperation algorithms. Two economic models are applied for this purpose: matching markets and competitive markets. In the matching market model, secondary users and channels build two agent sets. We implement a stable matching algorithm in which each secondary user, based on his achievable rate, proposes to the coordinator to be matched with desirable channels. The coordinator accepts or rejects the proposals based on the channel preferences which depend on interference from the secondary user. The coordination algorithm is of low complexity and can adapt to network dynamics. In the competitive market model, channels are associated with prices and secondary users are endowed with monetary budget. Each secondary user, based on his utility function and current channel prices, demands a set of channels. A Walrasian equilibrium maximizes the sum utility and equates the channel demand to their supply. We prove the existence of Walrasian equilibrium and propose a cooperative mechanism to reach it. The performance and complexity of the proposed solutions are illustrated by numerical simulations.

Place, publisher, year, edition, pages
IEEE Communications Society, 2015. Vol. 14, no 7, 3924-3936 p.
Keyword [en]
cognitive radio; spectrum sensing; resource allocation; distributed algorithms; stable matching; Walrasian equilibrium; English auction; combinatorial auctions
National Category
Communication Systems
Research subject
Information and Communication Technology
Identifiers
URN: urn:nbn:se:kth:diva-164180DOI: 10.1109/TWC.2015.2414918ISI: 000357805200032Scopus ID: 2-s2.0-84937137014OAI: oai:DiVA.org:kth-164180DiVA: diva2:804959
Note

QC 20150810

Available from: 2015-04-14 Created: 2015-04-14 Last updated: 2017-12-04Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Mochaourab, Rami

Search in DiVA

By author/editor
Mochaourab, Rami
By organisation
Signal ProcessingACCESS Linnaeus Centre
In the same journal
IEEE Transactions on Wireless Communications
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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