Networking centralized control method, controller, access point and system

Abstract

A networking centralized control method, a controller, an access point and a system relate to the technical field of optical communication, and the method comprises the following steps: setting BSSIDs of APs in a networking network to be the same, and enabling the BSSIDs to work in the same channel; acquiring user measurement information of the APs in real time to divide a non-conflict area and / or a conflict area of each AP; determining the time-sharing weight of each AP to obtain the grouping priority, dividing the APs without conflict areas into one group, and obtaining all AP groups based on the association relationship between the user and the APs; and determining the length of the time-sharing period of this round, and determining the length of an initially allocated time slice when all the APs communicate with the non-conflict areas of the APs and each AP group communicates with the conflict areas of the APs according to the length of the time-sharing period of this round and the traffic weights of the non-conflict areas and the conflict areas. According to the invention, the downlink air interface resources of the AP can be effectively managed and scheduled, so that conflicts in the whole network are reduced, the performance of the whole network is improved, and the roaming performance of the user terminal is improved.

Description

Technical Field

[0001] The present application relates to the field of optical communication technology, and in particular to a networking centralized control method, controller, access point and system. Background Art

[0002] With the large-scale application of FTTH (Fiber To The Home) technology, after solving the problem of fiber access in the last kilometer, fiber has been further extended to application scenarios such as user homes, hotels, small and medium-sized enterprise networks, and industrial workshop networks, solving the access problem of the last 100 meters. FTTR (Fiber to The Room) technology came into being.

[0003] In the FTTR network, the main gateway MFU can support the P2MP networking architecture of multiple slave gateways SFU. Usually, MFU has the function of AP (Access Point), and multiple SFUs also have the function of AP. In the traditional multi-AP network, the access and roaming management functions of wireless mobile terminals are independently implemented on a single AP. When a user roams from one AP to another, the user must disconnect from the source AP and then reconnect to the destination AP. This process requires rescanning channels, reassociation and reauthentication, which will interrupt service transmission and deteriorate the user's network experience.

[0004] In a network composed of MFU and multiple SFUs, the IEEE802.11 protocol specifies the DCF (Distributed Coordination Function) mechanism to solve the problem of conflict detection in wireless environments. The DCF channel access adopts the CSMA / CA (Carrier Sense Multiple Access with Collision Avoidance) strategy. Nodes that need to send data need to monitor the channel first and can only send data when the channel is idle. However, the 802.11 DCF mechanism is inefficient in dealing with interference problems in hidden / exposed terminal environments, and in the CSMA / CA mode, each wireless AP and STA adopts a free competition mode to work. When the number of APs and wireless workstations STA in the networking environment increases significantly, the competition for the air interface will cause a lot of time to be consumed in collisions, thereby greatly reducing the efficiency of the overall network.

[0005] In addition, the existing wireless roaming technology is mainly based on 802.11k / v / r, among which 802.11k mainly completes the measurement of wireless resources, can kick off a STA device (Station), and informs the STA device to change to another AP, while 802.11v mainly allows STA devices to exchange network topology information, including the radio frequency environment, and provides network energy saving and network roaming assistance, while 802.11r provides fast BSS switching, also known as fast roaming, which mainly simplifies the security handshake protocol during the switching process. However, in the 802.11 protocol, the final switching is controlled by the STA, and its logic is: among the signals that can be connected, the connection with the best signal is selected, and the connection will not be disconnected until the signal is lower than a threshold (usually very weak). The switching time is long, and it may not even switch (involving the software compatibility of the STA), and the switching cannot achieve a seamless experience effect. Summary of the invention

[0006] The present application provides a networking centralized control method, controller, AP and system, which can effectively manage and schedule the downlink air interface resources of the AP to reduce conflicts in the entire network and improve the overall network performance.

[0007] In a first aspect, an embodiment of the present application provides a networking centralized control method, the networking centralized control method comprising:

[0008] Set the BSSID of the access points AP in the network to be the same and work on the same channel;

[0009] The controller AC obtains user measurement information of the AP in real time to divide each AP into a non-conflict area and / or a conflict area, wherein when a user has a measurement result of only one AP, the user is in the non-conflict area of ​​the AP, and when a user has a measurement result of at least two APs, the user is in the conflict area of ​​each AP involved;

[0010] Determine the time-sharing weight of each AP in this round of time-sharing to obtain grouping priority, divide APs that do not have conflicting areas into one group, and obtain all AP groups based on the association relationship between users and APs;

[0011] The length of this time-sharing cycle is determined based on the throughput rate or initial throughput rate of the networking network in the previous cycle. The length of the time-sharing cycle and the traffic weights of the non-conflict area and the conflict area are used to determine the length of the time slice initially allocated when all APs communicate with their own non-conflict areas and when each AP group communicates with its own conflict area.

[0012] In combination with the first aspect, in one implementation, determining the length of the time slice initially allocated for all APs to communicate with their own non-conflict areas and for each AP group to communicate with its own conflict area according to the length of the current time-sharing cycle and the traffic weights of the non-conflict area and the conflict area includes:

[0013] Calculate the product of the non-conflict area traffic of the AP with the largest non-conflict area traffic and the first factor, and add the product of the sum of the non-conflict area traffic of other APs and the second factor as the weight calculation value of the non-conflict area;

[0014] Calculate the product of the conflict area flow of the AP with the largest conflict area flow of an AP group and the third factor, and add the product of the sum of the conflict area flows of other APs in the AP group and the fourth factor as the weight calculation value of each AP group;

[0015] Calculate the traffic weights of the non-conflict area and the conflict area based on the weight calculation values ​​of the non-conflict area and each AP group;

[0016] The length of this round of time-sharing cycle is allocated according to the traffic weights of the non-conflict area and the conflict area.

[0017] In combination with the first aspect, in one implementation, the method further includes:

[0018] When the AP grouping remains unchanged, determining the length of surplus time slices generated by the AP groupings that need to increase the time slices and the AP groupings that need to reduce the time slices;

[0019] If the total traffic of all APs communicating with their non-conflict areas in the previous cycle is greater than the total traffic of all APs communicating with the conflicting areas, the current time-sharing cycle will be directly allocated more time slices for communication in the non-conflict areas according to the set ratio. If the length of the surplus time slice is greater than the length of the current time-sharing cycle with the set ratio, the surplus time slice will be deducted from the extra time slice and then equally divided among all AP groups that need to increase their time slices.

[0020] If no AP group needs to increase the time slice and the length of the surplus time slice is greater than 0, the surplus time slice is equally divided among all AP groups.

[0021] In combination with the first aspect, in one implementation, determining the length of surplus time slices generated by the AP groups whose time slices need to be increased and the AP groups whose time slices need to be reduced includes:

[0022] When the length of the current time-sharing cycle remains unchanged, if all APs in an AP group report that the time slices allocated in the previous cycle cannot meet the bandwidth demand, it is determined that the time slice needs to be increased;

