WO2022068842A1

WO2022068842A1 - Network management method and related apparatus

Info

Publication number: WO2022068842A1
Application number: PCT/CN2021/121527
Authority: WO
Inventors: 雷凯; 陈锐彪; 陈翔; 白铂; 张弓
Original assignee: 华为技术有限公司
Priority date: 2020-09-30
Filing date: 2021-09-29
Publication date: 2022-04-07
Also published as: CN114339778A

Abstract

A network management method and a related apparatus, which are applied to a WiFi network to realize management and planning regarding an STA connected to an AP, to reduce interference between user equipments, and to improve the performance of network transmission. The method comprises: a first communication apparatus acquiring first channel parameter information, wherein the first channel parameter information comprises channel parameter information between first APs in a first network and STAs within a signal coverage range of the first APs; the first communication apparatus grouping the first APs and first STAs according to the first channel parameter information, so as to obtain a plurality of groups, wherein the first STAs comprise some of or all of the STAs within the signal coverage range of the first APs; and the first communication apparatus sending a grouping result of the plurality of groups, wherein the grouping result is used for indicating APs and STAs comprised in each of the plurality of groups.

Description

Network management method and related device

This application claims the priority of the Chinese patent application filed on September 30, 2020 with the application number 202011063602.3 and the title of the invention is "Network Management Method and Related Apparatus", the entire contents of which are incorporated herein by reference middle.

technical field

The present application relates to the field of communication technologies, and in particular, to a network management method and related devices.

Background technique

With the popularization of wireless fidelity (WiFi) technology and the continuous growth of application requirements, the future WiFi network needs to deploy a large number of wireless access point (AP) devices to serve a large number of access users. The rapidly increasing density of APs and users makes the problem of wireless signal interference between devices more and more prominent. Without proper management measures, signal interference can lead to high packet error rates and the inability of the interfered device to access the channel, thereby limiting the amount of concurrent transmissions on the network.

Currently, the AP uses the least congested channel scan (LCCS) technique to periodically scan the orthogonal channels, determines the connection status of each channel, and configures the AP to the channel with the least number of AP connections.

It can be seen from the above solution that in the LCCS technology, the AP only allocates channels according to the AP's measurement information, or in the case of a fixed AP connected to a station (Station, STA), the AP adjusts the channel accessed by the AP to reduce interference. However, there is no corresponding planning and management for the connection between the AP and the STA, resulting in a large signal interference between the users served by the AP, resulting in low network transmission performance.

SUMMARY OF THE INVENTION

The embodiments of the present application provide a network management method and related apparatuses, which are used to implement management and planning of STAs connected to an AP, which can reduce interference between user equipments, thereby improving network transmission performance.

A first aspect of the embodiments of the present application provides a network management method, where the network management method includes:

The first communication device acquires first channel parameter information, where the first channel parameter information includes channel parameter information between the first AP in the first network and the STAs within the signal coverage of the first AP; then, the first communication The device groups the first AP and the first STA according to the first channel parameter information to obtain multiple groups, and the first STA includes part or all of the STAs within the signal coverage of the first AP; A communication device sends a grouping result of the plurality of groups, where the grouping result is used to indicate APs and STAs included in each group of the plurality of groups.

In this embodiment, the first communication device groups the first AP and the first STA according to the first channel parameter information, obtains multiple groups, and sends the grouping results of the multiple groups, so that the AP or the STA receives the grouping results, The connection can be adjusted according to the group to which it belongs, so as to realize the management and planning of the STA connected to the AP. Since the multiple groups are divided by the first communication apparatus according to the first channel parameter information, the implementation of the management and planning of the STAs connected to the AP through the solutions in the embodiments of the present application can reduce interference between user equipments, thereby improving the network transmission performance.

In a possible implementation manner, the first communication device is a server, the first AP includes all APs of the first network, and the first STA includes all STAs of the first network; the first communication device obtains the first channel parameter information, including: the server receives the first channel parameter information sent by the control device, where the first channel parameter information includes the difference between each AP in all APs in the first network and the STAs within the signal coverage of each AP The first network is a network controlled by the control device; the first communication device sending the grouping results of the multiple groups includes: the server sending the grouping results of the multiple groups to the control device.

In this possible implementation, a centralized network management system is adopted, and the centralized network management system includes a control device and a server. The server in the centralized network management system realizes the grouping of all APs and all STAs in the first network, and sends the grouping results of the multiple groups to the control device, and then the control device groups the APs in the first network. The connected STA performs management and planning.

In another possible implementation manner, the first channel parameter information includes a channel matrix W, where the channel matrix W is a matrix of K rows multiplied by L columns, K is the number of STAs included in the first network, and L is the first The number of APs included in the network, the channel matrix

w _ij is the channel gain between the i-th STA and the j-th AP, i is an integer greater than or equal to 1 and less than or equal to K, j is an integer greater than or equal to 1 and less than or equal to L; the first communication The device groups the first AP and the first STA according to the first channel parameter information, and obtains multiple groups, including: the server obtains a first intermediate matrix D by calculating according to the channel matrix W, the first intermediate matrix

D ₁ is a matrix with K rows by K columns,

The element a _i on the main diagonal of D ₁ is the sum of the channel gains between the i-th STA in the first network and all APs in the first network, respectively, and the off-diagonal elements of D ₁ _The elements are all zero; D2 is a matrix of L rows by L columns,

The element b _j on the main diagonal of D ₂ is the sum of the channel gains between the jth AP in the first network and all STAs in the first network, and 0 _K×L is K rows multiplied by For a matrix of L columns, the elements in 0 _K×L are all zero, and 0 _L×K is a matrix of L rows multiplied by K columns, and the elements in 0 _L×K are all zero; the server is based on the channel matrix W and the The first intermediate matrix D determines a second intermediate matrix, each row vector in the second intermediate matrix corresponds to a network node, and the network node is an STA or AP in the first network; The row vectors of the two intermediate matrices are clustered to obtain a first clustering result, where the first clustering result includes row vectors of multiple clusters, and one of the multiple clusters corresponds to one of the multiple groups; the The server determines the network nodes respectively included in the multiple groups according to the row vectors of the multiple clusters.

In this possible implementation manner, the specific content of the first channel parameter information and the grouping process for the server to group all APs and all STAs in the first network are provided. Specifically, the network nodes of the first network are divided into groups by means of clustering, so as to realize the grouping of all APs and all STAs of the first network, and improve the feasibility of the solution.

In another possible implementation manner, the channel matrix W is an edge weight matrix W of a weighted bipartite graph, the weighted bipartite graph includes a first type vertex and a second type vertex, and the first type vertex represents the first network The STA in , the second type vertex represents the AP in the first network, the element of the edge weight matrix W is the edge weight of the weighted bipartite graph, and the edge weight of the weighted bipartite graph is the first network. The channel gain between the STA and the AP, the first intermediate matrix is the degree matrix of the weighted bipartite graph.

In this possible implementation, the first channel parameter information is represented by an edge weight matrix of a weighted bipartite graph, so that the server can combine the graph method and the spectral clustering method to group all APs and all STAs in the first network , the signal interference degree between the sub-networks formed corresponding to each of the multiple groups obtained in this way is relatively small, and the effective strength in the sub-network is relatively large.

In another possible implementation manner, the server determines the second intermediate matrix according to the channel matrix W and the first intermediate matrix D, including: the server determines the third intermediate matrix according to the channel matrix W and the first intermediate matrix D R,

W ^T is the transpose of W; the server performs singular value decomposition on the third intermediate matrix R to obtain the left singular matrix of the third intermediate matrix R and the right singular matrix of the third intermediate matrix R; wherein, the third intermediate matrix R The intermediate matrix R=UΣV ^T , the Σ is a diagonal matrix, and the V ^T is the transpose of the right singular matrix V; the corresponding main diagonal element on the rth column vector of the diagonal matrix Σ is the left singular matrix The singular value corresponding to the rth column vector of U, the corresponding main diagonal element on the rth column vector of the diagonal matrix Σ is the singular value corresponding to the rth column vector of the right singular matrix V, and r is greater than or equal to 1 and an integer less than or equal to min(K, L), min(K, L) refers to the minimum value between K and L; the server follows the order of the singular values in the diagonal matrix Σ from large to small, from the left singular Select the corresponding M column vectors from the matrix U to obtain the fourth intermediate matrix U _M , and select the corresponding M column vectors from the right singular matrix V according to the size order of the singular values in the diagonal matrix Σ from large to small, Obtain the fifth intermediate matrix V _M , where M is an integer greater than or equal to log ₂ (K+L) and less than or equal to min(K, L), and log ₂ (K+L) refers to the base 2 for K+L logarithm; the server calculates and obtains the second intermediate matrix Z according to the fourth intermediate matrix, the fifth intermediate matrix and the first intermediate matrix, and the

In this possible implementation manner, the specific process of determining the second intermediate matrix Z by the server is shown. The server selects M column vectors from the left singular matrix U and M column vectors from the right singular matrix V according to the size of the singular values. The column vector contains more feature information that characterizes the weighted bipartite graph, and the server clusters the second intermediate matrix Z by spectral clustering, so that the server has a better grouping effect on the STAs and APs in the first network. . For example, the sum of the effective signal strengths in the sub-network formed by the APs and STAs in each group is relatively large, and the signal interference strength between the network nodes (APs or STAs) in the sub-network and outside the sub-network is relatively low.

In another possible implementation manner, the first communication device performs clustering on the row vectors of the second intermediate matrix according to a clustering algorithm to obtain a first clustering result, including: the server performing the clustering on the second intermediate matrix according to the clustering algorithm. Intermediate matrix

The included K+L row vectors are clustered to obtain row vectors of multiple clusters, and one of the multiple clusters corresponds to one of the multiple groups; the server determines the multiple clusters according to the row vectors of the multiple clusters. The network nodes respectively included in the multiple groups include: the server divides the network nodes corresponding to the row vector of the same cluster in the row vectors of the multiple clusters into the same group.

In this possible implementation, the server clusters the row vectors of the second intermediate matrix according to a clustering algorithm to obtain row vectors included in each cluster, and then determines that each group includes a network node corresponding to each row vector. The network node implements grouping of all APs and all STAs of the first network.

In another possible implementation manner, the first communication device is the first AP, and the first STA includes a STA that has established a connection with the first AP within the signal coverage of the first AP; the method further includes: The first AP adjusts the STA to which the first AP is connected according to the group to which the first AP belongs.

In this possible implementation, a distributed network management system is adopted, the first AP and the STAs connected to the first AP are grouped through the first AP in the distributed network management system, and then the first AP adjusts the The STA connected to the first AP implements connection management and planning for the STA connected to the first AP, reduces interference between user equipments, and improves network transmission performance.

In another possible implementation manner, the first AP is the pth AP in the first network, and the first channel parameter information includes the pth column vector of the channel matrix W, and the channel matrix

w _ij is the channel gain between the ith STA and the jth AP, i is an integer greater than or equal to 1 and less than or equal to K, j is an integer greater than or equal to 1 and less than or equal to L, p is less than or equal to an integer equal to the L, where L is the number of APs included in the first network, and K is the number of STAs included in the first network; the first communication device groups the first AP and the first STA according to the first channel parameter information , to obtain a plurality of groupings, including: the first AP obtains the p+K-th main diagonal element b _p of the first intermediate matrix D according to the p-th column vector of the channel matrix W;

Among them, the first intermediate matrix

The D ₁ is a matrix of K rows by K columns, the

The element a _i on the main diagonal of D ₁ is the sum of the channel gains between the i-th STA in the first network and all APs in the first network, and the elements on the off-diagonal of D ₁ are zero _; D2 is a matrix of L rows by L columns,

The element b _j on the main diagonal of D ₂ is the sum of the channel gains between the j-th AP in the first network and all STAs in the first network, 0 _K×L is a matrix multiplied by L columns, The elements in 0 _K×L are all zero, 0 _L×K is a matrix of L rows by K columns, and the elements in 0 _L×K are all zero;

The first AP acquires the first K main diagonal elements of the first intermediate matrix D;

The first AP is based on the p-th column vector of the channel matrix W, the p+K-th main diagonal element b _p of the first intermediate matrix D, and the first K main diagonals in the first intermediate matrix D The elements determine the first K row vectors and the K+pth row vector of the sixth intermediate matrix Q, each row vector of the sixth intermediate matrix Q corresponds to a network node, and the network node is the AP or STA in the first network, The i-th row vector of the sixth intermediate matrix Q is the row vector corresponding to the i-th STA, and the K+j-th row vector of the sixth intermediate matrix Q is the row vector corresponding to the j-th AP; the first AP The target row vector is clustered according to the clustering algorithm to obtain a second clustering result; wherein, the target row vector includes the K+pth row vector corresponding to the first AP and the sixth intermediate matrix Q The row vector corresponding to the first STA in the first K row vectors of An AP determines the network nodes respectively included in the multiple packets according to the row vectors of the multiple clusters.

In this implementation manner, a grouping process in which the first AP groups the STAs connected to the first AP and the first AP in the distributed network management system is shown, which provides a specific implementation manner for the implementation of the solution and improves the solution. feasibility and diversity.

In another possible implementation manner, the first AP is based on the p-th row vector of the channel matrix W, the p+K-th main diagonal element b _p of the first intermediate matrix D, and the first intermediate matrix D The first K main diagonal elements in determine the first K row vectors and the K+pth row vector of the sixth intermediate matrix Q, including:

The first AP is based on the p-th column vector of the channel matrix W, the p+K-th main diagonal element b _p of the first intermediate matrix D, and the first K main diagonals in the first intermediate matrix D The elements determine the p-th row vector of the third intermediate matrix R

the second intermediate matrix

The W ^T is the W transpose;

The first AP is based on the stochastic gradient descent algorithm and the p-th row vector of the third intermediate matrix R

Determine the p row vectors of the first matrix X _M and the second matrix Y _M , the degree of approximation between the first matrix X _M and the third matrix is greater than or equal to the first preset threshold, and the second matrix Y _M and the fourth matrix The degree of approximation is greater than or equal to the second preset threshold;

Wherein, the third matrix is a matrix obtained by selecting M column vectors from the left singular matrix obtained by singular value decomposition of the third intermediate matrix R, and each column vector in the left singular matrix has a corresponding singular value, The M column vectors of the third matrix are M column vectors selected from the left singular matrix in descending order according to the size of the singular values;

The fourth matrix is a matrix obtained by selecting M column vectors from the right singular matrix obtained by singular value decomposition of the third intermediate matrix R. Each column vector in the right singular matrix has a corresponding singular value, and the The M column vectors of the fourth matrix are the M column vectors selected from the right singular matrix in descending order of singular values;

The M is an integer greater than or equal to log ₂ (K+L) and less than or equal to min(K, L), the log ₂ (K+L) refers to the logarithm of K+L with the base 2, the min( K, L) refers to taking the minimum value of K and L;

The first AP is based on the _p +K th main diagonal element bp of the first intermediate matrix D, the first K main diagonal elements in the first intermediate matrix D, and the p th element of the first matrix X _M row vectors and the second matrix Y _M are calculated to obtain the sixth intermediate matrix

The first K row vector and the K+pth row vector of .

In this possible implementation, a specific implementation process for determining the first K row vectors and the K+p th row vector of the sixth intermediate matrix Q by the first AP is provided, because the first K row vectors of the sixth intermediate matrix Q correspond to the first K row vectors respectively. The STA of a network and the K+p th row vector correspond to the first AP, which facilitates the subsequent first AP to cluster the row vectors corresponding to the first AP and the STA connected to the first AP, so as to realize the first AP to the th row vector. A grouping of APs and STAs connected to the first AP.

In another possible implementation manner, the first AP performs clustering on the target row vector according to a clustering algorithm to obtain a second clustering result, including: the first AP generates a first cluster center according to a first random seed, The first clustering center includes clustering centers corresponding to the multiple clusters, and each cluster corresponds to a clustering center; the first AP determines, according to the first clustering center, to which each row vector in the target row vector belongs the clusters, obtain the row vector included in each cluster in the multiple clusters; the first AP determines the network nodes respectively included in the multiple groups according to the row vectors of the multiple clusters, including: when the first preset condition is satisfied , the first AP divides the network nodes corresponding to the row vector of the same cluster in the multiple clusters into the same group.

In this possible implementation manner, the clustering process of the target row vector by the first AP according to the clustering algorithm is provided, which improves the implementability of the solution.

In another possible implementation manner, when the first preset condition is not satisfied, the method further includes:

The first AP calculates the first average vector corresponding to the row vector of each cluster in the multiple clusters according to the gossip protocol; the first AP calculates the first average vector of the row vector of each cluster in the multiple clusters as the The cluster centers corresponding to a plurality of clusters, respectively, obtain the second cluster center; the first AP determines the cluster to which each row vector in the target row vector belongs according to the second cluster center; when the second preset is satisfied When conditions are met, the first AP divides the network nodes corresponding to the row vector of the same cluster in the multiple clusters into the same group.

In this possible implementation, it is provided that when the first preset condition is not satisfied, the first AP clusters the target row vector again according to the clustering algorithm, so as to realize the grouping of the first AP and the STAs connected to the first AP. .

In another possible implementation manner, the first preset condition includes:

The update times of the cluster centers of the clusters corresponding to the multiple groups respectively is greater than or equal to the third preset threshold.

In this possible implementation manner, the first preset condition may be set as the number of iterations of the foregoing clustering, that is, the number of updates of the cluster centers corresponding to the multiple clusters respectively.

In another possible implementation manner, the first preset condition includes:

The first convergence accuracy is less than or equal to the preset convergence accuracy;

Wherein, the first convergence accuracy is the ratio of the absolute value of the first difference to the first global error, and the first difference is the difference between the first global error and a preset initialization error;

The first global error is the sum of the first local errors calculated respectively by all APs in the first network;

The first local error of the first AP includes a sum of errors corresponding to each of the multiple clusters determined by the first AP;

The error corresponding to each cluster is the sum of the errors between the row vector included in each cluster and the first average vector corresponding to each cluster, and the first average vector corresponding to each cluster is the first AP Calculated according to the gossip protocol.

In this possible implementation manner, another first preset condition is provided. Since the first AP does not have the global interference information of the first network, the first AP can obtain the first local errors of other APs through the gossip protocol, and The first global error is determined by the first local errors of all APs, and the first convergence accuracy is determined according to the first global error and the preset initialization error, that is, the first convergence accuracy is equal to the difference between the first global error and the preset initialization error The absolute value of the difference. The first AP then compares the first convergence accuracy with the preset convergence accuracy, and if it is less than or equal to the preset convergence accuracy, the first AP can determine that the clustering iteration on the target row vector reaches the convergence degree, so that the first The AP divides the multiple groups according to the row vectors of the multiple clusters, so that the degree of signal interference between the sub-networks formed corresponding to each group in the multiple groups is relatively small, and the effective strength within the sub-network is relatively large.

In another possible implementation manner, the first AP adjusts the STA connected to the first AP according to the group to which the first AP belongs, including: the first AP sending information of the group to which the first AP belongs, the first AP The information of the group to which the AP belongs is used by the STA in the first network to determine whether to access the first AP.

In this possible implementation manner, a specific adjustment manner in which the first AP adjusts the STA connected to the first AP according to the group to which the first AP belongs is provided. That is, the STA determines whether to connect to the first AP according to the received information of the group to which the first AP belongs, so as to implement connection management and planning for the STA connected to the first AP.

In another possible implementation manner, the information of the group to which the first AP belongs includes a first group number of the group to which the first AP belongs; the first AP sends the information of the group to which the first AP belongs, including: the The first AP sends a first beacon frame, where the first beacon frame carries the first group number.

In this possible implementation, a method is provided in which the first AP carries the group number of the group to which the first AP belongs through the beacon frame of the first AP, so that the STA of the first network can determine whether to use the beacon frame. Connect to the first AP.

In another possible implementation manner, the first AP adjusts the STA connected to the first AP according to the group to which the first AP belongs, including:

The first AP determines whether the second STA that has established a connection with the first AP belongs to the same group;

If so, the first AP keeps providing services for the second STA;

If not, the first AP determines the group to which the second STA belongs, and sends the first indication information to the third AP;

The first indication information is used to indicate that the third AP provides services for the second STA, and the third AP and the second STA belong to the same group.

In this possible implementation, another implementation is provided in which the first AP adjusts the STA connected to the first AP according to the group to which the first AP belongs. Whether the two STAs belong to the same group, if not, the first AP can send indication information to a third AP that belongs to the same group as the second STA, and the third AP provides services for the second STA, thereby realizing the Connection management and planning for STAs connected to an AP. Moreover, this implementation is transparent to the STA, and the STA is not aware of it, so that the improvement to the STA can be avoided.

In another possible implementation manner, the method further includes: receiving, by the first AP, first grouping information sent by a fourth AP, where the first grouping information includes grouping information to which the fourth AP belongs and an identifier of the fourth AP , the fourth AP includes APs other than the first AP in the first network; the first AP determines according to the first group information that the fifth AP and the first AP belong to the same group, and the fifth AP is the Some APs in the fourth AP; the first AP judges whether the priority of the first AP is higher than that of the fifth AP according to the identification of the fifth AP, the identification of the first AP and the preset AP priority rule Priority; if the priority of the first AP is higher than the priority of the fifth AP, the first AP selects the first channel by scanning channels, and adjusts the channel accessed by the first AP to the first channel ; The first AP sends first channel allocation information to the fifth AP, where the first channel allocation information is used to instruct the fifth AP to access the first channel.

