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
Maximum Throughput Path Selection with Random Blockage for Indoor 60 GHz Relay Networks
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0003-0134-2996
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. MIT.ORCID iD: 0000-0002-9709-0713
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-5407-0835
2015 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 63, no 10, 3511-3524 p.Article in journal (Refereed) Published
Abstract [en]

Indoor communications in the 60 GHz band is capable to support multi-gigabit wireless access thanks to the abundant spectrum and the possibility of using dense antenna arrays. However, the high directivity and penetration loss make it vulnerable to blockage events which can be frequent in indoor environments. Given network topology information in sufficient precision, we investigate the average throughput and outage probability when the connection between any two nodes can be established either via the line-of-sight (LOS) link, through a reflection link, or by a half-duplex relay node. We model the reflection link as an LOS with extra power loss and derive the closed-form expression for the relative reflection loss. For networks with a central coordinator and multiple relays, we also propose a generic algorithm, maximum throughput path selection (MTPS), to select the optimal path that maximizes the throughput. The complexity of the MTPS algorithm is O(n2) for networks equipped with n relays, whereas a brute-forced algorithm has complexity of O(n ยท n!). Numerical results show that increasing the number of relays can significantly increase the average throughput and decrease the outage probability, and resorting to reflection paths provides significant gains when the probability of link blockage is high.

Place, publisher, year, edition, pages
IEEE Press, 2015. Vol. 63, no 10, 3511-3524 p.
Keyword [en]
60 GHz, Relay, Blockage, Throughput, Outage, Reflection
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-159104DOI: 10.1109/TCOMM.2015.2463284Scopus ID: 2-s2.0-84958019491OAI: oai:DiVA.org:kth-159104DiVA: diva2:782565
Funder
Swedish Research Council, 637-2013-473
Note

QC 20151117. Updated from Manuscript to Article in journal.

Available from: 2015-01-21 Created: 2015-01-21 Last updated: 2017-12-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopusPublished version

Authority records BETA

Yang, GuangDu, JinfengXiao, Ming

Search in DiVA

By author/editor
Yang, GuangDu, JinfengXiao, Ming
By organisation
Communication TheoryACCESS Linnaeus Centre
In the same journal
IEEE Transactions on Communications
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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