[0023] When the length of the current time-sharing cycle remains unchanged, if all APs in an AP group report that the time slices allocated in the previous cycle can meet the bandwidth demand, it is determined that the time slice needs to be reduced, and the maximum time slice of all APs in the AP group that meets the communication bandwidth demand, the proportion of the time slices allocated in the previous cycle of the AP group, and the proportion of the time slices after the initial allocation of the AP group are counted. The maximum value of the three is taken as the time slice after the redistribution of the AP group, and the length of the surplus time slice generated is determined;

[0024] When the length of the current time-sharing cycle changes, if all APs in an AP group report that the time slices allocated in the previous cycle cannot meet the bandwidth demand, and the proportion of the time slices initially allocated in this cycle to the cycle is less than the proportion of the allocation in the previous cycle, it is determined that the time slice needs to be increased;

[0025] In other cases, the time slice of the AP group is kept as the result of the initial allocation.

[0026] In combination with the first aspect, in one implementation, the method further includes:

[0027] The time slice length allocated to the area where users exist is supplemented to the minimum bandwidth time slice.

[0028] In combination with the first aspect, in one implementation, determining the time-sharing weight of each AP in the current time-sharing round to obtain the grouping priority and dividing the APs that do not have conflicting areas into one group includes:

[0029] The AC counts and sums the current round of uplink and downlink traffic and the number of packets in the AP cache queue at the end of the period, and uses the statistical value of the conflict area as the time-sharing weight of each AP in this round of time-sharing;

[0030] Sort APs by time-sharing weight;

[0031] According to whether there is a conflicting area, a weight-based greedy algorithm is used to match and group the sorted APs.

[0032] In combination with the first aspect, in one implementation, the method further includes:

[0033] After determining the AP grouping result once, a new AP grouping is generated only when the traffic change ratio in at least one AP group exceeds a set threshold.

[0034] In combination with the first aspect, in one implementation, determining the length of the current time-sharing cycle according to the initial value or the throughput rate of the previous cycle includes:

[0035] If this round of time-sharing cycle is the first cycle, the length of this round of time-sharing cycle is the set initial value;

[0036] If the throughput rate of the previous cycle is greater than the first flow rate, the length of the current time-sharing cycle is the first length;

[0037] If the throughput rate of the previous cycle is greater than the second flow rate but less than the first flow rate, the length of the current time-sharing cycle is the second length;

[0038] If the throughput rate of the previous cycle is less than or equal to the second flow rate, the length of the current time-sharing cycle is the third length;

[0039] The first length, the second length and the third length decrease in sequence.

[0040] In combination with the first aspect, in one implementation, the method further includes:

[0041] When the AC determines the user's location, if there is a user that meets the roaming conditions, the AC determines the best AP as the roaming destination AP based on the user measurement information of all APs;

[0042] After determining the roaming destination AP, the user switching information is notified to the source AP and the roaming destination AP, and the switching time notification message generated based on the number of messages in the user cache queue reported by the source AP is received. The switching time is the time required for all the remaining user messages in the source AP cache queue to be sent at the end of this round of time-sharing cycle;

[0043] Adjust the time-sharing strategy of the initial allocation so that only the AP group where the source AP is located gets the time, and adjust the length of the time-sharing cycle to the sum of the maximum switching times of each AP group, and generate a time slice allocation message;

[0044] Send a time slice allocation message to the source AP, driving the source AP to send the roaming user's message to the roaming destination AP, associate the user with the roaming destination AP, and disassociate the user from the source AP, and restore the initially allocated time-sharing strategy and the length of the time-sharing cycle.

[0045] In combination with the first aspect, in one implementation, if the user has no communication with the currently connected AP within a set time, the mode of the MCS levels measured by the currently connected AP for the user is less than or equal to the set level, or the user and the currently connected AP only interact with control frames, the AC determines that the user has triggered a roaming condition.

[0046] In combination with the first aspect, in one implementation, determining the best AP as the roaming destination AP based on user measurement information of all APs includes:

[0047] Start the timer to continuously monitor the APs available for user switching. When the time is up, select the AP with the highest average RSSI value measured for the user as the roaming destination AP.

[0048] In combination with the first aspect, in one implementation, when the RSSI measured by an AP for a user is higher than a set threshold value than that of a source AP, it is determined that the AP is available for user switching.

[0049] In a second aspect, an embodiment of the present application provides another networking centralized control method, the networking centralized control method is applied to multiple access points AP in a networking network, and the BSSIDs of the multiple APs are set to be the same and all work on the same channel, the networking centralized control method includes:

[0050] Collecting user measurement information and sending the user measurement information to the controller AC;

[0051] Get the time slice allocated to it and communicate with the user in the corresponding time slice.

[0052] The time slice is allocated by the AC according to the length of the current time-sharing cycle, the traffic weights of the non-conflict area and the conflict area, and the time slice that all APs should obtain when communicating with their own non-conflict areas and each AP group should obtain when communicating with its own conflict area.

[0053] In the third aspect, an embodiment of the present application provides a controller AC in a networking network, wherein the AC includes a processor, a memory, and a networking centralized control program stored in the memory and executable by the processor, wherein when the networking centralized control program is executed by the processor, the steps of the networking centralized control method as described in any one of the above are implemented.

[0054] In combination with the third aspect, in one implementation, the controller is arranged in a main gateway of the FTTR networking network.

[0055] In a fourth aspect, an embodiment of the present application provides an access point AP in a networking network, wherein the AP comprises a processor, a memory, and a networking centralized control program stored in the memory and executable by the processor, wherein when the networking centralized control program is executed by the processor, the steps of the networking centralized control method described in the second aspect above are implemented.

[0056] In combination with the fourth aspect, in one implementation, the AP is arranged in a master gateway and / or a slave gateway of the FTTR networking network.

[0057] In a fifth aspect, an embodiment of the present application provides a networked centralized control system, comprising the controller AC described in the third aspect and at least one access point AP described in the fourth aspect.

[0058] The beneficial effects brought by the technical solution provided in the embodiments of the present application include:

[0059] The networking centralized control method in the present application sets the BSSID of the access point AP in the networking network to be the same and all work on the same channel; the controller AC obtains the user measurement information of the AP in real time to divide the non-conflict area and / or the conflict area of ​​each AP, wherein when a user has only one AP measurement result, the user is in the non-conflict area of ​​the AP, and when a user has at least two AP measurement results, the user is in the conflict area of ​​each AP involved; the time-sharing weight of each AP in this round of time-sharing is determined to obtain the group priority, the APs that do not have conflict areas between each other are divided into a group, and all AP groups are obtained based on the association relationship between the user and the AP; the length of the current round of time-sharing cycle is determined according to the throughput rate or initial throughput rate of the previous cycle of the networking network, and the length of the time slice initially allocated when all APs communicate with their own non-conflict areas and each AP group communicates with its own conflict area is determined according to the length of the current round of time-sharing cycle, the traffic weights of the non-conflict area and the conflict area.

