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
Lower bounding models for wireless networks
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.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
2013 (English)In: Proceedings of IEEE International Symposium on Information Theory, 2013, IEEE conference proceedings, 2013, 1456-1460 p.Conference paper, Published paper (Refereed)
Abstract [en]

Motivated by the framework of network equivalencetheory [1], [2], we present capacity lower bounding models forwireless networks by construction of noiseless networks whichcan be used to calculate an inner bound for the correspondingwireless network. We first extend the “one-shot” lower boundingmodel [6] to many-user scenarios, and then propose a two-stepupdate of the one-shot models to incorporate the broadcast natureof wireless transmission. The main advantage of the proposedlower bounding method is its simplicity and the fact that it can beeasily extended to larger networks. We demonstrate by examplesthat the resulting lower bounds can even approach the capacityin some setups.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2013. 1456-1460 p.
Keyword [en]
capacity, wireless network, equivalence
National Category
Telecommunications
Research subject
SRA - ICT
Identifiers
URN: urn:nbn:se:kth:diva-124649ISI: 000348913401118Scopus ID: 2-s2.0-84890329398OAI: oai:DiVA.org:kth-124649DiVA: diva2:637982
Conference
IEEE International Symposium on Information Theory, Istanbul, Turkey, 7-12 July 2013
Funder
Swedish Research Council
Note

QC 20130725

Available from: 2013-07-24 Created: 2013-07-24 Last updated: 2015-12-04Bibliographically approved

Open Access in DiVA

fulltext(156 kB)90 downloads
File information
File name FULLTEXT02.pdfFile size 156 kBChecksum SHA-512
253184b5c2a568b11ec6d0d935771588c44bde9445bcc3d285f3849c74bc4ceee1362148a085f2dc5310a0abc4340c72b777ae7048b22e316929d296a5150193
Type fulltextMimetype application/pdf

Other links

ScopusISIT2013

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: 90 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: 89 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