Cluster DRS: Enabling 5G for Low-Altitude Communication and Beyond
By extending the “Cluster” concept to the spatial domain, the cluster dynamic radio sharing (Cluster DRS) solution enables low-altitude, three-dimensional coverage on 5G commercial
Cluster Communication
In the cluster, a node responsible for Intra- and inter-cluster communication is known as cluster head, whereas the other nodes that share their data to cluster head for communication are called cluster
A study of base station establishment site selection based on cluster
In this paper, to address the site planning and area clustering problems of mobile communication networks, the K-mean clustering algorithm, linear programming,
Base Station Planning Based on Region Division and
In this paper, the weak signal coverage points were divided into three categories according to the number of users and traffic demand.
Research on Base Station Site Planning Based on Cluster
This paper provides some reference ideas for solving the problem of selecting and planning the base station site in the communication network.
Base Stations
Base stations form a key part of modern wireless communication networks because they offer some crucial advantages, such as wide coverage, continuous communications and an array of
Modeling information and communication interaction in 5G cluster
In this study, we developed a stochastic model to analyse the information and communication interaction between a base station and a set of subscribers in a 5G cluster with
Block-type reinforcement learning based on matrix-based
This paper establishes a three-dimensional base station communication model to address the overall signal coverage rate in special regions with specific coverage requirements,
WO2018129641A1
Also disclosed in the present invention are a corresponding communication apparatus for the cluster system, and a base station.
Cluster Analysis of mobile communication network station location
Because there are so many different types of base stations and antennas, the choice of site becomes more complicated. This paper mainly uses the 0-1 knapsack dynamic programming