[0060] Thus, on the one hand, in scenarios where co-channel networking interference is severe and user mobility is high, the present application can effectively reduce the retransmission rate of downlink data of users in overlapping coverage areas and reduce the proportion of high-delay messages. In low-load scenarios in the system, the present invention can increase the bandwidth of users in overlapping coverage areas while ensuring the bandwidth requirements of users in other areas, thereby improving the throughput of the entire system. In high-load scenarios in the system, the present invention can enable users in each area to have better bandwidth fairness.

[0061] On the other hand, the latency of the roaming process is also reduced. During the traditional roaming process, users need to perform operations such as rescanning, reassociation, and reauthentication, which consume time and cause interruptions in data transmission. The present application uses seamless roaming under the same BSSID and the same channel, so that users do not trigger operations such as rescanning, reassociation, and reauthentication when roaming, thereby reducing the latency of the roaming process. In addition, by setting the BSSID of all APs in the network to be the same and working on the same channel, as well as by controlling the AP downlink transmission, co-channel interference and RTS / CTS conflicts are effectively reduced, thereby improving the stability of the network.

[0062] During traditional roaming, users may frequently switch between different APs, resulting in communication interruption and increased latency. This application avoids users switching back and forth between different APs by using AC to decide the destination AP and set the switching threshold, thus maintaining the continuity of user communication. Through AC's time-sharing scheduling management of APs and user location judgment, as well as intelligent control of user roaming, intelligent management and optimization of the network are achieved, improving the overall performance of the network and user experience. BRIEF DESCRIPTION OF THE DRAWINGS

[0063] Figure 1 This is a flow chart of an embodiment of the network centralized control method of the present application;

[0064] Figure 2 A schematic diagram of the AP coverage area and its association with STAs for this application;

[0065] Figure 3 This is a schematic diagram of the time-sharing management process of the centralized control method for networking of this application;

[0066] Figure 4 Schematic diagram of all message contents provided for the centralized control method of networking of this application;

[0067] Figure 5 A schematic diagram of the roaming processing flow provided for the centralized control method of the networking of this application;

[0068] Figure 6 This is a flow chart of another embodiment of a centralized control method for networking according to the present application. DETAILED DESCRIPTION

[0069] In order to enable those skilled in the art to better understand the solution of the present application, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0070] In order to make the objectives, technical solutions and advantages of the present application clearer, the implementation methods of the present application will be further described in detail below with reference to the accompanying drawings.

[0071] In a first aspect, an embodiment of the present application provides a networking centralized control method.

[0072] In one embodiment, referring to Figure 1 , Figure 1 This is a flow chart of an embodiment of the centralized control method for networking of the present application. Figure 1 As shown, the networking centralized control method includes:

[0073] S1. Set the BSSID of the access points AP in the network to be the same and work on the same channel;

[0074] In this embodiment, the networking network can be FTTR networking. In addition, in a Mesh network composed of multiple routers, there are also situations similar to FTTR networking. As long as there are multiple devices that form a network through wired or wireless means, there is a similar architecture and the solution in this application can be applied.

[0075] Taking FTTR networking as an example, this embodiment sets the BSSID of the AP in the MFU and SFU in the network to be the same, and they all work on the same channel. When the user associates with the AP in the MFU and SFU, the AP shares the user's association information and key information with all APs in the network through the controller in the MFU, so that the user does not trigger rescanning, reassociation, and reauthentication processes when roaming, thereby solving the technical problem of high switching delay in the existing roaming process.

[0076] S2. The controller AC obtains user measurement information of the AP in real time to divide each AP into a non-conflict area and / or a conflict area, wherein when a user has a measurement result of only one AP, the user is in the non-conflict area of ​​the AP, and when a user has a measurement result of at least two APs, the user is in the conflict area of ​​each AP involved;

[0077] It is worth noting that in the FTTR network, the networking mode of the same BSSID and the same channel has the problem of co-channel interference caused by multiple APs transmitting in parallel. When the number of APs and users in the network gradually increases, the RTS / CTS conflict during AP downlink transmission will become more and more serious. In the worst case, the network throughput is 0. Therefore, it is necessary to control AP downlink transmission to reduce conflicts.

[0078] The AP needs to continuously monitor user information and periodically send measurement information messages to the controller AC, with a general period set to 10ms. Whenever the AP detects an air interface message sent by any user or sends an air interface message to any user, it needs to record the RSSI (Received Signal Strength Indicator) and MCS (Modulation and Coding Scheme) level of the message, and update the average RSSI and MCS level recorded for the user accordingly.

[0079] AC determines the location of each user based on the location measurement results of all APs. In this embodiment, the area where the AP signal coverage area does not overlap with other AP signal coverage areas is divided into non-conflict areas, and the area where the AP signal coverage area overlaps with other AP signal coverage areas is divided into conflict areas. If there are two or more APs whose average RSSI measured for a certain user is equivalent and within a certain range, then the user is in the conflict area of ​​these APs; if there is only one AP measurement result for a certain user, then the user is in the non-conflict area of ​​the AP. Each time the AC updates the user location, it needs to send a user location synchronization message to the AP for synchronous update.

[0080] It is worth mentioning that the two APs know that their coverage areas overlap mainly because they can both receive signals from the same user STA. If there is no STA in the conflict area, the two APs are actually unaware of the overlap, and thus will not be judged as a conflict area on the AC side.

[0081] S3, determining the time-sharing weight of each AP in this round of time-sharing to obtain grouping priority, dividing APs that do not have conflicting areas into one group, and obtaining all AP groups based on the association relationship between users and APs;

[0082] It is worth noting that when the AP is communicating downlink, no data conflict will occur when all APs communicate with users in their own non-conflict areas at the same time. APs can sense each other's existence. APs that cannot sense each other's existence are called non-neighbor APs. No data conflict will occur when all non-neighbor APs (without conflict areas between each other) communicate with users in their own conflict areas at the same time.

[0083] To this end, this embodiment divides APs that do not have conflicting areas into one group, and APs belonging to the same group can communicate with users in their own conflicting areas at the same time without causing interference. At the same time, based on the association relationship between the user and the AP in the conflicting area, the division of the AP and the users (STAs) associated with the AP can be determined.

[0084] Specifically, the AC groups APs in the following steps:

[0085] S31. The AC calculates the time-sharing weight of each AP in this round of time-sharing: in each round, the upstream and downstream traffic and the number of packets in the AP cache queue at the end of the cycle are counted and summed up, and the conflicting and non-conflicting areas are calculated separately, and the statistical value of the conflicting area is used as the time-sharing weight of each AP;

[0086] S32, sorting the APs according to their time-sharing weights from large to small;

[0087] S33. Use a weight-based greedy algorithm to match and group the sorted APs to ensure that the APs in each group can communicate with the STAs in their own conflict area at the same time without causing conflicts.

[0088] See also Figure 2 As shown, the following is a specific example to illustrate:

