技术领域technical field
本发明涉及通信领域，尤其是一种基于负载的以用户为中心的动态分簇方法。The invention relates to the communication field, in particular to a load-based dynamic clustering method centered on users.
背景技术Background technique
超密集网络(UDN,Ultra Dense Network)是下一代移动通信的关键技术之一。UDN中部署大量的低功率的小基站，能提升系统容量、增强室内覆盖、提高频谱利用率。由于小基站之间的距离很近，若它们采用相同的频段，则会存在严重的干扰，因此有效的干扰管理方法是研究的热点。Ultra Dense Network (UDN, Ultra Dense Network) is one of the key technologies of the next generation mobile communication. Deploying a large number of low-power small base stations in UDN can increase system capacity, enhance indoor coverage, and improve spectrum utilization. Since the distance between small base stations is very close, if they use the same frequency band, there will be serious interference, so effective interference management methods are a hotspot of research.
传统的干扰管理策略，如功率控制、基于信道质量的调度等，虽然能在一定程度上抑制小区内干扰，但仅在单个小区内进行干扰控制，不能与相邻小区进行数据的交互，对小区间干扰的处理能力十分有限。多点协作传输(CoMP,Coordinated Multiple Point)技术通过基站之间的数据交互能避免小区间干扰或将干扰链路转化为有用链路，能有效地消减干扰。Although traditional interference management strategies, such as power control and channel quality-based scheduling, can suppress intra-cell interference to a certain extent, they only perform interference control in a single cell and cannot perform data interaction with adjacent cells. Interference processing ability is very limited. Coordinated Multiple Point (CoMP, Coordinated Multiple Point) technology can avoid inter-cell interference or convert interfering links into useful links through data exchange between base stations, and can effectively reduce interference.
CoMP分为协作调度/协作波束赋形、动态节点选择和联合传输(JT,JointTransmission)。协作调度/协作波束赋形模式中，用户所在小区的基站为用户提供服务，用户的调度和预编码方案由多个基站联合确定。动态节点选择模式中，在多个基站中选择其中的一个为用户发送数据。JT模式中，多个基站共享用户数据，同时为用户发送数据，将干扰链路转化为有用链路。JT-CoMP中，基站之间要交换信道状态信息和用户数据，如果所有的小基站都相互协作，这需要太高的回程链路开销，若协作的基站较少，则不能提供足够的增益，因此协作簇的选择至关重要。CoMP is divided into cooperative scheduling/cooperative beamforming, dynamic node selection and joint transmission (JT, Joint Transmission). In the coordinated scheduling/coordinated beamforming mode, the base station in the cell where the user is located provides services for the user, and the user's scheduling and precoding schemes are jointly determined by multiple base stations. In the dynamic node selection mode, one of the multiple base stations is selected to transmit data for the user. In JT mode, multiple base stations share user data and send data for users at the same time, converting interference links into useful links. In JT-CoMP, channel state information and user data need to be exchanged between base stations. If all small base stations cooperate with each other, this requires too high backhaul link overhead. If there are fewer cooperative base stations, it cannot provide enough gain. Therefore, the choice of cooperative clusters is crucial.
JT-CoMP中的分簇方法即为用户选择服务基站簇的方法分为三种：静态分簇、半动态分簇和动态分簇。静态分簇方法根据网络结构和基站地理位置，预先设计不随时间改变的固定协作簇，其优点是操作简单且运算量极低，缺点是没考虑到衰落信道的时变特性，可获得的协作增益有限。半动态分簇是静态分簇的一种改进，其协作增益高于静态分簇。动态分簇根据信道状态信息和用户位置的变化，周期性地进行分簇，能够获得更高的协作增益，但是这类分簇复杂度较高。动态分簇分为三类：以网络为中心的动态分簇、以用户为中心的动态分簇和混合分簇。在以网络为中心的动态分簇中，首先对基站进行分簇，每个基站簇包含多个基站，然后在用户所处的基站簇内为该用户选择合适的服务基站，这种分簇方法的复杂度相对较低，但是簇边缘用户会受到严重的簇间干扰。以用户为中心的动态分簇根据用户的信道状态信息在所有的小基站中为用户选择合适的服务基站簇，这种方法能获得较高的信干噪比和吞吐量，但是复杂度最高。混合分簇是以网络为中心的分簇和以用户为中心的分簇的结合，能随着网络状况的变化而做出调整，在复杂度和协作增益之间取得折衷。The clustering method in JT-CoMP is the method for the user to select the serving base station cluster, which is divided into three types: static clustering, semi-dynamic clustering and dynamic clustering. The static clustering method pre-designs a fixed cooperative cluster that does not change over time according to the network structure and the geographical location of the base station. The advantage is that the operation is simple and the amount of calculation is extremely low. limited. Semi-dynamic clustering is an improvement of static clustering, and its cooperation gain is higher than static clustering. Dynamic clustering performs clustering periodically according to changes in channel state information and user locations, and can obtain higher cooperation gains, but this type of clustering is more complex. Dynamic clustering is divided into three categories: network-centric dynamic clustering, user-centric dynamic clustering, and hybrid clustering. In network-centric dynamic clustering, the base stations are first clustered, each base station cluster contains multiple base stations, and then the user is selected in the base station cluster where the user is located. The appropriate serving base station, this clustering method The complexity of is relatively low, but cluster edge users will suffer severe inter-cluster interference. User-centered dynamic clustering selects the appropriate serving base station cluster for the user in all small base stations according to the user's channel state information. This method can obtain higher SINR and throughput, but has the highest complexity. Hybrid clustering is a combination of network-centered clustering and user-centered clustering, which can make adjustments with changes in network conditions and achieve a compromise between complexity and collaboration gain.
文献“Load aware self-organising user-centric dynamic comp clusteringfor 5G networks”提出了一种基于负载的以用户为中心的动态分簇方法，该方法能显著减少因负载过高而未能满足速率要求的用户数量。该文献中提到：该方法是也可视为一种混合分簇，先进行以网络为中心的分簇，同一个宏基站覆盖范围内的小基站组成一个基站簇，然后在该基站簇内进行以用户为中心的分簇，为每个用户选择服务基站簇。然而，若用户处于宏基站覆盖范围的边界，则该宏基站覆盖范围内能为该用户服务的基站数量较少，并且相邻宏基站以及该宏基站覆盖范围内的且与该用户距离较近的小基站会对该用户造成严重的干扰。The paper "Load aware self-organizing user-centric dynamic comp clustering for 5G networks" proposes a load-based user-centric dynamic clustering method, which can significantly reduce the number of users who fail to meet the rate requirements due to excessive load quantity. It is mentioned in this document that this method can also be regarded as a kind of hybrid clustering. Firstly, the network-centric clustering is performed, and the small base stations within the coverage of the same macro base station form a base station cluster, and then in the base station cluster Perform user-centered clustering and select a serving base station cluster for each user. However, if the user is at the boundary of the coverage area of the macro base station, the number of base stations that can serve the user within the coverage area of the macro base station is relatively small, and the adjacent macro base stations and those within the coverage area of the macro base station are relatively close to the user. A small base station will cause serious interference to the user.
发明内容Contents of the invention
本发明提出了一种基于负载的以用户为中心的动态分簇方法，适用于采用多点协作传输的超密集网络。The invention proposes a load-based and user-centered dynamic clustering method, which is suitable for ultra-dense networks adopting multi-point cooperative transmission.
实现本发明的技术思路是：构造网络中的小基站对应的路径损耗图，对于每个用户，在路径损耗图中找出与该用户所在小小区的小基站相连的所有小基站，把这些小基站当做该用户的备选服务基站，用户根据参考信号估算备选服务基站到自身的信道衰落系数，并从备选服务基站中选出待选服务基站，每个用户将自身的待选服务基站组成的集合以及待选服务基站到自身的信道衰落系数通过其中的一个小基站发送给中心控制器，中心控制器根据接收到的信息以及每个用户的速率需求为每个用户选择服务基站簇。The technical idea of realizing the present invention is: to construct the path loss diagram corresponding to the small base station in the network, for each user, find all the small base stations connected to the small base station of the small cell where the user is located in the path loss diagram, and combine these small base stations The base station is regarded as the candidate serving base station of the user, and the user estimates the channel fading coefficient from the candidate serving base station to itself according to the reference signal, and selects the candidate serving base station from the candidate serving base stations, and each user assigns its own candidate serving base station The formed set and the channel fading coefficient from the candidate serving base station to itself are sent to the central controller through one of the small base stations, and the central controller selects a serving base station cluster for each user according to the received information and the rate requirement of each user.
为了实现上述技术思路，本发明提出的基于负载的以用户为中心的动态分簇方法，适用于采用CoMP的超密集网络，包括如下步骤：In order to realize the above-mentioned technical ideas, the load-based user-centered dynamic clustering method proposed by the present invention is suitable for ultra-dense networks using CoMP, including the following steps:
A，构造网络中的小基站对应的路径损耗图，该图中的节点对应小基站，边对应小基站之间的路径损耗，若小基站之间的路径损耗小于预先设置的损耗门限，则这两个小基站对应的节点之间有条边，若小基站之间的路径损耗大于预先设置的损耗门限，则这两个小基站对应的节点之间没有边；A. Construct the path loss graph corresponding to the small base stations in the network. The nodes in the graph correspond to the small base stations, and the edges correspond to the path loss between small base stations. If the path loss between small base stations is less than the preset loss threshold, then this There is an edge between the nodes corresponding to the two small base stations, and if the path loss between the small base stations is greater than the preset loss threshold, there is no edge between the nodes corresponding to the two small base stations;
B，对于第u个用户，在路径损耗图中找出与该用户所在小小区的小基站相连的所有小基站，将这些小基站放在集合Qu中，u＝1,2,…,U，U是该网络中用户的总数，Qu中的小基站是第u个用户的备选服务基站；B. For the uth user, find all the small base stations connected to the small base station of the small cell where the user is located in the path loss diagram, and put these small base stations in the setQu , u=1,2,...,U , U is the total number of users in the network, and the small base station in Qu is the candidate serving base station for the uth user;
C，每个小基站以相同的功率发送参考信号，第u个用户根据接收到的参考信号测量接收信号功率并且估算Qu中的小基站到自身的信道衰落系数，u＝1,2,…,U，U是该网络中用户的总数；C, each small base station sends reference signals with the same power, the uth user measures the received signal power according to the received reference signal and estimates the channel fading coefficient from the small base station inQu to itself, u=1,2,... , U, U is the total number of users in the network;
D，第u个用户将步骤C测量得到的多个接收信号功率与预先设置的功率门限相比较，选出大于功率门限的若干个接收信号对应的小基站，并且按功率从大到小的顺序将它们对应的小基站依次放在集合Pu中，Pu中的元素表示小基站，uk是Pu中元素的总数，uk不大于Qu中元素的总数，u＝1,2,…,U，U是该网络中用户的总数，Pu中的小基站是第u个用户的待选服务基站；D. The u-th user compares the multiple received signal powers measured in step C with the preset power thresholds, selects the small base stations corresponding to several received signals greater than the power thresholds, and selects the small base stations corresponding to the received signals in descending order of power Put their corresponding small base stations in the set Pu in turn, The elements in Pu represent small base stations, uk is the total number of elements in Pu , uk is not greater than the total number of elements in Qu , u=1,2,...,U, U is the total number of users in the network, P The small base station inu is the candidate serving base station for the uth user;
E，第u个用户将集合Pu以及步骤C估算得到的Pu中的每个小基站到自身的信道衰落系数发送给小基站BSu,1，小基站BSu,1将收到的这些信息发送给中心控制器；E, the u-th user sends the set Puu and the channel fading coefficient from each small base station in Puu to itself estimated in step C to the small base station BSu,1 , and the small base station BSu,1 will receive these The information is sent to the central controller;
F，中心控制器基于每个用户的速率需求、步骤E接收到的Pu和信道衰落系数为每个用户选择服务基站；F, the central controller selects the serving base station for each user based on the rate requirement of each user, thePu received in step E, and the channel fading coefficient;
G，中心控制器根据Nu找到第j个小基站服务的用户集合Vj，并将Vj发送给第j个小基站，第j个小基站与集合Vj中的用户交互数据，j＝1,2,…,J，J是该网络中小基站的总数。G. The central controller finds the user set Vj served by the j-th small base station according toNu , and sends Vj to the j-th small base station, and the j-th small base station interacts with users in the set Vj . j = 1,2,...,J, J is the total number of small base stations in the network.
进一步，所述步骤F具体包括：Further, the step F specifically includes:
F1，用Nu表示第u个用户的服务基站簇，Nu为空集，令集合M为空集，u＝1,2,…,U，U是该网络中用户的总数；F1, useNu to represent the serving base station cluster of the uth user,Nu is an empty set, let the set M be an empty set, u=1,2,...,U, U is the total number of users in the network;
F2，将小基站BSu,1加入到第u个用户的服务基站簇Nu，中心控制器根据已知的信道衰落系数计算此时第u个用户的速率ru,1，u＝1,2,…,U，U是该网络中用户的总数，令i＝2；F2, add the small base station BSu,1 to the serving base station clusterNu of the uth user, and the central controller calculates the rate ru, 1 of the uth user at this time according to the known channel fading coefficient, u=1, 2,...,U, U is the total number of users in the network, let i=2;
F3，用|Pu︱表示集合Pu的势，若|Pu︱≥i，中心控制器考虑将小基站BSu,i当做第u个用户的服务基站，u＝1,2,…,U且u不在集合M中，U是该网络中用户的总数，中心控制器根据已知的信道衰落系数计算此时第u个用户的速率ru,i；F3, use |Pu ︱ to represent the potential of the set Pu , if |Pu ︱≥i, the central controller considers the small base station BSu,i as the serving base station of the uth user, u=1,2,..., U and u is not in the set M, U is the total number of users in the network, the central controller calculates the rate ru,i of the uth user at this time according to the known channel fading coefficient;
F4，比较ru,i-1、ru,i和du，du是第u个用户的最低速率需求，若ru,i-1＞ru,i，则不把小基站BSu,i加入到第u个用户的服务基站簇Nu且将u放入集合M中，若du>ru,i>ru,i-1或ru,i>du>ru,i-1，则将小基站BSu,i加入到第u个用户的服务基站簇Nu，若ru,2>ru,1>du，则不把小基站BSu,i加入到第u个用户的服务基站簇Nu，令i＝i+1，u＝1,2,…,U，U是该网络中用户的总数；F4, compare ru,i-1 , ru,i and du , du is the minimum rate requirement of the uth user, if ru,i-1 >ru,i , do not use the small base station BSu ,i joins the serving base station cluster Nu of the uth user and puts u into the set M, if du >ru,i >ru,i-1 or ru,i >du >ru, i-1 , the small base station BSu,i will be added to the serving base station clusterNu of the uth user, if ru,2 >ru,1 >du , then the small base station BSu,i will not be added to The serving base station cluster Nu of the uth user, let i=i+1, u=1, 2,..., U, U is the total number of users in the network;
F5，重复步骤F3和F4，直至i＞max{|Pu︱,u＝1,2,…,U且u不在集合M中}，U是该网络中用户的总数。F5, repeat steps F3 and F4 until i>max{|Pu ︱, u=1, 2,..., U and u is not in the set M}, where U is the total number of users in the network.
本发明中，对于每个用户，在路径损耗图中找出与该用户所在小小区的小基站相连的所有小基站，把这些小基站当做该用户的备选服务基站，这些小基站不局限于单个宏基站的覆盖范围内，也可能处于多个宏基站的覆盖范围内，只要是与用户之间信道质量较好的小基站都当做该用户的备选服务基站，克服了文献“Load aware self-organisinguser-centric dynamic comp clustering for 5G networks”中的不足。In the present invention, for each user, all small base stations connected to the small base station of the small cell where the user is located are found in the path loss diagram, and these small base stations are regarded as the user's alternative serving base stations. These small base stations are not limited to Within the coverage of a single macro base station, it may also be within the coverage of multiple macro base stations. As long as the small base station with better channel quality between the user and the user is used as the user's alternative serving base station, it overcomes the literature "Load aware self -Organizing user-centric dynamic comp clustering for 5G networks".
附图说明Description of drawings
图1是本发明实施例的路径损耗图；FIG. 1 is a path loss diagram of an embodiment of the present invention;
图2是本发明的流程图；Fig. 2 is a flow chart of the present invention;
图3是本发明为每个用户选择服务基站簇的流程图。Fig. 3 is a flowchart of selecting a serving base station cluster for each user in the present invention.
具体实施方式Detailed ways
下面给出本发明的一种实施例，对本发明做进一步详细的说明。考虑包含若干个小基站和多个用户的超密集网络，每个小小区中有一个小基站，小基站和用户都随机分布在该网络内。每个小基站通过回程链路与中心控制器相连。An embodiment of the present invention is given below to further describe the present invention in detail. Consider an ultra-dense network containing several small base stations and multiple users. Each small cell has a small base station, and the small base stations and users are randomly distributed in the network. Each small base station is connected to the central controller through a backhaul link.
中心控制器首先构造网络中的小基站对应的路径损耗图，如图1所示，该图中的节点对应小基站，边对应小基站之间的路径损耗，若小基站之间的路径损耗小于预先设置的损耗门限，则这两个小基站对应的节点之间有条边，若小基站之间的路径损耗大于预先设置的损耗门限，则这两个小基站对应的节点之间没有边。作为实施例，图1中有24个小基站，圆圈代表小基站，圆圈中的数字代表小基站的序号，用BSj表示第j个小基站，j＝1,2,…,24。The central controller first constructs the path loss graph corresponding to the small base stations in the network, as shown in Figure 1, the nodes in the graph correspond to the small base stations, and the edges correspond to the path losses between small base stations. If the path loss between small base stations is less than If the loss threshold is set in advance, there is an edge between the nodes corresponding to the two small base stations. If the path loss between the small base stations is greater than the loss threshold set in advance, there is no edge between the nodes corresponding to the two small base stations. As an example, there are 24 small base stations in FIG. 1 , the circles represent the small base stations, the numbers in the circles represent the serial numbers of the small base stations, and BSj represents the jth small base station, where j=1, 2,...,24.
对于第u个用户，若中心控制器从所有的小基站中为该用户选择服务基站，则需要已知每个小基站到该用户的信道衰落系数，这需要较高的回程链路，u＝1,2,…,U，U是该网络中用户的总数。若某个小基站与第u个用户的距离较远，在该小基站不可能成为第u个用户的服务基站的情况下，仍然向中心控制器发送该小基站到第u个用户的信道衰落系数，则会造成链路资源的浪费，没有换取任何增益，因此，没有必要将所有的小基站当做第u个用户的备选服务基站。用表示第u个用户所在小小区的小基站，在路径损耗图中，若某些小基站与相连，则这些小基站与之间的路径损耗较小，信道质量较高，同理，这些小基站与第u个用户的信道质量也较高，因此，需要将这些小基站当做第u个用户的备选服务基站。若在路径损耗图中某个小基站与不相连，则该小基站与之间的路径损耗较大，该小基站与第u个用户的信道质量较差，没有必要将该小基站当做第u个用户的备选服务基站。For the uth user, if the central controller selects the serving base station for the user from all the small base stations, the channel fading coefficient from each small base station to the user needs to be known, which requires a relatively high backhaul link, u= 1,2,...,U, where U is the total number of users in the network. If the distance between a small base station and the uth user is far, and the small base station cannot become the serving base station of the uth user, the channel fading from the small base station to the uth user is still sent to the central controller coefficient, it will cause a waste of link resources without any gain. Therefore, it is not necessary to use all small base stations as candidate serving base stations for the uth user. use Indicates the small base station of the small cell where the u-th user is located. In the path loss diagram, if some small base stations are connected to connected, then these small base stations are connected with The path loss between the small base stations is small, and the channel quality is high. Similarly, the channel quality between these small base stations and the uth user is also high. Therefore, these small base stations need to be used as the candidate serving base stations for the uth user. If a small base station and is not connected, the small base station and The path loss between the small base station is relatively large, and the channel quality between the small base station and the uth user is poor, so it is not necessary to use the small base station as a candidate serving base station for the uth user.
对于第u个用户，在路径损耗图中找出与该用户所在小小区的小基站相连的所有小基站，将这些小基站放在集合中，中的小基站是第u个用户的备选服务基站。是第u个用户的备选服务基站组成的集合。当ku的取值分别为1,2,…,24时，如下所示。For the uth user, find all the small base stations connected to the small base station of the small cell where the user is located in the path loss graph, and put these small base stations in the set middle, The small base station in is the candidate serving base station for the uth user. is the set of candidate serving base stations for the uth user. When the values of ku are 1,2,…,24 respectively, As follows.
Q1＝{BS2,BS7,BS8}Q1 ＝{BS2 ,BS7 ,BS8 }
Q2＝{BS1,BS3,BS7,BS10}Q2 ＝{BS1 ,BS3 ,BS7 ,BS10 }
Q3＝{BS2,BS4,BS10}Q3 ＝{BS2 ,BS4 ,BS10 }
Q4＝{BS3,BS5,BS6,BS11}Q4 ＝{BS3 ,BS5 ,BS6 ,BS11 }
Q5＝{BS4,BS11,BS12}Q5 ＝{BS4 ,BS11 ,BS12 }
Q6＝{BS4,BS10,BS14}Q6 ＝{BS4 ,BS10 ,BS14 }
Q7＝{BS1,BS2,BS8,BS16}Q7 ＝{BS1 ,BS2 ,BS8 ,BS16 }
Q8＝{BS1,BS7,BS9}Q8 ＝{BS1 ,BS7 ,BS9 }
Q9＝{BS8,BS16}Q9 ＝{BS8 ,BS16 }
Q10＝{BS2,BS3,BS6,BS14,BS15,BS17}Q10 ＝{BS2 ,BS3 ,BS6 ,BS14 ,BS15 ,BS17 }
Q11＝{BS4,BS5,BS13,BS14}Q11 ＝{BS4 ,BS5 ,BS13 ,BS14 }
Q12＝{BS5,BS13}Q12 = {BS5 ,BS13 }
Q13＝{BS11,BS12,BS14,BS18,BS19}Q13 ＝{BS11 ,BS12 ,BS14 ,BS18 ,BS19 }
Q14＝{BS6,BS10,BS11,BS13,BS17,BS18,BS21}Q14 ＝{BS6 ,BS10 ,BS11 ,BS13 ,BS17 ,BS18 ,BS21 }
Q15＝{BS2,BS10,BS17,BS16,BS22}Q15 ＝{BS2 ,BS10 ,BS17 ,BS16 ,BS22 }
Q16＝{BS7,BS9,BS15,BS22}Q16 ＝{BS7 ,BS9 ,BS15 ,BS22 }
Q17＝{BS10,BS14,BS15,BS22,BS24}Q17 ＝{BS10 ,BS14 ,BS15 ,BS22 ,BS24 }
Q18＝{BS13,BS14,BS19,BS20}Q18 ＝{BS13 ,BS14 ,BS19 ,BS20 }
Q19＝{BS13,BS18,BS20}Q19 ＝{BS13 ,BS18 ,BS20 }
Q20＝{BS18,BS19,BS21,BS24}Q20 ＝{BS18 ,BS19 ,BS21 ,BS24 }
Q21＝{BS14,BS20,BS24}Q21 ＝{BS14 ,BS20 ,BS24 }
Q22＝{BS15,BS16,BS17,BS23,BS24}Q22 ＝{BS15 ,BS16 ,BS17 ,BS23 ,BS24 }
Q23＝{BS22,BS24}Q23 ＝{BS22 ,BS24 }
Q24＝{BS17,BS20,BS21,BS22,BS23}Q24 ＝{BS17 ,BS20 ,BS21 ,BS22 ,BS23 }
每个小基站以相同的功率发送参考信号，第u个用户根据接收到的参考信号测量接收信号功率并且估算中的小基站到自身的信道衰落系数，u＝1,2,…,U，U是该网络中用户的总数。第u个用户将测量得到的多个接收信号功率与预先设置的功率门限相比较，选出大于功率门限的若干个接收信号对应的小基站，并且按功率从大到小的顺序将它们对应的小基站依次放在集合Pu中，Pu中的元素表示小基站，uk是Pu中元素的总数。集合Pu中的小基站与第u个用户的信道质量较好，是第u个用户的待选服务基站。Each small base station sends a reference signal with the same power, and the uth user measures the received signal power according to the received reference signal and estimates The channel fading coefficient from the small base station to itself, u=1,2,...,U, where U is the total number of users in the network. The u-th user compares the measured received signal power with the preset power threshold, selects the small base stations corresponding to several received signals greater than the power threshold, and selects the corresponding small base stations in order of power from large to small The small base stations are placed in the set Pu in turn, Elements in Pu represent small base stations, and uk is the total number of elements in Pu . The small base station in the set Pu has better channel quality with the uth user, and is the candidate serving base station for the uth user.
中心控制器为每个用户选择服务基站簇时，需要已知集合Pu以及集合Pu中的小基站到第u个用户的信道衰落系数。第u个用户将集合Pu以及估算得到的Pu中的每个小基站到自身的信道衰落系数发送给小基站BSu,1，小基站BSu,1将收到的这些信息发送给中心控制器。When the central controller selects a serving base station cluster for each user, it needs to know the set Pu and the channel fading coefficient from the small base stations in the set Pu to the uth user. The uth user sends the set Puu and the estimated channel fading coefficient from each small base station in Puu to itself to the small base station BSu,1 , and the small base station BSu,1 sends the received information to the center controller.
中心控制器基于每个用户的速率需求、集合Pu和集合Pu中的小基站到第u个用户的信道衰落系数为每个用户选择服务基站簇，u＝1,2,…,U，U是该网络中用户的总数，具体过程如下：The central controller selects a serving base station cluster for each user based on the rate requirement of each user, the setPu and the channel fading coefficient from the small base stations in the setPu to the uth user, u=1,2,...,U, U is the total number of users in the network, and the specific process is as follows:
步骤1，用Nu表示第u个用户的服务基站簇，Nu为空集，令集合M为空集，u＝1,2,…,U，U是该网络中用户的总数；Step 1, useNu to represent the serving base station cluster of the uth user,Nu is an empty set, let the set M be an empty set, u=1, 2,..., U, U is the total number of users in the network;
步骤2，将小基站BSu,1加入到第u个用户的服务基站簇Nu，中心控制器根据已知的信道衰落系数计算此时第u个用户的速率ru,1，u＝1,2,…,U，U是该网络中用户的总数，令i＝2；Step 2: Add the small base station BSu,1 to the serving base station clusterNu of the uth user, and the central controller calculates the rate ru,1 of the uth user at this time according to the known channel fading coefficient, u=1 ,2,...,U, U is the total number of users in the network, let i=2;
步骤3，用|Pu︱表示集合Pu的势，若|Pu︱≥i，中心控制器考虑将小基站BSu,i当做第u个用户的服务基站，u＝1,2,…,U且u不在集合M中，U是该网络中用户的总数，中心控制器根据已知的信道衰落系数计算此时第u个用户的速率ru,i；Step 3, use |Pu ︱ to represent the potential of the set Pu , if |Pu ︱≥i, the central controller considers the small base station BSu,i as the serving base station of the uth user, u=1,2,… , U and u is not in the set M, U is the total number of users in the network, and the central controller calculates the rate ru,i of the uth user at this time according to the known channel fading coefficient;
步骤4，比较ru,i-1、ru,i和du，du是第u个用户的最低速率需求，若ru,i-1＞ru,i，则不把小基站BSu,i加入到第u个用户的服务基站簇Nu且将u放入集合M中，若du>ru,i>ru,i-1或ru,i>du>ru,i-1，则将小基站BSu,i加入到第u个用户的服务基站簇Nu，若ru,2>ru,1>du，则不把小基站BSu,i加入到第u个用户的服务基站簇Nu，令i＝i+1，u＝1,2,…,U，U是该网络中用户的总数；Step 4, compare ru,i-1 , ru,i and du , du is the minimum rate requirement of the uth user, if ru,i-1 > ru,i , do not use the small base station BSu,i join the serving base station cluster Nu of the uth user and put u into the set M, if du >ru,i >ru,i-1 or ru,i >du >ru ,i-1 , add the small base station BSu,i to the serving base station cluster Nu of the uth user, if ru,2 >ru,1 >du , then do not add the small base station BSu,i To the serving base station cluster Nu of the uth user, let i=i+1, u=1, 2,..., U, U is the total number of users in the network;
步骤5，重复步骤F3和F4，直至i＞max{|Pu︱,u＝1,2,…,U且u不在集合M中}，U是该网络中用户的总数。Step 5, repeat steps F3 and F4 until i>max{|Pu ︱,u=1,2,...,U and u is not in the set M}, where U is the total number of users in the network.
中心控制器根据Nu找到第j个小基站服务的用户集合Vj，并将Vj发送给第j个小基站，第j个小基站与集合Vj中的用户交互数据，j＝1,2,…,24。The central controller finds the user set Vj served by the j-th small base station according toNu , and sends Vj to the j-th small base station, and the j-th small base station interacts with users in the set Vj , j=1, 2,...,24.
结合本发明的流程图即图2，基于负载的以用户为中心的动态分簇方法的具体步骤如下：In conjunction with the flowchart of the present invention, namely Fig. 2, the specific steps of the load-based user-centric dynamic clustering method are as follows:
A，构造网络中的小基站对应的路径损耗图，该图中的节点对应小基站，边对应小基站之间的路径损耗，若小基站之间的路径损耗小于预先设置的损耗门限，则这两个小基站对应的节点之间有条边，若小基站之间的路径损耗大于预先设置的损耗门限，则这两个小基站对应的节点之间没有边；A. Construct the path loss graph corresponding to the small base stations in the network. The nodes in the graph correspond to the small base stations, and the edges correspond to the path loss between small base stations. If the path loss between small base stations is less than the preset loss threshold, then this There is an edge between the nodes corresponding to the two small base stations, and if the path loss between the small base stations is greater than the preset loss threshold, there is no edge between the nodes corresponding to the two small base stations;
B，对于第u个用户，在路径损耗图中找出与该用户所在小小区的小基站相连的所有小基站，将这些小基站放在集合Qu中，u＝1,2,…,U，U是该网络中用户的总数，Qu中的小基站是第u个用户的备选服务基站；B. For the uth user, find all the small base stations connected to the small base station of the small cell where the user is located in the path loss diagram, and put these small base stations in the setQu , u=1,2,...,U , U is the total number of users in the network, and the small base station in Qu is the candidate serving base station for the uth user;
C，每个小基站以相同的功率发送参考信号，第u个用户根据接收到的参考信号测量接收信号功率并且估算Qu中的小基站到自身的信道衰落系数，u＝1,2,…,U，U是该网络中用户的总数；C, each small base station sends reference signals with the same power, the uth user measures the received signal power according to the received reference signal and estimates the channel fading coefficient from the small base station inQu to itself, u=1,2,... , U, U is the total number of users in the network;
D，第u个用户将步骤C测量得到的多个接收信号功率与预先设置的功率门限相比较，选出大于功率门限的若干个接收信号对应的小基站，并且按功率从大到小的顺序将它们对应的小基站依次放在集合Pu中，Pu中的元素表示小基站，uk是Pu中元素的总数，uk不大于Qu中元素的总数，u＝1,2,…,U，U是该网络中用户的总数，Pu中的小基站是第u个用户的待选服务基站；D. The u-th user compares the multiple received signal powers measured in step C with the preset power thresholds, selects the small base stations corresponding to several received signals greater than the power thresholds, and selects the small base stations corresponding to the received signals in descending order of power Put their corresponding small base stations in the set Pu in turn, The elements in Pu represent small base stations, uk is the total number of elements in Pu , uk is not greater than the total number of elements in Qu , u=1,2,...,U, U is the total number of users in the network, P The small base station inu is the candidate serving base station for the uth user;
E，第u个用户将集合Pu以及步骤C估算得到的Pu中的每个小基站到自身的信道衰落系数发送给小基站BSu,1，小基站BSu,1将收到的这些信息发送给中心控制器；E, the u-th user sends the set Puu and the channel fading coefficient from each small base station in Puu to itself estimated in step C to the small base station BSu,1 , and the small base station BSu,1 will receive these The information is sent to the central controller;
F，中心控制器基于每个用户的速率需求、步骤E接收到的Pu和信道衰落系数为每个用户选择服务基站；F, the central controller selects the serving base station for each user based on the rate requirement of each user, thePu received in step E, and the channel fading coefficient;
G，中心控制器根据Nu找到第j个小基站服务的用户集合Vj，并将Vj发送给第j个小基站，第j个小基站与集合Vj中的用户交互数据，j＝1,2,…,J，J是该网络中小基站的总数。G. The central controller finds the user set Vj served by the j-th small base station according toNu , and sends Vj to the j-th small base station, and the j-th small base station interacts with users in the set Vj . j = 1,2,...,J, J is the total number of small base stations in the network.
结合本发明的为每个用户选择服务基站簇的流程图即图3，为每个用户选择服务基站簇的具体步骤如下：In conjunction with the flowchart of selecting a serving base station cluster for each user of the present invention, that is, Fig. 3, the specific steps for selecting a serving base station cluster for each user are as follows:
F1，用Nu表示第u个用户的服务基站簇，Nu为空集，令集合M为空集，u＝1,2,…,U，U是该网络中用户的总数；F1, useNu to represent the serving base station cluster of the uth user,Nu is an empty set, let the set M be an empty set, u=1,2,...,U, U is the total number of users in the network;
F2，将小基站BSu,1加入到第u个用户的服务基站簇Nu，中心控制器根据已知的信道衰落系数计算此时第u个用户的速率ru,1，u＝1,2,…,U，U是该网络中用户的总数，令i＝2；F2, add the small base station BSu,1 to the serving base station clusterNu of the uth user, and the central controller calculates the rate ru, 1 of the uth user at this time according to the known channel fading coefficient, u=1, 2,...,U, U is the total number of users in the network, let i=2;
F3，用|Pu︱表示集合Pu的势，若|Pu︱≥i，中心控制器考虑将小基站BSu,i当做第u个用户的服务基站，u＝1,2,…,U且u不在集合M中，U是该网络中用户的总数，中心控制器根据已知的信道衰落系数计算此时第u个用户的速率ru,i；F3, use |Pu ︱ to represent the potential of the set Pu , if |Pu ︱≥i, the central controller considers the small base station BSu,i as the serving base station of the uth user, u=1,2,..., U and u is not in the set M, U is the total number of users in the network, the central controller calculates the rate ru,i of the uth user at this time according to the known channel fading coefficient;
F4，比较ru,i-1、ru,i和du，du是第u个用户的最低速率需求，若ru,i-1＞ru,i，则不把小基站BSu,i加入到第u个用户的服务基站簇Nu且将u放入集合M中，若du>ru,i>ru,i-1或ru,i>du>ru,i-1，则将小基站BSu,i加入到第u个用户的服务基站簇Nu，若ru,2>ru,1>du，则不把小基站BSu,i加入到第u个用户的服务基站簇Nu，令i＝i+1，u＝1,2,…,U，U是该网络中用户的总数；F4, compare ru,i-1 , ru,i and du , du is the minimum rate requirement of the uth user, if ru,i-1 >ru,i , do not use the small base station BSu ,i joins the serving base station cluster Nu of the uth user and puts u into the set M, if du >ru,i >ru,i-1 or ru,i >du >ru, i-1 , the small base station BSu,i will be added to the serving base station clusterNu of the uth user, if ru,2 >ru,1 >du , then the small base station BSu,i will not be added to The serving base station cluster Nu of the uth user, let i=i+1, u=1, 2,..., U, U is the total number of users in the network;
F5，重复步骤F3和F4，直至i＞max{|Pu︱,u＝1,2,…,U且u不在集合M中}，U是该网络中用户的总数。F5, repeat steps F3 and F4 until i>max{|Pu ︱, u=1, 2,..., U and u is not in the set M}, where U is the total number of users in the network.
以上实施例仅仅是对本发明的举例说明，本领域的技术人员可以对本发明进行各种改动和变型而不脱离本发明的精神和范围。这样，倘若本发明的这些修改和变型属于本发明权利要求及其等同技术的范围之内，则本发明也意图包含这些改动和变型在内。The above embodiments are only illustrations of the present invention, and those skilled in the art can make various modifications and variations to the present invention without departing from the spirit and scope of the present invention. Thus, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalent technologies, the present invention also intends to include these modifications and variations.
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810234242.5ACN108322271B (en) | 2018-03-21 | 2018-03-21 | User-centric dynamic clustering method based on load |
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810234242.5ACN108322271B (en) | 2018-03-21 | 2018-03-21 | User-centric dynamic clustering method based on load |
| Publication Number | Publication Date |
|---|---|
| CN108322271Atrue CN108322271A (en) | 2018-07-24 |
| CN108322271B CN108322271B (en) | 2021-06-15 |
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810234242.5AExpired - Fee RelatedCN108322271B (en) | 2018-03-21 | 2018-03-21 | User-centric dynamic clustering method based on load |
| Country | Link |
|---|---|
| CN (1) | CN108322271B (en) |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109548073A (en)* | 2018-11-16 | 2019-03-29 | 厦门大学 | One kind is based on the matched adaptive slight differentiation cluster method of multi-to-multi |
| CN113595599A (en)* | 2021-09-30 | 2021-11-02 | 华东交通大学 | 5G-oriented cluster cooperative communication heterogeneous system and interference suppression method |
| WO2025111196A1 (en)* | 2023-11-20 | 2025-05-30 | Apple Inc. | Systems and methods for determining base station sets for resource allocation grants in cell-free communications |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015117508A1 (en)* | 2014-08-20 | 2015-08-13 | 中兴通讯股份有限公司 | Multi-cell beamforming method and device |
| CN107172682A (en)* | 2017-07-10 | 2017-09-15 | 南京邮电大学 | Super-intensive network radio resources distribution method based on dynamic clustering |
| CN107425885A (en)* | 2017-08-02 | 2017-12-01 | 西安电子科技大学 | Dynamic clustering method is mixed under CoMP based on Game with Coalitions |
| CN107750056A (en)* | 2017-10-25 | 2018-03-02 | 河南理工大学 | Interference mitigation method in super-intensive network |
| CN107770874A (en)* | 2017-10-25 | 2018-03-06 | 河南理工大学 | Cluster-dividing method and channel allocation method in super-intensive network |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015117508A1 (en)* | 2014-08-20 | 2015-08-13 | 中兴通讯股份有限公司 | Multi-cell beamforming method and device |
| CN107172682A (en)* | 2017-07-10 | 2017-09-15 | 南京邮电大学 | Super-intensive network radio resources distribution method based on dynamic clustering |
| CN107425885A (en)* | 2017-08-02 | 2017-12-01 | 西安电子科技大学 | Dynamic clustering method is mixed under CoMP based on Game with Coalitions |
| CN107750056A (en)* | 2017-10-25 | 2018-03-02 | 河南理工大学 | Interference mitigation method in super-intensive network |
| CN107770874A (en)* | 2017-10-25 | 2018-03-06 | 河南理工大学 | Cluster-dividing method and channel allocation method in super-intensive network |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109548073A (en)* | 2018-11-16 | 2019-03-29 | 厦门大学 | One kind is based on the matched adaptive slight differentiation cluster method of multi-to-multi |
| CN109548073B (en)* | 2018-11-16 | 2020-09-25 | 厦门大学 | An Adaptive Small Cell Clustering Method Based on Many-to-Many Matching |
| CN113595599A (en)* | 2021-09-30 | 2021-11-02 | 华东交通大学 | 5G-oriented cluster cooperative communication heterogeneous system and interference suppression method |
| WO2025111196A1 (en)* | 2023-11-20 | 2025-05-30 | Apple Inc. | Systems and methods for determining base station sets for resource allocation grants in cell-free communications |
| Publication number | Publication date |
|---|---|
| CN108322271B (en) | 2021-06-15 |
| Publication | Publication Date | Title |
|---|---|---|
| Zhang et al. | Energy-efficient resource allocation in NOMA heterogeneous networks | |
| Shokri-Ghadikolaei et al. | Millimeter wave cellular networks: A MAC layer perspective | |
| Zhou et al. | Uplink multicell processing with limited backhaul via per-base-station successive interference cancellation | |
| Wang et al. | Stackelberg game for user clustering and power allocation in millimeter wave-NOMA systems | |
| Qian et al. | Adaptive soft frequency reuse scheme for wireless cellular networks | |
| Ye et al. | User association and interference management in massive MIMO HetNets | |
| Liu et al. | Joint clustering and inter-cell resource allocation for CoMP in ultra dense cellular networks | |
| Dai et al. | Clustering-based spectrum sharing strategy for cognitive radio networks | |
| Feng et al. | Joint frame design, resource allocation and user association for massive MIMO heterogeneous networks with wireless backhaul | |
| CN105898757B (en) | A Spectrum Resource Allocation Method in Wireless Backhaul Link Heterogeneous Internet of Things | |
| Marabissi et al. | An optimized CoMP transmission for a heterogeneous network using eICIC approach | |
| Huang et al. | Joint spectrum and power allocation for multi-node cooperative wireless systems | |
| CN105471488A (en) | Multi-cell beam forming method and multi-cell beam forming device | |
| Zhang et al. | Dynamic user-centric clustering for uplink cooperation in multi-cell wireless networks | |
| Budhiraja et al. | Subchannel assignment for SWIPT-NOMA based HetNet with imperfect channel state information | |
| Shi et al. | Joint DL/UL decoupled cell-association and resource allocation in D2D-underlay HetNets | |
| Yemini et al. | Virtual cell clustering with optimal resource allocation to maximize capacity | |
| CN108322271A (en) | The dynamic clustering method of customer-centric based on load | |
| Yemini et al. | Virtual cell clustering with optimal resource allocation to maximize cellular system capacity | |
| Dehghani Firouzabadi et al. | Joint user association, subchannel assignment, and power allocation in full‐duplex OFDMA heterogeneous networks | |
| Apostolos et al. | Energy efficient spectrum allocation and mode selection for mission-critical D2D communications | |
| Sobhi-Givi et al. | Joint power allocation and user fairness optimization for reinforcement learning over mmwave-noma heterogeneous networks | |
| Swetha et al. | Fair resource allocation for D2D communication in mmwave 5G networks | |
| Xu et al. | Robust beamforming with pilot reuse scheduling in a heterogeneous cloud radio access network | |
| Zhang et al. | Resource allocation for relay-assisted OFDMA systems using inter-cell interference coordination |
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | Granted publication date:20210615 | |
| CF01 | Termination of patent right due to non-payment of annual fee |