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
The influence of error propagation on the capacity of wireless networks
University of South Australia. (Institute for Telecommunications Research)
University of South Australia. (Institute for Telecommunications Research)
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-7182-9543
2010 (English)In: 48th Annual Allerton Conference on Communication, Control, and Computing, 2010, 1488-1495 p.Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, it is shown that the achievable throughput capacity of wireless networks suffers from a fundamental limitation under finite node resource constraints. It is shown that this reduction results from a fundamental lower bound on the error performance of the wireless-channel model. In particular, the problem is addressed for the classic parallel-unicast problem introduced by Gupta-Kumar (2000). Under an AWGN channel-model assumption and for a pathloss exponent of α > 2, it is shown that the best available scheme for this setup achieves a throughput-capacity scaling of only Θ(n-1/2(log n)-1) per node. This is significant since an upper bound on asymptotic throughput capacity, scaling as Θ(n-1/2), was earlier shown to have been achieved by a scheme introduced by Franceschetti et. al. in 2006. The gap between achievability and the upper bound did not figure in past work on this problem, mainly due to transmission models that implicitly assume wireless nodes to have unlimited storage and encoding/decoding capabilities. Under the assumption of finite node memory, it is shown that such transmission models are unjustified in a strict information-theoretic sense. The new reduction in capacity scaling occurs from a necessity to modify the schemes used for showing achievability, in order to ensure that the failure probability is arbitrarily small. The analysis presented in this paper employs well-known sphere-packing bounds on the error probability of any block code in terms of the channel-error exponent. The result shows that for wireless networks with resource-constrained nodes, (a) the tightness of the best-known upper bound on capacity scaling still needs to be investigated, and (b) perhaps a better scheme that achieves higher capacity-scaling can be devised, but it is still an open problem.

Place, publisher, year, edition, pages
2010. 1488-1495 p.
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-63134DOI: 10.1109/ALLERTON.2010.5707089Scopus ID: 2-s2.0-79952410885ISBN: 978-142448214-6 (print)OAI: oai:DiVA.org:kth-63134DiVA: diva2:481679
Conference
48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010. Monticello, IL. 29 September 2010 - 1 October 2010
Note
QC 20120124Available from: 2012-01-22 Created: 2012-01-22 Last updated: 2012-01-24Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Rasmussen, Lars Kildehöj

Search in DiVA

By author/editor
Rasmussen, Lars Kildehöj
By organisation
Communication TheoryACCESS Linnaeus Centre
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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