A networking centralized control method, controller, access point and system

Abstract

A networking centralized control method, controller, access point and system, relating to optical communication technology field, comprising: setting the BSSID of AP in networking network to be the same, and all working in the same channel; real-time obtaining user measurement information of the AP, to divide the non-conflict area and / or conflict area of each AP; determining the time-sharing weight of each AP to obtain the grouping priority, dividing the AP without conflict area into a group, and obtaining all AP groups based on the association relationship between user and AP; determining the length of the current time-sharing period, and determining the length of the initial allocated time slice when all APs communicate with their non-conflict areas and each AP group communicates with its conflict area according to the length of the current time-sharing period, the traffic weight of the non-conflict area and the conflict area. The application can effectively manage and schedule the downlink air interface resource of the AP, reduce the conflict in the whole network, improve the overall network performance, and improve the roaming performance of the user terminal.

Description

Technical Field

[0001] This application relates to the field of optical communication technology, specifically to a centralized control method for networking, a controller, an access point, and a system. Background Technology

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

[0003] In FTTR networks, the master gateway (MFU) can support a P2MP networking architecture with multiple slave gateways (SFUs). Typically, the MFU functions as an access point (AP), and the multiple SFUs also function as APs. However, in traditional multi-AP networks, access and roaming management for wireless mobile terminals are implemented independently on a single AP. When a user roams from one AP to another, they must disconnect from the source AP and then reconnect to the destination AP. This process requires rescanning the channel, re-associating, and re-authenticating, which interrupts service transmission and degrades the user's network experience.

[0004] In networks composed of MFUs and multiple SFUs, the IEEE 802.11 protocol specifies the Distributed Coordination Function (DCF) mechanism to address collision detection issues in wireless environments. DCF employs a CSMA / CA (Carrier Sense Multiple Access with Collision Avoidance) strategy for channel access, requiring nodes to listen to the channel before transmitting data; data can only be transmitted when the channel is idle. However, the 802.11 DCF mechanism is inefficient in handling interference from hidden / exposed terminal environments. Furthermore, under the CSMA / CA approach, each wireless AP and STA operates in a free-competition manner. When the number of APs and STAs in the network environment increases significantly, air interface contention leads to a substantial waste of time in collision detection, thus drastically reducing the overall network efficiency.

[0005] Furthermore, existing wireless roaming technologies are primarily based on 802.11k / v / r. 802.11k mainly measures wireless resources and can disconnect a STA (Station) and notify it to switch to another AP. 802.11v primarily allows STAs to exchange network topology information, including RF environment details, providing network power saving and roaming assistance. 802.11r provides fast BSS handover, also known as fast roaming, which simplifies the security handshake protocol during handover. However, in the 802.11 protocol, the final handover is controlled by the STA. The logic is: among the available signals, it selects the one with the strongest signal and maintains the connection until the signal falls below a threshold (usually very weak), at which point it disconnects. This results in a long handover time, or even no handover at all (due to STA software compatibility issues), failing to achieve a seamless handover experience. Summary of the Invention

[0006] This application provides a centralized network 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 overall network performance.

[0007] In a first aspect, embodiments of this application provide a centralized network control method, the centralized network control method comprising:

[0008] Set the BSSID of the access points (APs) in the network to be the same and make them all work on the same channel;

[0009] The controller AC acquires user measurement information from the APs in real time to divide each AP into non-conflict areas and / or conflict areas. When a user has measurement results from only one AP, the user is in the non-conflict area of ​​that AP. When a user has measurement results from 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 to obtain the grouping priority, divide APs that do not have conflicting areas into a group, and obtain all AP groups based on the association between users and APs;

[0011] Based on the throughput or initial throughput of the network in the previous cycle, determine the length of the current time-division cycle. Based on the length of the current time-division cycle, the traffic weights of non-conflict areas and conflict areas, determine the length of the initial time slice allocated when all APs communicate with their own non-conflict areas and when each AP packet communicates with its own conflict area.

[0012] In conjunction with the first aspect, in one implementation, determining the length of the initially allocated time slice for all APs communicating with their own non-collision areas and for each AP packet communicating with its own collision area based on the length of the current time-sharing cycle, the traffic weights of non-collision areas and collision areas, 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 non-conflict area traffic of other APs and the second factor to obtain the weight value of the non-conflict area.

[0014] Calculate the product of the collision area traffic of the AP with the largest collision area traffic in an AP group and the third factor, and add the product of the collision area traffic of other APs in the same AP group and the fourth factor to obtain the weight value for each AP group.

[0015] Calculate the traffic weights for non-conflict areas and conflict areas based on the weights of non-conflict areas and each AP group.

[0016] The length of this round of time-sharing period is allocated based on the traffic weights of non-conflict areas and conflict areas.

[0017] In conjunction with the first aspect, in one implementation, it further includes:

[0018] When the AP packets remain unchanged, determine the AP packets that need to have their time slices increased and the surplus time slice lengths generated by AP packets that need to have their time slices decreased;

[0019] If the total traffic of all APs communicating with their non-conflicting areas in the previous cycle is greater than the total traffic of all APs communicating with their conflicting areas, the current time-sharing cycle will first be allocated more time slots to non-conflicting areas according to a set ratio. If the surplus time slot length is greater than the set ratio of the current time-sharing cycle length, the surplus time slot length will be reduced by the extra time slots and then evenly distributed to all AP groups that need to increase their time slots.

[0020] If no AP packet needs an increased time slice and the surplus time slice length is greater than 0, then the surplus time slice is evenly distributed among all AP packets.

[0021] In conjunction with the first aspect, in one implementation, determining the surplus time slice length resulting from AP packets requiring increased time slices and AP packets requiring decreased time slices includes:

