Communications and Information Theory Chair CommI Queue-Aware Beam Scheduling for Half-Duplex mmWave Relay Networks Xiaoshen Song , Giuseppe Caire Technische Universität Berlin June 21-26, 2020 Xiaoshen Song (TU Berlin) xiaoshen.song@campus.tu-berlin.de June 21-26, 2020 1 / 25
Communications and Information Theory Chair CommI Outline Background 1 System Model 2 Proposed Beam Schedulers 3 HC-EC scheduler BP scheduler newBP scheduler Numerical Results 4 Xiaoshen Song (TU Berlin) xiaoshen.song@campus.tu-berlin.de June 21-26, 2020 2 / 25
Communications and Information Theory Chair CommI Outline Background 1 System Model 2 Proposed Beam Schedulers 3 HC-EC scheduler BP scheduler newBP scheduler Numerical Results 4 Xiaoshen Song (TU Berlin) xiaoshen.song@campus.tu-berlin.de June 21-26, 2020 3 / 25
Communications and Information Theory Chair CommI 1. Background mmWave communication Being considered : The key enabler for 5G and beyond. Challenges : Severe path loss & vulnerability to obstacles. Solution : Beamforming + relaying Xiaoshen Song (TU Berlin) xiaoshen.song@campus.tu-berlin.de June 21-26, 2020 4 / 25
Communications and Information Theory Chair CommI 1. Background mmWave communication Being considered : The key enabler for 5G and beyond. Challenges : Severe path loss & vulnerability to obstacles. Solution : Beamforming + relaying X. Song, S. Haghighatshoar, and G. Caire, "A scalable and statistically robust beam alignment technique for mm-wave systems," IEEE Transactions on Wireless Communications, 2018. X. Song, S. Haghighatshoar, and G. Caire, "Efficient beam alignment for mmWave single-carrier systems with hybrid MIMO transceivers," IEEE Transactions on Wireless Communications, 2019. X. Song, T. Kühne, and G. Caire, "Fully-/Partially-Connected Hybrid Beamforming Architectures for mmWave MU-MIMO," IEEE Transactions on Wireless Communications, 2019. Xiaoshen Song (TU Berlin) xiaoshen.song@campus.tu-berlin.de June 21-26, 2020 4 / 25
Communications and Information Theory Chair CommI 1. Background mmWave communication Being considered : The key enabler for 5G and beyond. Challenges : Severe path loss & vulnerability to obstacles. Solution : Beamforming + relaying X. Song, S. Haghighatshoar, and G. Caire, "A scalable and statistically robust beam alignment technique for mm-wave systems," IEEE Transactions on Wireless Communications, 2018. X. Song, S. Haghighatshoar, and G. Caire, "Efficient beam alignment for mmWave single-carrier systems with hybrid MIMO transceivers," IEEE Transactions on Wireless Communications, 2019. X. Song, T. Kühne, and G. Caire, "Fully-/Partially-Connected Hybrid Beamforming Architectures for mmWave MU-MIMO," IEEE Transactions on Wireless Communications, 2019. Xiaoshen Song (TU Berlin) xiaoshen.song@campus.tu-berlin.de June 21-26, 2020 4 / 25
Communications and Information Theory Chair CommI Outline Background 1 System Model 2 Proposed Beam Schedulers 3 HC-EC scheduler BP scheduler newBP scheduler Numerical Results 4 Xiaoshen Song (TU Berlin) xiaoshen.song@campus.tu-berlin.de June 21-26, 2020 5 / 25
Communications and Information Theory Chair CommI 2. System Model Network model S D (a) The line network L . 1 (a) (b) The diamond network D . 2 S D (b) 1 Y. H. Ezzeldin, M. Cardone, C. Fragouli, and D. Tuninetti, "Efficiently finding simple schedules in Gaussian half-duplex relay line networks," in 2017 IEEE International Symposium on Information Theory (ISIT), 2017, pp. 471-475. 2 Y. H. Ezzeldin, M. Cardone, C. Fragouli, and G. Caire, "Gaussian 1-2-1 networks: Capacity results for mmwave communications," in 2018 IEEE International Symposium on Information Theory (ISIT), 2018, pp. 2569-2573. Xiaoshen Song (TU Berlin) xiaoshen.song@campus.tu-berlin.de June 21-26, 2020 6 / 25
Communications and Information Theory Chair CommI 2. System Model Capacity results The line network L S D (a) Relay nodes: i ∈ [ N ] . Source node: i = 0. � l i · l i + 1 Destination node: i = N + 1. � C L = min Link capacity: l i . l i + l i + 1 i ∈ [ N ] The approximate capacity 3 : C L . Within a gap: O ( N ) . 3 Y. H. Ezzeldin, M. Cardone, C. Fragouli, and D. Tuninetti, "Efficiently finding simple schedules in Gaussian half-duplex relay line networks," in 2017 IEEE International Symposium on Information Theory (ISIT), 2017, pp. 471-475. Xiaoshen Song (TU Berlin) xiaoshen.song@campus.tu-berlin.de June 21-26, 2020 7 / 25
Communications and Information Theory Chair CommI 2. System Model Capacity results The diamond network D S D Relay nodes: p ∈ [ N ] . (b) Link capacity: l p , 1 , l p , 2 . l p , 1 · l p , 2 Path capacity: C p = l p , 1 + l p , 2 . � C D = max x p C p Path activation time fraction: x p . p ∈ [ N ] 0 ≤ x p ≤ 1 , ∀ p ∈ [ N ] The approximate capacity 4 : C D . s . t . C p � Within a gap: O ( N log N ) . ≤ 1 , ∀ j ∈ [ 2 ] x p l p , j p ∈ [ N ] 4 Y. H. Ezzeldin, M. Cardone, C. Fragouli, and G. Caire, "Gaussian 1-2-1 networks: Capacity results for mmwave communications," in 2018 IEEE International Symposium on Information Theory (ISIT), 2018, pp. 2569-2573. Xiaoshen Song (TU Berlin) xiaoshen.song@campus.tu-berlin.de June 21-26, 2020 8 / 25
Communications and Information Theory Chair CommI Outline Background 1 System Model 2 Proposed Beam Schedulers 3 HC-EC scheduler BP scheduler newBP scheduler Numerical Results 4 Xiaoshen Song (TU Berlin) xiaoshen.song@campus.tu-berlin.de June 21-26, 2020 9 / 25
CommI Communications and Information Theory Chair Outline Proposed Beam Schedulers 3 HC-EC scheduler BP scheduler newBP scheduler Xiaoshen Song (TU Berlin) xiaoshen.song@campus.tu-berlin.de June 21-26, 2020 10 / 25
Communications and Information Theory Chair CommI 3.Proposed Beam Schedulers HC-EC (edge coloring) scheduler S D (a) Link Capapcity: N = 3 , l 1 = 8 , l 2 = 8 , l 3 = 12 , l 4 = 4. Xiaoshen Song (TU Berlin) xiaoshen.song@campus.tu-berlin.de June 21-26, 2020 11 / 25
Communications and Information Theory Chair CommI 3.Proposed Beam Schedulers HC-EC (edge coloring) scheduler S D (a) Link Capapcity: N = 3 , l 1 = 8 , l 2 = 8 , l 3 = 12 , l 4 = 4. The common multiple of l i : M . Xiaoshen Song (TU Berlin) xiaoshen.song@campus.tu-berlin.de June 21-26, 2020 11 / 25
Communications and Information Theory Chair CommI 3.Proposed Beam Schedulers HC-EC (edge coloring) scheduler S D (a) Link Capapcity: N = 3 , l 1 = 8 , l 2 = 8 , l 3 = 12 , l 4 = 4. The common multiple of l i : M . n i = M Assign parallel edges to each link: l i . Xiaoshen Song (TU Berlin) xiaoshen.song@campus.tu-berlin.de June 21-26, 2020 11 / 25
Communications and Information Theory Chair CommI 3.Proposed Beam Schedulers HC-EC (edge coloring) scheduler S D (a) Link Capapcity: N = 3 , l 1 = 8 , l 2 = 8 , l 3 = 12 , l 4 = 4. The common multiple of l i : M . n i = M Assign parallel edges to each link: l i . The running example: M = 24 , n 1 = 3 , n 2 = 3 , n 3 = 2 , n 4 = 6. Maximum node degree: ∆ L = 8. Xiaoshen Song (TU Berlin) xiaoshen.song@campus.tu-berlin.de June 21-26, 2020 11 / 25
Communications and Information Theory Chair CommI 3.Proposed Beam Schedulers HC-EC (edge coloring) scheduler S D (a) The number of parallel edges: n 1 = 3 , n 2 = 3 , n 3 = 2 , n 4 = 6. Links i i = 1 i = 2 i = 3 i = 4 1 2 1 2 Assigned colors C i L Xiaoshen Song (TU Berlin) xiaoshen.song@campus.tu-berlin.de June 21-26, 2020 12 / 25
Communications and Information Theory Chair CommI 3.Proposed Beam Schedulers HC-EC (edge coloring) scheduler S D (a) The number of parallel edges: n 1 = 3 , n 2 = 3 , n 3 = 2 , n 4 = 6. Links i Links i i = 1 i = 1 i = 2 i = 2 i = 3 i = 3 i = 4 i = 4 1 1 2 2 1 1 2 2 3 4 3 4 Assigned Assigned colors C i colors C i L L Xiaoshen Song (TU Berlin) xiaoshen.song@campus.tu-berlin.de June 21-26, 2020 12 / 25
Communications and Information Theory Chair CommI 3.Proposed Beam Schedulers HC-EC (edge coloring) scheduler S D (a) The number of parallel edges: n 1 = 3 , n 2 = 3 , n 3 = 2 , n 4 = 6. Links i Links i i = 1 i = 1 i = 2 i = 2 i = 3 i = 3 i = 4 i = 4 1 1 2 2 1 1 2 2 3 4 3 4 Assigned Assigned 5 6 5 colors C i colors C i L L Xiaoshen Song (TU Berlin) xiaoshen.song@campus.tu-berlin.de June 21-26, 2020 12 / 25
Communications and Information Theory Chair CommI 3.Proposed Beam Schedulers HC-EC (edge coloring) scheduler S D (a) The number of parallel edges: n 1 = 3 , n 2 = 3 , n 3 = 2 , n 4 = 6. Links i Links i i = 1 i = 1 i = 2 i = 2 i = 3 i = 3 i = 4 i = 4 1 1 2 2 1 1 2 2 3 4 3 4 Assigned Assigned 5 6 5 colors C i colors C i 6 L L 7 8 Xiaoshen Song (TU Berlin) xiaoshen.song@campus.tu-berlin.de June 21-26, 2020 12 / 25
Communications and Information Theory Chair CommI 3.Proposed Beam Schedulers HC-EC (edge coloring) scheduler S D (a) The number of parallel edges: n 1 = 3 , n 2 = 3 , n 3 = 2 , n 4 = 6. Links i Links i i = 1 i = 1 i = 2 i = 2 i = 3 i = 3 i = 4 i = 4 1 1 2 2 1 1 2 2 3 4 3 4 Assigned Assigned 5 6 5 colors C i colors C i 6 L L 7 8 L } , ˆ Scheduling decision: Λ L ( t ) i = 1 { ˆ t = ( t − 1 ) mod ∆ L . t ∈C i Xiaoshen Song (TU Berlin) xiaoshen.song@campus.tu-berlin.de June 21-26, 2020 12 / 25
Recommend
More recommend