[0089] The division of groups is based on the traffic of APs and whether there is a conflict relationship. Assuming that the traffic relationship (that is, the grouping priority) is AP1>AP2>AP3>AP4, first look at AP1, which conflicts with AP2 and AP3 and cannot be grouped together, but does not conflict with AP4 and can be grouped together. Assuming that AP1 and AP4 have already formed a group, then consider AP2. Since AP2 conflicts with AP1, AP2 cannot be grouped together with AP1 and AP4. Since AP2 conflicts with AP3, AP2 can only be grouped together with AP3. For more APs, the above conditions are also used to form a definite grouping division.

[0090] S4. Determine the length of this round of time-sharing cycle according to the throughput rate of the previous cycle or the initial throughput rate of the networking network, and determine the length of the time slice initially allocated when all APs communicate with their own non-conflict areas and when each AP group communicates with its own conflict area according to the length of this round of time-sharing cycle and the traffic weights of the non-conflict area and the conflict area.

[0091] After all APs are grouped, the AC determines the size of the current time-sharing cycle based on the traffic status of the entire network and allocates detailed time slices. The traffic status is divided into three types: large traffic, medium traffic, and small traffic. In each cycle, the total number of bytes sent by all APs is counted to calculate the throughput of each cycle. Based on the throughput of the most recently completed cycle, the current traffic type is updated to be large traffic, medium traffic, or small traffic. Before each cycle starts, the total cycle length timeslice is determined based on the current traffic type.

[0092] Specifically, if the current time-sharing cycle is the first cycle, the length of the current time-sharing cycle is the set initial value; if the throughput of the previous cycle is greater than the first flow, the length of the current time-sharing cycle is the first length; if the throughput of the previous cycle is greater than the second flow but less than the first flow, the length of the current time-sharing cycle is the second length; if the throughput of the previous cycle is less than or equal to the second flow, the length of the current time-sharing cycle is the third length; wherein the first length, the second length and the third length decrease in size in turn.

[0093] The corresponding relationship is shown in Table 1, that is, the first flow is 1600Mbps, the second flow is 600Mbps, the first length, the second length and the third length are 15ms, 10ms and 5ms respectively, and the default initial value is 5ms.

[0094] Table 1 Correspondence between traffic types and new cycle lengths

[0095] The throughput rate of the last cycle Traffic Type New period length timeslice More than 1600Mbps Large flow 15ms More than 600Mbps, less than 1600Mbps Medium flow 10ms Less than or equal to 600Mbps Small flow 5ms Default default value 5ms

[0096] After determining the size of the time-sharing cycle of this round, reasonable time slice allocation should be performed to meet the communication requirements of each group as much as possible. Specifically, the allocation of time slices in this embodiment is divided into three rounds.

[0097] The first round of allocation preliminarily determines the length of the time slices allocated for all APs to communicate with their own non-conflict areas and for each AP group to communicate with its own conflict area based on the traffic weight of each time slot type.

[0098] Specifically, the product of the non-conflict area flow of the AP with the largest non-conflict area flow and the first factor is calculated, and the product of the sum of the non-conflict area flows of other APs and the second factor is added as the weight calculation value of the non-conflict area; the product of the conflict area flow of the AP with the largest conflict area flow of an AP group and the third factor is calculated, and the product of the sum of the conflict area flows of other APs in the AP group and the fourth factor is added as the weight calculation value of each AP group; the flow weights of the non-conflict area and the conflict area are calculated based on the weight calculation values ​​of the non-conflict area and each AP group; the length of the current time-sharing cycle is allocated based on the flow weights of the non-conflict area and the conflict area.

[0099] For example, in some embodiments, the weight calculation value of the non-conflict area is obtained by multiplying the non-conflict area flow of the AP with the largest non-conflict area flow by a factor of 0.85 plus the sum of the non-conflict area flows of other APs by a factor of 0.2. The weight calculation value of the i-th group is obtained by multiplying the conflict area flow of the AP with the largest conflict area flow in the group by a factor of 0.8 plus the sum of the conflict area flows of other APs by a factor of 0.2. After obtaining the weight calculation values ​​of the non-conflict area and each AP group, the sum is calculated as the denominator of the weight calculation, and then the weight can be calculated according to the respective weight calculation values. According to these weights, the time-sharing period timeslice of this round is allocated to the non-conflict area and each AP group in the first round, and the time slice length allocated to the non-conflict area and each AP group in the first round can be obtained.

[0100] Let's take a specific example to illustrate:

[0101] See also Figure 2 As shown, first, the non-conflict area is served. According to the weight relationship, the weights of the non-conflict area and the conflict area are calculated. In the non-conflict area, (AP1, STA1) and (AP2, STA4) send at the same time to complete the traffic in the non-conflict area. Then, in the first conflict area time slice, according to the AP grouping, AP1 and AP4 are a group. AP1 is mainly in the conflict area VOC1 (AP1, STA2), (AP2, STA3), AP3), while AP4 is mainly in the conflict area VOC4 ((AP4, STA7), (AP2, STA6)). At this time, the calculation of weights mainly considers AP1->STA2 and AP4->STA7.

[0102] Similarly, considering the AP2 grouping, there are four conflicting areas: VOC1 ((AP1, STA2), (AP2, STA3), AP3), VOC2 ((AP3, STA5), AP1, (AP2, STA3)), VOC3 ((AP2, STA3), AP3, AP1), and VOC4 ((AP4, STA7), (AP2, STA6)). In the time slice of the AP2 grouping, only the traffic demand of AP2 is considered, and its time slice is determined by the traffic of AP2->STA6 and AP2->STA3.

[0103] Similarly, considering the AP3 grouping, it mainly involves three conflict areas VOC2 ((AP3, STA5), AP1, (AP2, STA3)), VOC3 ((AP2, STA3), AP3, AP1), VOC1 ((AP1, STA2), (AP2, STA3), AP3), but because of the association relationship, the calculation of the time slice only considers the traffic weight of AP3->STA5.

[0104] In summary, three AP groups (AP1 / AP4 in one group, AP2 in one group, and AP3 in one group) form a total of 4 time slices. The first time slice is the non-conflict zone time slice (AP1->STA1, AP2->STA4), the second time slice (AP1->STA2, AP4->STA7), the third time slice (AP2->STA3, AP2->STA6), the traffic of STA3 and STA6 is calculated uniformly in the time slice, and the specific sending behavior is completed by AP2 based on Qos priority scheduling to complete its sending order, the fourth time slice (AP3->STA5). The arrangement of the above time slices is calculated based on the relevant traffic. When the STA does not move and roams, the relevant grouping relationship remains unchanged. The specific grouping and division can be seen in Table 2 below:

[0105] Table 2 AP grouping and VOC correspondence table

[0106] VOC1 VOC2 VOC3 VOC4 AP1 / AP4 AP1->STA2 AP1 AP1 AP4->STA7 AP2 AP2->STA3 AP2->STA3 / AP2->STA3 AP2->STA6 AP3 AP3 AP3->STA5 AP3 /