[0022] When the length of the current time-sharing cycle remains unchanged, if all APs in an AP group report that the time slice allocated in the previous cycle cannot meet the bandwidth requirements, 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 slice allocated in the previous cycle can meet the bandwidth requirements, it is determined that the time slice needs to be reduced. The maximum time slice that meets the communication bandwidth requirements of all APs in the AP group, the proportion of the time slice allocated in the previous cycle of the AP group, and the proportion of the time slice after the initial allocation of the AP group are counted. The maximum value of the three is taken as the time slice after the reallocation of the AP group, and the length of the surplus time slice 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 requirements, and the proportion of the time slices initially allocated in this cycle is less than the proportion allocated in the previous cycle, then it is determined that the time slices need to be increased.

[0025] In other cases, the time slice for AP packets remains the result of the initial allocation.

[0026] In conjunction with the first aspect, in one implementation, it further includes:

[0027] The time slice length allocated to the region where the user exists will be padded to the minimum bandwidth time slice.

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

[0029] AC calculates and sums the uplink and downlink traffic in this round and the number of packets in the AP's buffer queue at the end of the cycle, and uses the statistical value of the conflict area as the time-sharing weight of each AP in this round.

[0030] Sorting APs according to time-sharing weights;

[0031] Based on the existence of conflicting regions, a weighted greedy algorithm is used to match and group the sorted APs.

[0032] In conjunction with the first aspect, in one implementation, it further includes:

[0033] After determining the results of an AP group, a new AP group is only generated if the traffic change ratio within at least one AP group exceeds a set threshold.

[0034] In conjunction with the first aspect, in one implementation, determining the length of the current time-sharing cycle based on the initial value or the throughput of the previous cycle includes:

[0035] If this round of intraday trading is the first round, then the length of this round of intraday trading is the set initial value;

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

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

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

[0039] The lengths of the first, second, and third lengths decrease sequentially.

[0040] In conjunction with the first aspect, in one implementation, it further includes:

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

[0042] After determining the roaming destination AP, notify the user of the handover information to the source AP and the roaming destination AP, and receive the handover time notification message generated by the source AP based on the number of user buffer queue packets. The handover time is the time required for all remaining user packets in the source AP's buffer queue to be sent at the end of this round of time-sharing period.

[0043] Adjust the initial time-sharing strategy to ensure that only the AP group containing the source AP receives time, and adjust the length of the time-sharing period 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, which in turn sends the roaming user's message to the roaming destination AP, associating the user with the roaming destination AP. At the same time, it removes the user from the source AP and restores the initial time-slice allocation strategy and the length of the time-slice period.

[0045] In conjunction 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 level measured by the user's currently connected AP is less than or equal to the set level, or the user only interacts with the currently connected AP via control frames, then the AC determines that the user has triggered roaming conditions.

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

[0047] Start a timer to continuously monitor the APs available for user switching. At the end of the time, select the AP with the highest average RSSI (Received Signal Strength Indicator) value measured by the user as the roaming destination AP.

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

[0049] Secondly, embodiments of this application provide another centralized network control method, which is applied to multiple access points (APs) in a network, wherein the BSSIDs of the multiple APs are set to be the same and they all operate on the same channel. The centralized network control method includes:

[0050] Collect user measurement information and send the user measurement information to the controller AC;

[0051] It obtains its allocated time slice and conducts downlink communication with the user within the corresponding time slice.

[0052] The time slices are allocated by the AC based on the length of the current time-sharing cycle, the traffic weights of non-conflict areas and conflict areas, and according to the time slices that each AP should receive when communicating with its own non-conflict area and when each AP group communicates with its own conflict area.

[0053] Thirdly, embodiments of this application provide a controller AC in a network, the AC including a processor, a memory, and a centralized network control program stored in the memory and executable by the processor, wherein when the centralized network control program is executed by the processor, it implements the steps of any of the centralized network control methods described above.

[0054] In conjunction with the third aspect, in one implementation, the controller is located in the main gateway of the FTTR network.

[0055] Fourthly, embodiments of this application provide an access point (AP) in a network, the AP including a processor, a memory, and a centralized network control program stored in the memory and executable by the processor, wherein when the centralized network control program is executed by the processor, it implements the steps of the centralized network control method described in the second aspect above.

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

[0057] Fifthly, embodiments of this application provide a networked centralized control system, including the controller AC described in the third aspect above and at least one access point AP described in the fourth aspect above.

[0058] The beneficial effects of the technical solutions provided in this application include:

[0059] The centralized network control method in this application sets the BSSIDs of the access points (APs) in the network to be the same and they all operate on the same channel. The controller (AC) acquires user measurement information of the APs in real time to divide each AP into non-conflict areas and / or conflict areas. When a user has measurement results from only one AP, the user is in the non-conflict area of ​​that AP. When a user has measurement results from at least two APs, the user is in the conflict area of ​​each AP involved. The time-division weight of each AP in this round is determined to obtain the packet priority. APs that do not have conflict areas with each other are grouped together, and all AP packets are obtained based on the association between users and APs. The length of the current round of time-division period is determined according to the throughput or initial throughput of the network in the previous cycle. Based on the length of the current round of time-division period, the traffic weights of the non-conflict areas and the conflict areas, the length of the initially allocated time slice for all APs to communicate with their own non-conflict areas and for each AP packet to communicate with its own conflict areas is determined.

[0060] Therefore, on the one hand, in scenarios with severe co-channel network interference and high user mobility, this application can effectively reduce the retransmission rate of downlink data for users in overlapping coverage areas and decrease the proportion of high-latency packets. On the other hand, in low-load scenarios, this invention can increase the bandwidth for users in overlapping coverage areas while ensuring the bandwidth requirements of users in other areas, thereby improving the overall system throughput. On the other hand, in high-load scenarios, this invention can provide better bandwidth fairness for users in different areas.

