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
Reducing Initial Cell-search Latency in mmWave Networks
KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
KTH, School of Electrical Engineering and Computer Science (EECS), Network and Systems engineering.
KTH, School of Electrical Engineering and Computer Science (EECS), Network and Systems engineering.
KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
Show others and affiliations
2018 (English)In: INFOCOM 2018 - IEEE Conference on Computer Communications Workshops, IEEE conference proceedings, 2018Conference paper, Published paper (Refereed)
Abstract [en]

Millimeter-wave (mmWave) networks rely on directional transmissions, in both control plane and data plane, to overcome severe path-loss. Nevertheless, the use of narrow beams complicates the initial cell-search procedure where we lack sufficient information for beamforming. In this paper, we investigate the feasibility of random beamforming for cell-search. We develop a stochastic geometry framework to analyze the performance in terms of failure probability and expected latency of cell-search. Meanwhile, we compare our results with the naive, but heavily used, exhaustive search scheme. Numerical results show that, for a given discovery failure probability, random beamforming can substantially reduce the latency of exhaustive search, especially in dense networks. Our work demonstrates that developing complex cell-discovery algorithms may be unnecessary in dense mmWave networks and thus shed new lights on mmWave system design.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2018.
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-239139DOI: 10.1109/INFCOMW.2018.8406924ISI: 000450157700178Scopus ID: 2-s2.0-85050687161OAI: oai:DiVA.org:kth-239139DiVA, id: diva2:1263798
Conference
IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
Note

QC 20181120

Available from: 2018-11-16 Created: 2018-11-16 Last updated: 2019-04-15Bibliographically approved
In thesis
1. Ultra-Densification for Future Cellular Networks: Performance Analysis and Design Insights
Open this publication in new window or tab >>Ultra-Densification for Future Cellular Networks: Performance Analysis and Design Insights
2018 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

The traffic volume in wireless communication has grown dramatically in the lastdecade. Recent predictions indicate such data storm will be even more violent in theshort run. Potential solutions for accommodating the rapid traffic growth can besummed up into three categories: broadening the available bandwidth, improvingthe spectral efficiency, and densifying the infrastructure. In this thesis, we focuson the densification dimension which has been proven to be the most effectiveone in the past. The current gain of network densification mainly comes from cellsplitting, thereby serving more user equipment (UE) simultaneously. This trendwill decelerate as the base station (BS) density gets closer to or even surpassesthe UE density which forms an ultra-dense network (UDN). Thus, it is crucialto understand the behavior and design operations of ultra-densification in futurenetworks.

An important question for future system design and operating strategy is whichelement is more effective than others. To this end, we start from comparing the effectivenessof densification with spectrum expansion and multi-antenna systems interms of meeting certain traffic demand. Our findings show that deploying more BSsprovides a substantial gain in sparse network but the gain decreases progressively ina UDN. Meanwhile, even with the same area throughput, different combinations ofindividual throughput and UE density lead to different requirements for resources.The diminishing gain appearing in UDNs makes us curious to know if there existsa terminal on the way of densification. Such uncertainty leads to the study onthe asymptotic behavior of densification. By incorporating a sophisticated boundeddual-slope path loss model and practical UE densities in our analysis, we present theasymptotic behavior of ultra-densification: the coverage probability and area spectralefficiency (ASE) have non-zero convergences in asymptotic regions unless theUE density goes to infinity (full load). Our results suggest that network densificationcannot always improve the UE performance or boost the network throughput.

Next, we shift our focus to the operations of UDNs. We first study BS cooperationsin two UDN scenarios: homogeneous and heterogeneous UDNs which aredistinguished by BS types. In both cases, the cooperation rules become more complicatedthan those in traditional networks. Either channel state information (CSI) orextra delay information needs to be acquired in order to obtain cooperation gains.At last, we investigate the feasibility of applying random beamforming to initialaccess in millimeter-wave (mmWave) UDNs. To our surprise, the simple methodcan provide sufficient performance in both control and data plane, comparing withthe existing schemes. Therefore, it may be unnecessary to develop complex algorithmsfor initial access in future dense mmWave networks. The findings indicatethat UDN may complicate network operations while it may also facilitate the use ofsimple schemes. Our work provides insights into the understanding of the networkdensification and thus paves the way for the operational design of future UDNs.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2018. p. 59
Series
TRITA-EECS-AVL ; 2018:88
National Category
Communication Systems
Research subject
Telecommunication
Identifiers
urn:nbn:se:kth:diva-239175 (URN)978-91-7873-017-9 (ISBN)
Public defence
2018-12-07, Ka-Sal C (Sal Sven-Olof Öhrvik), Electrum, Kungl Tekniska högskolan, Kistagången 16, Kista, Stockholm, 13:00 (English)
Opponent
Supervisors
Note

QC 20181119

Available from: 2018-11-19 Created: 2018-11-19 Last updated: 2018-11-19Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopusConference webpage

Authority records BETA

Petrova, MarinaSung, Ki Won

Search in DiVA

By author/editor
Yang, YanpengHossein, Shokri-GhadikolaeiFischione, CarloPetrova, MarinaSung, Ki Won
By organisation
Radio Systems Laboratory (RS Lab)Network and Systems engineering
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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