In this possible implementation, in a distributed network management system, the first AP allocates information in the same group and notifies the channel allocation information of multiple APs in the same group, so as to realize multi-AP joint transmission to improve network throughput and network transmission performance.

In another possible implementation manner, if the priority of the first AP is lower than the priority of the fifth AP, the method further includes: the first AP receives the second channel allocation information sent by the sixth AP, and the second The channel allocation information is information of the second channel selected by the sixth AP, and the sixth AP is the AP with the highest priority in the fifth AP; the first AP accesses the first AP according to the second channel allocation information The channel is adjusted to the second channel.

In this possible implementation, in a distributed network management system, a process of selecting a channel by other APs in the same group and notifying the first AP of the channel allocation information is provided, so that the first AP can adjust the access channel , so as to realize multi-AP joint transmission to improve network throughput and network transmission performance.

A second aspect of the embodiments of the present application provides a network management method, where the network management method includes:

The control device sends first channel parameter information to the server, where the first channel parameter information includes channel parameter information between each AP in all APs of the first network and the STAs within the signal coverage of each AP, the first channel parameter information The network is a network controlled by the control device; the control device receives grouping results of multiple groups from the server, and the multiple groups include all STAs and all APs in the first network; the control device determines the multiple groups according to the grouping results APs and STAs included in each group; the control device sends second grouping information, where the second grouping information includes information about groups to which APs of the first network belong respectively and information about groups to which STAs of the first network belong respectively .

In this embodiment, in the centralized network management system, the control device collects the global interference information in the first network, reports it to the server, and then receives the grouping results of multiple packets sent by the server, and then the control device sends the multiple packets. The grouping information of each group is convenient for the AP of the first network to adjust the connected STAs according to the grouping information, so as to realize the management and planning of the STAs connected to the AP. Since the multiple groups are divided by the server according to the first channel parameter information, implementing the management and planning of the STAs connected to the AP through the solutions in the embodiments of the present application can reduce interference between user equipments, thereby improving the performance of network transmission .

In another possible implementation manner, the method further includes: the control device assigns the same channel to APs in the same group in the multiple groups; the control device sending the second grouping information includes: the control device sending the second group information Grouping information, the second grouping information includes channel allocation information corresponding to the multiple groups respectively.

In this possible implementation, the control device can further allocate the same channel to the APs in the same group, so that the APs in the same group can access the same channel, thereby realizing multi-AP joint transmission and improving network throughput and network transmission performance.

In another possible implementation manner, the control device assigns the same channel to the APs in the same group in the multiple groups, including: the control device assigns the AP of each group in the multiple groups according to the first channel parameter information Corresponding channels are allocated, wherein the channels allocated by the control device to APs in the same group are the same.

In this possible implementation manner, the control device may allocate channels to APs in the same group in combination with the first channel parameter information, so that the allocated channels conform to the current channel state, thereby improving network transmission performance.

A third aspect of the embodiments of the present application provides a network management method, where the network management method includes:

The second AP sends second channel parameter information to the control device, where the second channel parameter information includes channel parameter information between the second AP and STAs within the signal coverage of the second AP; the second AP receives the control The second grouping information sent by the device, the second grouping information includes the information of the groups to which the APs of the first network belong respectively and the information of the groups to which the STAs of the first network belong respectively; the second AP according to the second grouping information Determine the group to which the second AP belongs; the second AP adjusts the STA connected to the second AP according to the group to which the second AP belongs.

In this embodiment, the second AP acquires the second channel parameter information and sends it to the control device; then, the control device sends the second grouping information to the second AP, and the second AP adjusts the second grouping information according to the second grouping information The STA connected to the AP, thereby implementing the connection management and planning of the STA connected to the second AP by the second AP. In addition, since the multiple groups are divided by the server according to the first channel parameter information, implementing the management and planning of the STAs connected to the AP through the solutions in the embodiments of the present application can reduce interference between user equipments, thereby improving network transmission. performance.

In a possible implementation manner, the second grouping information further includes third channel assignment information, where the third channel assignment information includes information about a third channel assigned by the control device to the second AP; the method further includes:

The second AP adjusts the channel accessed by the second AP to the third channel according to the third channel allocation information.

In this possible implementation manner, the second AP can adjust the channel accessed by the second AP according to the information of the third channel allocated by the control device, so that multiple APs in the same group can access the same channel, so as to realize multiple AP joint transmission to improve network throughput.

In another possible implementation manner, the second AP adjusts the STA connected to the second AP according to the group to which the second AP belongs, including: the second AP sends information of the group to which the second AP belongs, and the second AP sends the information of the group to which the second AP belongs. The information of the group to which the AP belongs is used to instruct the STA in the first network to determine whether to access the second AP, where the first network is a network controlled by the control device.

In this possible implementation manner, a management and planning for the second AP to adjust the STA connected to the second AP is provided.

In another possible implementation manner, the information of the group to which the second AP belongs includes a second group number of the group to which the second AP belongs; the second AP sends the information of the group to which the second AP belongs, including:

The second AP sends a second beacon frame, where the second beacon frame carries the second group number.

In this possible implementation manner, the second AP may carry the second group number through a beacon frame to notify the STA in the first network and other APs of the group to which the second AP belongs, so that STAs in the same group are connected to on the second AP.

In another possible implementation manner, the second AP adjusts the STA connected to the second AP according to the group to which the second AP belongs, including: the second AP determining the STA included in the group to which the second AP belongs; the The second AP determines whether the second AP and the third STA belong to the same group, and the third STA is a STA that has established a connection with the second AP; if so, the second AP keeps providing services for the third STA; if If no, the second AP determines the seventh AP according to the group to which the third STA belongs, and sends third indication information to the seventh AP; wherein the third indication information is used to indicate that the seventh AP is the third AP The STA provides services, and the seventh AP and the third STA belong to the same group.

In this possible implementation, another implementation is provided in which the second AP adjusts the STA connected to the second AP according to the group to which the second AP belongs. Whether the three STAs belong to the same group, if not, the second AP may send indication information to the seventh AP that belongs to the same group as the third STA, and the seventh AP provides services for the third STA, thereby realizing the Connection management and planning of STAs connected to two APs. Moreover, this implementation is transparent to the STA, and the STA is not aware of it, so that the improvement to the STA can be avoided.

A fourth aspect of the embodiments of the present application provides a network management method, where the network management method includes:

The fourth STA receives the information of the group to which the second AP belongs and sent by the second AP; then, the fourth STA determines that the second AP and the fourth STA belong to the same group according to the information of the group to which the second AP belongs; the fourth STA The connected AP is adjusted to the second AP.

In this possible implementation manner, the fourth STA determines that the second AP and the fourth STA belong to the same group according to the information of the group to which the second AP belongs and the group to which the fourth STA belongs, and adjusts the AP to which the fourth STA is connected It is the second AP, so as to realize the connection management and planning of the STA connected to the AP. In addition, since the multiple groups are divided by the server according to the first channel parameter information, implementing the management and planning of the STAs connected to the AP through the solutions in the embodiments of the present application can reduce interference between user equipments, thereby improving network transmission. performance.

In a possible implementation manner, the information of the group to which the second AP belongs includes a second group number of the group to which the second AP belongs; the fourth STA receives the information of the group to which the second AP belongs sent by the second AP, include:

The fourth STA receives a second beacon frame sent by the second AP, where the first beacon frame carries the second group number;

The fourth STA determines that the second AP and the fourth STA belong to the same group according to the second group number;

If the second group number is consistent with the group number of the group to which the fourth STA belongs, the fourth STA determines that the second AP and the fourth STA belong to the same group.

In this possible implementation manner, a manner is provided in which the fourth STA determines the group to which the second AP belongs by receiving the second beacon frame of the second AP, and according to the group to which the second AP belongs and the group to which the fourth STA belongs The group determines whether to connect the second AP.

In another possible implementation manner, the method further includes:

The fourth STA receives the information of the group to which the fourth STA belongs and is sent by the eighth AP, where the eighth AP is the AP connected before the fourth STA adjusts the connection.

In this possible implementation manner, the fourth STA first obtains the information of the group to which the fourth STA belongs. Specifically, the eighth AP that belongs to the same group as the fourth STA may obtain the information of the group to which the fourth STA belongs.

A fifth aspect of the embodiments of the present application provides a network management system, where the network management system includes a server, a control device, a second AP, and a fourth STA;

The second AP is used to send the second channel parameter information to the control device;

The control device is configured to receive second channel parameter information sent by a second AP; send first channel parameter information to a server, where the first channel parameter information includes each AP and each AP in all APs of the first network Channel parameter information between STAs within the signal coverage range;

The server is configured to receive first channel parameter information sent by the control device; group all APs of the first network and all STAs of the first network according to the first channel parameter information to obtain multiple groups; send the first channel parameter information to the control device Grouping results of multiple groups, where the grouping results are used to indicate APs and STAs included in each of the multiple groups;

The control device is configured to receive grouping results of the multiple groups; determine APs and STAs included in each of the multiple groups according to the grouping results; send second grouping information, where the second grouping information includes information about the first network Information about the groups to which the APs belong respectively and information about the groups to which the STAs of the first network belong respectively;

The second AP is further configured to determine the group to which the second AP belongs according to the second group information, and adjust the STA connected to the second AP according to the group to which the second AP belongs.

In a possible implementation manner, the first channel parameter information includes a channel matrix W, where the channel matrix W is a matrix of K rows multiplied by L columns, K is the number of STAs included in the first network, and L is the first network. The number of APs included, the channel matrix

w _ij is the channel gain between the i-th STA and the j-th AP, i is an integer greater than or equal to 1 and less than or equal to K, j is an integer greater than or equal to 1 and less than or equal to L, the server uses At:

According to the channel matrix W, a first intermediate matrix D is obtained, and the first intermediate matrix

D ₁ is a matrix with K rows by K columns,

The element b _j on the main diagonal of D ₂ is the sum of the channel gains between the jth AP in the first network and all STAs in the first network, and 0 _K×L is K rows multiplied by For a matrix of L columns, the elements in 0 _K×L are all zero, and 0 _L×K is a matrix of L rows multiplied by K columns, and the elements in 0 _L×K are all zero; according to the channel matrix W and the first The intermediate matrix D determines a second intermediate matrix, each row vector in the second intermediate matrix corresponds to a network node, and the network node is the STA or AP in the first network; The row vector is clustered to obtain a first clustering result, where the first clustering result includes row vectors of multiple clusters, and one of the multiple clusters corresponds to one of the multiple groups; according to the multiple clusters The row vector of determines the network nodes respectively included in the plurality of packets.

In another possible implementation, the server is specifically used for:

The server determines a third intermediate matrix R according to the channel matrix W and the first intermediate matrix D,

W ^T is the transpose of W; perform singular value decomposition on the third intermediate matrix R to obtain the left singular matrix of the third intermediate matrix R and the right singular matrix of the third intermediate matrix R; wherein, the third intermediate matrix R=UΣV ^T , the Σ is a diagonal matrix, and the V ^T is the transpose of the right singular matrix V; the corresponding main diagonal element on the rth column vector of the diagonal matrix Σ is the left singular matrix U The singular value corresponding to the rth column vector, the corresponding main diagonal element on the rth column vector of the diagonal matrix Σ is the singular value corresponding to the rth column vector of the right singular matrix V, and r is greater than or equal to 1 and less than or an integer equal to min(K, L), min(K, L) refers to the minimum value between K and L; select from the left singular matrix U in descending order of the singular values in the diagonal matrix Σ The corresponding M column vectors are obtained to obtain the fourth intermediate matrix U _M , and the corresponding M column vectors are selected from the right singular matrix V according to the size order of the singular values in the diagonal matrix Σ, and the fifth intermediate matrix is obtained. Matrix V _M , where M is an integer greater than or equal to log ₂ (K+L) and less than or equal to min(K, L), and log ₂ (K+L) refers to the logarithm of K+L with the base 2; according to The fourth intermediate matrix, the fifth intermediate matrix and the first intermediate matrix are calculated to obtain the second intermediate matrix Z, the

In another possible implementation, the server is specifically used for:

According to the clustering algorithm, the second intermediate matrix

The included K+L row vectors are clustered to obtain row vectors of multiple clusters, and one of the multiple clusters corresponds to one of the multiple groups;

The network nodes corresponding to the row vector of the same cluster in the row vectors of multiple clusters are divided into the same group.

In another possible implementation manner, the control device is also used for:

Allocate the same channel for APs in the same group in the multiple groups;

The control device is specifically used for:

sending the second grouping information to the second AP, where the second grouping information includes third channel allocation information, and the third channel allocation information includes information about the third channel allocated by the control device to the second AP;

The second AP is also used to:

The channel accessed by the second AP is adjusted to the third channel according to the third channel allocation information included in the second grouping information.

In another possible implementation manner, the control device is specifically used for:

According to the first channel parameter information, a corresponding channel is allocated to APs in each group of the multiple groups, wherein the channels allocated by the control device to APs in the same group are the same.

In another possible implementation manner, the second AP is specifically used for:

The information of the group to which the second AP belongs is sent, where the information of the group to which the second AP belongs is used to instruct the STA in the first network to determine whether to access the second AP, and the first network is a network controlled by the control device.

The fourth STA is used to receive the information of the group to which the second AP belongs and sent by the second AP; determine that the second AP and the fourth STA belong to the same group according to the information of the group to which the second AP belongs; adjust the AP to which it is connected is the second AP.

The second AP sends a second beacon frame, where the first beacon frame carries the second group number of the group to which the second AP belongs;

The fourth STA is specifically used for:

Determine according to the second group number that the second AP and the fourth STA belong to the same group;

If the second group number is consistent with the group number of the group to which the fourth STA belongs, it is determined that the second AP and the fourth STA belong to the same group.

In another possible implementation manner, the fourth STA is also used for:

Receive the information of the group to which the fourth STA belongs and is sent by the eighth AP, where the eighth AP is the AP connected before the fourth STA adjusts the connection.

determining the STA included in the group to which the second AP belongs;

Determine whether the second AP and the third STA belong to the same group, and the third STA is a STA that has established a connection with the second AP;

If so, keep serving the third STA;

If not, determine a seventh AP according to the group to which the third STA belongs, and send third indication information to the seventh AP; wherein the third indication information is used to instruct the seventh AP to provide services for the third STA , the seventh AP and the third STA belong to the same group.

A sixth aspect of the embodiments of the present application provides a network management system, where the network management system includes a first AP and a first STA;

The first AP is used to acquire first channel parameter information, where the first channel parameter information includes channel parameter information between the first AP in the first network and the STAs within the signal coverage of the first AP; according to the The first channel parameter information groups the first AP and the first STA to obtain multiple groups, and the first STA includes the STA within the signal coverage of the first AP and having established a connection with the first AP; sending the Grouping results of multiple groups, where the grouping results are used to indicate APs and STAs included in each of the multiple groups; adjust the STAs connected to the first AP according to the group to which the first AP belongs.

In a possible implementation manner, the first AP is the pth AP in the first network, and the first channel parameter information includes the pth column vector of the channel matrix W, and the channel matrix

w _ij is the channel gain between the ith STA and the jth AP, i is an integer greater than or equal to 1 and less than or equal to K, j is an integer greater than or equal to 1 and less than or equal to L, p is less than or equal to is an integer equal to the L, where L is the number of APs included in the first network, and K is the number of STAs included in the first network; the first AP is specifically used for:

According to the p-th column vector of the channel matrix W, the p+K-th main diagonal element b _p of the first intermediate matrix D is obtained;

Among them, the first intermediate matrix

The D ₁ is a matrix of K rows by K columns, the

Obtain the first K main diagonal elements of the first intermediate matrix D;

According to the p-th column vector of the channel matrix W, the p+K-th main diagonal element b _p of the first intermediate matrix D, and the first K main diagonal elements of the first intermediate matrix D, determine the sixth The first K row vectors and the K+pth row vector of the intermediate matrix Q, each row vector of the sixth intermediate matrix Q corresponds to a network node, and the network node is an AP or STA in the first network, and the sixth intermediate matrix Q corresponds to a network node. The i-th row vector of the matrix Q is the row vector corresponding to the i-th STA, and the K+j-th row vector of the sixth intermediate matrix Q is the row vector corresponding to the j-th AP;

The target row vector is clustered according to the clustering algorithm to obtain a second clustering result; wherein, the target row vector includes the K+pth row vector corresponding to the first AP and the sixth intermediate matrix Q The row vector corresponding to the first STA in the first K row vectors of , the second clustering result includes row vectors of multiple clusters, and one cluster in the multiple clusters corresponds to a grouping of the multiple groupings;

The network nodes respectively included in the plurality of groups are determined according to the row vectors of the plurality of clusters.

In another possible implementation manner, the first AP is specifically used for:

_Determine the third the p-th row vector of the intermediate matrix R

the second intermediate matrix

The W ^T is the W transpose;

According to the stochastic gradient descent algorithm and the p-th row vector of the third intermediate matrix R

According to the p+K th main diagonal element b _p of the first intermediate matrix D, the first K main diagonal elements in the first intermediate matrix D, the p th row vector sum of the first matrix X _M The second matrix Y _M is calculated to obtain the sixth intermediate matrix

The first K row vector and the K+pth row vector of .

Generate a first cluster center according to the first random seed, the first cluster center includes the cluster centers corresponding to the multiple clusters respectively, and each cluster corresponds to a cluster center;

Determine the cluster to which each row vector in the target row vector belongs according to the first cluster center, and obtain the row vector included in each cluster in the multiple clusters;

Determining the network nodes respectively included in the multiple groups according to the row vectors of the multiple clusters includes: when a first preset condition is satisfied, the first AP divides the network nodes corresponding to the row vectors of the same cluster in the multiple clusters into the same group.

In another possible implementation manner, when the first preset condition is not met, the first AP is further used for:

Calculate the first average vector corresponding to the row vector of each cluster in the multiple clusters according to the gossip protocol;

Taking the first average vector of the row vectors of each cluster in the multiple clusters as the cluster centers corresponding to the multiple clusters, respectively, to obtain the second cluster center;

The cluster to which each row vector in the target row vector belongs is determined according to the second cluster center; when the second preset condition is satisfied, the first AP determines the network corresponding to the row vector of the same cluster in the multiple clusters Nodes are grouped into the same group.

In another possible implementation manner, the first preset condition includes:

Sending information about the group to which the first AP belongs, where the information about the group to which the first AP belongs is used for the STA in the first network to determine whether to access the first AP;

The network management system further includes a fifth STA, and the fifth STA does not establish a connection with the first AP;

Determine that the first AP and the fifth STA belong to the same group according to the information of the group to which the first AP belongs and the group to which the fifth STA belongs;

The fifth STA adjusts the AP connected to the fifth STA to the first AP.

In another possible implementation manner, the information of the group to which the first AP belongs includes a first group number of the group to which the first AP belongs; the first AP is specifically used for:

sending a first beacon frame, where the first beacon frame carries the first group number;

The fifth STA is specifically used for:

determining the first group number of the group to which the first AP belongs according to the first beacon frame;

The fifth STA determines that the first AP and the fifth STA belong to the same group according to the first group number and the group number to which the fifth STA belongs.

In another possible implementation manner, the network management system further includes a second STA; the first AP is specifically used for:

Determine whether the second STA that has established a connection with the first AP belongs to the same group;

If so, keep serving the second STA;

If not, determine the group to which the second STA belongs, and send the first indication information to the third AP;

In another possible implementation manner, the network management system further includes a fifth AP; the first AP is further used for:

Receive first grouping information sent by a fourth AP, where the first grouping information includes grouping information to which the fourth AP belongs and an identifier of the fourth AP, where the fourth AP includes elements other than the first AP in the first network AP;

According to the first group information, it is determined that the fifth AP and the first AP belong to the same group, and the fifth AP is a part of the AP in the fourth AP; the first AP The identification and the preset AP priority rule determine whether the priority of the first AP is higher than the priority of the fifth AP;

If the priority of the first AP is higher than the priority of the fifth AP, selecting the first channel by scanning channels, and adjusting the channel accessed by the first AP to the first channel;

sending first channel allocation information to the fifth AP, where the first channel allocation information is used to instruct the fifth AP to access the first channel;

The fifth AP is configured to determine the first channel according to the first channel allocation information, and adjust the channel accessed by the fifth AP to the first channel.

In another possible implementation manner, the first AP is also used for:

If the priority of the first AP is lower than the priority of the fifth AP, the second channel allocation information sent by the sixth AP is received, and the second channel allocation information is the information of the second channel selected by the sixth AP, and the second channel allocation information is sent by the sixth AP. Six APs are the APs with the highest priority among the fifth APs;

The channel accessed by the first AP is adjusted to the second channel according to the second channel allocation information.

A seventh aspect of an embodiment of the present application provides a first communication device, where the first communication device includes:

a transceiver module, configured to acquire first channel parameter information, where the first channel parameter information includes channel parameter information between the first AP in the first network and the STAs within the signal coverage of the first AP;

