Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Network reduction for coded multiple-hop networks
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. Research Lab of Electronics, MIT.ORCID iD: 0000-0002-9709-0713
MIT.
MIT.
MIT.
2015 (English)In: 2015 IEEE International Conference on Communications (ICC), IEEE conference proceedings, 2015, 4518-4523 p.Conference paper, Published paper (Refereed)
Abstract [en]

Data transmission over multiple-hop networks is impaired by random deleterious events, and characterizing the probability of error for the end-to-end transmission is challenging as the size of networks grows. Adams et al. showed that, when re-encoding at intermediate nodes is enabled, coded transmission over tandem/parallel links can be reduced to a single equivalent link with a specified probability function. Although iterative application of the tandem/parallel reduction techniques in alternation can simplify the task, they are generally not sufficient to reduce an arbitrary network to a single link. In this paper, we propose upper- and lower- bounding processes to bound the end-to-end probability distribution of a network by combining the parallel/tandem link reduction with the structure of flows over the network. We evaluate the performance of the proposed bounding methods at the 99% success rate of end-to-end data transmission over randomly generated acyclic networks. The numerical results demonstrate that our bounding approaches enable us to characterize a network by a single probability function to a very good precision.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2015. 4518-4523 p.
Series
IEEE International Conference on Communications, ISSN 1550-3607
Keyword [en]
network reduction, multi-hop networks, network coding, coded transmission
National Category
Telecommunications
Research subject
SRA - ICT
Identifiers
URN: urn:nbn:se:kth:diva-159103DOI: 10.1109/ICC.2015.7249034ISI: 000371708104121Scopus ID: 2-s2.0-84953750804ISBN: 978-1-4673-6432-4 (print)OAI: oai:DiVA.org:kth-159103DiVA: diva2:782564
Conference
IEEE International Conference on Communications, ICC 2015, London, United Kingdom, 8 June 2015 through 12 June 2015
Funder
Swedish Research Council
Note

QC 20160216, QC 20160421

Available from: 2015-01-21 Created: 2015-01-21 Last updated: 2016-04-21Bibliographically approved

Open Access in DiVA

ICC2015(657 kB)21 downloads
File information
File name FULLTEXT01.pdfFile size 657 kBChecksum SHA-512
4f14a9be99a2e5052e68c2537561be53ec5e7b1bfea7a1c5da740fc1ba9d4e6e2ef54ff572c7ec87933ab2cc2a2324067e9017e6868adc6793c0ba6ff2ea1e72
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusConference website

Search in DiVA

By author/editor
Du, Jinfeng
By organisation
Communication TheoryACCESS Linnaeus Centre
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar
Total: 21 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 97 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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