[0061] On the other hand, it also reduces roaming latency. Traditional roaming requires users to perform rescanning, reassociation, and reauthentication, which consume time and cause data transmission interruptions. This application, however, achieves seamless roaming with the same BSSID on the same channel, eliminating the need for rescanning, reassociation, and reauthentication during roaming, thus reducing latency. Furthermore, by setting all APs in the network to have the same BSSID and operating on the same channel, and by controlling AP downlink transmission, co-channel interference and RTS / CTS conflicts are effectively reduced, thereby improving network stability.

[0062] In traditional roaming, users may frequently switch between different access points (APs), leading to communication interruptions and increased latency. This application avoids users switching back and forth between different APs by using the AC to determine the target AP and set a handover threshold, thus maintaining the continuity of user communication. Through the AC's time-sharing scheduling management of APs, user location determination, and intelligent control of user roaming, intelligent network management and optimization are achieved, improving overall network performance and user experience. Attached Figure Description

[0063] Figure 1 This is a flowchart illustrating an embodiment of the centralized network control method of this application;

[0064] Figure 2 This is a schematic diagram illustrating the coverage area of ​​the AP and its association with the STA in this application;

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

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

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

[0068] Figure 6 This is a flowchart illustrating an embodiment of another centralized network control method of this application. Detailed Implementation

[0069] To enable those skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present application, and not all embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of the present application.

[0070] To make the objectives, technical solutions, and advantages of this application clearer, the embodiments of this application will be described in further detail below with reference to the accompanying drawings.

[0071] Firstly, embodiments of this application provide a network-based centralized control method.

[0072] In one embodiment, reference is made to Figure 1 , Figure 1 This is a flowchart illustrating an embodiment of the centralized network control method of this application. Figure 1 As shown, the centralized control method for networking includes:

[0073] S1. Set the BSSID of the access points (APs) in the network to be the same and make them all work on the same channel;

[0074] In this embodiment, the network can be an FTTR network. Furthermore, a mesh network composed of multiple routers also exhibits similar characteristics to FTTR networking. Any network consisting of multiple devices connected via wired or wireless means has a similar architecture and the solution described in this application can be applied.

[0075] Taking FTTR networking as an example, this embodiment sets the BSSID of the APs in the MFU and SFU in the network to be the same and they all work on the same channel. When a user is associated with an 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. This enables the user to avoid triggering rescanning, reassociation and re-authentication processes when roaming, thereby solving the technical problem of high handover latency in the existing roaming process.

[0076] S2. The controller AC acquires user measurement information of AP in real time to divide the non-conflict area and / or conflict area of ​​each AP. When a user has measurement results from only one AP, the user is in the non-conflict area of ​​that AP. When a user has measurement results from at least two APs, the user is in the conflict area of ​​each AP involved.

[0077] It is worth noting that in FTTR networks, the co-channel networking configuration with the same BSSID presents a problem of co-channel interference caused by multiple APs transmitting in parallel. As the number of APs and users in the network gradually increases, RTS / CTS collisions during AP downlink transmission become increasingly severe, with the network throughput dropping to zero in the worst-case scenario. Therefore, it is necessary to manage AP downlink transmission to reduce collisions.

[0078] The AP needs to continuously monitor user information and periodically send measurement information messages to the controller AC, typically with a period of 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) levels of the message, and update the average RSSI and MCS levels recorded for that user accordingly.

[0079] The AC determines the location of each user based on the location measurement results of all APs. In this embodiment, areas where the signal coverage of an AP does not overlap with other APs are classified as non-conflict areas, while areas where the signal coverage of an AP overlaps with other APs are classified as conflict areas. If two or more APs have comparable average RSSI measurements for a given user, and these measurements are within a certain range, then the user is located within the conflict area of ​​these APs. If only one AP has a measurement result for a given user, then the user is located within the non-conflict area of ​​that AP. Each time the AC updates a user's location, it needs to send a user location synchronization message to the AP for synchronous updates.

[0080] It is worth noting that the two APs can 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 objectively existing conflict area, then the two APs will not know that they overlap, and therefore will not be judged as conflict areas at the AC end.

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

[0082] It is worth noting that during AP downlink communication, no data conflict will occur when all APs communicate with users in their non-conflicting areas at the same time. APs can be aware of each other's existence. APs that cannot be aware of each other's existence are called non-neighbor APs. No data conflict will occur when all non-neighbor APs (which have no conflicting areas with each other) communicate with users in their own conflicting areas at the same time.

[0083] Therefore, this embodiment groups APs that do not conflict with each other into a single group. APs belonging to the same group can communicate simultaneously with users in conflicting areas without interference. Furthermore, based on the association between users and APs in conflicting areas, the AP grouping and the associated users (STAs) under each AP can be determined.

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

[0085] S31. AC calculates the time-sharing weight of each AP in this round of time-sharing: In each round, the uplink and downlink traffic and the number of packets in the AP buffer queue at the end of the cycle are counted and summed. Conflict and non-conflict areas are calculated separately, and the statistical value of the conflict area is used as the time-sharing weight of each AP.

[0086] S32. Sort the APs from largest to smallest according to their time-sharing weight;

[0087] S33. A weight-based greedy algorithm is used to match and group the sorted APs, ensuring that each AP in a group can communicate with STAs in its conflict area at the same time without causing a conflict.

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

[0089] Grouping is based on AP traffic and the existence of conflict relationships. Assuming the traffic order (i.e., group priority) is AP1 > AP2 > AP3 > AP4, AP1 is considered first. It conflicts with AP2 and AP3 and cannot be grouped together, but it does not conflict with AP4 and can be grouped together. If AP1 and AP4 are already grouped, then AP2 is considered. Since AP2 conflicts with AP1, it cannot be grouped with either AP1 or AP4. Because AP2 conflicts with AP3, AP2 must be in one group, and AP3 in another. For more APs, the same conditions are applied to form definite group assignments.