a grouping module, configured to group the first AP and the first STA according to the first channel parameter information to obtain multiple groups, where the first STA includes part or all of the STAs within the signal coverage of the first AP STA;

The transceiver module is configured to send grouping results of the multiple groups, where the grouping results are used to indicate APs and STAs included in each of the multiple groups.

In a possible implementation manner, the communication device is a server, the first AP includes all APs of the first network, and the first STA includes all STAs of the first network; the transceiver module is specifically configured to:

Receive the first channel parameter information sent by the control device, where the first channel parameter information includes channel parameter information between each AP in all APs of the first network and the STAs within the signal coverage of each AP, the The first network is a network controlled by the control device;

The transceiver module is specifically used for:

The grouping results of the plurality of groups are sent to the control device.

w _ij is the channel gain between the ith STA and the jth AP, i is an integer greater than or equal to 1 and less than or equal to K, j is an integer greater than or equal to 1 and less than or equal to L;

This grouping module is specifically used for:

D ₁ is a matrix with K rows by K columns,

The element b _j on the main diagonal of D ₂ is the sum of the channel gains between the jth AP in the first network and all STAs in the first network, and 0 _K×L is K rows multiplied by For a matrix of L columns, the elements in 0 _K×L are all zero, and 0 _L×K is a matrix of L rows multiplied by K columns, and the elements in 0 _L×K are all zero;

Determine a second intermediate matrix according to the channel matrix W and the first intermediate matrix D, each row vector in the second intermediate matrix corresponds to a network node, and the network node is an STA or an AP in the first network;

The row vectors of the second intermediate matrix are clustered according to a clustering algorithm, and a first clustering result is obtained. The first clustering result includes row vectors of multiple clusters, and one of the multiple clusters corresponds to the multiple clusters. a group within a group;

In another possible implementation manner, the grouping module is specifically used for:

Determine the third intermediate matrix R according to the channel matrix W and the first intermediate matrix D,

W ^T is the transpose of W;

Perform singular value decomposition on the third intermediate matrix R to obtain the left singular matrix of the third intermediate matrix R and the right singular matrix of the third intermediate matrix R; wherein, the third intermediate matrix R=UΣV ^T , and the Σ is Diagonal matrix, the V ^T is the transpose of the right singular matrix V;

The main diagonal element corresponding to the rth column vector of the diagonal matrix Σ is the singular value corresponding to the rth column vector of the left singular matrix U, and the corresponding main diagonal element on the rth column vector of the diagonal matrix Σ The line element is the singular value corresponding to the rth column vector of the right singular matrix V, where r is an integer greater than or equal to 1 and less than or equal to min(K, L), which refers to the K and the The minimum value in L;

Select corresponding M column vectors from the left singular matrix U in descending order of the singular values in the diagonal matrix Σ to obtain a fourth intermediate matrix U _M , and according to the singular values in the diagonal matrix Σ Select the corresponding M column vectors from the right singular matrix V in order of size to obtain a fifth intermediate matrix V _M , where M is greater than or equal to log ₂ (K+L) and less than or equal to min(K, L ), the log ₂ (K+L) refers to the logarithm of K+L with the base 2;

The second intermediate matrix Z is calculated and obtained according to the fourth intermediate matrix, the fifth intermediate matrix and the first intermediate matrix, and the

According to the clustering algorithm, the second intermediate matrix

In another possible implementation manner, the communication device is the first AP, and the first STA includes a STA that has established a connection with the first AP within the signal coverage of the first AP; the first AP further includes a packet Management module, the group management module is used for:

Adjust the STA connected to the first AP according to the group to which the first AP belongs.

In another possible implementation manner, the communication device is the pth AP in the first network, and the first channel parameter information includes the pth column vector of the channel matrix W, and the channel matrix

w _ij is the channel gain between the ith STA and the jth AP, i is an integer greater than or equal to 1 and less than or equal to K, j is an integer greater than or equal to 1 and less than or equal to L, and p is less than or equal to 1 or an integer equal to the L, where L is the number of APs included in the first network, and K is the number of STAs included in the first network;

This grouping module is specifically used for:

Among them, the first intermediate matrix

The D ₁ is a matrix of K rows by K columns, the

The element a _i on the main diagonal of the D ₁ is the sum of the channel gains between the i-th STA in the first network and all APs in the first network, and the off-diagonal line of the D ₁ The elements of are all zero; the D ₂ is a matrix of L rows by L columns, the

The element b _j _on the main diagonal of the D2 is the sum of the channel gains between the jth AP in the first network and all STAs in the first network, 0 _K×L is multiplied by the L column , the elements in 0 _K×L are all zero, 0 _L×K is a matrix of L rows by K columns, and the elements in 0 _L×K are all zero;

Obtain the first K main diagonal elements of the first intermediate matrix D;

According to the clustering algorithm, the target row vector is clustered to obtain the second clustering result;

Wherein, the target row vector includes the K+p th row vector corresponding to the first AP and the row vector corresponding to the first STA among the first K row vectors of the sixth intermediate matrix Q, the The second clustering result includes row vectors of multiple clusters, one of the multiple clusters corresponds to one group of the multiple groups;

_Determine the third the p-th row vector of the intermediate matrix R

the second intermediate matrix

the W ^T is the W transpose;

According to the stochastic gradient descent algorithm and the p-th row vector of this third intermediate matrix R

The M is an integer greater than or equal to log ₂ (K+L) and less than or equal to min(K, L), the log ₂ (K+L) refers to the logarithm of K+L with the base 2, the min( K, L) refers to the minimum value in this K and this L;

The first K row vector and the K+pth row vector of .

When the first preset condition is satisfied, the network nodes corresponding to the row vector of the same cluster in the multiple clusters are divided into the same group.

In another possible implementation manner, when the first preset condition is not met, the grouping module is further configured to:

Determine the cluster to which each row vector in the target row vector belongs according to the second cluster center;

When the second preset condition is satisfied, the network nodes corresponding to the row vector of the same cluster in the multiple clusters are divided into the same group.

In another possible implementation manner, the first preset condition includes:

In another possible implementation manner, the group management module sends the information of the group to which the first AP belongs through the transceiver module, and the information of the group to which the first AP belongs is used for the STA in the first network to determine whether to access or not First AP.

In another possible implementation manner, the information of the group to which the first AP belongs includes a first group number of the group to which the first AP belongs; the group management module sends a first beacon frame through the transceiver module, and the first beacon frame is sent by the group management module. The beacon frame carries the first packet number.

In another possible implementation manner, the group management module is specifically used for:

If so, keep providing services for the second STA;

In another possible implementation manner, the transceiver module is also used for:

The group management module is also used to:

It is determined according to the first grouping information that the fifth AP and the first AP belong to the same group, and the fifth AP is a part of the APs in the fourth AP;

Determine whether the priority of the first AP is higher than the priority of the fifth AP according to the identity of the fifth AP, the identity of the first AP and the preset AP priority rule;

The transceiver module is also used to:

Send first channel allocation information to the fifth AP, where the first channel allocation information is used to instruct the fifth AP to access the first channel.

In another possible implementation manner, if the priority of the first AP is lower than the priority of the fifth AP, the transceiver module is further configured to:

receiving the second channel allocation information sent by the sixth AP, where the second channel allocation information is the information of the second channel selected by the sixth AP, and the sixth AP is the AP with the highest priority in the fifth AP;

The group management module is also used to:

An eighth aspect of the embodiments of the present application provides a control device, where the control device includes:

a transceiver module, configured to send first channel parameter information to the server, where the first channel parameter information includes channel parameter information between each AP in all APs of the first network and the STAs within the signal coverage of each AP, The first network is a network controlled by the control device; receiving grouping results of multiple groups from the server, where the multiple groups include all STAs and all APs in the first network;

a grouping management module, configured to determine APs and STAs included in each of the multiple groups according to the grouping result;

The transceiver module is further configured to send second grouping information, where the second grouping information includes information about groups to which APs of the first network respectively belong and information about groups to which STAs of the first network respectively belong.

In a possible implementation manner, the group management module is further used for:

Allocate the same channel for APs in the same group in the multiple groups;

The transceiver module is specifically used for:

Send the second grouping information, where the second grouping information includes channel allocation information corresponding to the multiple groups respectively.

In another possible implementation manner, the group management module is also used for:

A ninth aspect of the embodiments of the present application provides a second AP, where the second AP includes:

a transceiver module, configured to send second channel parameter information to the control device, where the second channel parameter information includes the channel parameter information between the second AP and the STAs within the signal coverage of the second AP; receive the transmission from the control device The second grouping information, the second grouping information includes the information of the groups to which the APs of the first network belong respectively and the information of the groups to which the STAs of the first network belong respectively;

The group management module is configured to determine the group to which the second AP belongs according to the second group information; and adjust the STA connected to the second AP according to the group to which the second AP belongs.

In a possible implementation manner, the second grouping information further includes third channel assignment information, and the third channel assignment information includes information about the third channel assigned by the control device to the second AP; the grouping management module also uses At:

The channel accessed by the second AP is adjusted to the third channel according to the third channel allocation information.

In another possible implementation manner, the group management module sends the information of the group to which the second AP belongs through the transceiver module, and the information of the group to which the second AP belongs is used to instruct the STA in the first network to determine whether to access or not The second AP and the first network are networks controlled by the control device.

In another possible implementation manner, the information of the group to which the second AP belongs includes a second group number of the group to which the second AP belongs;

The group management module sends a second beacon frame through the transceiver module, and the second beacon frame carries the second group number.

determining the STA included in the group to which the second AP belongs;

If so, keep serving the third STA;

If not, determine a seventh AP according to the group to which the third STA belongs, and send third indication information to the seventh AP;

The third indication information is used to indicate that the seventh AP provides services for the third STA, and the seventh AP and the third STA belong to the same group.

A tenth aspect of the embodiments of the present application provides a fourth STA, where the fourth STA includes:

a transceiver module, configured to receive information sent by the second AP of the grouping to which the second AP belongs;

A grouping management module, configured to determine that the second AP and the fourth STA belong to a group according to the information of the group to which the second AP belongs; and adjust the connected AP to be the second AP.

In a possible implementation manner, the information of the group to which the second AP belongs includes the second group number of the group to which the second AP belongs; the transceiver module is specifically used for:

receiving a second beacon frame sent by the second AP, where the first beacon frame carries the second group number;

The group management module is specifically used for:

An eleventh aspect of the present application provides a communication device, where the communication device includes: a processor and a memory. The memory stores a computer program or computer instructions, and the processor is used to call and execute the computer program or computer instructions stored in the memory, so that the processor implements any one of the implementation manners in the first aspect.

Optionally, the communication device further includes a transceiver, and the processor is configured to control the transceiver to send and receive signals.

A twelfth aspect of the present application provides a control device, the control device includes: a processor and a memory. The memory stores a computer program or computer instructions, and the processor is used to call and execute the computer program or computer instructions stored in the memory, so that the processor implements any one of the implementation manners in the second aspect.

Optionally, the control device further includes a transceiver, and the processor is configured to control the transceiver to send and receive signals.

A thirteenth aspect of the present application provides a second AP, where the second AP includes: a processor and a memory. The memory stores a computer program or computer instructions, and the processor is used to call and execute the computer program or computer instructions stored in the memory, so that the processor implements any one of the implementation manners in the third aspect.

Optionally, the second AP further includes a transceiver, and the processor is configured to control the transceiver to send and receive signals.

A fourteenth aspect of the present application provides a fourth STA, where the fourth STA includes: a processor and a memory. The memory stores a computer program or computer instructions, and the processor is used to call and execute the computer program or computer instructions stored in the memory, so that the processor implements any one of the implementation manners in the fourth aspect.

Optionally, the fourth STA further includes a transceiver, and the processor is configured to control the transceiver to send and receive signals.

A fifteenth aspect of the present application provides a computer program product comprising instructions, characterized in that, when run on a computer, the computer is caused to perform any one of the first, second, third and fourth aspects. an implementation.

A sixteenth aspect of the present application provides a computer-readable storage medium, comprising computer instructions that, when executed on a computer, cause the computer to perform any one of the first, second, third and fourth aspects any of the implementations.

A seventeenth aspect of the present application provides a chip device, comprising a processor for invoking a computer program or computer instructions in the memory, so that the processor executes the first aspect, the second aspect, the third aspect and the fourth aspect Any implementation of any of the aspects.

Optionally, the chip device further includes a memory, and the memory is used for storing computer programs or computer instructions. The chip arrangement is composed of chips, and may also include chips and other discrete devices.

Optionally, the processor is coupled to the memory through an interface.

As can be seen from the above technical solutions, the embodiments of the present application have the following advantages:

It can be known from the above technical solutions that the first communication device acquires first channel parameter information, where the first channel parameter information includes channel parameter information between the first AP in the first network and the STAs within the signal coverage of the first AP; The first communication device groups the first AP and the first STA according to the first channel parameter information to obtain multiple groups, where the first STA includes part or all of the STAs within the signal coverage of the first AP; then , the first communication apparatus sends the grouping result of the multiple groups, where the grouping result is used to indicate the AP and the STA included in each of the multiple groups. In this way, when the AP or STA receives the grouping result, it can adjust the connection according to the group to which it belongs, so as to realize the management and planning of the STA connected to the AP. Since the multiple groups are divided by the first communication apparatus according to the first channel parameter information, the implementation of the management and planning of the STAs connected to the AP through the solutions in the embodiments of the present application can reduce interference between user equipments, thereby improving the network transmission performance.

Description of drawings

1A is a schematic diagram of a network management system according to an embodiment of the present application;

1B is a schematic structural diagram of a server according to an embodiment of the present application;

1C is a schematic structural diagram of a control device according to an embodiment of the present application;

FIG. 1D is a schematic structural diagram of an AP according to an embodiment of the present application;

FIG. 1E is a schematic structural diagram of an STA according to an embodiment of the present application;

2A is a schematic diagram of another embodiment of a network management system according to an embodiment of the present application;

FIG. 2B is a schematic structural diagram of a first AP according to an embodiment of the present application;

FIG. 2C is a schematic structural diagram of a second STA according to an embodiment of the present application;

FIG. 3 is a schematic diagram of an embodiment of a network management method according to an embodiment of the present application;

4A is a schematic diagram of another embodiment of a network management method according to an embodiment of the present application;

4B is a schematic diagram of a weighted bipartite graph according to an embodiment of the present application;

4C-1 is a schematic diagram of a connection state between a STA and an AP in the first network under a traditional single-AP transmission mechanism;

4C-2 is a schematic diagram of the grouping distribution of a plurality of groupings divided according to regions;

FIG. 4C-3 is a schematic diagram of group distribution of multiple groups obtained by dividing a server in a centralized network management system according to an embodiment of the present application;

4D is a schematic diagram of a frame structure of a second beacon frame according to an embodiment of the present application;

5A is a schematic diagram of another embodiment of a network management method according to an embodiment of the present application;

5B is a schematic diagram of group distribution of multiple groups obtained by multiple APs in a distributed network management system according to an embodiment of the present application;

6A is a schematic diagram of another embodiment of a network management method according to an embodiment of the present application;

6B is a schematic structural diagram of a first broadcast message according to an embodiment of the present application;

FIG. 7 is a schematic diagram of another embodiment of a network management method according to an embodiment of the present application;

FIG. 8A is a schematic diagram of another embodiment of a network management method according to an embodiment of the present application;

8B is a schematic structural diagram of a second broadcast message according to an embodiment of the present application;

FIG. 9 is a schematic structural diagram of a communication device according to an embodiment of the present application;

10 is a schematic structural diagram of a control device according to an embodiment of the present application;

FIG. 11 is a schematic structural diagram of a second AP according to an embodiment of the present application;

FIG. 12 is a schematic structural diagram of a fourth STA according to an embodiment of the present application;

13 is a schematic diagram of a network management system according to an embodiment of the present application;

FIG. 14 is another schematic diagram of a network management system according to an embodiment of the present application.

Detailed ways

The embodiments of the present application provide a network management method and a related apparatus, which are used to implement management and planning of STAs connected to an AP, which can reduce interference between user equipments, thereby improving network transmission performance.

The technical solutions of the embodiments of the present application can be applied to a wireless local area network (WLAN), commonly referred to as a wireless WiFi network, and the adopted standard is the Institute of Electrical and Electronics Engineers (IEEE) 802.11 series standard. The network nodes that a WLAN can include are stations (Station, STA), and the stations include an access point type station (access point, AP) and a non-access point type station (None Access Point Station, Non-AP STA). Hereinafter, the access point type station is called AP, and the non-access point type station is called STA.

Access point type sites, also known as wireless access points or hotspots, etc. APs are access points for mobile users to access wired networks. They are mainly deployed in homes, buildings, and campuses, with a typical coverage radius ranging from tens of meters to hundreds of meters. Of course, they can also be deployed outdoors. AP is equivalent to a bridge connecting wired network and wireless network. Its main function is to connect various wireless network clients together, and then connect the wireless network to Ethernet. Specifically, the AP may be a terminal device or a network device with a WiFi chip. Optionally, the AP may be a device supporting the 802.11ax standard. Further, optionally, the AP may be a device supporting multiple WLAN standards such as 802.11be, 802.11ac, 802.11n, 802.11g, 802.11b, and 802.11a.

A non-access point station (none access point station, Non-AP STA) can be a wireless communication chip, a wireless sensor or a wireless communication terminal. For example: mobile phones that support WiFi communication, tablet computers that support WiFi communication, set-top boxes that support WiFi communication, smart TVs that support WiFi communication, smart wearable devices that support WiFi communication, in-vehicle communication that supports WiFi communication Devices and computers that support WiFi communication. Specifically, the STA may be a terminal device or a network device with a Wi-Fi chip. Optionally, the site may support the 802.11ax standard, and further optionally, the site may support multiple WLAN standards such as 802.11be, 802.11ac, 802.11n, 802.11g, 802.11b, and 802.11a.

It should be noted that wireless signal interference between devices is caused by dense deployment of devices in a wireless network, so the technical solutions of the embodiments of the present application are also applicable to network management and planning of other wireless communication networks where devices are densely deployed.

In the embodiments of the present application, in order to implement management and planning of the WiFi network, two possible network management systems are introduced in the embodiments of the present application, namely, a centralized network management system and a distributed network management system. 1A and FIG. 2A are described in detail below.

Please refer to FIG. 1A . FIG. 1A is a schematic diagram of a network management system according to an embodiment of the present application. The network management system shown in FIG. 1A is a centralized network management system. The centralized network management system includes servers, control devices, APs and STAs in the WiFi network (only 5 APs and 3 STAs are shown in FIG. 1A ).

The control device acquires the first channel parameter information, and sends the first channel parameter information to the server. The first channel parameter information includes channel parameter information between each AP in all APs in the WiFi network and the STAs within the signal coverage of each AP. For example, as shown in FIG. 1A , the signal coverage range of AP2 is the range within the dotted circle shown in FIG. 1A , and the range within the dotted circle includes STA1 and STA2 . Then, the control device can acquire the channel parameter information between the AP2 and the STA1 and STA2 respectively. Similar to other APs in the WiFi network, the details are not described one by one.

Then, the server groups all APs and STAs in the WiFi network according to the first channel parameter information to obtain multiple groups, and then feeds back the grouping results of the multiple groups to the control device. The control device manages and plans the WiFi network according to the grouping result.

Specifically, the management and planning of the WiFi network by the control device mainly include: the control device notifies the groups to which APs and STAs in the WiFi network belong. Then, the AP in the WiFi network adjusts the STA to which the AP is connected, so as to realize the connection management of the STA and reduce the mutual interference between the devices. Further, the control device can also allocate the same channel to the APs in the same group, so that multiple APs in the same group can realize multi-AP joint transmission, so as to meet the requirements of high throughput and low delay of the WiFi network, and also Improve spectrum utilization.

In the above FIG. 1A , the server is a cloud server, or a cloud computing center server, or other types of servers, which are not specifically limited in this application. The control device is a central controller, or a master (master) AP, etc., which is not specifically limited in this application.

Based on the network management system shown in FIG. 1A , the following describes the structures of the server, control device, AP and STA of the network management system through FIG. 1B , FIG. 1C , FIG. 1D and FIG. 1E respectively. The AP shown in FIG. 1C is any AP in the first network, and the STA shown in FIG. 1E is any STA in the first network.

First, the server in the network management system is introduced. Please refer to FIG. 1B , which is a schematic structural diagram of a server according to an embodiment of the present application. In FIG. 1B , the server includes a first transceiver module 101 and a first grouping module 102 .

The transceiver module 101 is configured to receive the first channel parameter information sent by the control device.

The grouping module 102 is configured to group all APs and all STAs in the first network according to the first channel parameter information to obtain grouping results of multiple groups;

The transceiver module 101 is further configured to send the grouping results of the multiple groups to the control device.

The server shown in FIG. 1B is configured to perform some or all of the steps in the embodiment shown in FIG. 3 and some or all of the steps performed by the server in the embodiment shown in FIG. 4A . For example, the transceiver module 101 is configured to execute step 301 and step 303 in the embodiment shown in FIG. 3 , and step 402 and step 404 in the embodiment shown in FIG. 4A . The grouping module 102 is configured to perform step 302 in the embodiment shown in FIG. 3 and step 403 in the embodiment shown in FIG. 4A . For details, please refer to the related introductions in the embodiments shown in FIG. 3 and FIG. 4A later.

