The beam sweeping procedure estimates the beamforming directions, or beams, to be used for downlink millimeter-wave cellular transmissions to an incoming user entering the cell. We propose three new approaches for the choice of the sequence by which beams are explored (the beam-search sequence), in order to reduce the average time to find the directions. The proposed methods exploit a) the correlation among angles of departure of the incoming user and its nearest, already connected user, and b) the position of both the incoming and its nearest user. For point a), the nearest-neighbor-beam search method starts from the beam of the nearest user, and then explores other beams, with directions progressively farther away (in the angular domain) from the first beam. In the beam-and-angle search, the beam-search sequence is optimized by exploiting the knowledge of both users' position and the nearest-user beam. We also propose the simplified beam-and-angle search, which still exploits the nearest-user information, although in a suboptimal and simpler fashion. Based on the channel model of the 3rd generation partnership project, we analytically design the optimal beam-and-angle search sequence. We assess the performance of the proposed solutions, in terms of their average discovery time, also in comparison with existing approaches.

Beam-Sweeping Design Based on Nearest Users Position and Beam in 5G mmWave Networks

Tomasin S.
;
Cappellaro F.
2020

Abstract

The beam sweeping procedure estimates the beamforming directions, or beams, to be used for downlink millimeter-wave cellular transmissions to an incoming user entering the cell. We propose three new approaches for the choice of the sequence by which beams are explored (the beam-search sequence), in order to reduce the average time to find the directions. The proposed methods exploit a) the correlation among angles of departure of the incoming user and its nearest, already connected user, and b) the position of both the incoming and its nearest user. For point a), the nearest-neighbor-beam search method starts from the beam of the nearest user, and then explores other beams, with directions progressively farther away (in the angular domain) from the first beam. In the beam-and-angle search, the beam-search sequence is optimized by exploiting the knowledge of both users' position and the nearest-user beam. We also propose the simplified beam-and-angle search, which still exploits the nearest-user information, although in a suboptimal and simpler fashion. Based on the channel model of the 3rd generation partnership project, we analytically design the optimal beam-and-angle search sequence. We assess the performance of the proposed solutions, in terms of their average discovery time, also in comparison with existing approaches.
2020
File in questo prodotto:
File Dimensione Formato  
09129709 (1).pdf

accesso aperto

Tipologia: Published (publisher's version)
Licenza: Creative commons
Dimensione 1.1 MB
Formato Adobe PDF
1.1 MB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/3391525
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 14
  • ???jsp.display-item.citation.isi??? 10
social impact