[0107] After the first round of allocation, if the AP group type has not changed, it is necessary to determine whether the allocated time slice is reasonable compared with the previous time slice. The main reason is to avoid the group that has already met the bandwidth to obtain more time slices, so that the group with large communication traffic occupies more and more time slices, and the needs and fairness of other groups cannot be guaranteed. Therefore, when the group has not changed, the second round of allocation algorithm is carried out.

[0108] An important basis for reference in the second round of allocation is the bandwidth demand of each AP in its area. In order to measure the bandwidth satisfaction of a certain AP in the previous cycle, two parameters m_ncTimeZero and m_cTimeZero are introduced. m_ncTimeZero is the relative time when the bandwidth is satisfied in the non-conflicting area, and m_cTimeZero is the relative time when the bandwidth is satisfied in the conflicting area. The number of packets in the corresponding buffer of the current AP is recorded at 1 / 8, 2 / 8, ..., 8 / 8 of each time slice. If the number of packets in the corresponding buffer at a certain moment is small to a certain extent, it is considered that the length of the time-sharing time slice at this time satisfies the bandwidth. In the next cycle, you can try to reduce the length of this time slice and record the relative time period corresponding to the first time the number of packets is less than the set threshold.

[0109] Table 3 Possible values ​​of m_ncTimeZero and their meanings

[0110]

[0111] Table 4 Possible values ​​of m_cTimeZero and their meanings

[0112]

[0113] The second round of allocation will only be carried out if the grouping remains unchanged and is divided into two steps.

[0114] Step 1: Adjust the bandwidth requirements of each AP group based on its area.

[0115] 1. When the current time-sharing cycle remains unchanged, if all APs in an AP group report that the time slices allocated in the previous cycle cannot meet the bandwidth demand, it is determined that the time slice needs to be increased;

[0116] 2. When the current time-sharing period remains unchanged, if all APs in an AP group report that the time slices allocated in the previous period can meet the bandwidth demand, it is determined that the time slice needs to be reduced. Statistics are taken for the maximum time slice that all APs in the AP group can meet the communication bandwidth demand, the set ratio of the time slices allocated in the previous period of the AP group, and the set ratio of the time slices after the initial allocation of the AP group. For example, statistics are taken for the maximum time slice that all APs in the group can meet the communication bandwidth demand, 1 / 2 of the time slice allocated in the previous period of the group, and 1 / 2 of the time slice after the first round of allocation of the group, and the maximum value of these three is taken as the time slice after the second round of allocation of the group;

[0117] 3. When the current time-sharing cycle changes, if all APs in an AP group report that the time slices allocated in the previous cycle cannot meet the bandwidth demand, and the proportion of the time slices allocated in the first round of this cycle to the cycle is less than the proportion of the allocation in the previous time-sharing cycle, it is determined that the time slices of this group need to be increased;

[0118] 4. In other cases, the AP group allocation time slice is kept as the result of the first round of allocation.

[0119] Step 2: Allocate the remaining time slices to the groups that need to be increased

[0120] After step 1, the length of the surplus time slice and the AP grouping that needs to increase the time slice can be obtained, and its allocation rules can be divided into the following three steps.

[0121] 1. Prioritize the communication needs of all APs and non-conflict areas. If the total traffic of all APs communicating with their non-conflict areas in the previous cycle is greater than the total traffic of all APs communicating with the conflict area, a certain proportion (e.g. 10%) of the current cycle is directly allocated to the communication time slices of the non-conflict areas. If the length of the surplus time slice is greater than 10% of the time-sharing cycle length, the surplus time slice length is deducted from the extra time slice and the subsequent steps are continued. Otherwise, the subsequent steps are directly skipped.

[0122] 2. Divide the surplus time slices equally among all AP groups that need to increase the time slices of the conflicting areas;

[0123] 3. If no AP group needs to increase the time slice and the length of the surplus time slice is greater than 0, the surplus time slice is equally divided among all AP groups.

[0124] The third round of allocation is to ensure the minimum bandwidth for communication in each area. If the allocated time in an area is too small, it cannot communicate effectively, so the minimum bandwidth time slice should be allocated to each area where there are users. If the time slice length allocated to a certain area is less than 100us after the first two rounds of allocation, it will be supplemented to 100us.

[0125] In addition, if the AP grouping changes compared to the last grouping result, only the first and third rounds of allocation will be performed. In order to avoid too frequent grouping changes, after determining a grouping, the group matching algorithm will be used again to generate a new grouping only when the traffic change ratio in the AP group exceeds a certain threshold (for example, 30%).

[0126] After three rounds of allocation, the time slice allocation result is determined. The AC sends the time-sharing result to all APs. After receiving the time-sharing result, the AP maintains communication or remains silent at the corresponding time and sends load information to the AC at the end of this round of time slices.

[0127] For easier understanding, see Figure 3As shown, it is a schematic diagram of the time-sharing management process designed in this application. At the beginning of each round of time-sharing cycle, the AC sends a time slice allocation message to all APs for time synchronization. The message contains the slice planning of time slices 1 to 4 in this round, that is, three AP groups (one group of AP1 / AP4, one group of AP2, and one group of AP3), forming a total of 4 time slices, time slice 1 is a non-conflict area time slice (AP1->STA1, AP2->STA4), time slice 2 (AP1->STA2, AP4->STA7), time slice 3 (AP2->STA3, AP2->STA6), time slice 4 (AP3->STA5). The arrangement of the above time slices is calculated according to the relevant traffic.

[0128] If user access occurs within the time slice, the AP can normally reply CTS to the access request RTS of the user planned in the current time slice; however, if no user sends an access request or the AP is communicating, no actual user uplink communication will occur. Since the uplink communication of users before 802.11ax may time out, as long as RTS / CTS exists, the uplink transmission packet of the next time slice will not conflict with the user communicating in the previous time slice. After each round of time-sharing cycle ends, the AP will automatically enter the next round of non-conflicting area user service time without waiting for the time slice allocation message to be sent. The next round of time slice allocation message needs to be sent after all statistical information of the previous round is reported. The AP maintains silence by managing the downlink queue logic. Specifically, the AP only queues the user data message in the current service area according to the current service area. The AP does not send downlink data when it remains silent, but the reception of uplink data is not affected.

[0129] Figure 4 Schematic diagram of all message contents designed for this application.

[0130] In the diagram of the time slice statistical information content, ap_id indicates the AP identifier, which occupies 2 bytes; unconf_flow indicates the non-conflict zone flow, which occupies 8 bytes; and conf_flow indicates the conflict zone flow, which occupies 8 bytes.

[0131] In the diagram of the time slice allocation message content, syn_time represents the synchronization time, which occupies 8 bytes; time_slice represents the length of this round of time-sharing cycle, which occupies 8 bytes; ap_id represents the AP identifier, which occupies 2 bytes; nctime_start represents the start time of communication in the non-conflict zone, which occupies 8 bytes; nctime_end represents the end time of communication in the non-conflict zone, which occupies 8 bytes; ctime_start represents the start time of communication in the conflict zone, which occupies 8 bytes; ctime_end represents the end time of communication in the conflict zone, which occupies 8 bytes.