Please refer to FIG. 1C , which is a schematic structural diagram of a control device according to an embodiment of the present application. The control device includes a transceiver module 103 and a group management module 104 .

The transceiver module 103 is configured to receive the first channel parameter information reported by the AP or STA in the WiFi network, and send the first channel parameter information to the server; receive the grouping results of multiple groups sent by the server;

The group management module 104 is configured to determine APs and STAs included in each of the multiple groups according to the grouping results of the multiple groups.

The transceiver module 103 is further configured to send the grouping information of the multiple groups to the AP or the STA in the WiFi network.

Optionally, the group management module 104 is further configured to allocate the same channel to APs in the same group. The transceiver module 103 is further configured to send channel allocation information corresponding to each of the multiple groups to the AP or the STA in the WiFi network.

The control device shown in FIG. 1C is used to perform some or all of the steps performed by the control device in the embodiment shown in FIG. 4A . For example, the transceiver module 103 is used to execute step 401 and step 405 in the embodiment shown in FIG. 4A later. The group management module 104 is configured to execute step 405a in the embodiment shown in FIG. 4A hereinafter. For details, please refer to the related introduction in the embodiment shown in FIG. 4A , which will not be repeated here.

Please refer to FIG. 1D , which is a schematic structural diagram of an AP according to an embodiment of the present application. The AP includes a transceiver module 105 and a group management module 106 . Optionally, the AP includes a signal measurement module 107 .

The transceiver module 105 is configured to receive grouping information of multiple groups sent by the control device.

The group management module 106 is configured to determine the group to which the AP belongs according to the group information; and adjust the STA connected to the AP according to the group to which the AP belongs.

Optionally, the grouping information further includes channel allocation information allocated by the control device to the AP. The group management module 106 is further configured to determine the corresponding channel according to the channel allocation information, and adjust the channel accessed by the first AP to the channel corresponding to the channel allocation information.

In the WiFi network, the AP can measure the channel parameter information of the AP and the STAs within the signal coverage of the AP. Optionally, the signal measurement module 107 is configured to measure the channel parameter information of the AP and the STAs within the signal coverage of the AP.

The AP shown in FIG. 1D is used to perform some or all of the steps performed by the second AP shown in FIG. 4A later. For example, the transceiver module 105 is used for step 401 and step 405 in the embodiment shown in FIG. 4A later. The group management module 106 is configured to execute step 406 and step 407 in the embodiment shown in FIG. 4A later. The signal measurement module 107 is configured to perform measurement to obtain the second channel parameter information of step 401 in the embodiment shown in FIG. 4A .

Please refer to FIG. 1E. FIG. 1E is a schematic structural diagram of an STA according to an embodiment of the present application. In FIG. 1E , the STA includes a transceiver module 108 and a packet management module 109 . Optionally, the STA further includes a signal measurement module 110 .

The transceiver module 108 is configured to receive grouping information of multiple groups sent by the control device.

The group management module 109 is configured to determine the group to which the STA belongs according to the group information, and adjust the AP to which the STA is connected according to the group to which the STA belongs.

In the WiFi network, the STA may measure channel parameter information between the STA and the AP in the first network. Optionally, the signal measurement module 110 is configured to measure channel parameter information between the STA and the AP in the first network. The transceiver module 108 is further configured to send the channel parameter information to the AP connected to the STA, and then the AP sends the information to the control device.

Specifically, the STA is configured to perform some or all of the steps performed by the fourth STA in the embodiment shown in FIG. 4A later. For example, the transceiver module 108 is used to execute step 407b in the embodiment shown in FIG. 4A . The group management module 109 is configured to execute steps 407c to 407e in the above-mentioned embodiment shown in FIG. 4A

It should be noted that, in the centralized network management system shown in FIG. 1A above, the control device may also group all APs and STAs in the WiFi network according to the first channel parameter information to obtain multiple groups, which are grouped by the control device. The control device manages and plans the WiFi network according to the grouping result, which is not specifically limited in this application. That is, the server may not be included in the network management system shown in Fig. 1A.

Please refer to FIG. 2A , which is another schematic diagram of a network management system according to an embodiment of the present application. The network management system shown in FIG. 2A is a distributed network management system. The distributed network management system includes multiple APs and multiple STAs (only 5 APs and 3 STAs are shown in FIG. 2A ).

The following takes AP2 as an example to introduce the distributed network management system. AP2 acquires first channel parameter information, where the first channel parameter information includes channel parameter information of the AP2 and the STAs within the signal coverage of the AP2. Then, the AP1 groups the AP2 and the STAs connected to the AP2 within the signal coverage of the AP2 according to the first channel parameter information to obtain multiple groups. The AP2 performs connection management on the STA connected to the AP2 and adjusts the channel accessed by the AP2 according to the grouping results of the multiple groups, and performs similar operations on other APs, thereby implementing connection management for the STA in the WiFi network. Through the above process, the connection management of the STA is realized, and the mutual interference between the devices is reduced. Further, multiple APs in the same group can access the same channel, so that multiple APs in the same group can realize multi-AP joint transmission, so as to meet the requirements of high throughput and low latency of WiFi network, and also improve the frequency spectrum. utilization.

Moreover, in the network management system shown in FIG. 2A , in the WiFi network, information exchange can be performed between different APs, that is, the APs can group the APs and STAs of the WiFi network in a coordinated manner. Specifically, information can be exchanged between different APs through a wired network. For example, Ethernet, etc.

Based on the network management system shown in FIG. 2A , the structures of the first AP and the second STA of the network management system are respectively introduced below through FIG. 2B and FIG. 2C . The second STA is a STA within the signal coverage of the first AP.

Please refer to FIG. 2B , which is a schematic structural diagram of a first AP according to an embodiment of the present application. In FIG. 2B , the first AP includes a transceiver module 201 , a grouping module 202 and a grouping management module 203 . Optionally, the first AP further includes a signal measurement module 204 .

The transceiver module 201 is used to obtain first channel parameter information;

The grouping module 202 is configured to group the first AP and the first STA that is within the signal coverage of the first AP and has established a connection with the first AP according to the first channel parameter information, to obtain multiple groups, and obtain multiple The grouping result of each group and the group to which the first AP belongs.

The group management module 203 is configured to adjust the STA connected to the first AP according to the group to which the first AP belongs.

The transceiver module 201 is further configured to send the grouping results of the multiple groups.

In the WiFi network, the first AP may measure channel parameter information of the first AP and the STAs within the signal coverage of the first AP. Optionally, the signal measurement module 204 is configured to measure the first channel parameter information between the first AP and the STAs within the signal coverage of the first AP.

Specifically, the first AP is used to execute steps 301 to 303 in the embodiment shown in FIG. 3 and execute the first AP in the embodiment shown in FIG. 5A , FIG. 6 , FIG. 7 , and FIG. 8A . Some or all of the steps performed by the AP. For example, the transceiver module 201 is configured to execute step 501 , step 505 and step 509 in the embodiment shown in FIG. 5A . The grouping module 201 is configured to execute step 502 in the embodiment shown in FIG. 5A . The group management module 203 is used to execute step 504 in the embodiment shown in FIG. 5A . For details, please refer to the related introductions in the embodiments shown in FIG. 3 , FIG. 5A , FIG. 6 , FIG. 7 , and FIG. 8A , which will not be repeated here.

Please refer to FIG. 2C , which is a schematic structural diagram of a second STA according to an embodiment of the present application. In FIG. 2C , the second STA includes a transceiver module 205 and a packet management module 206 . Optionally, the second STA further includes a signal measurement module 207 .

The transceiver module 205 is configured to receive grouping results of multiple groups sent by the first AP.

The group management module 206 is configured to determine the group to which the second STA belongs according to the grouping result, and adjust the AP to which the second STA is connected according to the group to which the second STA belongs.

In the WiFi network, the second STA may measure channel parameter information between the second STA and the first AP. Optionally, the signal measurement module 207 is configured to measure channel parameter information between the second STA and the first AP; the transceiver module 205 is configured to send the signal parameter information to the first AP.

The technical solutions of the embodiments of the present application are described below with reference to the embodiments.

Please refer to FIG. 3 , which is a schematic diagram of an embodiment of a network management method according to an embodiment of the present application. In Figure 3, the network management method includes:

301. The first communication apparatus acquires first channel parameter information.

Wherein, the first channel parameter information includes channel parameter information between the first AP in the first network and the STAs within the signal coverage of the first AP.

Optionally, the first channel parameter information includes a signal gain between the first AP and a STA within a signal coverage of the first AP, where the signal gain is also referred to as received signal strength or interference signal strength. Specifically, the measurement method of the signal strength includes the following two possible implementation methods:

1. The first AP sends data packets on the channel accessed by the first AP, and the STAs within the signal coverage of the first AP receive the data packets sent by the first AP, and measure and receive the data sent by the first AP respectively. reported received signal strength.

2. STAs within the signal coverage of the first AP access the channel accessed by the first AP. The first AP receives the data packets sent by the STAs within the signal coverage of the first AP; then, the first AP measures the received signal strength of the data packets sent by the STAs within the signal coverage of the first AP respectively.

1. Based on the centralized network management system shown in FIG. 1A , the first communication device may be a server, and the first channel parameter information includes each AP in all APs in the first network and the signal coverage of each AP. channel parameter information between STAs. That is, the first channel parameter information can be understood as the global interference information of the first network, and the global interference information includes the communication between each AP in all APs in the first network and the STAs within the signal coverage of each AP. Interfering signal strength. The first AP includes all APs in the first network. For a specific process of the server acquiring the parameter information of the first channel, please refer to the related introduction in the embodiment shown in FIG. 4A later.

2. Based on the distributed network management system shown in FIG. 2A , the first communication device may be the first AP. Then, the first channel parameter information includes channel parameter information between the first AP and the STAs within the signal coverage of the first AP. That is, the first channel parameter information can be understood as the local interference information of the first network obtained by the first AP, and the local interference information includes interference signals between the first AP and STAs within the signal coverage of the first AP strength. For a specific process of the first AP acquiring the first channel parameter information, please refer to the related introduction in the embodiment shown in FIG. 5A later.

It should be noted that the above shows an implementation manner in which the first channel parameter information includes the channel parameter information between the first AP and the STAs within the signal coverage of the first AP. In practical applications, the first channel parameter information may also include channel parameter information between the first AP and a STA within a preset range of the first AP. Wherein, the preset range is a range divided according to geographic location; or, the preset range is a range where the STA corresponding to the signal gain greater than or equal to the fourth preset threshold is located.

Wherein, the signal gain greater than or equal to the fourth preset threshold is the channel gain between the first AP measured by the first AP and the STA corresponding to the signal gain greater than or equal to the fourth preset threshold, or the signal gain greater than or equal to the fourth preset threshold The signal gain equal to or equal to the fourth preset threshold is the channel gain between the STA and the first AP measured respectively by the STA corresponding to the signal gain greater than or equal to the fourth preset threshold.

Consideration factors for the setting of the fourth preset threshold include the computing capability of the first communication device, the precision requirement for the grouping result, the network state and channel of the first network, etc., which are not specifically limited in this application.

For example, the fourth preset threshold may be 5dB (decibel) or 10dB.

In the following embodiments, only the first channel parameter information includes the channel parameter information between the first AP and the STAs within the signal coverage of the first AP as an example for description, which is not specifically limited in this application.

302. The first communication apparatus groups the first AP and the first STA according to the first channel parameter information to obtain multiple groups.

The first STA includes some or all of the STAs within the signal coverage of the first AP.

1. Based on the centralized network management system shown in FIG. 1A , the first STA includes each AP of all APs in the first network and all STAs within the signal coverage of each AP. That is, the first STA includes all STAs in the first network. Specifically, based on the centralized network management system, for the specific execution flow of the server, please refer to the embodiment shown in FIG. 4A .

2. Based on the distributed network management system shown in FIG. 2A , the first STA includes a STA that has established a connection with the first AP within the signal coverage of the first AP. Specifically, based on the distributed network management system, please refer to the embodiment shown in FIG. 5A for the specific execution flow of the first AP.

303. The first communication apparatus sends the grouping results of the multiple groups.

The grouping result is used to indicate APs and STAs included in each of the multiple groups.

In this embodiment of the present application, the first communication device acquires first channel parameter information, where the first channel parameter information includes channel parameter information between the first AP in the first network and the STAs within the signal coverage of the first AP; The first communication device groups the first AP and the first STA according to the first channel parameter information to obtain multiple groups, where the first STA includes part or all of the STAs within the signal coverage of the first AP; then , the first communication apparatus sends the grouping result of the multiple groups, where the grouping result is used to indicate the AP and the STA included in each of the multiple groups. In this way, when the AP or STA receives the grouping result, it can adjust the connection according to the group to which it belongs, so as to realize the management and planning of the STA connected to the AP. In the technical solutions of the embodiments of the present application, the multiple groups are divided by the first communication apparatus according to the first channel parameter information, which can reduce interference between user equipments, thereby improving network transmission performance.

The following describes the technical solutions of the embodiments of the present application in detail with reference to the centralized network management system shown in FIG. 1A .

Please refer to FIG. 4A , which is a schematic diagram of an embodiment of a network management method according to an embodiment of the present application. In Figure 4A, the network management method includes:

401. The second AP sends second channel parameter information to the control device.

The second channel parameter information is the channel parameter information between the second AP and the STAs within the signal coverage of the second AP, the second AP is an AP in the first network, and the first network is controlled by the control device The internet.

Specifically, as shown in FIG. 1A , the first network is a WiFi network controlled by the control device shown in FIG. 1A . The STA in the WiFi network selects an AP from the WiFi network for connection according to the existing method. For example, the STA may connect with the AP corresponding to the beacon frame with the highest signal strength. The APs in the WiFi network can select a channel and access the channel through the prior art. For example, the AP selects a channel and accesses the channel through the LCSS technology. Then, the second AP measures the second channel parameter information between the second AP and the STAs within the signal coverage of the first AP, and sends the second channel parameter information to the control device. Other APs in the WiFi network also perform corresponding measurements and report channel parameter information. Then, the control device may collect the first channel parameter information between each AP in all APs in the WiFi network and the STAs within the signal coverage of each AP.

402. The control device sends first channel parameter information to the server.

Wherein, the first channel parameter information includes channel parameter information between each AP in all APs in the first network and the STAs within the signal coverage of each AP.

Optionally, the first channel parameter information includes a channel matrix W, and the channel matrix

The channel matrix W is a matrix with K rows multiplied by L columns, K is the number of STAs included in the first network, and L is the number of APs included in the first network. The element w _ij in the channel matrix W is the channel gain between the i-th STA and the j-th AP (it may also be the average channel gain), i is an integer greater than or equal to 1 and less than or equal to K, and j is greater than or equal to K or an integer equal to 1 and less than or equal to L.

Specifically, the first network includes K STAs and L APs. The first network is modeled as a bipartite graph G=(V,E). The vertex set V can be divided into two mutually disjoint vertex subsets V _STA and vertex subset V _AP , and the vertex subset V _STA and vertex subset V _AP satisfy the following equations (1) and (2):

V _STA ∪ V _AP =V Formula (1)

Wherein, in the above formula (2)

is the empty set.

For example, as shown in FIG. 4B , the weighted bipartite graph includes two types of vertices, the first type of vertex is an STA in the first network, and the second type of vertex is an AP in the first network.

And the edge set E of the weighted bipartite graph represents the channel condition between the STA in the first network and the AP in the first network.

The edge weight of the weighted bipartite graph represents the channel gain between the STA and the AP in the first network, that is, the weight marked on the edge of the weighted bipartite graph. For example, if STA1 is the first STA in the first network, and AP1 is the first AP in the first network, then the edge weight of the edge connecting STA1 and AP1 is w ₁₁ , indicating that the connection between STA1 and AP1 is channel gain. The edge weights of other edges in FIG. 4B are similar, and will not be described one by one here.

Optionally, the channel matrix W is an edge weight matrix of the weighted bipartite graph.

403. The server groups all APs and all STAs in the first network according to the first channel parameter information to obtain multiple groups.

Step 403 is described below with reference to the first channel parameter information including the channel matrix W in the above step 402. Specifically, step 403 specifically includes steps 403a to 403d.

Step 403a: The server calculates and obtains the first intermediate matrix D according to the channel matrix W.

Among them, the first intermediate matrix

D ₁ is a matrix with K rows*K columns,

The element a _i on the main diagonal of D ₁ is the sum of the channel gains between the i-th STA in the first network and all APs in the first network, respectively, and the off-diagonal line of D ₁ All elements on are zero.

D ₂ is a matrix with L rows by L columns,

The element b _j on the main diagonal of D ₂ is the sum of the channel gains between the j-th AP in the first network and all STAs in the first network, respectively.

0 _K×L is a matrix of K rows by L columns, and the elements in 0 _K×L are all zero. 0 _L×K is a matrix of L rows by K columns, and the elements in 0 _L×K are all zero.

Optionally, when the channel matrix W is an edge weight matrix W of a weighted bipartite graph, step 403a is specifically as follows: the server generates a degree matrix of the edge weight matrix W according to the edge weight matrix W. Wherein, each diagonal element of the degree matrix of the edge weight matrix W is the degree of the node corresponding to each diagonal element, and the degree of the node corresponding to each diagonal element is the weighted dichotomy in FIG. 4B The sum of the edge weights of the edges associated with the node in the graph (that is, the edges connected to the node in the weighted bipartite graph). For example, as shown in FIG. 4B, the nodes connected to STA1 include AP1, AP2, AP3 and AP4, then the degree of the STA1 is the edge weight of the edge connected between the STA1 and AP1, the degree of the connection between the STA1 and AP2 The sum of the edge weight of the edge, the edge weight of the edge connected between the STA1 and AP3, and the edge weight of the edge connected between the STA1 and AP4. The degree matrix of the edge weight matrix W is the above-mentioned first intermediate matrix D.

Step 403b: The server determines the second intermediate matrix Z according to the channel matrix W and the first intermediate matrix D.

Wherein, each row vector in the second intermediate matrix Z corresponds to a network node, and the network node is an STA or an AP in the first network.

The process of determining the second intermediate matrix Z by the server in the above steps will be described below with reference to steps 1 to 3.

Step 1: The server determines the third intermediate matrix R according to the channel matrix W and the first intermediate matrix D.

Among them, the third intermediate matrix

^WT is the transpose of the channel matrix W.

Step 2: The server performs singular value decomposition on the third intermediate matrix R to obtain the left singular matrix U and the right singular matrix of the third intermediate matrix R,

Wherein, the third intermediate matrix R=UΣV ^T , Σ is the diagonal matrix obtained by the singular value decomposition of the third intermediate matrix R, and V ^T is the transpose of the right singular matrix V obtained by the singular value decomposition of the third intermediate matrix R.

Step 3: The server selects the corresponding M column vectors from the left singular matrix U in descending order of the singular values in the diagonal matrix Σ, to obtain the fourth intermediate matrix U _M , and according to the singular values in the diagonal matrix Σ The corresponding M column vectors are selected from the right singular matrix V in descending order of value size to obtain the fifth intermediate matrix V _M .

Wherein, M is an integer greater than or equal to log ₂ (K+L) and less than or equal to min(K, L). log ₂ (K+L) refers to taking the logarithm of K+L in base 2, and min(K, L) refers to taking the minimum value from K and L.

Optionally, the value of M may be the number of groups of the multiple groups. The number of groups of the plurality of groups is an integer greater than 1 and less than min(K, L).

It should be noted that the value of M can also be determined in combination with the actual situation, which is not specifically limited in this application. The above example of the value range of M is determined by the analysis of experimental data. When the value range of M is an integer between log ₂ (K+L) and min(K, L), the server will determine the value of the STA and AP in the first network. The grouping effect is better. For example, the sum of the effective signal strengths in the sub-network formed by the APs and STAs in each group is relatively large, and the signal interference strength between the network nodes (APs or STAs) in the sub-network and outside the sub-network is relatively low.

Step 4: The server calculates and obtains the second intermediate matrix Z according to the fourth intermediate matrix, the fifth intermediate matrix and the first intermediate matrix.

where, the second intermediate matrix

Specifically, each row vector in the second intermediate matrix Z corresponds to a network node, and the network node is an STA or an AP in the first network. Specifically, the i-th row vector of the second intermediate matrix Z is the row vector corresponding to the i-th STA in the first network, and the K+j-th row vector of the second intermediate matrix Z is the j-th row vector in the first network. The row vector corresponding to each AP.

Step 403c: The server performs clustering on the row vectors of the second intermediate matrix according to the clustering algorithm to obtain a first clustering result.

The first clustering result includes row vectors of multiple clusters, and one of the multiple clusters corresponds to one of the multiple groups.

Specifically, in the above step 403b, the M column vectors selected by the server from the left singular matrix U and the M column vectors in the right singular matrix V according to the size of the singular values include more features representing the weighted bipartite graph information, then in step 403c, the server performs clustering on the second intermediate matrix Z by means of spectral clustering, so that the server performs better grouping of STAs and APs in the first network. For example, the sum of the effective signal strengths in the sub-network formed by the APs and STAs in each group is relatively large, and the signal interference strength between the network nodes (APs or STAs) in the sub-network and outside the sub-network is relatively low.

