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
Scalable capacity bounding models for wireless 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
Department of Electrical Engineering and Computer Science, MIT.
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
(English)Manuscript (preprint) (Other academic)
Abstract [en]

Based on the framework of network equivalence theory developed by Koetter et al., this paper presents scalable capacity upper and lower bounding models for wireless networks by construction of noiseless networks that can be used to calculate outer and inner bounds, respectively, for the original networks. A channel decoupling method is proposed to decompose wireless networks into point-to-point channels, and (potentially) coupled multiple-access channels (MACs) and broadcast channels (BCs). The upper bounding model, consisting of only point-to-point bit-pipes, is constructed by firstly extending the "one-shot" bounding models developed by Calmon et al. and then integrating them with network equivalence tools. The lower bounding model, consisting of both point-to-point and point-to-points bit-pipes, is constructed based on a two-step update of the one-shot models to incorporate the broadcast nature of wireless transmission. The main advantages of the proposed methods are their simplicity and the fact that they can be extended easily to large networks with a complexity that grows linearly with the number of nodes. It is demonstrated that the gap between the resulting upper and lower bounds is usually not large, and they can approach the capacity in some setups.

Keyword [en]
capacity, wireless networks, equivalence, channel emulation, channel decoupling
National Category
Telecommunications
Research subject
Information and Communication Technology
Identifiers
URN: urn:nbn:se:kth:diva-146898OAI: oai:DiVA.org:kth-146898DiVA: diva2:726248
Projects
VR International Postdoc
Funder
Swedish Research Council
Note

submitted to IEEE Transactions on Information Theory in Jan. 2014. QS 2015

Available from: 2014-06-17 Created: 2014-06-17 Last updated: 2015-02-10Bibliographically approved

Open Access in DiVA

No full text

Authority records BETA

Du, JinfengXiao, MingSkoglund, Mikael

Search in DiVA

By author/editor
Du, JinfengXiao, MingSkoglund, Mikael
By organisation
Communication TheoryACCESS Linnaeus Centre
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

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