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
Multiple-User Cooperative Communications Based on Linear Network Coding
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-5407-0835
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-7926-5081
2010 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 58, no 12, 3345-3351 p.Article in journal (Refereed) Published
Abstract [en]

We propose a new scheme for cooperative wireless networking based on linear network codes. The network consists of multiple (M >= 2) users having independent information to be transmitted to a common basestation ( BS), assuming block-fading channels with independent fading for different codewords. The users collaborate in relaying messages. Because of potential transmission errors in links, resulting in erasures, the network topology is dynamic. To efficiently exploit the diversity available by cooperation and time-varying fading, we propose the use of diversity network codes (DNCs) over finite fields. These codes are designed such that the BS is able to rebuild the user information from a minimum possible set of coded blocks conveyed through the dynamic network. We show the existence of deterministic DNCs. We also show that the resulting diversity order using the proposed DNCs is 2M - 1, which is higher than schemes without network coding or with binary network coding. Numerical results from simulations also show substantial improvement by the proposed DNCs over the benchmark schemes. We also propose simplified versions of the DNCs, which have much lower design complexity and still achieve the diversity order 2M - 1.

Place, publisher, year, edition, pages
IEEE Communications Society , 2010. Vol. 58, no 12, 3345-3351 p.
Keyword [en]
Linear network coding, cooperative communications, source-coding, outage probability, code construction, dynamic topology, field size
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-39366DOI: 10.1109/TCOMM.2010.092810.100045ISI: 000285357200001Scopus ID: 2-s2.0-78650418369OAI: oai:DiVA.org:kth-39366DiVA: diva2:439801
Funder
Swedish Research Council
Note
QC 20110909Available from: 2011-09-09 Created: 2011-09-09 Last updated: 2017-12-08Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Xiao, MingSkoglund, Mikael

Search in DiVA

By author/editor
Xiao, MingSkoglund, Mikael
By organisation
Communication TheoryACCESS Linnaeus Centre
In the same journal
IEEE Transactions on Communications
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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