[0132] In the schematic diagram of the location measurement information message content, sta_num indicates the number of users reporting location measurement, occupying 1 Byte; sta_mac indicates the MAC address of the user, occupying 6 Bytes; avg_rssi indicates the measured average RSSI value, occupying 8 bytes; mode_mcs indicates the measured MCS level mode, occupying 1 Byte.

[0133] In the diagram of user location synchronization message content, sta_num indicates the number of users updating their locations, occupying 1 Byte; sta_mac indicates the user's MAC address, occupying 6 Bytes; ap_num indicates the number of APs involved in the user's location, occupying 1 Byte; ap_id indicates the AP identifier, occupying 2 Bytes; area indicates whether the user is in the conflict area or non-conflict area of ​​the AP, occupying 1 Byte.

[0134] The area field has three values, which respectively indicate that the user STA is in a non-conflict area, that the STA is in a conflict area and communicates with the AP, and that the STA is in a conflict area and does not communicate with the AP. When the STA status in the message is that the STA is in a conflict area and communicates with this AP, and the AP's local record is that the STA is in a conflict area and does not communicate with this AP, it means that this AP is the destination AP for the STA to switch, otherwise it is the source AP.

[0135] In the diagram of the switching time notification message content, ap_id represents the AP identifier, which occupies 2 bytes; sta_mac represents the MAC address of the roaming user, which occupies 6 bytes; and switch_time represents the time required for switching, which occupies 8 bytes.

[0136] In the diagram of the roaming end notification message content, sta_mac indicates the MAC address of the roaming user, which occupies 6 bytes; src_apid indicates the source AP identifier of the roaming user, which occupies 2 bytes; dest_apid indicates the destination AP identifier of the roaming user, which occupies 2 bytes; success_flag indicates whether the roaming is ended normally, which occupies 1 Byte.

[0137] It is worth noting that the above-mentioned entire interactive message is mainly exchanged between the controller and the AP, and the sending direction is from the controller to the AP, or from the AP to the controller.

[0138] For specific messages, such as a schematic diagram of the content of time slice statistics, the AP sends to the controller to report its traffic information, including the traffic of its associated STAs in the conflict area and the non-conflict area.

[0139] The time slice allocation message is the time slice information sent by the controller to each AP. The ap_id indicates which AP the time slice related information is sent to.

[0140] The location measurement information message is sent by the AP to the controller to report information such as the signal strength of associated and unassociated STAs detected by the AP.

[0141] The user location synchronization message is sent by the controller to the AP.

[0142] The switching time notification message is a message sent by the AP to the controller to notify the STA of the time required to switch to the new AP.

[0143] The roaming end notification message is sent by the controller to the AP to report the source and destination of a roaming.

[0144] It is understandable that in scenarios where co-channel networking interference is severe and user mobility is high, this application can effectively reduce the retransmission rate of downlink data of users in overlapping coverage areas and reduce the proportion of high-delay messages. In low-load scenarios in the system, this application can increase the bandwidth of users in overlapping coverage areas while ensuring the bandwidth requirements of users in other areas, thereby improving the throughput of the entire system. In high-load scenarios in the system, this application can enable users in each area to have better bandwidth fairness.

[0145] On the other hand, when the AC makes a location judgment, if there are users who meet the roaming conditions, it will start to select the best roaming destination AP: in the next 100ms, the AC will continue to monitor the APs that can be switched by the user, and at the end of the time, select the AP with the highest average RSSI measured for the user as the roaming destination AP. The AP benchmark for user switching is that the RSSI measured for the user is higher than the set threshold (for example, 3dBm) of the source AP. This benchmark can avoid the problem of users switching back and forth between the source AP and the destination AP. The AC supports multiple users roaming at the same time, but only one user can roam outward under the same AP.

[0146] The user triggers roaming conditions including: there is no communication between the user and the currently connected AP within a set time (such as 1s), the mode of the MCS level measured by the currently connected AP for the user is less than or equal to the set level (such as 5), or the user and the currently connected AP only interact with control frames. Since there is no MCS level in the control frame, when only the control frame is interacted, the measured MCS level is the initial value, which can be used to judge this situation.

[0147] See also Figure 5 As shown, after the AC determines the roaming destination AP, it sends user switching information to the source AP and the roaming destination AP. The information is carried by the user location synchronization message.

[0148] After receiving the user switching information, the source AP needs to send a switching time notification message to the AC at the end of this round of time-sharing cycle. The switching time refers to the time required for all the remaining user messages in the source AP cache queue to be sent out at the end of this round of time-sharing cycle. This time is calculated by the average queue time of the messages in the cache queue and the number of messages remaining in the cache queue. The average queue time of the messages in the cache queue is calculated by weighting the average queue time of the most recent 100 messages.

[0149] After receiving the switching time notification message sent by the source AP, the AC no longer forwards the user's message to the source AP but forwards it to the roaming destination AP. At the same time, the AC performs roaming time-sharing management based on the switching time. In roaming time-sharing, only the AP group to which the source AP belongs can get time, and the time allocated to the AP group is the maximum switching time reported by the source AP in the group. At this time, the time-sharing period is no longer 10ms, but the sum of the maximum switching times of each AP group. This is mainly a mechanism designed for zero packet loss. The queue cache in the source AP also contains data that needs to be sent to the STA. Therefore, the roaming switching time announced by the STA is the time required to send the relevant data. Therefore, in order to ensure that before switching to the new AP, the source AP needs to obtain the time slice, send the messages cached in the queue, and then start the switching process. The adjustment to the maximum switching time required for each AP group is to consider that in a group composed of multiple APs, if there are multiple roaming switches, the maximum switching time reported by the source AP in the group needs to be obtained. If there are multiple groups, the time slice needs to be the sum of the maximum switching times of the multiple groups to ensure that all groups can complete the switching.

[0150] After the source AP receives the roaming time slice allocation message, it will give priority to sending the roaming user's message. The roaming destination AP will cache the received user message. When the switching time sent by the source AP expires, the AC will send a roaming end notification message to the source AP and the roaming destination AP. After receiving the roaming end notification message, the source AP will stop sending user messages, discard the remaining unsent messages and send a DEL BA frame. After the user receives the DEL BA frame, the BA connection with the source AP will be deleted. When this roaming time-sharing period ends, the AC's time-sharing period will be restored to 10ms.

[0151] The roaming destination AP sends an ADD BAReq frame before sending user messages. After receiving the ADD BA Req frame, the user establishes a new BA connection with the roaming destination AP. This ensures that the user has deleted the BA with the source AP. After that, the roaming destination AP and the user can communicate normally.

[0152] It is understandable that in the traditional roaming process, users need to perform rescanning, reassociation and reauthentication operations, which consume time and cause data transmission interruption. However, this application uses seamless roaming under the same BSSID and the same channel, so that users do not trigger rescanning, reassociation and reauthentication operations when roaming, thereby reducing the delay of the roaming process.

