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
Spectrum Sharing With Network Coding for Multiple Cognitive Users
KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering. KTH, School of Electrical Engineering and Computer Science (EECS), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-9456-8702
KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering. KTH, School of Electrical Engineering and Computer Science (EECS), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-5407-0835
KTH, School of Electrical Engineering and Computer Science (EECS), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering.ORCID iD: 0000-0001-7182-9543
2019 (English)In: IEEE Internet of Things Journal, ISSN 2327-4662, Vol. 6, no 1, p. 230-238Article in journal (Refereed) Published
Abstract [en]

In this paper, an intelligently cooperative communication network with cognitive users is considered, where in a primary system and a secondary system, respectively, a message is communicated to their respective receiver over a packet-based wireless link. The secondary system assists in the transmission of the primary message employing network coding, on the condition of maintaining or improving the primary performance, and is granted limited access to the transmission resources as a reward. The users in both systems exploit their previously received information in encoding and decoding the binary combined packets. Considering the priority of legitimate users, a selective cooperation mechanism is investigated and the system performance based on an optimization problem is analyzed. Both the analytical and numerical results show that the condition for the secondary system accessing the licensed spectrum resource is when the relay link performs better than the direct link of the primary transmission. We also extend the system model into a network with multiple secondary users and propose two relay selection algorithms. Jointly considering the related link qualities, a best relay selection and a best relay group selection algorithm are discussed. Overall, it is found that the throughput performance can be improved with multiple secondary users, especially with more potential users cooperating in the best relay group selection algorithm.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC , 2019. Vol. 6, no 1, p. 230-238
Keywords [en]
Cooperative communication, multiuser, network coding, spectrum sharing
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-246273DOI: 10.1109/JIOT.2017.2728626ISI: 000459709500021Scopus ID: 2-s2.0-85028923057OAI: oai:DiVA.org:kth-246273DiVA, id: diva2:1298962
Note

QC 20190325

Available from: 2019-03-25 Created: 2019-03-25 Last updated: 2019-03-25Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Li, NanXiao, MingRasmussen, Lars Kildehöj

Search in DiVA

By author/editor
Li, NanXiao, MingRasmussen, Lars Kildehöj
By organisation
Information Science and EngineeringACCESS Linnaeus Centre
In the same journal
IEEE Internet of Things Journal
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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