Agglomerative Group Scheduling for MmWave Massive MIMO under Hybrid Beamforming Architecture

Xu, Huazheng; Tian, Zhao; Zhu, Shibing; Lv, Denglong; Zhao, Jiang

doi:10.1109/icct.2018.8600015

Cited by 10 publications

(8 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [14], a mixed integer linear programming problem is devised to cluster femto access points (FAPs) and femto users (FUs) in a way to increase the number of LoS links and reduce interference. Xu et al in [15] propose an agglomerative algorithm that clusters the users in groups to schedule beamforming in a base station (BS), iteratively merging users into groups to provide high spectral efficiency. Although the method described in [15] does not provide any schedule of transmissions and as only one user in each will communicate with the BS, this system is prone to energy fault considering the user equipment power constraints.…”

Section: Related Workmentioning

confidence: 99%

“…Xu et al in [15] propose an agglomerative algorithm that clusters the users in groups to schedule beamforming in a base station (BS), iteratively merging users into groups to provide high spectral efficiency. Although the method described in [15] does not provide any schedule of transmissions and as only one user in each will communicate with the BS, this system is prone to energy fault considering the user equipment power constraints. Dense scenarios of wearable devices are investigated in [16], in which authors conclude that clustering protocols are potential feasible solutions to mmWave constraints imposed to MAC layer.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A Clustering Approach for Multiband Neighbor Discovery on 60 GHz WLAN

Brilhante

Rezende

2019

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

The 60 GHz mmWave unlicensed band has a very large spectrum available, divided into four orthogonal channels, which allows up to 7 Gbps data rate. On the other side, the propagation in the 60 GHz band is subject to severe path loss attenuation, which can be mitigated using highly directional antennas. This high directionality brings a new challenge to neighbor discovery; the devices now need to know the exact neighbors’ physical location to successfully communicate with them. In order to expedite the neighbor discovery process, multiband protocols have been proposed in the literature in which a separate band is used for the exchange of control messages in an omnidirectional mode. Nonetheless, these proposals suffer from the control channel bottleneck problem due to the numerous messages that need to be exchanged in this channel. In this work, we propose a scheme that divides the network nodes in clusters and for each cluster we allocate one separate control channel and also a separate mmWave channel for beamforming only. The former separation allows decreasing the number of control messages exchanged in each control channel, and the latter allows the simultaneously execution of multiple beamforming. In conjunction to this clustering scheme, we propose a multiband protocol in which only the cluster leader performs beamforming and uses the control channel to propagate the information obtained during this process. We compare the existing protocols with our proposed clustering protocol in terms of average transmission time, overhead, and accuracy of neighbor discovery information.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

A Clustering Approach for Multiband Neighbor Discovery on 60 GHz WLAN

Brilhante

Rezende

2019

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…The scheduler main idea is to balance the channel gain and spatial channel correlation of the selected MSs leading to a high system throughput. In [17] it is proposed a scheduling based on matrix vectorization aiming at maximizing the system throughput. The scheduler main idea is to pre-select different sets of MSs based on the Pearson correlation coefficient, whose MSs are scheduled afterwards to maximize the throughput.…”

Section: Introductionmentioning

confidence: 99%

A Framework for Radio Resource Allocation and SDMA Grouping in Massive MIMO Systems

et al. 2021

View full text Add to dashboard Cite

This work proposes a framework for multiuser massive Multiple Input Multiple Output (MIMO) systems which is composed of three partsclustering, grouping, and scheduling -and aims at maximizing the total system data rate considering Quality of Service (QoS) constraints. We firstly use a clustering algorithm to create clusters of spatially correlated Mobile Stations (MSs). Secondly, in the grouping part, we select a set of Space-Division Multiple Access (SDMA) groups from each cluster. These groups are used as candidate groups to receive Scheduling Unit (SU) in the scheduling part. In order to compose a group, we employ a metric that takes into account the trade-off between the spatial channel correlation and channel gain of MSs. In this context, it is proposed a suboptimal solution to avoid the high complexity required by the optimal solution. Thirdly and finally, we use the candidate SDMA groups from the grouping part to solve the data rate maximization problem considering QoS requirements. The scheduling part can be solved by our proposed optimal solution based on Branch and Bound (BB). However, since it has high computational complexity, we propose a suboptimal scheduling algorithm that presents a reduced complexity. In the simulation results, we evaluate the performance of both optimal and suboptimal solutions, as well as an adaptation of the Joint Satisfaction Maximization (JSM) scheduler to a massive MIMO scenario. Although the suboptimal solution presents a performance loss compared to the optimal one, it is more suitable for practical settings as it is able to obtain a good performance-complexity trade-off. Furthermore, we show that the choice of a suitable trade-off between the spatial channel correlation and channel gain improves the system performance. Finally, for a low number of available SDMA groups, the suboptimal solution presents near optimal outage and a throughput loss of only 10% in comparison to the high-complexity optimal solution while it outperforms the JSM solution in terms of outage and system throughput.

show abstract

“…Besides the capacity increasing, vehicular communication has a great development process in the field of infrastructure such as using multi-Radio Access Technologies (Multi-RAT) in heterogeneous networks, using massive Multiple-Input Multiple-Output (MIMO) configuration in the main Base Station (BS), and in the field of controlling the huge coming data from available vehicles [2]. Vehicular network is one of the 3rd Generation Partnership Project (3GPP) that use Long-Term Evolution (LTE) as a the technology of covering wide range of communication area instead of IEEE 802.11p networks which is suitable for short range covering [3]. Using LTE with vehicular links leads to have LTE-V networks where V indicates Vhicle [4].…”

Section: Introductionmentioning

confidence: 99%

Vehicular Networks Performance Evaluation Based on Downlink Scheduling Algorithms for High-Speed Long Term Evolution – Vehicle

Mahdi

Al-Bander

Alwan

et al. 2021

Int. J. Interact. Mob. Technol.

View full text Add to dashboard Cite

Moving is the key to modern life. Most things are in moving such as vehicles and user mobiles, so the need for high-speed wireless networks to serve the high demand of the wireless application becomes essential for any wireless network design. The use of web browsing, online gaming, and on-time data exchange like video calls as an example means that users need a high data rate and fewer error communication links. To satisfy this, increasing the bandwidth available for each network will enhance the throughput of the communication, but the bandwidth available is a limited resource which means that thinking about techniques to be used to increase the throughput of the network is very important. One of the techniques used is the spectrum sharing between the available networks, but the problem here is when there is no available channel to connect with. This encourages researchers to think about using scheduling as a technique to serve the high capacity on the network. Studying scheduling techniques depends on the Quality-of-Service (QoS) of the network, so the throughput performance is the metric of this paper. In this paper, an improved Best-CQI scheduling algorithm is proposed to enhance the throughput of the network. The proposed algorithm was compared with three user scheduling algorithms to evaluate the throughput performance which are Round Robin (RR), Proportional Fair (PF), and Best-CQI algorithms. The study is performed under Line-of-Sight (LoS) link at carrier frequency 2.6 GHz to satisfy the Vehicular Long Term Evolution (LTE-V) with the high-speed scenario. The simulation results show that the proposed algorithm outperforms the throughput performance of the other algorithms.

show abstract

Agglomerative Group Scheduling for MmWave Massive MIMO under Hybrid Beamforming Architecture

Cited by 10 publications

References 13 publications

A Clustering Approach for Multiband Neighbor Discovery on 60 GHz WLAN

A Clustering Approach for Multiband Neighbor Discovery on 60 GHz WLAN

A Framework for Radio Resource Allocation and SDMA Grouping in Massive MIMO Systems

Vehicular Networks Performance Evaluation Based on Downlink Scheduling Algorithms for High-Speed Long Term Evolution – Vehicle

Contact Info

Product

Resources

About