In this embodiment, the clustering algorithm is k-means (k-means) algorithm, k-means++ algorithm, mean-shift clustering, expectation-maximization algorithm (EM) clustering algorithm, representative density-based Clustering algorithm (density-based spatial clustering of applications with noise, DBSCAN), graph community detection (graph community detection) clustering algorithm, graph neural network (graph neural network, GCN) clustering algorithm, etc.

Optionally, the server performs a clustering algorithm on the second intermediate matrix

The included K+L row vectors are clustered to obtain row vectors of multiple clusters.

It should be noted that the server is on the second intermediate matrix

The server can use this second intermediate matrix when clustering the included K+L row vectors

All or part of each of the included K+L row vectors represents that row vector for clustering. That is, the server can select a part of each row vector to represent the row vector for clustering.

Step 403d: The server determines network nodes included in the multiple groups according to the row vectors of the multiple clusters.

Specifically, it can be seen from the above step 403c that each row vector in the second intermediate matrix Z corresponds to a network node, then the server divides the network nodes corresponding to the row vector of the same cluster among the row vectors of the multiple clusters into the same group middle.

For example, as shown in FIG. 1A , APs and STAs in the WiFi network are divided into two groups, and the two groups correspond to two clusters. Here, the two clusters include cluster 1 and cluster 2, and the two groups include group 1 and group 2 as an example for introduction. Among them, cluster 1 corresponds to group 1, and cluster 2 corresponds to group 2.

Wherein, STA1 corresponds to row vector 1 of the second intermediate matrix Z, STA2 corresponds to row vector 2 of the second intermediate matrix Z, and STA3 corresponds to row vector 3 of the second intermediate matrix z. AP1 corresponds to the row vector 4 of the second intermediate matrix Z, AP2 corresponds to the row vector 5 of the second intermediate matrix, AP3 corresponds to the row vector 6 of the second intermediate matrix Z, AP4 corresponds to the row vector 7 of the second intermediate matrix Z, and AP5 corresponds to the row vector 7 of the second intermediate matrix Z. Two row vectors 8 of the intermediate matrix Z.

Cluster 1 includes Row Vector 1, Row Vector 2, Row Vector 4, Row Vector 5, and Row Vector 6, while Cluster 2 includes Row Vector 3, Row Vector 7, and Row Vector 8. Then, the server determines that the group 1 includes AP1, AP2, AP3, STA1 and STA2 according to the row vector included in the cluster 1. The server determines that group 2 includes AP4, AP5 and STA3 according to the row vector included in cluster 2.

As can be seen from the above, for the group C of the multiple groups, the sum of the signal strengths of the mutual interference between the network nodes in the sub-network formed by the network nodes in the group C and the network nodes outside the sub-network can be expressed as:

Wherein, STA _k represents the k-th STA, and AP ₁ represents the l-th AP.

The effective strength of the sub-network formed by the network nodes in the group C can be defined as the sum of the signal strengths between the network nodes in the sub-network, specifically expressed as:

In order to reduce the overall interference of the network and improve the throughput, the degree of mutual interference between the sub-networks formed in each group should be as small as possible, and the effective signal strength in the same sub-network should be as large as possible. Here, the multiple groups are taken as N, and N is an integer greater than or equal to 2, then the first network can be divided into N sub-networks corresponding to the N groups. The interference degree is as small as possible and the effective signal strength in the same sub-network is as large as possible. The problem can be located as:

argmin is the operator for the arguments of the maxima,

pointing to make

Minimized {G ₁ ,G ₂ ,...,G _N }.

st is the operator for constraints.

indicate that it should be satisfied

and

c is the constraint condition 1,

is Constraint 2,

is a universal quantifier,

is an empty set, G _d ∩ G _g refers to the intersection of G _d and G _g , G _b refers to the b-th cluster, and b is an integer greater than or equal to 1 and less than or equal to N.

In the above step 401, the control device collects the global interference information in the first network, and in step 402 sends the global interference information in the first network to the server. In the above step 403, the server abstracts the first network into a weighted bipartite graph to perform spectral graph decomposition, and performs spectral graph decomposition on the weighted bipartite graph through graph theory and spectral clustering to solve the above problem. That is, all APs and all STAs of the first network are grouped by graph theory method and spectral clustering, so that the degree of signal interference between the sub-networks formed corresponding to each grouping in the multiple groups obtained in this way is small, and the sub-networks The effective strength inside is greater.

For example, FIG. 4C-1 is a schematic diagram of a connection state between an AP and a STA in the first network under a traditional single-AP transmission mechanism. In Figure 4C-1, the STA selects the nearest AP to establish a connection, and the AP provides services for the STA. FIG. 4C-2 is a schematic diagram of the distribution of the groups obtained by division according to the geographical division. FIG. 4C-3 is a schematic diagram of group distribution of multiple groups under a network management method according to an embodiment of the present application. As shown in FIG. 4C-3 , APs and STAs in the first network are divided into multiple groups. Compared with FIG. 4C-3 The division method of 4C-2, in Fig. 4C-3, the network nodes located relatively close are all divided into the same group. Compared with the traditional single-AP transmission mechanism in Figure 4C-1, in Figure 4C-3, multiple APs in the same group can simultaneously provide services for STAs in the same group, realizing multi-AP joint transmission and improving network throughput and spectrum. utilization.

404. The server sends the grouping results of the multiple groups to the control device.

The grouping result of the multiple groups is used to indicate the APs and STAs included in each of the multiple groups.

For example, the grouping result includes a group number of each group in the plurality of groups, and APs and STAs corresponding to each group number (ie, APs and STAs included in each group).

405. The control device sends the second grouping information.

The second group information includes information about groups to which all APs in the first network belong respectively and information about groups to which all STAs of the first network belong respectively.

For example, the second group information includes group numbers of groups to which all APs and all STAs in the first network belong respectively.

Optionally, this embodiment further includes step 405a, and step 405a is performed before step 405.

Step 405a: The control device allocates the same channel to the APs in the same group among the multiple groups.

Specifically, the control device selects a channel for the APs in each of the multiple groups according to the first channel parameter information; and the control device selects the same channel for the APs in each group.

Based on step 405a, optionally, the second grouping information further includes third channel allocation information. The third channel allocation information is information of a channel allocated by the control device to the AP in the first network.

It should be noted that step 405a shows an implementation manner in which the control device allocates corresponding channels to the multiple groups respectively. In practical applications, in a centralized network management system, APs in the same group can also select channels. The specific selection process is similar to steps 507 to 511 in the subsequent embodiment shown in FIG. 5A . For details, please refer to The related introductions that follow will not be repeated here.

Step 405 is introduced by taking the control device broadcasting the second grouping information of all APs and all STAs in the first network as an example. In practical applications, the control device may also determine the information of the group to which each network node in the first network belongs from the grouping results of the multiple groups, and send the grouping information corresponding to the network node to the corresponding network node. That is, the control device sends the packet information through unicast.

It should be noted that the control device may also only send the second grouping information to all APs in the first network. Optionally, the server is transparent to the grouping management of all APs and all STAs in the first network; or, the APs in each group notify the STAs in the same group of related grouping information, which is not specifically limited in this application.

Since in a centralized network management system, the control device collects the global interference information in the first network, it is reasonable for the control device to allocate a corresponding channel to each group according to the global interference information. Compared with the method of selecting channels through APs in the same group, the method of selecting the corresponding channel for each group by the control device can reduce information exchange between devices, reduce signaling overhead, and avoid unnecessary waste of resources.

Moreover, the control device allocates the same channel to the APs in the same group, so that multiple APs in the same group can realize multi-AP joint transmission, so as to meet the requirements of high throughput and low delay of WiFi network, and also improve the frequency spectrum. utilization.

406. The second AP determines the group to which the second AP belongs according to the second group information.

Specifically, the second AP is an AP in the first network, and the second AP determines the group to which the second AP belongs according to the second group information. Optionally, the second group information includes the group number to which the second AP belongs; the second AP determines the group to which the second AP belongs according to the group number to which the second AP belongs.

Optionally, the second grouping information further includes third channel allocation information. Then, this embodiment further includes step 406a. Step 406a and step 406 may be performed simultaneously, or step 406 may be performed first, or step 406a may be performed first, which is not specifically limited in this application.

Step 406a: The second AP determines the third channel selected by the control device for the second AP according to the third channel allocation information.

For example, the third channel allocation information includes indication information of the frequency band used for the third channel or the frequency band of the third channel. The second AP may determine the frequency band of the third channel according to the indication information of the frequency band used for the third channel, and access the frequency band; or, the second AP accesses the frequency band of the third channel.

Step 406b: The second AP adjusts the channel accessed by the second AP to the third channel.

407. The second AP adjusts the STA connected to the second AP according to the group to which the second AP belongs.

In step 407, there are various adjustment modes for the second AP to adjust the STA of the second connection, and two possible implementation modes are shown below.

Implementation mode 1: The second AP sends information of the group to which the second AP belongs, and the information of the group to which the second AP belongs is used for the STA in the first network to determine whether to access the second AP.

Based on the first implementation manner, the above step 407 specifically includes step 407a.

Step 407a: The second AP sends the information of the group to which the second AP belongs.

The information of the group to which the second AP belongs is used for the STA in the first network to determine whether to access the second AP.

Specifically, the second AP may send the information of the group to which the second AP belongs by broadcasting.

Optionally, the sending form of the information of the group to which the second AP belongs may be in a message broadcast by the second AP or carried in a beacon frame, which is not specifically limited in this application.

The following shows the manner in which the second AP sends the information of the group to which the second AP belongs through the beacon frame. Optionally, the information of the group to which the second AP belongs includes the second group number of the group to which the second AP belongs, then the above step 407a specifically includes:

The second AP sends a second beacon frame, where the second beacon frame carries the second group number of the group to which the second AP belongs.

For example, as shown in FIG. 4D, the second AP modifies the format of the second beacon frame. In FIG. 4D, the second beacon frame includes a fixed field field and an optional field. The second AP extends the packet number field in the optional field, and carries the second packet number on the bit corresponding to the packet number field.

Based on the first implementation, this embodiment further includes steps 407b to 407e, and steps 407b to 407e are executed after step 407a.

Step 407b: The fourth STA receives the information of the group to which the second AP belongs and sent by the second AP.

Optionally, the information of the group to which the second AP belongs includes the second group number.

Optionally, the fourth STA receives a second beacon frame sent by the second AP, where the second beacon frame carries the second group number.

Specifically, the fourth STA scans all the channels, and receives the second beacon frame sent by the second AP; then, the fourth STA according to the second group number carried in the second beacon frame and the grouping of the group to which the fourth STA belongs number for comparison.

It should be noted that, before step 407b, the fourth STA receives the information of the group to which the fourth STA belongs and sent by the eighth AP. The eighth AP is an AP to which the fourth STA adjusts the connection. That is to say, the fourth STA may determine the group to which the fourth STA belongs by using the group information sent by the eighth AP to which it is connected. For example, as shown in the figure, the fourth STA is STA3, the STA3 is connected to the AP2, and the AP2 sends the information of the group to which the fourth STA belongs to the STA3.

Step 407c: The fourth STA determines whether the second AP and the fourth STA belong to the same group according to the information of the group to which the second AP belongs. If so, execute step 407d; if not, execute step 407e.

Optionally, the information of the group to which the second AP belongs includes the second group number, and step 407c is specifically for the fourth STA to determine whether the group number of the group to which the fourth STA belongs is consistent with the second group number, and if so, Then go to step 407d, if not, go to step 407e.

Step 407d: The fourth STA adjusts the AP connected to the fourth STA to the second AP.

For example, as shown in FIG. 2A , the fourth STA is STA3, STA2 is connected to AP2 before adjustment, and the second AP is AP3. Then STA3 can adjust the STA3 from the connected AP2 to AP3.

Step 407e: the fourth STA keeps the connection with the eighth AP.

In the technical solution of the first implementation manner, the fourth STA mainly adjusts its associated AP, so as to realize the connection management of the STA.

Implementation mode 2: The implementation mode 2 is described below in conjunction with steps 407f to 407i.

Step 407f: The second AP determines the STA included in the group to which the second belongs.

Specifically, the second AP determines, according to the second grouping information sent by the control device, the STA included in the group to which the second AP belongs.

Step 407g: The second AP judges whether the second AP and the third STA belong to the same group, if so, execute step 407h; if not, execute step 407i.

The third STA is a STA that has established a connection with the second AP.

In a possible implementation manner, the second AP determines the STA included in the group to which the second AP belongs according to the second group information, and determines whether the STA included in the group to which the second AP belongs includes the third STA, and if so , then go to step 407h; if not, go to step 407i.

In another possible implementation manner, the second AP determines the group to which the second AP belongs and the group to which the third STA belongs according to the second group information; then, the second AP determines the group to which the second AP belongs and the third STA Whether the belonging groups are the same, if yes, go to step 407h; if not, go to step 407i.

Step 407h: The second AP keeps serving the third STA.

If the second AP and the third STA belong to the same group, the second AP keeps serving the third STA.

Step 407i: The second AP determines a seventh AP according to the group to which the third STA belongs, and sends third indication information to the seventh AP; or, the second AP sends fourth indication information to the third STA.

Specifically, the second AP determines the group to which the third STA belongs according to the second group information, and determines the seventh AP from the group to which the third STA belongs. For example, the seventh AP may be an AP with the highest signal strength or medium signal strength in the group to which the third STA belongs, and may be specifically determined by the signal strength of the beacon frame sent by the seventh AP. Then, the second AP sends third indication information to the seventh AP to instruct the seventh AP to provide services for the third STA, so as to implement connection management for the STA connected to the AP.

In this implementation, it is mainly the second AP that adjusts the STAs connected to it. That is, the connection adjustment between the AP and the STA is transparent to the STA in the first network. The mechanism of association adjustment performed by the second AP can be compatible with the existing WiFi7 standard, and the association adjustment process is transparent to the STA in the first network, and does not need to perform function expansion and modification on the STA in the first network.

The fourth indication information is used to indicate that the third STA requests the seventh AP to provide services for the third STA.

Specifically, the second AP determines the group to which the third STA belongs according to the second group information, and determines the seventh AP from the group to which the third STA belongs. For example, the seventh AP may be an AP with the highest signal strength or medium signal strength in the group to which the third STA belongs, and may be specifically determined by the signal strength of the beacon frame sent by the seventh AP. Then, the second AP sends the fourth indication information to the seventh AP to instruct the third STA to request the seventh AP to provide services for the third STA.

In the embodiment of the present application, the control device receives the second channel parameter information sent by the second AP; then, the control device sends the first channel parameter information to the server. The server groups all APs and all STAs in the first network according to the first channel parameter information to obtain multiple groups, and sends the grouping results of the multiple groups to the control device. The control device sends the second group information; then, the second AP determines the group to which the second AP belongs according to the second group information, and adjusts the STA connected to the second AP according to the group to which the second AP belongs, so as to realize the STA connected to the AP management and planning. Secondly, in the embodiment of the present application, all APs and all STAs of the first network are grouped by using graph theory method and spectral clustering to obtain multiple groups. In this way, each group in the multiple groups corresponds to a sub-network formed between them. The degree of signal interference is small, and the effective strength in the sub-network is large, which can reduce the interference between user equipments, thereby improving the performance of network transmission.

Please refer to FIG. 5A , which is a schematic diagram of another embodiment of a network management method according to an embodiment of the present application. In Figure 5A, the network management method includes:

501. The first AP acquires first channel parameter information.

The first channel parameter information includes channel parameter information between the first AP and the STAs within the signal coverage of the first AP.

Specifically, as shown in FIG. 2A , the STA in the WiFi network selects an AP from the WiFi network to connect to according to the existing method. For example, the STA may connect with the AP corresponding to the beacon frame with the highest signal strength. The AP in the WiFi network can select a channel and access the channel through the prior art. Here, the first AP is AP2, and AP2 obtains the first channel parameter information between AP2 and STAs (including STA1 and STA2 in FIG. 2A ) within the signal coverage of AP2 respectively. Specifically, AP2 measures the channel parameter information between the AP2 and STA1 and STA2 respectively; or, STA1 measures the channel parameter information between the STA1 and AP2 and reports it to AP2; and STA2 measures the channel parameter information between the STA2 and the AP2 channel parameter information and report it to AP2.

502. The first AP groups the first AP and the first STA according to the first channel parameter information to obtain multiple groups.

Wherein, the first STA is a STA that has established a connection with the first AP within the signal coverage of the first AP.

The following describes the process of determining the plurality of groups by the first AP in step 502 with reference to steps 502a to 502e.

Step 502a: The first AP calculates the p+Kth main diagonal element bp of the first intermediate matrix D according to the _pth column vector of the channel matrix W.

The first network includes L APs and K STAs, the first AP is the pth AP in the first network, L is an integer greater than or equal to 1, K is an integer greater than or equal to 1, and p is an integer greater than or equal to 1 and less than or equal to L.

For the related introduction of the channel matrix W, please refer to the related introduction of the channel matrix W in step 402 in the embodiment shown in FIG. 4A , and details are not repeated here. For the related introduction of the first intermediate matrix D, please refer to the related introduction of the first intermediate matrix D in step 403 in the above-mentioned embodiment shown in FIG. 4A , which will not be repeated here.

Since the first AP obtains the p-th column vector of the channel matrix W, the first AP calculates the p+K-th main diagonal of the first middle D according to the p-th column vector of the channel matrix W element b _p .

Step 502b: The first AP acquires the first K main diagonal elements of the first intermediate matrix D.

The first AP acquires the first K diagonal elements of the first intermediate matrix D, ie a ₁ to a _K , from the STAs in the first network and other APs in the first network. Specifically, an access point protocol (inter access point protocol, IAPP) may be used to exchange information between the first AP and other APs in the first network through a wired network, so as to obtain information sent by other APs.

Step 502c: The first AP determines the first part of the sixth intermediate matrix Q according to the p+Kth main diagonal element b _p of the first intermediate matrix D and the first K main diagonal elements in the first intermediate matrix D; K-row vector and K+p-th row vector.

Wherein, each row vector of the sixth intermediate matrix Q corresponds to a network node, and the network node is an AP or STA in the first network.

Step 502c will be described below in conjunction with steps 1 to 3.

Step 1: The first AP uses the p-th column vector of the channel matrix W, the p+K-th main diagonal element b _p of the first intermediate matrix D, and the first K main pairs in the first intermediate matrix D. The corner elements determine the p-th row vector of the third intermediate matrix R

where the second intermediate matrix

The W ^T is the W transpose.

Since the first AP only acquires the p-th column vector of the channel matrix W, as well as the first K main diagonal elements and the p+K-th main diagonal elements b _p of the first intermediate matrix, therefore, the th An AP can only determine the p-th row vector of the first intermediate matrix R

Step 2: The first AP according to the stochastic gradient descent algorithm and the p-th row vector of the third intermediate matrix R

Determine the p-th row vector of the first matrix X _M and the second matrix Y _M .

Wherein, the degree of similarity between the first matrix X _M and the third matrix is greater than or equal to a first preset threshold, and the degree of similarity between the second matrix Y _M and the fourth matrix is greater than or equal to a second preset threshold.

The third matrix is a matrix obtained by selecting M column vectors from the left singular matrix obtained by singular value decomposition of the third intermediate matrix R, and each column vector in the left singular matrix has a corresponding singular value, and the first The M column vectors of the three matrices are the M column vectors selected from the left singular matrix in descending order of singular values.

The fourth matrix is a matrix obtained by selecting M column vectors from the right singular matrix obtained by singular value decomposition of the third intermediate matrix R. Each column vector in the right singular matrix has a corresponding singular value, and the The M column vectors of the fourth matrix are M column vectors selected from the right singular matrix in descending order of singular values.

M is an integer greater than or equal to log ₂ (K+L) and less than or equal to min(K, L), log ₂ (K+L) refers to the logarithm of K+L with base 2, min(K, L ) means taking the minimum of K and L.

It should be noted that the value of M can also be determined in combination with the actual situation, which is not specifically limited in this application. The above example of the value range of M is determined by the analysis of experimental data. When the value range of M is an integer between log ₂ (K+L) and min(K, L), the server will determine the value of the STA and AP in the first network. The grouping effect can achieve better results. For example, the sum of the effective signal strengths in the sub-network formed by the APs and STAs in each group is relatively large, and the signal interference strength between the network nodes (APs or STAs) in the sub-network and outside the sub-network is relatively low.

Wherein, the size of the first preset threshold and the second preset threshold can be determined in combination with experimental data, and specifically, the sizes of the first preset threshold and the second preset threshold can be determined in combination with the following formula (5).