[0090] S4. Based on the throughput or initial throughput of the previous cycle on the network, determine the length of the current time-division cycle, and based on the length of the current time-division cycle, the traffic weights of non-conflict areas and conflict areas, determine the length of the initially allocated time slice when all APs communicate with their own non-conflict areas and when each AP group communicates with its own conflict area.

[0091] After receiving all AP packets, the AC determines the size of the current time-division cycle and performs detailed time slice allocation based on the traffic status across the entire network. Traffic status is categorized into three types: high traffic, medium traffic, and low traffic. Each cycle involves counting the total number of bytes sent by all APs to calculate the throughput for that cycle. The current traffic type (high traffic, medium traffic, or low traffic) is updated based on the throughput of the most recently completed cycle. Before each cycle begins, 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, then 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, then 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, then 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, then 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 that order.

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

[0094] Table 1. Correspondence between flow type and new cycle length

[0095] throughput in the previous cycle Traffic type New period length timeslice Greater than 1600Mbps High flow 15ms Greater than 600Mbps, less than 1600Mbps medium flow 10ms Less than or equal to 600Mbps Small flow 5ms Default default value 5ms

[0096] Once the time-sharing period size is determined, time slices need to be allocated reasonably to meet the communication needs of each group as much as possible. Specifically, in this embodiment, time slice allocation is divided into three rounds.

[0097] The first round of allocation initially determines the length of the time slice allocated to each AP for communication with its non-conflicting area and for each AP group to communicate with its conflicting area based on the traffic weight of each time slot type.

[0098] Specifically, the product of the non-conflict area traffic of the AP with the largest non-conflict area traffic and the first factor is calculated, and then the product of the non-conflict area traffic of other APs and the second factor is added to obtain the weight value of the non-conflict area. The product of the conflict area traffic of the AP with the largest conflict area traffic in an AP group and the third factor is calculated, and then the product of the conflict area traffic of other APs in that AP group and the fourth factor is added to obtain the weight value of each AP group. Based on the weight values ​​of the non-conflict areas and each AP group, the traffic weights of the non-conflict areas and the conflict areas are calculated. The length of the current time-sharing cycle is allocated according to the traffic weights of the non-conflict areas and the conflict areas.

[0099] For example, in some embodiments, the weight calculation value of a non-conflict area is obtained by multiplying the non-conflict area traffic of the AP with the largest non-conflict area traffic by a factor of 0.85, plus the sum of the non-conflict area traffic of other APs multiplied by a factor of 0.2. The weight calculation value of the i-th group is obtained by multiplying the conflict area traffic of the AP with the largest conflict area traffic in that group by a factor of 0.8, plus the sum of the conflict area traffic of other APs multiplied by a factor of 0.2. After obtaining the weight calculation values ​​of the non-conflict areas and each AP group, the sum is used as the denominator for calculating the weights, and then the weights can be calculated according to their respective weight calculation values. By allocating the time slices for this round according to these weights, the time slice length allocated to the non-conflict areas and each AP group in the first round can be obtained.

[0100] The following is a specific example to illustrate this:

[0101] See Figure 2 As shown, the service first targets the non-collision zone. Based on the weighting relationship, the weights of the non-collision and collision zones are calculated. In the non-collision zone, (AP1, STA1) and (AP2, STA4) transmit simultaneously, completing the traffic in the non-collision zone. Then, in the first collision zone time slice, traffic is grouped by AP. AP1 and AP4 are grouped together. AP1 mainly consists of collision zone VOC1 (AP1, STA2), (AP2, STA3), and AP3), while AP4 mainly consists of collision zone VOC4 ((AP4, STA7), and (AP2, STA6)). At this point, the weight calculation mainly considers AP1->STA2 and AP4->STA7.

[0102] Similarly, considering the AP2 packet, it mainly involves four conflict zones: 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 packet, only the traffic demand of AP2 is considered, and its time slice is determined by the traffic flow from AP2 to STA6 and from AP2 to STA3.

[0103] Similarly, considering AP3 grouping, it mainly involves three conflict zones: VOC2 ((AP3, STA5), AP1, (AP2, STA3)), VOC3 ((AP2, STA3), AP3, AP1), and VOC1 ((AP1, STA2), (AP2, STA3), AP3). However, due to the correlation, the time slice calculation only considers the traffic weight of AP3->STA5.

[0104] In summary, the three AP groups (AP1 / AP4 in one group, AP2 in another, and AP3 in yet another) form a total of four time slices. The first time slice is the non-collision zone time slice (AP1->STA1, AP2->STA4), the second time slice (AP1->STA2, AP4->STA7), the third time slice (AP2->STA3, AP2->STA6), where the traffic of STA3 and STA6 is calculated in the same time slice, and the specific transmission behavior is determined by AP2 based on QoS priority scheduling, resulting in the fourth time slice (AP3->STA5). The arrangement of these time slices is calculated based on the relevant traffic. When STAs do not move and roaming occurs, the relevant group relationships remain unchanged. Specific grouping and division are shown in Table 2 below:

[0105] Table 2. Correspondence between AP groups and VOCs

