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 upper 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, Massachusetts Institute of Technology.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
2014 (English)In: Proceedings of IEEE International Symposium on Information Theory, IEEE conference proceedings, 2014, 241-245 p.Conference paper, Published paper (Refereed)
Abstract [en]

The framework of network equivalence theory developed by Koetter et al. introduces a notion of channel emulation to construct noiseless networks as upper/lower bounding models for the original noisy network. This paper presents scalable upper bounding models for wireless networks, by firstly extending the ``one-shot'' bounding models developed by Calmon et al. and then integrating them with network equivalence tools. A channel decoupling method is proposed to decompose wireless networks into decoupled multiple-access channels (MACs) and broadcast channels (BCs). The main advantages of the proposed method is its simplicity and the fact that it can be extended easily to large networks with a complexity that grows linearly with the number of nodes. It is demonstrated that the resulting upper bounds can approach the capacity in some setups.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2014. 241-245 p.
Keyword [en]
network equivalence, wireless networks, capacity upper bounds
National Category
Telecommunications
Research subject
Information and Communication Technology
Identifiers
URN: urn:nbn:se:kth:diva-146897Scopus ID: 2-s2.0-84906549327OAI: oai:DiVA.org:kth-146897DiVA: diva2:726245
Conference
2014 IEEE International Symposium on Information Theory, June 29 - July 4, 2014,Honolulu, Hawai`i, USA
Projects
VR International Postdoc
Funder
Swedish Research Council
Note

QC 20140619

Available from: 2014-06-17 Created: 2014-06-17 Last updated: 2014-07-08Bibliographically approved

Open Access in DiVA

NetEqv_Outer_bounds(198 kB)75 downloads
File information
File name FULLTEXT01.pdfFile size 198 kBChecksum SHA-512
077acbd16ac73448a2ebfc19a79f5bfd43e371e27d5d9e33f7ed530597fafe658e10b253987a9bcb30c513987a5b14be8411b9f7a05dc89ec9706fb8da365eae
Type fulltextMimetype application/pdf

Other links

ScopusConference website

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
Total: 75 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

urn-nbn

Altmetric score

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