In this embodiment, the APs in the first network implement singular value decomposition of the third intermediate matrix R and clustering of row vectors of the sixth intermediate matrix Q in a distributed network management system in a cooperative manner. In a distributed network management system, each AP measures the channel parameter information between each AP and the STAs within the signal coverage of each AP (the channel parameter information measured by each AP corresponds to the value of the channel matrix W For example, if the first AP is the p-th AP in the first network, then the first AP can calculate the p-th row vector of the third intermediate matrix R

A distributed stochastic gradient descent algorithm is used between APs in the first network to achieve a result similar to that obtained by performing singular value decomposition on the third intermediate matrix R. Specifically, the problem can be approximated as:

in,

pointing to make

The minimized X _M and Y _M .

to take

The Frobenius norm of .

Specifically, the problem of the above formula (7) is solved through the calculation process of the embodiment shown in FIG. 6A , please refer to the related introduction in FIG. 6A later.

Step 3: The first AP is based on the p+K-th main diagonal element b _p of the first intermediate matrix D, the first K main diagonal elements in the first intermediate matrix D, and the first matrix X _M . The p-th row vector and the second matrix Y _M are calculated to obtain the sixth intermediate matrix

The first K row vector and the K+pth row vector of .

Among them, the first K row vectors of the sixth intermediate matrix Q are:

And the K+pth row vector of the sixth intermediate matrix Q is:

The K+p th row vector of the sixth intermediate matrix Q corresponds to the p th AP, and the first K row vectors of the sixth intermediate matrix Q correspond to K STAs in the first network respectively.

Step 502d: The first AP performs clustering on the target row vector according to the clustering algorithm to obtain a second clustering result.

The target row vector includes the K+p th row vector corresponding to the first AP and the row vector corresponding to the first STA among the first K row vectors of the sixth intermediate matrix Q. One cluster in the plurality of clusters corresponds to one group in the plurality of groups.

Optionally, the clustering algorithm is k-means algorithm, k-means++ algorithm, mean shift clustering, maximum expectation clustering algorithm, DBSCAN, graph community detection clustering algorithm, GCN clustering algorithm, and the like.

In this embodiment, the first AP is introduced by using k-means as an example, and specifically, the process of determining the first AP in step 502d is introduced through the embodiment shown in FIG. 7 later.

Step 502e: The first AP determines network nodes respectively included in the multiple groups according to the row vectors of the multiple clusters.

Specifically, since the K+p th row vector of the sixth intermediate matrix Q corresponds to the p th AP, and the first K row vector distributions of the sixth intermediate matrix Q correspond to the K STAs in the first network, the first AP can The network nodes corresponding to the row vectors of the same cluster in the multiple clusters are divided into the same group, and the network node is the first AP or the first STA.

503. The first AP sends grouping results of multiple groups.

Since the objects of the first AP grouping include the first AP and the first STA, the multiple groups include the first AP and the first STA. The grouping result may include a grouping number corresponding to each grouping, and APs and STAs corresponding to each grouping number.

504. The first AP adjusts the STA connected to the first AP according to the group to which the first AP belongs.

The adjustment method of the first AP in step 504 is similar to the adjustment method of the second AP in step 407 in the embodiment shown in FIG. 4A . For details, please refer to the related introduction of step 407 in the embodiment shown in FIG. 4A , which is not repeated here. Repeat.

In a distributed network management system, multiple APs group all APs and all STAs in the first network in a cooperative manner. The specific distribution of multiple groups is shown in Figure 5B. The grouping effect of multiple groups is similar to that of multiple groups. The grouping effects of the aforementioned multiple groups in FIG. 4C-3 are similar, and the sum of the effective signal strengths in the sub-network formed by the APs and STAs in each group is relatively large, and the network nodes (AP or The signal interference strength between STAs) is low.

In the embodiment of the present application, the first AP acquires the first channel parameter information; then, the first AP groups the first AP and the STAs connected to the first AP within the signal coverage of the first AP according to the first channel parameter information, Obtain multiple groups; then, the first AP sends the grouping results of the multiple groups, and the first AP adjusts the STAs connected to the first AP according to the groups to which the first AP belongs, so as to manage and plan the STAs connected to the AP. Secondly, in the embodiment of the present application, in the distributed network management system, each AP of the first network implements grouping of all APs and all STAs of the first network through a collaborative method, graph theory method and spectral clustering, and obtains Multiple groups, so that the signal interference between the sub-networks formed by each group in the multiple groups is small, and the effective signal strength in the sub-network is large, which can reduce the interference between user equipment and improve network transmission. performance.

In a distributed network management system, multiple APs group all APs and all STAs in the first network in a cooperative manner. Each AP may group each AP and the STAs that have established connections with the respective APs. Then, under the distributed network management system, for the channel allocation process of the APs in the same group, please refer to the related introduction of the following steps 505 to 511 for details.

Then, the above-mentioned embodiment shown in FIG. 5A further includes steps 505 to 511 . Also, steps 505 to 511 are executed before step 502 . Steps 505 to 511 and steps 503 to 504 have no obvious order of execution. Steps 503 to 504 can be executed first, or steps 505 to 511 can be executed first; or, depending on the situation, steps 505 to 511 and steps 505 to 505 can be executed simultaneously. Step 511, which is not specifically limited in this application.

505. The first AP receives the first packet information sent by the fourth AP.

The first grouping information includes grouping information to which a fourth AP belongs and an identifier of the fourth AP, where the fourth AP includes APs other than the first AP in the first network.

Specifically, the first group includes the group number of the group to which the fourth AP belongs. The first AP receives the first group information broadcast by other APs in the first network to determine the group to which the other APs belong.

506. The first AP determines, according to the first group information, that the fifth AP and the first AP belong to the same group.

The fifth AP is a part of APs in the fourth AP, and the fifth AP and the first AP belong to the same group.

Specifically, according to the group number included in the first group information, the first AP determines that the group number of the group to which the first AP belongs is the same as the group number of the group to which the fifth AP belongs, that is, the first AP can determine that the first AP and the group belong to the same group. The fifth AP belongs to the same group.

507. The first AP judges whether the priority of the first AP is higher than the priority of the fifth AP according to the identifier of the first AP, the identifier of the fifth AP and the preset AP priority rule, and if so, perform step 508; If not, step 510 is executed.

The preset AP priority rule includes the priority corresponding to the identifier of each AP in the first network, and the first AP can determine the priority of the first AP and the priority of the fifth AP according to the preset AP priority rule level, and determine whether the priority of the first AP is higher than the priority of the fifth AP, if so, go to step 508; if not, go to step 510.

Optionally, the preset AP priority rule is pre-configured on the first AP, or specified by a communication protocol, or sent to the first AP by other network devices.

The preset AP priority rule can be set in any of the following ways:

1. Set the preset AP priority rule according to the hardware configuration of the AP. For example, the higher the hardware configuration of the AP, the higher the priority of the AP.

2. Set the preset AP priority rule according to the order of the AP's index. For example, the larger the index of the AP, the higher the priority of the AP.

The above setting method is only an example, and the preset AP priority rule may also be set in other manners, which are not specifically limited in this application.

508. The first AP selects a first channel by scanning channels, and accesses the first channel.

For example, the first AP may use the LCCS technology to scan channels and select the first channel, and access the first channel.

509. The first AP sends the first channel allocation information to the fifth AP.

Wherein, the first channel allocation information is used to instruct the fifth AP to access the first channel.

Optionally, the first channel allocation information includes indication information for indicating the frequency band of the first channel or the frequency band of the first channel.

510. The first AP receives the second channel allocation information sent by the sixth AP.

The second channel allocation information is information of the second channel selected by the sixth AP, and the sixth AP is the AP with the highest priority among the fifth APs. The second channel allocation information is similar to the first channel allocation information. For details, please refer to the foregoing related introduction of the first channel allocation information.

511. The first AP adjusts the channel accessed by the first AP to the second channel according to the second channel allocation information.

For example, the second channel allocation information includes a frequency band of the second channel, and the first AP can access the first AP to the frequency band of the second channel.

From the above steps 505 to 511, it can be known that in the distributed network management system, the same channel is allocated to multiple APs in the same group, so that multiple APs in the same group can realize multi-AP joint transmission, thereby satisfying the WiFi network. The demand for high throughput and low latency also improves spectrum utilization.

It should be noted that the channel allocation manners in the above steps 505 to 511 are just an example. In a distributed network management system, multiple APs in the same group can also select an AP by means of listening and competition. Then, the AP selects a channel, and then sends the information of the selected channel to other APs in the group, so that multiple APs in the same group can access the same channel to realize multi-AP joint transmission; and meet the high throughput of the WiFi network It can meet the requirements of high throughput and low latency, and at the same time, it also improves the spectrum utilization.

Please refer to FIG. 6A. FIG. 6A is a schematic diagram of another embodiment of the network management method according to the embodiment of the present application. In Figure 6A, the method includes:

601. The first AP randomly initializes the p-th row vector x _p of the first matrix X _M and the second matrix Y _M .

Among them, x _p = [x _p1 x _p2 ... x _pM ], x _p is a matrix of one row multiplied by M columns, x _pf is the element of the f-th column vector in x _p ; Y _M = [y ₁ y ₂ ... y _M ] is a matrix of K rows by M columns, y _f is the element of the f-th column vector in Y _M , and f is an integer greater than or equal to 1 and less than or equal to M.

602 . The first AP initializes the momentum term Δx _p and the momentum term ΔY _M , so that the momentum term Δx _p and the momentum term ΔY _M are both 0.

The momentum term Δx _p and the momentum term ΔY _M are used in the stochastic gradient descent process to accelerate the convergence process of the stochastic gradient descent algorithm, so as to solve the minimum value problem of the above equation (5). Among them, the momentum term Δx _p =[Δx _p1 Δx _p2 ... Δx _pM ], and Δx _pf is the f-th column vector of the momentum term Δx _p . The momentum term ΔY _M =[Δy ₁ Δy ₂ ... Δy _M ], and Δy _f is the f-th column vector of the momentum term ΔY _M.

603. The first AP broadcasts the second matrix Y _M to other APs in the first network except the first AP.

After the first AP performs the initialization process of steps a and b, the first AP periodically broadcasts the second matrix Y _M to other APs, and other APs in the first network also periodically broadcast the second matrix Y M on the other APs. matrix Y _M .

Specifically, the first AP may broadcast the second matrix Y _M through a first broadcast message, where the first broadcast message carries the second matrix Y _M , the first identifier and the grouping round number.

The first identifier is used when the first broadcast message is a broadcast message for stochastic gradient descent processing. The grouping round number is used to identify the round number of the current grouping performed by the first AP, that is, the number of times the first AP currently groups the first AP and the first STA. When the first AP receives the first broadcast message with a higher grouping round number, the first AP ends the execution operation of the stochastic gradient descent corresponding to the grouping round number, and enters the next round of the stochastic gradient descent process.

For example, as shown in FIG. 6B , the first bit of the payload of the first broadcast message is used to identify the first broadcast message as a broadcast message for stochastic gradient descent processing. For example, when the first bit is "0", it represents that the first broadcast message is used for stochastic gradient descent processing. In addition to the first bit, the remaining 7 bits of the first byte of the payload of the first broadcast message are used to identify the round number of the packet, and are used to identify the round number of the current packet of the first AP. The second matrix Y _M is carried on the remaining bytes except the first byte in the payload in the first broadcast message.

604. The first AP starts a first timer.

The first timer is used for the first AP to monitor the second matrix Y _M broadcast by other APs in the first network within the duration of the first timer.

605. The first AP determines the interruption type of the first interruption. If the first interruption is caused by the first AP receiving an interruption that occurs when other APs send the second matrix Y _M , perform step 606; if the first interruption is due to the first timing If the timer expires or is interrupted, the first AP returns to step 604, and the first AP restarts the first timer.

When the first _interruption occurs to the first AP, the first AP determines the interruption type of the first interruption. If the timer expires or is interrupted, the first AP returns to step 604, where the first AP continues to receive and monitor the second matrix Y _M sent by other APs in the first network.

606. The first AP updates the p-th row vector x _p of the first matrix X _M and the second matrix Y _M according to the stochastic gradient descent rule.

Step 606 is described below in conjunction with steps 1 to 3.

Step 1: The first AP calculates the p-th row vector of the third intermediate matrix R

The first intermediate matrix is known from step 502c in the embodiment shown in FIG. 5A above

The first K main diagonal elements of , i.e.

All the elements on the main diagonal of , and the p+K-th main diagonal element b _p of the first intermediate matrix D . Then it is known that

is a matrix with one row by K columns,

for

The element in the i-th column of .

Step 2: The first AP stores the received second matrix Y _M sent by other APs.

Step 3: The first AP is based on the p-th row vector of the third intermediate matrix R

and the received other AP sends the second matrix Y _M to update the p-th row vector x _p and the second matrix Y _M of the first matrix X _M on the first AP.

Steps a to d are combined below to update the first element x _p1 in x _p =[x _p1 x _p2 ... x _pM ] and the first element y ₁ in Y _M =[y ₁ y ₂ ... y _M ] The procedure is used as an example to introduce step 3.

Step a, the first AP calculates the error vector

Step b. The first AP updates Δx _p1 and Δy ₁ , the updated Δx _p1 =αΔx _p1 +ηey ₁ , the updated Δy ₁ =αΔy ₁ +ηe ^T x _p1 , α and η are constant parameters, α is a momentum parameter , η is the learning rate, e ^T is the transpose of e,

is the transpose of y ₁ .

Step c, the first AP update

get updated

Step d, the first AP updates x _p1 and y ₁ , and the updated x _p1 is equal to the pre-update x _p1 plus the updated Δx _p1 , and the updated y ₁ is equal to the pre-update y ₁ plus the updated Δy ₁ .

The update process for other elements in x _p is similar to the update process for x _p1 , and the update process for other elements in Y _M is similar to the update process for y ₁ , and it should be noted that when calculating the error vector e, should use the one from the previous update

Calculate this error vector. from the previous update

Refers to the e obtained by the first AP updating the previous element of the currently updated element. For example, the above steps a to d update the first element x _p1 in x _p and the first element y ₁ in Y _M , then use the information obtained in step 1 in step 606

If the first AP updates the second element x _p2 in x _p and the first element y ₂ in Y _M , then when the first AP calculates the error vector, it uses the update obtained in the above step c.

By analogy, we will not describe them one by one here.

It should be noted that after the first AP completes step 606, the first AP can restart the first timer and continue to monitor the first matrix Y _M broadcast by other APs in the first network. When there are two matrices Y _M , the first AP performs operations similar to those in step 606 , that is, the p-th row vector x _p and the second matrix Y _M of the first matrix X _M obtained in step 606 are updated again, and so on. The process of the second update is similar, until the number of restarts of the first timer reaches the preset number of times, then the first AP determines the p-th row vector x _p and the second matrix Y of the first matrix X _M obtained by the last update. _M.

In step 502d in the above-mentioned embodiment shown in FIG. 5A , the first AP performs clustering on the target row vector according to the clustering algorithm to obtain a second clustering result. The step 502d is described below with reference to the embodiment shown in FIG. 7 . Please refer to FIG. 7 , which is a schematic diagram of another embodiment of the network management method according to the embodiment of the present application. In Figure 7, the method includes:

701. The first AP generates a first cluster center according to a first random seed.

The first cluster center includes the cluster centers corresponding to the multiple clusters generated by the first AP, each cluster corresponds to a cluster center, and each cluster in the multiple clusters corresponds to one of the multiple groups grouping.

Specifically, all APs in the first network make the first random seed generate cluster centers corresponding to multiple clusters. For example, the first AP randomly generates the first cluster centers G={c ₁ , c ₂ , c ₃ , c ₄ ...... c _N } corresponding to the multiple clusters according to the first random seed, and c _b is the b-th The cluster center corresponding to the cluster, b is an integer greater than or equal to 1 and less than or equal to N. That is, the randomly initialized cluster centers corresponding to the multiple clusters are obtained respectively, and the cluster G _b corresponds to the cluster center c _b .

It should be noted that the first random seed may be pre-configured, or may be generated by an AP (for example, a master AP) in the first network, and then sent by the AP to other APs in the first network , which is not specifically limited in this application.

702. The first AP determines, according to the first cluster center, a cluster to which each row vector in the target row vector belongs, and obtains a row vector included in each of the multiple clusters.

Specifically, the first AP searches for a cluster center closest to each row vector for each row vector in the target row vector, and divides each row vector into a cluster corresponding to the cluster center. For example, the first AP from the first K row vectors of the sixth intermediate matrix Q

and the K+pth row vector of the sixth intermediate matrix Q

Select the target row vector in , here the target row vector is called

The first AP is the

The row vectors included in find the cluster corresponding to the closest cluster center for each row vector, respectively.

It should be noted that the first AP uses all or part of each row vector in the target row vector as a representative row vector for clustering. That is to say, the first AP can select part of the content of each row vector to represent the row vector for clustering.

On the basis of the above steps 701 and 702, step 502e in the embodiment shown in FIG. 5A specifically includes:

When the first preset condition is satisfied, the first AP determines the network nodes respectively included in the multiple groups according to the row vectors of the multiple clusters.

Specifically, when the first preset condition is satisfied, the first AP divides the network nodes corresponding to the row vector of the same cluster in the row vectors of the multiple clusters into the same group.

There are many kinds of the first preset condition, and two possible implementation manners are shown below.

Implementation mode 1: The first preset condition includes that the update times of the cluster centers corresponding to the multiple clusters are greater than or equal to a third preset threshold.

Specifically, the first AP determines whether the update times of the cluster centers corresponding to the multiple clusters are greater than or equal to the third preset threshold, and if so, the first AP determines the multiple groups according to the row vectors of the multiple clusters The network nodes included respectively; if not, the following steps 512 to 514 are performed.

For example, the third preset threshold is 100. The third preset threshold is mainly determined according to experimental data, that is, the update times of the cluster centers corresponding to the multiple clusters respectively when the above-mentioned clustering process reaches a degree of convergence.

Implementation mode 2: The first preset condition is described below in conjunction with steps 1 to 4, including: the first convergence accuracy is less than or equal to the preset convergence accuracy.

The first convergence accuracy is the ratio of the absolute value of the first difference to the first global error.

The first difference is the difference between the first global error and a preset initialization error.

The first global error is the sum of the first local errors respectively calculated by all APs in the first network.

The first local error of the first AP includes the sum of the errors corresponding to each cluster of the plurality of clusters determined by the first AP, and the error corresponding to each cluster is the row vector included in each cluster and each cluster respectively. The sum of errors between the first average vectors corresponding to the clusters, where the first average vector corresponding to each cluster is calculated by the first AP according to a gossip protocol.

Then, when the first AP determines that the first convergence accuracy is less than or equal to the preset convergence accuracy, the first AP executes the foregoing step 502e.

For example, the initialization error is ε and the first global error is

The preset convergence accuracy is τ; then the first AP judges whether it satisfies the

If yes, go to step 502e; if not, go to the following steps 512 to 514.

For example, the preset convergence accuracy is 0.01, and the preset initialization error is infinite.

The preset convergence accuracy is determined based on experimental data and experience. That is, when the above-mentioned clustering process reaches the degree of convergence, the value of the preset convergence precision.

Optionally, the preset convergence precision is set by the first AP, or may be specified by a communication protocol, or sent to the first AP by other devices, which is not specifically limited in this application.

The calculation process of the first convergence accuracy is described below with reference to steps 1 to 3.

Step 1: the first AP calculates the first average vector corresponding to the row vector of each cluster in the multiple clusters according to the gossip protocol (also called epidemic protocol (epidemic protocol), or rumor algorithm, epidemic propagation algorithm);

Specifically, the first AP calculates the number of network nodes size _b included in the multiple clusters determined by the first AP and the sum _b of the row vectors included in the multiple clusters respectively, where b is greater than or equal to 1 and less than or equal to N Integer, N is the number of groups of multiple groups. Then, the first AP uses the gossip protocol to calculate the first average vector corresponding to the row vector of each cluster in the multiple clusters respectively

If the first AP is the pth AP, each AP in the first network stores the local variable Δ _p1 and the local control parameter ω _p1 respectively. The first AP sets Δ _p1 ={sum ₁ , sum ₂ ...... sum _N } on the first AP, that is, the sum of the row vectors respectively included in the multiple clusters. The first AP sets ω _p1 ={size ₁ , size ₂ ...... size _N } on the first AP, that is, the number of row vectors respectively included in the multiple clusters. Then, the first AP uses the gossip protocol to calculate the first average vector corresponding to the row vector of each cluster in the multiple clusters respectively

It should be noted that, for the related introduction of the first AP using the gossip protocol, please refer to the related introduction of the embodiment shown in FIG. 8A later.

Step 2: The first AP calculates the first local error.

Specifically, the first AP calculates the first local error according to the row vectors respectively included in the multiple clusters obtained in step 702 and the first average vector corresponding to the row vector of each cluster in the multiple clusters.

Wherein, the first local error includes a sum of errors corresponding to each of the multiple clusters determined by the first AP. The error corresponding to each cluster is the sum of errors between the row vector included in each cluster and the first average vector corresponding to each cluster.

For example, the first local error

The first local error represents the sum of root mean square errors corresponding to a plurality of clusters in the first AP respectively.

represents the row vector in the bth cluster among the multiple clusters, and c _b represents the cluster center corresponding to the bth cluster.

It represents the sum of the root mean square errors of the row vector of the bth cluster and the cluster center corresponding to the bth cluster.

Step 3: The first AP calculates the first global error according to the gossip protocol and the first local error.

The first global error is the sum of the first local errors calculated respectively by all APs in the first network.

Specifically, if the first AP is the p-th AP, each AP in the first network stores the local variable Δ _p2 and the local control parameter ω _p2 respectively. Δ _p2 on the first AP is set to the sum of the corresponding root mean square errors in multiple clusters in the first AP, ω _p2 on the first AP is set to 1, and the local control parameters on other APs are 0. Then, the first AP uses the gossip protocol and the first local error to calculate the first global error, that is, the sum of the first local errors calculated by all APs in the first network is obtained.

In this embodiment, the calculation of the first local error by other APs of the first network is similar to the manner in which the first AP calculates the first local error on the first AP in step 2, and details are not repeated here. When each AP calculates the first local error of each AP, the clustering result of each AP's most recent clustering of the row vectors of multiple clusters and the previous clustering results of the row vectors of multiple clusters The clustering result of clustering is calculated. The moments at which other APs of the first network send the first local error may be different or the same. For example, AP1 sends the first local error of AP1 to the first AP at time 1, that is, AP1 should select the clustering result of clustering the row vectors of multiple clusters most recently from time 1 and the previous row vector of multiple clusters. The first global error of AP1 is calculated based on the clustering result of the vector clustering. AP2 sends the first local error of AP2 to the first AP at time 2, that is, AP2 should select the clustering result of clustering the row vectors of multiple clusters most recently from time 2 and the previous row vector of multiple clusters. The first global error of the AP2 is calculated from the clustering result of the clustering. The same is true for other APs of the first network, and will not be described one by one here.

It should be noted that, in step 3 and steps 801 to 811 shown in FIG. 8A below, the first AP uses the gossip protocol to determine the first average vector corresponding to the row vector of each cluster in the multiple clusters respectively.

Similarly, the difference is that the first AP sets the local variable Δ _p2 to the sum of the root mean square errors corresponding to the multiple clusters in the first AP, and sets ω _p2 to 1, so that by similar to what is shown in FIG. 8A later The execution flow of steps 801 to 811 shown in the figure can obtain the sum of the first local errors calculated by all APs in the first network.

Step 4: The first AP calculates the first convergence accuracy according to the first global error and the preset initialization error.

The first convergence accuracy is equal to the absolute value of the quotient of the first difference and the first global error, and the first difference is the difference between the first global error and the initialization error.

In a possible implementation manner, if the first preset condition is not satisfied, the above-mentioned embodiment shown in FIG. 5A further includes steps 512 to 514 .

Step 512: the first AP calculates the first average vector corresponding to the row vectors of the multiple clusters according to the gossip protocol;

Step 512 is similar to step 1 of implementation manner 2 in the foregoing first preset condition. For details, please refer to the relevant introduction of step 1 of implementation manner 2 in the foregoing first preset condition, which will not be repeated here.

Step 513: The first AP takes the first average vector corresponding to the row vector of each cluster in the multiple clusters as the cluster centers corresponding to the multiple clusters respectively, and obtains the second cluster center;

Step 514: the first AP determines the cluster to which each row vector in the target row vector belongs according to the second cluster center;

Steps 513 to 514 are similar to steps 701 and 702 in the embodiment shown in FIG. 7 . For details, please refer to the related introductions of steps 701 and 702 in the embodiment shown in FIG. 7 , which will not be repeated here.

Step 515: When the second preset condition is satisfied, the first AP divides the network nodes corresponding to the row vector of the same cluster in the multiple clusters into the same group.

Step 515 is similar to the related introduction of the foregoing step 502e. For details, please refer to the related introduction of the foregoing step 502e, which will not be repeated here.

The second preset condition is similar to the first preset condition, and two possible implementation manners are shown below.

Implementation mode 1: The second preset condition includes that the update times of the cluster centers corresponding to the multiple clusters are greater than or equal to the third preset threshold.

For the related introduction of the third preset threshold, please refer to the related introduction to the third preset threshold in the first implementation manner of the first preset condition, which will not be repeated here.

For example, steps 512 to 515 are the first update of the cluster centers corresponding to the multiple clusters by the first AP. Therefore, if the third preset threshold is 1, the first AP executes step 515; if the third preset threshold is an integer greater than 1, the second AP performs the third clustering on the target row vector, specifically The clustering process is similar to the aforementioned steps 512 to 515 .

Implementation mode 2: The second preset condition includes: the second convergence accuracy is less than or equal to the preset convergence accuracy, and the second convergence accuracy is the absolute value of the difference between the second global error and the first global error and the The ratio of the second global error.

Then, when the first AP determines that the second convergence accuracy is less than or equal to the preset convergence accuracy, the first AP executes the foregoing step 515 .

The calculation process of the second convergence accuracy is described below in conjunction with step a and step d.

Step a: the first AP calculates the second average vector corresponding to the row vector of each cluster in the multiple clusters according to the gossip protocol;

Specifically, it can be seen from the above steps 513 and 514 that the row vector of each cluster in the multiple clusters is updated again, then the first AP uses the gossip protocol to calculate the first AP corresponding to the row vector of each cluster in the multiple clusters. Two mean vectors. The specific calculation method is similar to step 1 in the second implementation mode in the foregoing first preset condition, and details are not repeated here.

Step b: The first AP calculates the second local error.

The first AP obtains the row vectors respectively included in the multiple clusters according to the above step 514 and the second average vector corresponding to the row vector of each cluster in the multiple clusters.

Step c: The first AP calculates the second global error according to the gossip protocol and the second local error.

Steps b to c are similar to steps 2 to 3 in implementation mode 2 in the aforementioned first preset condition, please refer to the relevant introduction of steps 2 to 3 in implementation mode 2 in the aforementioned first preset condition, I won't go into details here.

Step d: The first AP calculates the second convergence accuracy according to the second global error and the first global error.

The second convergence accuracy is equal to the ratio of the absolute value of the second difference to the quotient of the second global error, and the second difference is the difference between the second global error and the first global error.

Specifically, since steps 512 to 515 are the second clustering of the target row vector, the second global error should be compared with the first global error obtained by the calculation of the previous clustering (ie, the first clustering). , that is to say, the initialization error in the foregoing step 502e is updated to the first global error. If the first AP needs to perform the third clustering on the target row vector, the initialization error is updated to the second global error, and so on.

Therefore, when the absolute value of the quotient of the second difference and the second global error is less than or equal to the preset convergence precision, the first AP executes step 515 . When the absolute value of the quotient of the second difference and the second global error is greater than the preset convergence precision, the first AP continues to cluster the target row vector for the third time. 515 is similar.

The process of calculating the first average vector corresponding to the row vector of each cluster in the multiple clusters by the first AP according to the gossip protocol will be described below with reference to the embodiment shown in FIG. 8A . Please refer to FIG. 8A , FIG. 8A is another embodiment of the network management method according to the embodiment of the present application. In Figure 8A, the network management method includes:

801. The first AP sets a local variable Δ _p1 and a local control parameter ω _p1 .

Each AP in the first network stores a local variable Δ _p1 and a local control parameter ω _p1 , respectively. The first AP sets Δ _p1 ={sum ₁ , sum ₂ ......sum _N }, that is, the sum of the row vectors respectively included in the multiple clusters, and sets ω _p1 ={size ₁ , size ₂ ....... ..size _N }, that is, the number of row vectors included in the multiple clusters. The first AP calculates Δ _p1 and ω _p1 for the first AP.

802. The first AP determines a first node cache set.

The first node cache set includes a set consisting of I _max APs selected by the first AP from APs directly connected to the first AP in the first network, where I _max is an integer greater than or equal to 1.

The size of the I _max is related to the cache size or storage space size of the first AP. For example, the larger the storage space of the first AP, the larger the I _max .

803. The first AP selects a target node from the first node cache set.

804. The first AP determines Δ _p1 /2, ω _p1 /2 and r1 of the first AP.

Wherein, r1 is used to indicate whether the first AP exchanges the Δ _p1 and ω _p1 with the target node for the first time. For example, when r1 is 1, it indicates that the first AP exchanges the Δ _p1 and ω _p1 with the target node for the first time. When r1 is 0, it indicates that Δ _p1 and ω _p1 are not exchanged between the first AP and the target node for the first time.

805. The first AP sends a second broadcast message to the target node.

Wherein, the second broadcast message carries the grouping round number, Δ _p1 /2, ω _p1 /2 and r1. For the related introduction of the grouping round number, please refer to the related introduction in the embodiment shown in FIG. 6A , which will not be repeated here.

For example, as shown in FIG. 8B , the second broadcast message carries the packet round number, Δ _p1 /2, ω _p1 /2, r1 and the identifiers of the nodes included in the first cache set.

It should be noted that the second broadcast message shown in FIG. 8B is the first broadcast message sent by the first AP to the target node for the first time, so the second broadcast message carries Δ _p1 /2, ω _p1 /2, and r1 is 1; If it is not the first time that the first AP sends the second broadcast message to the target node, the second broadcast message should carry Δ _p1 , ω _p1 and r1=0 obtained after the current update of the first AP. For example, when the first AP sends the second broadcast message to the target node for the second time, the updated Δ _p1 and ω _p1 on the first AP are: the first AP uses Δ _p1 /2 in step 801 as the first AP On the updated Δ _p1 , use ω _p1 /2 in step 801 as the updated ω _p1 on the first AP. Then, the second broadcast message sent by the first AP to the target node for the second time carries the updated Δ _p1 , ω _p1 and r1=0 on the first AP.

806. The first AP starts a second timer.

Wherein, the second timer is used for the first AP to monitor the second broadcast messages sent by other APs in the first network except the first AP within the duration of the second timer.

807. The first AP determines the interruption type of the second interruption. If the second interruption is caused by the first AP receiving the second broadcast message sent by other APs in the first network except the first AP, then the interruption occurs. Step 808 is executed; if the second interruption occurs due to the timeout or interruption of the second timer, the first AP returns to step 806 .

If the second interruption is caused by the timeout or interruption of the second timer, the first AP returns to step 806 , that is, restarts the second timer, and then executes steps 806 to 810 .

It should be noted that, if the second broadcast message of the target node is still not received after restarting the second timer for many times, the first AP can re-select other nodes, and then execute the first AP according to the process similar to step 804 to step 810. Information exchange between the AP and selected other nodes. Specifically, the number of times the first AP restarts the second timer for the selected node can be configured on the first AP, and when the number of times is reached and the second broadcast message sent by the node has not been sent, the first AP selects other nodes, Then, the information exchange between the first AP and the selected other nodes is performed according to the process similar to step 804 to step 810 .

808. The first AP determines whether r1 in the second broadcast message sent by other APs in the first network than the first AP is 1, and if so, execute steps 809 to 810; if not, execute steps 809 to 810 Step 810.

If the first AP receives the second broadcast message sent by other APs in the first network except the first AP, the first AP judges whether the reply message r1 is 1, and if so, executes step 809 and 810; if not, perform step 810.

809. The first AP sends the pre-update Δ _p1 /2 and ω _p1 /2 of the first AP to the first node.

The first node is the node that sends the second broadcast message to the first AP within the second timer in the foregoing step 807 .

810. The first AP updates Δ _p1 /2 and ω _p1 /2 according to the second broadcast message sent by other APs in the first network.

If r1 in the second broadcast message sent by the first node is 1, the first AP adds Δ _p1 /2 on the first AP to Δ _p1 /2 carried in the second broadcast message sent by the first node , add ω _p1 /2 on the first AP to the ω _p1 /2 carried in the second broadcast message sent by the first node.

If r1 in the second broadcast message sent by the first node is 0, the first AP does not need to perform the above step 809, and Δ _p1 /2 on the first AP is added to the second broadcast message sent by the first node. The Δ _p1 /2 carried is ω _p1 /2 on the first AP plus ω _p1 /2 carried in the second broadcast message sent by the first node.

811. The first AP updates the first node cache set.

Specifically, the first AP selects I _max APs from the second node cache set carried in the second broadcast message sent by the first node, the first node and the first node cache set as the first node cache set Included AP.

The above shows the process of executing the gossip protocol between the first AP and the target node, realizing the exchange of Δ _p1 and ω _p1 between the first AP and the target node. Then, similarly for other nodes in the first node cache set, the first AP performs the process of the above steps 803 to 811 to realize the Δ between the first AP and all nodes in the first node cache set The exchange of _p1 and ω _p1 , so as to obtain the first average vector corresponding to the row vector of each cluster in the multiple clusters calculated by the first AP using the gossip protocol

An embodiment of the present application further provides a communication apparatus. Please refer to FIG. 9 , which is another schematic structural diagram of the communication apparatus 900 in the embodiment of the present application. The communication apparatus 900 may be used to execute the first communication apparatus in the embodiment shown in FIG. 3 . , the steps performed by the server in the embodiment shown in FIG. 4A , and the steps performed by the first AP in the embodiment shown in FIG. 5A may refer to the relevant descriptions in the foregoing method embodiments.

The communication device 900 includes: a processor 901 , a memory 902 and a transceiver 903 .

The processor 901, the memory 902 and the transceiver 903 are respectively connected through a bus, and the memory stores computer instructions.

In a possible implementation manner, when the communication apparatus 900 is configured to perform the steps performed by the server in the embodiment shown in FIG. 4A , the grouping module 102 in the foregoing FIG. 1B may specifically be the processor 901 in this embodiment. , so the specific implementation of the processor 901 is not repeated here. The transceiver module 101 in the aforementioned FIG. 1B may specifically be the transceiver 903 in this embodiment, and thus the specific implementation of the transceiver 903 will not be described again.

In another possible implementation manner, when the communication apparatus 900 is used to perform the steps performed by the first AP in the embodiment shown in FIG. 5A , the grouping module 202 , the grouping management module 203 and the signal measurement in the aforementioned FIG. 2B The module 204 may be the processor 901 in this embodiment, so the specific implementation of the processor 901 will not be described again. The transceiver module 201 in the aforementioned FIG. 1B may specifically be the transceiver 903 in this embodiment, and thus the specific implementation of the transceiver 903 will not be described again.

An embodiment of the present application further provides a control device. Please refer to FIG. 10 , which is another schematic structural diagram of the control device 1000 in the embodiment of the present application. The control device 1000 can be used to execute the control device in the embodiment shown in FIG. 4A . For the steps, reference may be made to the relevant descriptions in the foregoing method embodiments.

The control device 1000 includes: a processor 1001 , a memory 1002 and a transceiver 1003 .

The processor 1001, the memory 1002 and the transceiver 1003 are respectively connected through a bus, and the memory stores computer instructions.

The aforementioned grouping management module 104 in FIG. 1C may specifically be the processor 1001 in this embodiment, and thus the specific implementation of the processor 1001 will not be described again. The transceiver module 103 in the aforementioned FIG. 1C may specifically be the transceiver 1003 in this embodiment, and thus the specific implementation of the transceiver 1003 will not be described again.

This embodiment of the present application further provides a second AP. Please refer to FIG. 11 , which is another schematic structural diagram of the second AP 1100 in the embodiment of the present application. The second AP 1100 may be used to execute the second AP in the embodiment shown in FIG. 4A . For the steps performed by the AP, reference may be made to the relevant descriptions in the foregoing method embodiments.

The second AP 1100 includes: a processor 1101 , a memory 1102 and a transceiver 1103 .

The processor 1101, the memory 1102 and the transceiver 1103 are respectively connected through a bus, and the memory stores computer instructions.

The grouping management module 106 and the signal measurement module 107 in the foregoing FIG. 1D may be specifically the processor 1101 in this embodiment, and therefore the specific implementation of the processor 1101 will not be described again. The transceiver module 105 in the aforementioned FIG. 1D may specifically be the transceiver 1103 in this embodiment, and thus the specific implementation of the transceiver 1103 will not be described again.

This embodiment of the present application further provides a fourth STA. Please refer to FIG. 12 , which is another schematic structural diagram of the fourth STA 1200 in the embodiment of the present application.

The fourth STA 1200 includes: a processor 1201 , a memory 1202 and a transceiver 1203 .

The processor 1201, the memory 1202 and the transceiver 1203 are respectively connected through a bus, and the memory stores computer instructions.

The aforementioned processing module 109 and the signal measurement module 110 in FIG. 1E may specifically be the processor 1201 in this embodiment, so the specific implementation of the processor 1201 will not be described again. The transceiver module 108 in the aforementioned FIG. 1E may specifically be the transceiver 1203 in this embodiment, and thus the specific implementation of the transceiver 1203 will not be described again.

An embodiment of the present application further provides a network management system, please refer to FIG. 13 , the network management system includes the server shown in FIG. 1B , the control device shown in FIG. 1C , the AP shown in FIG. STA.

The server shown in FIG. 1B is configured to perform some or all of the steps performed by the first communication apparatus in the embodiment shown in FIG. 3 , and is used to perform some or all of the steps performed by the server in the embodiment shown in FIG. 4A .

The control device shown in FIG. 1C is used to perform some or all of the steps performed by the control device in the embodiment shown in FIG. 4A described above.

The AP shown in FIG. 1D is configured to perform some or all of the steps performed by the second AP in the embodiment described in FIG. 4A .

The STA shown in FIG. 1E is configured to perform steps 407b to 407e performed by the fourth STA in the above-mentioned embodiment shown in FIG. 4A . For details, please refer to the related introductions of the embodiments shown in the foregoing FIG. 3 and FIG. 4A , which will not be repeated here.

An embodiment of the present application further provides a network management system, please refer to FIG. 14 , the network management system includes the first AP shown in FIG. 2B and the second STA shown in FIG. 2C .

The first AP shown in FIG. 2B is used to perform some or all of the steps performed by the first AP in the embodiments shown in FIG. 5A , FIG. 6A , FIG. 7 and FIG. 8A .

Optionally, the network management system further includes a fourth AP, where the fourth AP is configured to perform some or all of the steps performed by the fourth AP in the embodiment shown in FIG. 5A .

The fourth AP includes a fifth AP and a sixth AP. The fifth AP is used to perform some or all of the steps performed by the fifth AP in the embodiment shown in FIG. 5A , and the sixth AP is used to perform some or all of the steps performed by the sixth AP in the embodiment shown in FIG. 5A .

For details, please refer to the related introductions of the embodiments shown in FIG. 5A , FIG. 6A , FIG. 7 , and FIG. 8A , which will not be repeated here.

An embodiment of the present application provides a computer program product including instructions, which is characterized in that, when it runs on a computer, the computer is made to execute any one of FIGS. 3, 4A, 5A, 6A, 7, and 8A. an implementation.

The embodiments of the present application provide a computer-readable storage medium, including computer instructions, when the instructions are executed on a computer, the computer can execute any one of the implementations shown in FIG. 3 , FIG. 4A , FIG. 5A , FIG. 6A , and FIG. 7 . .

An embodiment of the present application provides a chip device, including a processor for invoking a computer program or computer instruction in the memory, so that the processor executes the above-mentioned FIG. 3 , FIG. 4A , FIG. 5A , FIG. 6A , FIG. 7 and FIG. Any of the implementations in 8A.

Optionally, the processor is coupled to the memory through an interface.

Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of the system, device and unit described above may refer to the corresponding process in the foregoing method embodiments, which will not be repeated here.

In the several embodiments provided in this application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the apparatus embodiments described above are only illustrative. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored, or not implemented. On the other hand, the shown or discussed mutual coupling or direct coupling or communication connection may be through some interfaces, indirect coupling or communication connection of devices or units, and may be in electrical, mechanical or other forms.

The units described as separate components may or may not be physically separated, and components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution in this embodiment.

In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit. The above-mentioned integrated units may be implemented in the form of hardware, or may be implemented in the form of software functional units.

The integrated unit, if implemented in the form of a software functional unit and sold or used as an independent product, may be stored in a computer-readable storage medium. Based on this understanding, the technical solutions of the present application can be embodied in the form of software products in essence, or the parts that contribute to the prior art, or all or part of the technical solutions, and the computer software products are stored in a storage medium , including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), magnetic disk or optical disk and other media that can store program codes .