[0153] Furthermore, the present application effectively reduces co-channel interference and RTS / CTS conflicts by setting the BSSID of all APs in the network to be the same and working on the same channel, and by controlling the AP downlink transmission, thereby improving the stability of the network.

[0154] In addition, in traditional roaming, users may frequently switch between different APs, resulting in communication interruption and increased latency. However, this technology avoids users switching back and forth between different APs by using the AC to decide the destination AP and set the switching threshold, thus maintaining the continuity of user communication.

[0155] In addition, through the AC's time-sharing scheduling management of APs and user location judgment, as well as the intelligent control of user roaming, intelligent management and optimization of the network are achieved, improving the overall performance of the network and user experience. In addition, the compatibility with the user end is improved, because all associations, switching and other operations are completed on the AP side, which is not noticeable to the STA user end. Therefore, less support is required for the user end, and it can support user ends of different protocols, thereby improving the compatibility with the user end.

[0156] In a second aspect, the embodiment of the present application also provides another networking centralized control method, the networking centralized control method is applied to multiple APs in a networking network, and the BSSIDs of the multiple APs are set to be the same and all work on the same channel, see Figure 6 As shown, the networking centralized control method includes:

[0157] S1 ’ , collecting user measurement information, and sending the user measurement information to the controller AC;

[0158] S2 ’ , obtain the time slice allocated to itself, and communicate downlink with the user in the corresponding time slice. At the same time, the time slice is allocated by the AC according to the length of this round of time-sharing cycle, the traffic weights of the non-conflict area and the conflict area, and the time slice that all APs should obtain when communicating with their own non-conflict areas and each AP group communicates with its own conflict area.

[0159] In a third aspect, an embodiment of the present application provides a controller AC in a networking network. The controller in the networking network is arranged in a main gateway of the networking network, for example, it can be arranged in a main gateway of an FTTR networking network.

[0160] The controller includes a processor, a memory, and a networking centralized control program stored in the memory and executable by the processor, wherein when the networking centralized control program is executed by the processor, the steps of the networking centralized control method as described above are implemented.

[0161] It is worth noting that the networking centralized control method implemented by the controller refers to the steps that should be performed by the controller.

[0162] In a fourth aspect, an embodiment of the present application provides an access point AP in a networking network, wherein the AP is arranged in a master gateway and / or a slave gateway of the networking network, for example, can be arranged in a master gateway and / or a slave gateway of an FTTR networking network.

[0163] The AP includes a processor, a memory, and a networking centralized control program stored in the memory and executable by the processor, wherein when the networking centralized control program is executed by the processor, the steps of the above-mentioned networking centralized control method are implemented.

[0164] It is worth noting that the centralized control method of networking implemented by the AP refers to the steps that should be performed by the AP end.

[0165] In a fifth aspect, an embodiment of the present application provides a networked centralized control system, including the above-mentioned controller AC and at least one of the above-mentioned access points AP.

[0166] It is worth noting that the memory can be various types of storage media, such as random access memory (RAM), read-only memory (ROM), non-volatile RAM (NVRAM), flash memory, optical storage, hard disk, programmable ROM (PROM), erasable PROM (EPROM), electrically erasable PROM (EEPROM), etc.

[0167] The processor may be a general-purpose processor, and the general-purpose processor may call the networking centralized control program stored in the memory and execute the networking centralized control method provided in the embodiment of the present application. For example, the general-purpose processor may be a central processing unit (CPU). The method executed when the networking centralized control program is called may refer to the various embodiments of the networking centralized control method of the present application, and will not be repeated here.

[0168] It should be noted that the serial numbers of the above-mentioned embodiments of the present application are only for description and do not represent the advantages or disadvantages of the embodiments.

[0169] The terms "including" and "having" and any variations thereof in the specification and claims of this application and the above-mentioned drawings are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not limited to the listed steps or units, but optionally includes steps or units that are not listed, or optionally includes other steps or units inherent to these processes, methods, products or devices. The terms "first", "second" and "third" are used to distinguish different objects, etc., and do not represent a sequence, nor do they limit "first", "second" and "third" to different types.

[0170] In the description of the embodiments of the present application, "exemplary", "for example" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary", "for example" or "for example" in the embodiments of the present application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary", "for example" or "for example" is intended to present related concepts in a specific way.

[0171] In the description of the embodiments of the present application, unless otherwise specified, “ / ” means or, for example, A / B can mean A or B; the “and / or” in the text is merely a description of the association relationship of associated objects, indicating that three relationships may exist, for example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. In addition, in the description of the embodiments of the present application, “multiple” refers to two or more than two.

[0172] In some processes described in the embodiments of the present application, multiple operations or steps that appear in a specific order are included, but it should be understood that these operations or steps may not be executed in the order in which they appear in the embodiments of the present application or in parallel, and the sequence number of the operation is only used to distinguish the different operations, and the sequence number itself does not represent any execution order. In addition, these processes may include more or fewer operations, and these operations or steps may be executed in sequence or in parallel, and these operations or steps may be combined.

[0173] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present application is essentially or the part that contributes to the prior art can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, disk, CD) as described above, and includes a number of instructions for a terminal device to execute the methods described in each embodiment of the present application.

[0174] The above are only preferred embodiments of the present application, and are not intended to limit the patent scope of the present application. Any equivalent structure or equivalent process transformation made using the contents of the present application specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present application.

Claims

1. A network centralized control method, characterized in that: The networking centralized control method comprises: Set the BSSID of the access points AP in the network to be the same and work on the same channel; The controller AC obtains user measurement information of the AP in real time to divide each AP into a non-conflict area and / or a conflict area, wherein when a user has a measurement result of only one AP, the user is in the non-conflict area of ​​the AP, and when a user has a measurement result of at least two APs, the user is in the conflict area of ​​each AP involved; Determine the time-sharing weight of each AP in this round of time-sharing to obtain grouping priority, divide APs that do not have conflicting areas into one group, and obtain all AP groups based on the association relationship between users and APs; The length of this time-sharing cycle is determined based on the throughput rate or initial throughput rate of the networking network in the previous cycle. The length of the time-sharing cycle and the traffic weights of the non-conflict area and the conflict area are used to determine the length of the time slice initially allocated when all APs communicate with their own non-conflict areas and when each AP group communicates with its own conflict area.

2. The network centralized control method according to claim 1, characterized in that: The method of determining the length of the time slice initially allocated for communication between all APs and their own non-conflict areas and for communication between each AP group and its own conflict area according to the length of the current time-sharing cycle and the traffic weights of the non-conflict area and the conflict area includes: Calculate the product of the non-conflict area traffic of the AP with the largest non-conflict area traffic and the first factor, and add the product of the sum of the non-conflict area traffic of other APs and the second factor as the weight calculation value of the non-conflict area; Calculate the product of the conflict area flow of the AP with the largest conflict area flow of an AP group and the third factor, and add the product of the sum of the conflict area flows of other APs in the AP group and the fourth factor as the weight calculation value of each AP group; Calculate the traffic weights of the non-conflict area and the conflict area based on the weight calculation values ​​of the non-conflict area and each AP group; The length of this round of time-sharing cycle is allocated according to the traffic weights of the non-conflict area and the conflict area.