[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 packet type remains unchanged, it is necessary to determine whether the allocated time slices are reasonable compared to the previous time slices. This is primarily to prevent packets that have already met their bandwidth requirements from receiving more time slices, leading to high-traffic packets occupying an excessive number of time slices, thus compromising the needs and fairness of other packets. Therefore, if the packet type remains unchanged, a second round of allocation is performed.

[0108] A key factor to consider in the second round of allocation is the bandwidth requirement of each AP for its area. To measure the bandwidth fulfillment of a particular AP in the previous cycle, two parameters, m_ncTimeZero and m_cTimeZero, are introduced. m_ncTimeZero represents the relative time when bandwidth is met in non-conflicting areas, and m_cTimeZero represents the relative time when bandwidth is met in conflicting areas. At 1 / 8, 2 / 8, ..., 8 / 8 of each time slice, the number of data packets in the corresponding buffer for the current AP is recorded. If the number of data packets in the corresponding buffer is low enough at a certain moment, the time slice length is considered to meet the bandwidth requirement. In the next cycle, the length of this time slice can be shortened, and the relative time period corresponding to the first time the number of data packets falls below the set threshold is recorded.

[0109] Table 3 shows the possible values ​​of m_ncTimeZero and their meanings.

[0110]

[0111] Table 4 shows the possible values ​​of m_cTimeZero and their meanings.

[0112]

[0113] The second round of allocation will only take place if the groups remain unchanged, and it consists of two steps.

[0114] Step 1: Adjust according to the bandwidth requirements of each AP group for its area.

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

[0116] 2. When the current time-sharing period remains unchanged, if all APs within an AP group report that the time slices allocated in the previous period can meet the bandwidth requirements, it is determined that the time slices need to be reduced. The maximum time slice required to meet the communication bandwidth requirements for all APs within the AP group, the set proportion of the time slices allocated to the AP group in the previous period, and the set proportion of the time slices after the initial allocation for the AP group are calculated. For example, the maximum time slice required to meet the communication bandwidth requirements for all APs within the group, half of the time slices allocated to the group in the previous period, and half of the time slices after the first round of allocation for the group are calculated, and the maximum value of these three is taken as the time slice for the group after the second round of allocation.

[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 requirements, and the proportion of the time slices allocated in the first round of this cycle is less than the proportion allocated in the previous time-sharing cycle, then it is determined that the time-sharing time slices of this group need to be increased.

[0118] 4. In other cases, the time slice allocated to the AP group remains 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 surplus time slice length and AP packets that need to have their time slices increased can be obtained. The allocation rules can be divided into the following three steps.

[0121] 1. Prioritize meeting the communication needs of all APs and non-conflict areas. If the total traffic of all APs communicating with non-conflict areas in the previous cycle is greater than the total traffic of all APs communicating with conflict areas, then allocate a certain percentage (e.g., 10%) of the current cycle directly to non-conflict areas for communication time slices. If the surplus time slice length is greater than 10% of the time-sharing cycle length, deduct the extra time slice from the surplus time slice length and continue with subsequent steps. Otherwise, skip the subsequent steps.

[0122] 2. Distribute the surplus time slices equally among all AP groups that need to increase the conflict area;

[0123] 3. If no AP packet needs an increased time slice and the surplus time slice length is greater than 0, then the surplus time slice is evenly distributed to all AP packets.

[0124] The third round of allocation is to ensure the minimum bandwidth for communication in each area. If the allocated time slice for an area is too short, it cannot communicate effectively. Therefore, a minimum bandwidth time slice should be allocated to each area with users. If, after the first two rounds of allocation, the time slice length allocated to a certain area is less than 100µs, it should be padded to 100µs.

[0125] Furthermore, if the AP grouping has changed compared to the previous grouping result, only the first and third rounds of allocation will be performed. To avoid excessively frequent grouping changes, after a grouping is determined, a new grouping algorithm will only be used to generate a new grouping if the traffic change rate within that AP group exceeds a certain threshold (e.g., 30%).

[0126] After three rounds of allocation, the time slice allocation results are determined. The AC sends the time-sharing results to all APs. After receiving the time-sharing results, the APs either maintain communication or remain silent at the corresponding time and send load information to the AC at the end of the current time slice.

[0127] For ease of understanding, see [link to relevant documentation]. Figure 3The diagram shows the time-sharing management process designed in this application. At the beginning of each time-sharing cycle, the AC sends a time-slot allocation message to all APs for time synchronization. The message contains the time-slot plan for time slots 1 to 4 in this round, i.e., three AP groups (AP1 / AP4 in one group, AP2 in another group, and AP3 in another group), forming a total of 4 time slots. Time slot 1 is a non-conflict zone time slot (AP1->STA1, AP2->STA4), time slot 2 (AP1->STA2, AP4->STA7), time slot 3 (AP2->STA3, AP2->STA6), and time slot 4 (AP3->STA5). The arrangement of the above time slots is calculated based on the relevant traffic.

[0128] If a user access occurs within a time slice, the AP can respond normally to the access request (RTS) and communication request (CTS) of the user scheduled for the current time slice. However, if no user sends an access request, or if the AP is in the process of communication, no actual user uplink communication will occur. Since uplink communication before 802.11ax may time out, as long as RTS / CTS exists, the uplink transmission packets of the next time slice will not conflict with users communicating in the previous time slice. After each round of time-sharing, the AP will automatically enter the next round of non-conflict zone user service time without waiting for the time slice allocation message. The next round's time slice allocation message needs to wait until all statistical information from the previous round is reported before it can be sent. The AP maintains silence by managing downlink queue logic; specifically, the AP only dequeues user data packets within its current service area. While maintaining silence, the AP does not send downlink data, but receiving uplink data is unaffected.

[0129] Figure 4 A schematic diagram of all message content designed for this application.

[0130] In the time slice statistics diagram, ap_id represents the AP identifier, occupying 2 bytes; unconf_flow represents non-collision zone traffic, occupying 8 bytes; and conf_flow represents collision zone traffic, occupying 8 bytes.

[0131] In the time slice allocation message content diagram, syn_time represents the synchronization time, occupying 8 bytes; time_slice represents the length of the current time-slicing cycle, occupying 8 bytes; ap_id represents the AP identifier, occupying 2 bytes; nctime_start represents the start time of non-collision zone communication, occupying 8 bytes; nctime_end represents the end time of non-collision zone communication, occupying 8 bytes; ctime_start represents the start time of collision zone communication, occupying 8 bytes; ctime_end represents the end time of collision zone communication, occupying 8 bytes.

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

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

[0134] The `area` field has three possible values: STA is in a non-collision area, STA is in a collision area and communicating with the AP, and STA is in a collision area and not communicating with the AP. If the STA's status in the message indicates it's in a collision area and communicating with the AP, while the AP's local record indicates it's in a collision area and not communicating with the AP, then this AP is the destination AP for the STA's handover; otherwise, it's the source AP.

[0135] In the diagram of the handover time notification message, ap_id represents the AP identifier, occupying 2 bytes; sta_mac represents the roaming user's MAC address, occupying 6 bytes; and switch_time represents the handover time required, occupying 8 bytes.

[0136] In the diagram of the roaming end notification message, sta_mac represents the MAC address of the roaming user, occupying 6 bytes; src_apid represents the source AP identifier of the roaming user, occupying 2 bytes; dest_apid represents the destination AP identifier of the roaming user, occupying 2 bytes; and success_flag indicates whether the roaming has ended normally, occupying 1 byte.

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

[0138] For specific messages, such as time slice statistics information diagrams, the AP sends them to the controller to report its traffic information, including the traffic of its associated STA in and out of the collision zone.

[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 information is sent to.

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

[0141] User location synchronization messages are messages sent from the controller to the AP.

[0142] The handover time notification message is a message sent by the AP to the controller, informing 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, reporting the source and destination of a roaming trip.

[0144] Understandably, in scenarios with severe co-channel network interference and high user mobility, this application can effectively reduce the retransmission rate of downlink data for users in overlapping coverage areas and decrease the proportion of high-latency packets. In low-load scenarios, this application can increase the bandwidth for users in overlapping coverage areas while ensuring the bandwidth needs of users in other areas, thereby improving the overall system throughput. In high-load scenarios, this application can provide better bandwidth fairness for users in different areas.

[0145] On the other hand, when the AC performs location determination, if a user meets the roaming conditions, it will begin selecting the optimal roaming destination AP: For the next 100ms, the AC continuously monitors available APs for the user to switch to, and at the end of the time, selects the AP with the highest average RSSI measured by the user as the roaming destination AP. The benchmark for an AP that can be switched to is that the RSSI measured by the user is higher than a set threshold (e.g., 3dBm) than the source AP. This benchmark avoids the problem of users switching back and forth between the source AP and the destination AP. The AC supports multiple users roaming simultaneously, but only one user can roam outwards from the same AP.

[0146] The conditions that trigger roaming for a user include: no communication between the user and the currently connected AP within a set time (e.g., 1 second); the mode of the MCS level measured by the user from the currently connected AP is less than or equal to a set level (e.g., 5); or the user and the currently connected AP only interact with control frames. Since control frames do not have an MCS level, the measured MCS level is the initial value when only control frames are interacted, which can be used to determine this situation.

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

[0148] After receiving user handover information, the source AP needs to send a handover time announcement message to the AC at the end of the current time-sharing period. The handover time refers to the time required for all remaining user packets in the source AP's buffer queue to be sent at the end of the current time-sharing period. This time is calculated by the average time packets spend in the buffer queue and the number of remaining packets in the buffer queue. The average time packets spend in the buffer queue is calculated by weighting the average time spent in the buffer queue of the most recent 100 packets.

[0149] After receiving the handover time announcement message from the source AP, the AC no longer forwards the user's packets to the source AP but instead forwards them to the roaming destination AP. Simultaneously, the AC performs roaming time-sharing management based on the handover time. In roaming time-sharing, only the AP group to which the source AP belongs receives a time slice, and the time allocated to that AP group is the maximum handover time reported by the source APs within that group. At this point, the time-sharing period is no longer 10ms, but rather the sum of the maximum handover times for each AP group. This mechanism is primarily designed for zero packet loss. The source AP's queue buffer still contains data that needs to be sent to the STA. Therefore, the roaming handover time announced by the STA is the time required to send all the relevant data. Thus, to ensure that the source AP receives a time slice before switching to the new AP, it must send all the packets buffered in the queue before initiating the handover process. Adjusting to the maximum handover time for each AP group is to consider that in a group consisting of multiple APs, if multiple roaming handovers occur, the maximum handover time reported by the source APs within that group is required. 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 receiving the roaming time-slice allocation message, the source AP will prioritize sending packets for the roaming user. The roaming destination AP will buffer the received user packets. When the handover time sent by the source AP expires, the AC will send a roaming end notice message to both the source AP and the roaming destination AP. Upon receiving the roaming end notice message, the source AP will stop sending user packets, discard any remaining unsent packets, and send a DEL BA frame. Upon receiving the DEL BA frame, the user's BA connection with the source AP will be deleted. When this roaming time-division period ends, the AC's time-division period will return to 10ms.

[0151] Before sending user packets, the roaming destination AP will send an ADD BAReq frame. After receiving the ADD BA Req, the user will establish a new BA connection with the roaming destination AP. At this time, it can be ensured that the user has deleted the BA with the source AP, and then the roaming destination AP and the user can communicate normally.

[0152] Understandably, in traditional roaming, users need to perform operations such as rescanning, reassociation, and reauthentication, which consume time and cause data transmission interruptions. This application, however, achieves seamless roaming under the same BSSID and channel, eliminating the need for rescanning, reassociation, and reauthentication during roaming, thereby reducing latency.

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

[0154] Furthermore, during traditional roaming, users may frequently switch between different access points (APs), leading to communication interruptions and increased latency. This technology, however, avoids users switching back and forth between different APs by having the AC (Access Controller) decide the destination AP and set a handover threshold, thus maintaining the continuity of user communication.

[0155] Furthermore, by using the AC to manage the APs in a time-sharing manner and determine user location, as well as intelligently control user roaming, intelligent network management and optimization are achieved, improving overall network performance and user experience. In addition, it enhances compatibility with user terminals, because all association and handover operations are completed on the AP side, making them imperceptible to the STA user terminal. Therefore, less support is required from the user terminal, enabling support for user terminals with different protocols, thus improving user terminal compatibility.

[0156] Secondly, embodiments of this application also provide another centralized network control method, which is applied to multiple APs in a network, wherein the BSSIDs of the multiple APs are set to be the same and they all operate on the same channel. See [link to relevant documentation]. Figure 6 As shown, the network-based centralized control method includes:

[0157] S1 ’ Collect user measurement information and send the user measurement information to the controller AC;

[0158] S2 ’ The AC obtains its allocated time slice and conducts downlink communication with users within the corresponding time slice. The time slice is allocated by the AC based on the length of the current time-sharing cycle, the traffic weights of non-conflict areas and conflict areas, and according to the time slice that each AP should obtain when communicating with its own non-conflict area and when each AP group communicates with its own conflict area.

[0159] Thirdly, embodiments of this application provide a controller AC in a network, wherein the controller in the network is set in the main gateway of the network, for example, it can be set in the main gateway of an FTTR network.

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

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

[0162] Fourthly, embodiments of this application provide an access point (AP) in a network, wherein the AP is set in the main gateway and / or slave gateway of the network, for example, it can be set in the main gateway and / or slave gateway of an FTTR network.

[0163] The AP includes a processor, a memory, and a centralized network control program stored in the memory and executable by the processor, wherein when the centralized network control program is executed by the processor, it implements the steps of the centralized network control method described above.

[0164] It is worth noting that the centralized control method for network deployment implemented by the AP refers to the steps that should be executed by the AP.

[0165] Fifthly, embodiments of this application provide a networked centralized control system, including the aforementioned controller AC and at least one of the aforementioned access points AP.

[0166] It is worth noting that 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 can be a general-purpose processor, which can call the centralized network control program stored in the memory and execute the centralized network control method provided in the embodiments of this application. For example, the general-purpose processor can be a central processing unit (CPU). The method executed when the centralized network control program is called can be referred to in the various embodiments of the centralized network control method of this application, and will not be repeated here.

[0168] It should be noted that the sequence numbers of the embodiments in this application are for descriptive purposes only and do not represent the superiority or inferiority of the embodiments.

[0169] The terms "comprising" and "having," and any variations thereof, in the specification, claims, and accompanying drawings of this application are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that includes a series of steps or units is not limited to the listed steps or units, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to such process, method, product, or apparatus. The terms "first," "second," and "third," etc., are used to distinguish different objects, etc., and do not indicate a sequence, nor do they limit "first," "second," and "third" to different types.

[0170] In the description of the embodiments of this application, terms such as "exemplary," "for example," or "for instance" are used to indicate examples, illustrations, or explanations. Any embodiment or design described as "exemplary," "for example," or "for instance" in the embodiments of this application should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of terms such as "exemplary," "for example," or "for instance" is intended to present the relevant concepts in a concrete manner.

[0171] In the description of the embodiments of this application, unless otherwise stated, " / " means "or". For example, A / B can mean A or B. The "and / or" in the text is merely a description of the relationship between related objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists alone, A and B exist simultaneously, and B exists alone. In addition, in the description of the embodiments of this application, "multiple" means two or more.

[0172] In some processes described in the embodiments of this application, multiple operations or steps are included in a specific order. However, it should be understood that these operations or steps may not be executed in the order they appear in the embodiments of this application, or they may be executed in parallel. The sequence number of the operation is only used to distinguish 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 sequentially or in parallel, and these operations or steps may be combined.

[0173] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) as described above, and includes several instructions to cause a terminal device to execute the methods described in the various embodiments of this application.

[0174] The above are merely preferred embodiments of this application and do not limit the patent scope of this application. Any equivalent structural or procedural transformations made using the content of this application's specification and drawings, or direct or indirect applications in other related technical fields, are similarly included within the patent protection scope of this application.

Claims

1. A network-based centralized control method, characterized in that, The network-based centralized control method includes: Set the BSSID of the access points (APs) in the network to be the same and make them all work on the same channel; The controller AC acquires user measurement information from the APs in real time to divide each AP into non-conflict areas and / or conflict areas. When a user has measurement results from only one AP, the user is in the non-conflict area of ​​that AP. When a user has measurement results from 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 to obtain the grouping priority, divide APs that do not have conflicting areas into a group, and obtain all AP groups based on the association between users and APs; Based on the throughput or initial throughput of the network in the previous cycle, determine the length of the current time-division cycle. Based on the length of the current time-division cycle, the traffic weights of non-conflict areas and conflict areas, determine the length of the initial time slice allocated when all APs communicate with their own non-conflict areas and when each AP packet communicates with its own conflict area.

2. The network-based centralized control method as described in claim 1, characterized in that, The process of determining the initial time slice length for all APs communicating with their own non-collision areas and for each AP packet communicating with its own collision area, based on the length of the current time-sharing cycle and the traffic weights of non-collision and collision areas, 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 non-conflict area traffic of other APs and the second factor to obtain the weight value of the non-conflict area. Calculate the product of the collision area traffic of the AP with the largest collision area traffic in an AP group and the third factor, and add the product of the collision area traffic of other APs in the same AP group and the fourth factor to obtain the weight value for each AP group. Calculate the traffic weights for non-conflict areas and conflict areas based on the weights of non-conflict areas and each AP group. The length of this round of time-sharing period is allocated based on the traffic weights of non-conflict areas and conflict areas.

3. The network-based centralized control method as described in claim 1, characterized in that, Also includes: When the AP packets remain unchanged, determine the AP packets that need to have their time slices increased and the surplus time slice lengths generated by AP packets that need to have their time slices decreased; If the total traffic of all APs communicating with their non-conflicting areas in the previous cycle is greater than the total traffic of all APs communicating with their conflicting areas, the current time-sharing cycle will first be allocated more time slots to non-conflicting areas according to a set ratio. If the surplus time slot length is greater than the set ratio of the current time-sharing cycle length, the surplus time slot length will be reduced by the extra time slots and then evenly distributed to all AP groups that need to increase their time slots. If no AP packet needs an increased time slice and the surplus time slice length is greater than 0, then the surplus time slice is evenly distributed among all AP packets.

4. The network-based centralized control method as described in claim 3, characterized in that, The determination of the surplus time slice length resulting from AP packets that need to have their time slices increased and AP packets that need to have their time slices decreased includes: When the length of the current time-sharing cycle remains unchanged, if all APs in an AP group report that the time slice allocated in the previous cycle cannot meet the bandwidth requirements, 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 slice allocated in the previous cycle can meet the bandwidth requirements, it is determined that the time slice needs to be reduced. The maximum time slice that meets the communication bandwidth requirements of all APs in the AP group, the duration of the time slice allocated in the previous cycle of the AP group calculated according to a preset ratio, and the duration of the time slice after the initial allocation of the AP group calculated according to a preset ratio are counted. The maximum value of the three is taken as the time slice after the AP group is reallocated, and the length of the resulting surplus time slice 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 requirements, and the proportion of the time slices initially allocated in this cycle is less than the proportion allocated in the previous cycle, then it is determined that the time slices need to be increased. In other cases, the time slice for AP packets remains the result of the initial allocation.

5. The network-based centralized control method as described in claim 2 or 3, characterized in that, Also includes: The time slice length allocated to the region where the user exists will be padded to the minimum bandwidth time slice.

6. The network-based centralized control method as described in claim 1, characterized in that, The process of determining the time-sharing weight of each AP in this round to obtain grouping priority, and grouping APs that do not have conflicting areas into a group, includes: AC calculates and sums the uplink and downlink traffic in this round and the number of packets in the AP's buffer queue at the end of the cycle, and uses the statistical value of the conflict area as the time-sharing weight of each AP in this round. Sorting APs according to time-sharing weights; Based on the existence of conflicting regions, a weighted greedy algorithm is used to match and group the sorted APs.

7. The network-based centralized control method as described in claim 6, characterized in that, Also includes: After determining the results of an AP group, a new AP group is only generated if the traffic change ratio within at least one AP group exceeds a set threshold.

8. The network-based centralized control method as described in claim 1, characterized in that, The determination of the length of the current time-sharing cycle based on the throughput of the previous cycle or the initial throughput of the network includes: If this round of intraday trading is the first round, then the length of this round of intraday trading is the set initial value; If the throughput of the previous cycle is greater than the first flow rate, then 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 rate but less than the first flow rate, then 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 rate, then the length of the current time-sharing cycle is the third length. The lengths of the first, second, and third lengths decrease sequentially.

9. The network-based centralized control method as described in 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 optimal AP is determined as the roaming destination AP based on the user measurement information of all APs. After determining the roaming destination AP, notify the user of the handover information to the source AP and the roaming destination AP, and receive the handover time notification message generated by the source AP based on the number of user buffer queue packets. The handover time is the time required for all remaining user packets in the source AP's buffer queue to be sent at the end of this round of time-sharing period. Adjust the initial time-sharing strategy to ensure that only the AP group containing the source AP receives time, and adjust the length of the time-sharing period 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, which in turn sends the roaming user's message to the roaming destination AP, associating the user with the roaming destination AP. At the same time, it removes the user from the source AP and restores the initial time-slice allocation strategy and the length of the time-slice period.

10. The network-based centralized control method as described in claim 9, characterized in that: If the user does not communicate with the currently connected AP within a set time, the mode of the MCS level measured by the user's currently connected AP is less than or equal to the set level, or the user only interacts with the currently connected AP via control frames, then the AC determines that the user has triggered roaming conditions.

11. The network-based centralized control method as described in claim 9, characterized in that, The process of determining the optimal AP as the roaming destination AP based on user measurement information from all APs includes: Start a timer to continuously monitor the APs available for user switching. At the end of the time, select the AP with the highest average RSSI (Received Signal Strength Indicator) value measured by the user as the roaming destination AP.

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

13. A network-based centralized control method, characterized in that, The centralized network control method is applied to multiple access points (APs) in a network, wherein the BSSIDs of the multiple APs are set to be the same and they all operate on the same channel. The centralized network control method includes: Collect user measurement information and send the user measurement information to the controller AC; It obtains its allocated time slice and conducts downlink communication with the user within the corresponding time slice. The time slices are allocated by the AC based on the length of the current time-sharing cycle, the traffic weights of non-conflict areas and conflict areas, and according to the time slices that each AP should receive when communicating with its own non-conflict area and when each AP group communicates with its own conflict area. The AC acquires user measurement information from the APs in real time to divide each AP into non-conflict and / or conflict areas. When a user has measurement results from only one AP, the user is in the non-conflict area of ​​that AP. When a user has measurement results from at least two APs, the user is in the conflict area of ​​each AP involved.

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

15. The controller AC in a network as described in claim 14, characterized in that: The controller is located in the main gateway of the FTTR network.

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

17. An access point (AP) in a network as described in claim 16, characterized in that: The AP is installed in the main gateway and / or slave gateway of the FTTR network.

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

Images