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
Asymptotic Throughput and Throughput-Delay Scaling in Wireless Networks: The Impact of Error Propagation
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-7182-9543
2014 (English)In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 13, no 4, 1974-1987 p.Article in journal (Refereed) Published
Abstract [en]

This paper analyzes the impact of error propagation on the achievable throughput and throughput-delay tradeoff in wireless networks. It addresses the particular class of multihop routing schemes for parallel unicast that achieve a throughput scaling of Theta(n(-1/2))per node in a network of n nodes. It is shown that in the finite-block-length case, necessitated by finite decoding memory at the nodes, the guaranteed per-node throughput in the network cannot scale better than o(n(-r)) per node for any r > 0. This bound on the guaranteed per-node throughput is tighter than the O(1/n) bound shown previously. Instead of focusing on the probability of error for each link, which is intractable, an approach of bounding mutual information is employed to show tight results on the achievable throughput and throughput-delay tradeoffs. It is shown that for multihop transmission protocols, error propagation leads to significant changes in the tradeoff between the throughput T (n) and the delay D(n), compared to previous results. The best known scaling behavior is only D(n) = Theta(n (log n) T (n)) under maximum throughput scaling, where the block length required scales as Omega(log n). When decoding memory at nodes is constrained to be O(log log n), the achievable tradeoff worsens to D(n) = Theta(n (log n)(2) T (n))

Place, publisher, year, edition, pages
2014. Vol. 13, no 4, 1974-1987 p.
Keyword [en]
Scaling laws, ad-hoc networks, finite block length, error propagation
National Category
Telecommunications Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-145837DOI: 10.1109/TWC.2014.031314.130774ISI: 000335154100020Scopus ID: 2-s2.0-84899919018OAI: oai:DiVA.org:kth-145837DiVA: diva2:720797
Funder
EU, FP7, Seventh Framework Programme, 228044Swedish Research Council, 621-2009-4666
Note

QC 20140602

Available from: 2014-06-02 Created: 2014-06-02 Last updated: 2017-12-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Rasmussen, Lars K.

Search in DiVA

By author/editor
Rasmussen, Lars K.
By organisation
Communication TheoryACCESS Linnaeus Centre
In the same journal
IEEE Transactions on Wireless Communications
TelecommunicationsElectrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
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