3. The network centralized control method according to claim 1, characterized in that: Also includes: When the AP grouping remains unchanged, determining the length of surplus time slices generated by the AP groupings that need to increase the time slices and the AP groupings that need to reduce the time slices; If the total traffic of all APs communicating with their non-conflict areas in the previous cycle is greater than the total traffic of all APs communicating with the conflicting areas, the current time-sharing cycle will be directly allocated more time slices for communication in the non-conflict areas according to the set ratio. If the length of the surplus time slice is greater than the length of the current time-sharing cycle with the set ratio, the surplus time slice will be deducted from the extra time slice and then equally divided among all AP groups that need to increase their time slices. If no AP group needs to increase the time slice and the length of the surplus time slice is greater than 0, the surplus time slice is equally divided among all AP groups.

4. The network centralized control method according to claim 3, characterized in that: The determining of the length of surplus time slices generated by the AP groups whose time slices need to be increased and the AP groups whose time slices need to be decreased includes: When the length of the current time-sharing cycle remains unchanged, if all APs in an AP group report that the time slices allocated in the previous cycle cannot meet the bandwidth demand, it is determined that the time slice needs to be increased; When the length of the current time-sharing cycle remains unchanged, if all APs in an AP group report that the time slices allocated in the previous cycle can meet the bandwidth demand, it is determined that the time slice needs to be reduced, and the maximum time slice of all APs in the AP group that meets the communication bandwidth demand, the proportion of the time slices allocated in the previous cycle of the AP group, and the proportion of the time slices after the initial allocation of the AP group are counted. The maximum value of the three is taken as the time slice after the redistribution of the AP group, and the length of the surplus time slice generated is determined; When the length of the current time-sharing cycle changes, if all APs in an AP group report that the time slices allocated in the previous cycle cannot meet the bandwidth demand, and the proportion of the time slices initially allocated in this cycle to the cycle is less than the proportion of the allocation in the previous cycle, it is determined that the time slice needs to be increased; In other cases, the time slice of the AP group is kept as the result of the initial allocation.

5. The network centralized control method according to claim 2 or 3, characterized in that: Also includes: The time slice length allocated to the area where users exist is supplemented to the minimum bandwidth time slice.

6. The network centralized control method according to claim 1, characterized in that: The step of determining the time-sharing weight of each AP in the current time-sharing round to obtain the grouping priority and grouping the APs that do not have conflicting areas with each other into one group includes: The AC counts and sums the current round of uplink and downlink traffic and the number of packets in the AP cache queue at the end of the period, and uses the statistical value of the conflict area as the time-sharing weight of each AP in this round of time-sharing; Sort APs by time-sharing weight; According to whether there is a conflicting area, a weight-based greedy algorithm is used to match and group the sorted APs.

7. The network centralized control method according to claim 6, characterized in that: Also includes: After determining the AP grouping result once, a new AP grouping is generated only when the traffic change ratio in at least one AP group exceeds a set threshold.

8. The network centralized control method according to claim 1, characterized in that: Determining the length of the current time-sharing cycle according to the initial value or the throughput rate of the previous cycle includes: If this round of time-sharing cycle is the first cycle, the length of this round of time-sharing cycle is the set initial value; If the throughput rate of the previous cycle is greater than the first flow rate, the length of the current time-sharing cycle is the first length; If the throughput rate of the previous cycle is greater than the second flow rate but less than the first flow rate, the length of the current time-sharing cycle is the second length; If the throughput rate of the previous cycle is less than or equal to the second flow rate, the length of the current time-sharing cycle is the third length; The first length, the second length and the third length decrease in sequence.

9. The network centralized control method according to claim 1, characterized in that: Also includes: When the AC determines the user's location, if there is a user that meets the roaming conditions, the AC determines the best AP as the roaming destination AP based on the user measurement information of all APs; After determining the roaming destination AP, the user switching information is notified to the source AP and the roaming destination AP, and the switching time notification message generated based on the number of messages in the user cache queue reported by the source AP is received. The switching time is the time required for all the remaining user messages in the source AP cache queue to be sent at the end of this round of time-sharing cycle; Adjust the time-sharing strategy of the initial allocation so that only the AP group where the source AP is located gets the time, and adjust the length of the time-sharing cycle to the sum of the maximum switching times of each AP group, and generate a time slice allocation message; Send a time slice allocation message to the source AP, driving the source AP to send the roaming user's message to the roaming destination AP, associate the user with the roaming destination AP, and disassociate the user from the source AP, and restore the initially allocated time-sharing strategy and the length of the time-sharing cycle.

10. The network centralized control method according to claim 9, characterized in that: If the user has no communication with the currently connected AP within the set time, the MCS level mode measured by the currently connected AP for the user is less than or equal to the set level, or the user and the currently connected AP only interact with control frames, the AC determines that the user triggers roaming conditions.

11. The network centralized control method according to claim 9, characterized in that: The determining the best AP as the roaming destination AP based on user measurement information of all APs includes: Start the timer to continuously monitor the APs available for user switching. When the time is up, select the AP with the highest average RSSI value measured for the user as the roaming destination AP.

12. The network centralized control method according to claim 11, characterized in that: When the RSSI measured by an AP for a user is higher than the set threshold value of the source AP, it is determined that the AP is available for user switching.

13. A network centralized control method, characterized in that: The networking centralized control method is applied to multiple access points AP in the networking network, and the BSSIDs of the multiple APs are set to be the same and all work on the same channel. The networking centralized control method includes: Collecting user measurement information and sending the user measurement information to the controller AC; Get the time slice allocated to it and communicate with the user in the corresponding time slice. The time slice is allocated by the AC according to the length of the current time-sharing cycle, the traffic weights of the non-conflict area and the conflict area, and the time slice that all APs should obtain when communicating with their own non-conflict areas and each AP group should obtain when communicating with its own conflict area.

14. A controller AC in a networking network, characterized in that: The AC includes a processor, a memory, and a networking centralized control program stored in the memory and executable by the processor, wherein when the networking centralized control program is executed by the processor, the steps of the networking centralized control method as described in any one of claims 1 to 12 are implemented.

15. The controller AC in a networking network according to claim 14, characterized in that: The controller is arranged in the main gateway of the FTTR networking network.

16. An access point AP in a networking network, characterized in that: The AP includes a processor, a memory, and a networking centralized control program stored in the memory and executable by the processor, wherein when the networking centralized control program is executed by the processor, the steps of the networking centralized control method as described in claim 13 are implemented.

17. The access point AP in a networking network according to claim 16, characterized in that: The AP is arranged in the master gateway and / or the slave gateway of the FTTR networking network.

18. A networked centralized control system, characterized in that: It comprises a controller AC as claimed in claim 14 and at least one access point AP as claimed in claim 16.

Images