As mentioned above, the above embodiments are only used to illustrate the technical solutions of the present application, but not to limit them; although the present application has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand: The technical solutions described in the embodiments are modified, or some technical features thereof are equivalently replaced; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions in the embodiments of the present application.

Claims

A network management method, characterized in that the method comprises:

The first communication device acquires first channel parameter information, where the first channel parameter information includes channel parameter information between a first AP in the first network and a STA within a signal coverage of the first AP;

The first communication apparatus groups the first AP and the first STA according to the first channel parameter information to obtain multiple groups, and the first STA includes STAs within the signal coverage of the first AP some or all of the STAs in;

The first communication apparatus sends grouping results of the multiple groups, where the grouping results are used to indicate APs and STAs included in each of the multiple groups.
A first communication device, characterized in that the first communication device comprises:

a transceiver module, configured to acquire first channel parameter information, where the first channel parameter information includes channel parameter information between the first AP in the first network and the STAs within the signal coverage of the first AP;

a grouping module, configured to group the first AP and the first STA according to the first channel parameter information to obtain multiple groups, and the first STA includes STAs within the signal coverage of the first AP part or all of the STA;

The transceiver module is configured to send grouping results of the multiple groups, where the grouping results are used to indicate APs and STAs included in each of the multiple groups.
The method according to claim 1 or the first communication device according to claim 2, wherein the first communication device is a server, the first AP includes all APs of the first network, and the The first STA includes all STAs of the first network; the first communication device obtains the first channel parameter information, including:

The server receives the first channel parameter information sent by the control device, where the first channel parameter information includes the difference between each AP in all APs of the first network and the STAs within the signal coverage of each AP. The channel parameter information between the two, the first network is a network controlled by the control device;

The first communication device sends the grouping results of the multiple groups, including:

The server sends the grouping results of the plurality of groups to the control device.
The method according to claim 3 or the first communication device according to claim 3, wherein the first channel parameter information comprises a channel matrix W, and the channel matrix W is a matrix of K rows multiplied by L columns , K is the number of STAs included in the first network, L is the number of APs included in the first network, and the channel matrix
w ij is the channel gain between the ith STA and the jth AP, i is an integer greater than or equal to 1 and less than or equal to K, j is an integer greater than or equal to 1 and less than or equal to L;

The first communication device groups the first AP and the first STA according to the first channel parameter information to obtain multiple groups, including:

The server calculates and obtains a first intermediate matrix D according to the channel matrix W, and the first intermediate matrix
D 1 is a matrix with K rows by K columns,
The element a i on the main diagonal of D 1 is the sum of the channel gains between the i-th STA in the first network and all APs in the first network, respectively, and the off-diagonal line of D 1 The elements on are all zero; D 2 is a matrix of L rows by L columns,
The element b j on the main diagonal of D2 is the sum of the channel gains between the jth AP in the first network and all STAs in the first network, and 0 K×L is the K row Multiplied by a matrix of L columns, the elements in 0 K×L are all zero, and 0 L×K is a matrix of L rows multiplied by K columns, and the elements in 0 L×K are all zero;

The server determines a second intermediate matrix according to the channel matrix W and the first intermediate matrix D, each row vector in the second intermediate matrix corresponds to a network node, and the network node is the first network STA or AP in ;

The server performs clustering on the row vectors of the second intermediate matrix according to a clustering algorithm, and obtains a first clustering result, where the first clustering result includes row vectors of a plurality of clusters. One cluster corresponds to one of the multiple groups;

The server determines the network nodes respectively included in the plurality of groups according to the row vectors of the plurality of clusters.
The method according to claim 4 or the first communication device according to claim 4, wherein the channel matrix W is an edge weight matrix W of a weighted bipartite graph, and the weighted bipartite graph includes the first type vertices and second type vertices, the first type vertices represent STAs in the first network, the second type vertices represent APs in the first network, and the elements of the edge weight matrix W are the The edge weight of the weighted bipartite graph, where the edge weight of the weighted bipartite graph is the channel gain between the STA and the AP in the first network, and the first intermediate matrix is the degree matrix of the weighted bipartite graph .
The method according to claim 4 or 5, or the first communication device according to claim 4 or 5, wherein the server determines the second Intermediate matrix, including:

The server determines a third intermediate matrix R according to the channel matrix W and the first intermediate matrix D,
W T is the transpose of W;

The server performs singular value decomposition on the third intermediate matrix R to obtain a left singular matrix U of the third intermediate matrix R and a right singular matrix V of the third intermediate matrix R; wherein, the third intermediate matrix R Matrix R=UΣV T , the Σ is a diagonal matrix, and the V T is the transpose of the right singular matrix V;

The main diagonal elements corresponding to the r-th column vector of the diagonal matrix Σ are the singular values corresponding to the r-th column vector of the left singular matrix U, and the corresponding main diagonal elements of the r-th column vector of the diagonal matrix Σ The main diagonal element is the singular value corresponding to the rth column vector of the right singular matrix V, where r is an integer greater than or equal to 1 and less than or equal to min(K, L), where min(K, L) refers to Take the minimum value among the K and the L;

The server selects the corresponding M column vectors from the left singular matrix U in descending order of the singular values in the diagonal matrix Σ to obtain a fourth intermediate matrix U M , and according to the diagonal matrix Σ The size of the singular values in the matrix Σ is from large to small, and corresponding M column vectors are selected from the right singular matrix V to obtain a fifth intermediate matrix V M , where M is greater than or equal to log 2 (K+L) and an integer less than or equal to min(K, L), the log 2 (K+L) refers to the logarithm of K+L with the base 2;

The server calculates and obtains the second intermediate matrix Z according to the fourth intermediate matrix, the fifth intermediate matrix and the first intermediate matrix, and the
The method according to claim 6 or the first communication device according to claim 6, wherein the first communication device performs clustering on the row vectors of the second intermediate matrix according to a clustering algorithm to obtain the first communication device. A clustering result, including:

The second intermediate matrix is processed by the server according to a clustering algorithm.
The included K+L row vectors are clustered to obtain row vectors of multiple clusters, and one of the multiple clusters corresponds to one of the multiple groups;

The server determines the network nodes respectively included in the multiple groups according to the row vectors of the multiple clusters, including:

The server divides the network nodes corresponding to the row vector of the same cluster in the row vectors of the multiple clusters into the same group.
The method according to claim 1 or the first communication apparatus according to claim 2, wherein the first communication apparatus is the first AP, and the first STA includes a signal of the first AP An STA that has established a connection with the first AP within the coverage; the method further includes:

The first AP adjusts the STA connected to the first AP according to the group to which the first AP belongs.
The method according to claim 8 or the first communication device according to claim 8, wherein the first AP is the pth AP in the first network, and the first channel parameter information includes the p-th column vector of the channel matrix W, the channel matrix
w ij is the channel gain between the ith STA and the jth AP, i is an integer greater than or equal to 1 and less than or equal to K, j is an integer greater than or equal to 1 and less than or equal to L, and p is an integer less than or equal to the L, where L is the number of APs included in the first network, and K is the number of STAs included in the first network;

The first communication device groups the first AP and the first STA according to the first channel parameter information to obtain multiple groups, including:

The first AP calculates the p+Kth main diagonal element b p of the first intermediate matrix D according to the pth column vector of the channel matrix W;

wherein the first intermediate matrix
The D1 is a matrix of K rows by K columns, the
The element a i on the main diagonal of the D 1 is the sum of the channel gains between the i-th STA in the first network and all APs in the first network, and the non-value of the D 1 The elements on the diagonal are all zero; the D2 is a matrix of L rows by L columns, the
The element b j on the main diagonal of the D 2 is the sum of the channel gains between the j-th AP in the first network and all STAs in the first network, and 0 K × L is the multiplication Taking a matrix of L columns, the elements in 0 K×L are all zero, and 0 L×K is a matrix of L rows multiplied by K columns, and the elements in 0 L×K are all zero;

The first AP acquires the first K main diagonal elements of the first intermediate matrix D;

The first AP is based on the p-th column vector of the channel matrix W, the p+K-th main diagonal element b p of the first intermediate matrix D, and the first K in the first intermediate matrix D The main diagonal elements determine the first K row vectors and the K+pth row vector of the sixth intermediate matrix Q, each row vector of the sixth intermediate matrix Q corresponds to a network node, and the network node is the first AP or STA in the network, the i-th row vector of the sixth intermediate matrix Q is the row vector corresponding to the i-th STA, and the K+j-th row vector of the sixth intermediate matrix Q is the j-th AP the corresponding row vector;

The first AP performs clustering on the target row vector according to a clustering algorithm to obtain a second clustering result;

Wherein, the target row vector includes the K+p th row vector corresponding to the first AP and the row vector corresponding to the first STA in the first K row vectors of the sixth intermediate matrix Q, The second clustering result includes row vectors of a plurality of clusters, and one cluster in the plurality of clusters corresponds to one grouping of the plurality of groups;

The first AP determines network nodes respectively included in the multiple groups according to the row vectors of the multiple clusters.
The method according to claim 9 or the first communication device according to claim 9, wherein the first AP is based on the p-th row vector of the channel matrix W, the first intermediate matrix D The p+K th main diagonal element b p and the first K main diagonal elements in the first intermediate matrix D determine the first K row vectors and the K+p th row vector of the sixth intermediate matrix Q, including:

The first AP is based on the p-th column vector of the channel matrix W, the p+K-th main diagonal element b p of the first intermediate matrix D, and the first K in the first intermediate matrix D The main diagonal elements determine the p-th row vector of the third intermediate matrix R
the second intermediate matrix
The W T is the W transpose;

The first AP is based on the stochastic gradient descent algorithm and the p-th row vector of the third intermediate matrix R
Determine the p row vectors of the first matrix X M and the second matrix Y M , the degree of approximation between the first matrix X M and the third matrix is greater than or equal to the first preset threshold, and the second matrix Y M and the third matrix The degree of approximation of the four matrices is greater than or equal to the second preset threshold;

The third matrix is a matrix obtained by selecting M column vectors from the left singular matrix obtained by singular value decomposition of the third intermediate matrix R, and each column vector in the left singular matrix has a corresponding Singular values, the M column vectors of the third matrix are M column vectors selected from the left singular matrix in the order of size of the singular values from large to small;

The fourth matrix is a matrix obtained by selecting M column vectors from the right singular matrix obtained by singular value decomposition of the third intermediate matrix R, and each column vector in the right singular matrix has a corresponding singular value, the M column vectors of the fourth matrix are the M column vectors selected from the right singular matrix in the order of the size of the singular values from large to small;

The M is an integer greater than or equal to log 2 (K+L) and less than or equal to min(K, L), and the log 2 (K+L) refers to the logarithm of K+L with the base 2, so The min(K, L) refers to the minimum value of the K and the L;

The first AP is based on the p+K-th main diagonal element b p of the first intermediate matrix D, the first K main diagonal elements in the first intermediate matrix D, and the first matrix X The p-th row vector of M and the second matrix Y M are calculated to obtain the sixth intermediate matrix
The first K row vector and the K+pth row vector of .
The method according to claim 10 or the first communication device according to claim 10, wherein the first AP performs clustering on the target row vector according to a clustering algorithm to obtain a second clustering result, comprising:

The first AP generates a first cluster center according to the first random seed, the first cluster center includes the cluster centers corresponding to the multiple clusters respectively, and each cluster corresponds to a cluster center;

The first AP determines the cluster to which each row vector in the target row vector belongs according to the first cluster center, and obtains the row vector included in each cluster in the multiple clusters;

The first AP determines the network nodes respectively included in the multiple groups according to the row vectors of the multiple clusters, including:

When the first preset condition is satisfied, the first AP divides the network nodes corresponding to the row vector of the same cluster in the multiple clusters into the same group.
The method according to claim 11 or the first communication device according to claim 11, wherein when the first preset condition is not satisfied, the method further comprises:

The first AP calculates the first average vector corresponding to the row vector of each cluster in the multiple clusters according to the gossip protocol;

The first AP uses the first average vector of the row vectors of each of the multiple clusters as the cluster centers corresponding to the multiple clusters, respectively, to obtain the second cluster center;

The first AP determines the cluster to which each row vector in the target row vector belongs according to the second cluster center;

When the second preset condition is satisfied, the first AP divides the network nodes corresponding to the row vector of the same cluster in the multiple clusters into the same group.
The method according to claim 11 or 12, or the first communication device according to claim 11 or 12, wherein the first preset condition comprises:

The update times of the cluster centers of the clusters corresponding to the multiple groups respectively is greater than or equal to a third preset threshold.
The method according to claim 11 or 12, or the first communication device according to claim 11 or 12, wherein the first preset condition comprises:

The first convergence accuracy is less than or equal to the preset convergence accuracy;

Wherein, the first convergence accuracy is the ratio of the absolute value of the first difference to the first global error, and the first difference is the difference between the first global error and a preset initialization error;

The first global error is the sum of the first local errors calculated respectively by all APs in the first network;

The first local error of the first AP includes a sum of errors corresponding to each of the multiple clusters determined by the first AP;

The error corresponding to each cluster is the sum of the errors between the row vector included in each cluster and the first average vector corresponding to each cluster; the first average vector corresponding to each cluster is The first AP is calculated according to the gossip protocol.
The method according to any one of claims 8 to 14, or the first communication device according to any one of claims 8 to 14, wherein the first AP is based on the information that the first AP belongs to The grouping adjustment of the STA connected to the first AP includes:

The first AP sends the information of the group to which the first AP belongs, and the information of the group to which the first AP belongs is used for the STA in the first network to determine whether to access the first AP.
The method according to claim 15, or the first communication device according to claim 15, wherein the information of the group to which the first AP belongs includes a first group number of the group to which the first AP belongs ; The first AP sends the information of the group to which the first AP belongs, including:

The first AP sends a first beacon frame, where the first beacon frame carries the first group number.
The method according to any one of claims 8 to 14, or the first communication device according to any one of claims 8 to 14, wherein the first AP is based on the information that the first AP belongs to The grouping adjustment of the STA connected to the first AP includes:

The first AP determines whether the second STA that has established a connection with the first AP belongs to the same group;

If so, the first AP keeps providing services for the second STA;

If not, the first AP determines the group to which the second STA belongs, and sends the first indication information to the third AP;

The first indication information is used to indicate that the third AP provides services for the second STA, and the third AP and the second STA belong to the same group.
The method according to any one of claims 8 to 17, or the first communication device according to any one of claims 8 to 17, wherein the method further comprises:

The first AP receives first group information sent by a fourth AP, where the first group information includes group information to which the fourth AP belongs and an identifier of the fourth AP, and the fourth AP includes the first group information. APs other than the first AP in a network;

The first AP determines, according to the first grouping information, that a fifth AP and the first AP belong to the same group, and the fifth AP is a part of the APs in the fourth AP;

The first AP determines whether the priority of the first AP is higher than the priority of the fifth AP according to the identifier of the fifth AP, the identifier of the first AP and a preset AP priority rule;

If the priority of the first AP is higher than the priority of the fifth AP, the first AP selects the first channel by scanning channels, and adjusts the channel accessed by the first AP to the first channel a channel;

The first AP sends first channel allocation information to the fifth AP, where the first channel allocation information is used to instruct the fifth AP to access the first channel.
The method according to claim 18, or the first communication device according to claim 18, wherein if the priority of the first AP is lower than the priority of the fifth AP, the method further include:

The first AP receives the second channel allocation information sent by the sixth AP, the second channel allocation information is the information of the second channel selected by the sixth AP, and the sixth AP is the priority among the fifth APs AP with the highest level;

The first AP adjusts the channel accessed by the first AP to the second channel according to the second channel allocation information.
A network management method, characterized in that the method comprises:

The control device sends first channel parameter information to the server, where the first channel parameter information includes channel parameter information between each AP in all APs of the first network and the STAs within the signal coverage of each AP, and the the first network is a network controlled by the control device;

receiving, by the control device, grouping results of a plurality of groups from the server, the plurality of groups including all STAs and all APs in the first network;

The control device determines, according to the grouping result, APs and STAs included in each of the multiple groups;

The control device sends second group information, where the second group information includes information of groups to which APs of the first network respectively belong and information of groups to which STAs of the first network respectively belong.
A control device, characterized in that the control device comprises:

A transceiver module, configured to send first channel parameter information to the server, where the first channel parameter information includes channel parameters between each AP in all APs of the first network and the STAs within the signal coverage of each AP information, the first network is a network controlled by the control device; receive grouping results of multiple groups from the server, where the multiple groups include all STAs and all APs in the first network;

a grouping management module, configured to determine APs and STAs included in each of the multiple groups according to the grouping result;

The transceiver module is configured to send second grouping information, where the second grouping information includes information about groups to which APs of the first network respectively belong and information about groups to which STAs of the first network respectively belong.
The method according to claim 20, or the control device according to claim 21, wherein the method further comprises:

The control device allocates the same channel to APs in the same group in the multiple groups;

The control device sends the second grouping information, including:

The control device sends the second grouping information, where the second grouping information includes channel allocation information respectively corresponding to the multiple groups.
The method according to claim 22, or the control device according to claim 22, wherein the control device allocates the same channel to APs in the same group in the multiple groups, comprising:

The control device allocates a corresponding channel to the APs in each group of the multiple groups according to the first channel parameter information, wherein the control device allocates the same channel to the APs in the same group.
A network management method, characterized in that the method comprises:

The second access point AP sends second channel parameter information to the control device, where the second channel parameter information includes channel parameter information between the second AP and STAs within the signal coverage of the second AP;

The second AP receives second grouping information sent by the control device, where the second grouping information includes information about groups to which APs of the first network belong respectively and information about groups to which STAs of the first network belong respectively. information;

determining, by the second AP, the group to which the second AP belongs according to the second grouping information;

The second AP adjusts the STA to which the second AP is connected according to the group to which the second AP belongs.
A second access point AP, characterized in that the second AP includes:

a transceiver module, configured to send second channel parameter information to the control device, where the second channel parameter information includes the channel parameter information between the second AP and the STAs within the signal coverage of the second AP; second grouping information sent by the control device, where the second grouping information includes information about groups to which APs of the first network respectively belong and information about groups to which STAs of the first network respectively belong;

A group management module, configured to determine the group to which the second AP belongs according to the second group information; and adjust the STA connected to the second AP according to the group to which the second AP belongs.
The method according to claim 24, or the second AP according to claim 25, wherein the second grouping information further comprises third channel allocation information, and the third channel allocation information comprises the control information about the third channel allocated by the device to the second AP; the method further includes:

The second AP adjusts the channel accessed by the second AP to the third channel according to the third channel allocation information.
The method according to claim 24 or 26, or the second AP according to claim 25 or 26, wherein the second AP adjusts the second AP connection according to the group to which the second AP belongs STA, including:

The second AP sends the information of the group to which the second AP belongs, and the information of the group to which the second AP belongs is used to instruct the STA in the first network to determine whether to access the second AP. The network is a network controlled by the control device.
The method according to claim 27 or the second AP according to claim 27, wherein the information of the group to which the second AP belongs includes a second group number of the group to which the second AP belongs; The second AP sends the information of the group to which the second AP belongs, including:

The second AP sends a second beacon frame, where the second beacon frame carries the second group number.
The method according to claim 24 or 26, or the second AP according to claim 25 or 26, wherein the second AP adjusts the connection of the second AP according to the group to which the second AP belongs. STA, including:

determining, by the second AP, STAs included in the group to which the second AP belongs;

The second AP determines whether the second AP and the third STA belong to the same group, and the third STA is a STA that has established a connection with the second AP;

If so, the second AP keeps providing services for the third STA;

If not, the second AP determines a seventh AP according to the group to which the third STA belongs, and sends third indication information to the seventh AP;

The third indication information is used to indicate that the seventh AP provides services for the third STA, and the seventh AP and the third STA belong to the same group.
A network management method, characterized in that the method comprises:

The fourth station STA receives the information of the group to which the second AP belongs and sent by the second AP;

The fourth STA determines that the second AP and the fourth STA belong to the same group according to the information of the group to which the second AP belongs;

The fourth STA adjusts its connected AP to the second AP.
A fourth site STA, wherein the fourth STA includes:

a transceiver module, configured to receive the information of the group to which the second AP belongs and sent by the second AP;

A group management module, configured to determine that the second AP and the fourth STA belong to the same group according to the information of the group to which the second AP belongs; and adjust the AP connected to the second AP.
The method according to claim 30, or the fourth STA according to claim 31, wherein the information of the group to which the second AP belongs includes a second group number of the group to which the second AP belongs; The fourth STA receives the information of the group to which the second AP belongs and sent by the second AP, including:

receiving, by the fourth STA, a second beacon frame sent by the second AP, where the first beacon frame carries the second group number;

The fourth STA determines that the second AP and the fourth STA belong to the same group according to the second group number, including:

If the second group number is consistent with the group number of the group to which the fourth STA belongs, the fourth STA determines that the second AP and the fourth STA belong to the same group.
The method according to claim 30 or 32, or the fourth STA according to claim 31 or 32, wherein the method further comprises:

The fourth STA receives the information of the group to which the fourth STA belongs and is sent by the eighth AP, where the eighth AP is the AP connected to before the fourth STA adjusts the connection.
A computer-readable storage medium, characterized by comprising computer instructions that, when the computer instructions are run on a computer, cause the computer to perform the method as claimed in claim 1 and any one of claims 3 to 19, Alternatively, the computer is caused to perform the method as claimed in any one of claims 20, 22 and 23, or the computer is caused to perform any one of claims 24 and 26 to 29. The method, or causing the computer to perform the method as claimed in any one of claims 30, 32 and 33.
A computer program product, characterized in that the computer program product comprises computer instructions, which, when the computer instructions are executed on a computer, cause the computer to perform the functions as claimed in claim 1 and any one of claims 3 to 19. The method described, or, causing the computer to perform the method as claimed in any one of claims 20, 22 and 23, or, causing the computer to perform the method as claimed in claim 24 and as claimed in claims 26 to 29 The method of any one of, or the computer is caused to perform, the method of any one of claim 30 , claim 32 , and claim 33 .
A chip, characterized in that the chip includes a processor for executing the method according to any one of claims 1 to 18 , or making the chip execute the method according to claim 1 and claims 3 to 18 19, or cause the chip to perform the method as claimed in any one of claims 20, 22 and 23, or cause the chip to perform the method as claimed in claim 24 and A method as claimed in any one of claims 26 to 29, or the chip is caused to perform a method as claimed in any one of claims 30, 32 and 33.