CN117500067A - RAW time slot allocation method, device and medium - Google Patents

Abstract

The disclosure provides a method, a device and a medium for allocating a RAW time slot, which relate to the technical field of communication and are used for solving the problem that hidden nodes possibly collide when station data are transmitted through a RAW mechanism, wherein the method comprises the following steps: acquiring the spatial position of each station STA in the coverage area of a wireless access point AP; grouping the STAs according to the spatial location so that hidden nodes do not exist in each group; each group of STAs is assigned to the same slot of the RAW mechanism to access the AP channel. According to the method and the device, the STAs in the same group can be mutually visible based on spatial position grouping, so that the problem of hidden nodes in the same group is avoided, the problem of collision and conflict can not occur when the STAs in the same group are allocated to the same time slot of the RAW mechanism to access the AP channel, and the network access capability is improved.

Description

RAW time slot allocation method, device and medium

Technical Field

The present disclosure relates to at least the field of communications technologies, and in particular, to a RAW time slot allocation method, a RAW time slot allocation apparatus, and a computer readable storage medium.

Background

The RAW (restricted access window ) mechanism provides an effective solution for fair channel access among a large number of nodes in the intensive Internet of things, limits the number of competing channels of access sites through different time slot transmission, relieves the collision and collision problem caused by the simultaneous competing channels of large-scale nodes, and improves the network access capability.

However, hidden nodes possibly existing in the internet of things still generate collision and collision problems if they are allocated in the same time slot of the RAW mechanism to transmit data, and the existing RAW mechanism does not provide an effective solution for the collision and collision problems.

Disclosure of Invention

The technical problem to be solved by the present disclosure is: in order to solve the above-mentioned shortcomings, a RAW time slot allocation method, a RAW time slot allocation apparatus, and a computer-readable storage medium are provided to solve the problem that hidden nodes may cause collisions when transmitting station data through a RAW mechanism.

In a first aspect, the present disclosure provides a method for restricting access window RAW slot allocation, the method comprising:

acquiring the spatial position of each station STA in the coverage area of a wireless access point AP;

grouping the STAs according to the spatial location so that hidden nodes do not exist in each group;

each group of STAs is assigned to the same slot of the RAW mechanism to access the AP channel.

In a second aspect, the present disclosure provides a restricted access window RAW slot allocation apparatus, the apparatus comprising:

the acquisition module is used for acquiring the spatial positions of all stations STA in the coverage area of the wireless access point AP;

the grouping module is connected with the acquisition module and is used for grouping the STAs according to the space positions so that hidden nodes do not exist in each group;

and the allocation module is connected with the grouping module and is used for allocating each group of STAs to the same time slot of the RAW mechanism to access the AP channel.

In a third aspect, the present disclosure provides a computer readable storage medium having a computer program stored therein, which when executed by a processor, implements a restricted access window RAW slot allocation method as described above.

The disclosure provides a RAW time slot allocation method, a RAW time slot allocation device and a computer readable storage medium, which group STAs in an AP coverage area based on spatial positions, realize mutual visibility of STAs in the same group, and avoid hidden node problems in the same group, so that collision and collision problems are not generated when the STAs in the same group are allocated to the same time slot of a RAW mechanism to access an AP channel, and network access capability is improved.

Drawings

Fig. 1 is a schematic diagram of a RAW slot in accordance with an embodiment of the present disclosure;

FIG. 2 is a schematic diagram of a hidden node of an embodiment of the present disclosure;

fig. 3 is a flowchart of a RAW slot allocation method according to an embodiment of the present disclosure;

fig. 4 is a schematic diagram of spatial grouping of STAs according to an embodiment of the present disclosure, 4-a is a schematic diagram of uniformly dividing STAs into 2 groups, 4-b is a schematic diagram of uniformly dividing STAs into 4 groups, 4-c is a schematic diagram of uniformly dividing STAs into 6 groups, and 4-d is a schematic diagram of uniformly dividing STAs into 8 groups;

fig. 5 is a schematic diagram of another spatial grouping of STAs according to an embodiment of the present disclosure, 5-a is a schematic diagram of uniformly grouping STAs first, and 5-b is a schematic diagram of secondarily dividing the uniform grouping;

fig. 6 is a schematic structural diagram of a RAW slot allocation apparatus according to an embodiment of the present disclosure.

Detailed Description

In order for those skilled in the art to better understand the technical solutions of the present disclosure, embodiments of the present disclosure will be described in further detail below with reference to the accompanying drawings.

It is to be understood that the specific embodiments and figures described herein are merely illustrative of the present disclosure, and are not limiting of the present disclosure.

It is to be understood that the various embodiments of the disclosure and features of the embodiments may be combined with one another without conflict.

It is to be understood that for convenience of description, only portions relevant to the present disclosure are shown in the drawings of the present disclosure, and portions irrelevant to the present disclosure are not shown in the drawings.

It should be understood that each unit and module in the embodiments of the present disclosure may correspond to only one physical structure, may be composed of a plurality of physical structures, or may be integrated into one physical structure.

It will be appreciated that, without conflict, the functions and steps noted in the flowcharts and block diagrams of this disclosure may occur out of the order noted in the figures.

It will be appreciated that in the flow charts and block diagrams of the present disclosure, architecture, functionality, and operation of possible implementations of systems, apparatuses, devices, methods according to various embodiments of the present disclosure are shown. Where each block in the flowchart or block diagrams may represent a unit, module, segment, code, or the like, which comprises executable instructions for implementing the specified functions. Moreover, each block or combination of blocks in the block diagrams and flowchart illustrations can be implemented by hardware-based systems that perform the specified functions, or by combinations of hardware and computer instructions.

It is to be understood that the units and modules referred to in the embodiments of the disclosure may be implemented in software or hardware, for example, the units and modules may be located in a processor.

To facilitate understanding of the present disclosure, a specific application scenario of the present disclosure is first introduced.

The method, the device and the medium provided by the disclosure can be particularly applied to the scenario of the internet of things oriented by the IEEE (institute of Electrical and electronics Engineers ) 802.11ah wireless network protocol.

Aiming at the development prospect of the Internet of things technology and the sensor network, in order to adapt to the development requirements of high transmission rate, high throughput and high spectral efficiency, the IEEE 802.11ah wireless network protocol works in an unlicensed frequency band below 1GHz for the Internet of things scene, and defines a low-power wireless communication technology which has the characteristics of wide coverage range, multiple accommodating nodes and high throughput.

To guarantee transmission performance under dense networks, IEEE 802.11ah defines three methods at the MAC layer (Medium Access Control ): DCF (Distributed Coordination Function ), PCF (point coordination function, point coordination function) and HCF (Hybrid Coordination Function ) proposed between the former two. The DCF access mechanism is the most basic medium access mechanism, and the user node obtains asynchronous data transmission through a contention channel according to a carrier sense multiple access mode of CSMA/CA (Carrier Sense Multiple Access with Collision Avoid, carrier sense multiple access with collision avoidance); PCF adopts different time to transmit in turn, but increases part of data packet time delay; HCF proposes EDCA (Enhanced Distributed Channel Access ) access based on QoS (Quality of Service, quality of service) and RAW (Restricted Access Window ) access unique to the 802.11ah protocol.

As shown in fig. 1, when a large number of STAs (stations) apply for transmitting data to the same AP (Access Point), the central AP will first send a short Beacon (short Beacon) for polling, determine the range of STAs that need to transmit data, and the RAW mechanism will group the STAs and transmit a channel Access time (T) in a Beacon Interval (Beacon Interval) _RAW ) Divided into a plurality of time slots (time slot, or slot for short, each slot being a length T _slot ) Each group of STAs together acquire a time slot resource within the RAW restricted access window, one possible allocation rule is as shown in equation (1):

i _slot ＝(x+N _offset )modN _RAW (1)

where x is the index of the STA, N _offset Representing the offset value in the mapping function, the sequence numbers of the time slots (i.e. slot 0, slot1, … … in FIG. 1) in RAW are from 0 to N _RAW The xth STA is at the ith _slot Transmission within a slot.

After grouping STAs by equation (1), fairness of STA allocation rules is improved, but it is difficult to avoid hidden node problems as shown in fig. 2.

The problem of hidden nodes exists in the IEEE 802.11 network, because the MAC layer uses a time division multiplexing mechanism, that is, when a user sends data, only one STA station occupies a channel, and when one node is visible to an AP wireless access point but not to other nodes communicating with the AP, multiple nodes outside the coverage area of each other cannot monitor the transmission of data packets of the other party, so that data collision occurs, which causes a number of performance problems, such as reduced throughput, uneven throughput allocation, unstable throughput, and the like. Fig. 2 illustrates the relationship between hidden nodes, where an AP is a wireless access point, A, B, C is three STA stations, a circle indicates a transmission range (furthest detection range) of each station, where the AP may cover A, B, C three stations, a may monitor the AP access point, but not B, C two stations, B and C may not monitor the a station, and therefore, if the nodes (A, B, C) transmit data in the same timeslot, collision may occur, resulting in network performance degradation.

Therefore, the present invention proposes a space grouping-based method, in which STAs which are hidden nodes are allocated to different groups, so that each transmits data in different time slots, thereby avoiding collision and collision between hidden nodes.

Example 1:

as shown in fig. 3, the present disclosure provides a restricted access window RAW slot allocation method, which includes:

s1, acquiring the spatial position of each station STA in the coverage area of a wireless access point AP;

s2, grouping the STAs according to the space positions, so that hidden nodes do not exist in each group;

s3, each group of STA is allocated to the same time slot of the RAW mechanism to access the AP channel.

In this embodiment, a method for allocating a RAW timeslot is provided, which is mainly aimed at implementing data packet transmission by grouping STAs based on spatial locations and accessing the STAs to an AP channel in different timeslots of the RAW based on the grouping, and channel resource contention conflicts will not occur in each STA node during the transmission process. The specific scheme is as follows: firstly, acquiring the spatial position of each station STA in the coverage area of a wireless access point AP; then, grouping the STAs according to the spatial position, so that hidden nodes do not exist in each group, namely, even if the STAs in the same group in each group are visible to each other, or any STA in the same group can be monitored by all STAs in the same group, specifically, the STAs are divided into multiple groups according to the spatial position, so that the furthest detection range of any STA in each group is greater than or equal to the spatial range distributed by all STAs in the group; finally, each group of STAs is allocated to the same slot of the RAW mechanism to access the AP channel. Through the method, the STAs are grouped based on the spatial positions, so that the STAs in the same group can see each other, the problem of hidden nodes in the same group is avoided, the problem of collision and conflict can not occur when the STAs in the same group are allocated to the same time slot of the RAW mechanism to access the AP channel, and the network access capability is improved.

In an embodiment, acquiring spatial locations of STAs of stations in an AP coverage area of a wireless access point specifically includes:

each STA within its coverage area is polled by the AP to acquire and record the spatial location of each STA.

In this embodiment, for the restricted access window RAW mechanism adopted by the 802.11ah protocol as shown in fig. 1, when sending a short beacon poll through the AP, the spatial location of each STA in the coverage area of the AP is obtained, that is, each STA is required to report its own spatial location information in the poll, the AP records the spatial location information of each STA, and the subsequent steps S2 and S3 are also executed by the AP.

In an embodiment, the STAs are grouped according to spatial location, so that no hidden node exists in each group, which specifically includes:

the AP coverage area is divided into a plurality of parts, each part of STA is taken as a group, and the furthest detection range of any STA in each group is more than or equal to the spatial range of the part in the AP coverage area.

In particular, for indoor environments such as office buildings and families, the requirement on the coverage of the AP is small, and the problem of hidden nodes of the traditional distributed coordination DCF transmission mechanism is not obvious. For the ah protocol facing to the internet of things, the coverage area is required to be more than 1 km, and hundreds of access devices are required to be supported, so that when a high-density WLAN (wireless local area network ) network is deployed on a large scale, the hidden node problem is greatly influenced, although the 802.11ah protocol adopts a restricted access window RAW mechanism to relieve collision among nodes, reduce collision probability and improve network performance, under the condition that the traffic load of stations is not considered, with the increase of the STAs, even if the number of stations is reduced after the RAW allocates time slots, stations allocated in the same group also contain nodes far away from each other, the hidden node problem still exists, data packet transmission cannot be monitored, and serious collision is still possible to happen in the group. That is, the hidden node problem is mainly caused by the spatial distance between STAs, and by reducing the maximum spatial distance between STAs in the same group, it is expected to avoid the hidden node problem between the same group.

In this embodiment, the requirement for grouping is that hidden nodes do not exist in the same group, and the main grouping concept is to group STAs closer to the same group based on spatial location, and group STAs farther from the same group. The grouping method can be as follows: the AP coverage area is divided into different parts according to space positions, the STAs of each part are regarded as a group, but the STAs of each group should meet the requirement of being visible to each other, the mutual visibility of the STAs of the same group can be ensured by the furthest detection range of any STA in each group being greater than or equal to the spatial range of the STA in the AP coverage area, the step does not necessarily need to be realized by acquiring the furthest detection range of the STA, for example, the AP coverage area can be divided into a plurality of parts by taking the AP as the center, and if the number of STAs in a part is greater than 1, the angle of the part is smaller than 180 degrees to reduce the furthest detection range required by the STAs of the same group, namely, if a certain group only needs to be visible to the AP, since there is no hidden node, if a group has a plurality of STAs, the furthest detection range between the STAs of the same group can be reduced by reducing the spatial distance between the STAs of the same group by reducing the sector area centered on the AP.

In one embodiment, the AP coverage area is divided into multiple parts, which specifically includes:

the AP coverage area is divided into at least three parts averagely by taking the AP as a center point, so that the radius of the farthest detection range of each required STA is smaller than 2r; or,

the AP coverage area is divided into at least six parts by taking the AP as a center point, so that the radius of the farthest detection range of each required STA is equal to r;

where r is the radius of the AP coverage area.

In this embodiment, as shown in fig. 4, fig. 4 describes several schemes for spatially uniformly grouping STAs, and when an AP coverage area is divided into sectors with an AP as a center point, the furthest detection range that any STA in each sector needs to have is related to the angle of the sector. It will be appreciated that for an AP coverage area with radius r, when there are multiple STAs in it, if the furthest detection range of all STAs is greater than or equal to 2r (the furthest distance possible between all STAs), there is necessarily no hidden node in it, for a same group of STAs, when their sector spatial area angle is less than 180 °, the furthest detection range required is less than 2r, and when their sector spatial area angle is less than 60 °, the furthest detection range required is equal to r. If the distribution of STAs in the coverage area of the AP is relatively uniform, the STAs can be uniformly grouped according to the spatial location, that is, the AP coverage area is directly and averagely divided, so that the fairness of the time slot can be ensured, if the number of slots in one window RAW is N, that is, the number of groups of STAs is N, that is, the AP coverage area is uniformly divided into N shares, the furthest detection distance required by any STA is as shown in formula (2):

therefore, compared with the furthest detection distance of 2r before the space grouping is carried out on the STA, after the space grouping is adopted, the furthest distance possibly appearing between the STAs can be shortened when the grouping number is more than or equal to 3, and the furthest distance possibly appearing between the STAs can be effectively shortened when the grouping number is more than or equal to 6, so that the collision problem between hidden nodes which cannot be detected at a long distance can be effectively reduced. Although the performance of the spatial packet RAW scheme is related to a plurality of factors, such as the number of STAs, the number of slots, the coverage radius, the furthest detection range of the hidden node, etc., different partitioning modes affect the throughput of the system, shortening the furthest detection distance that the STAs need to have can always better avoid collision problems.

In one embodiment, a group of STAs for each group specifically includes:

selecting a 0-degree datum line by taking an AP as a center point;

time slot sequence number i of each STA is allocated according to the following _slot ：

Or->

Where θ is the line angle of each STA and the AP based on a 0 ° reference line in a clockwise or counterclockwise direction, and N is the number of copies of the AP coverage area divided equally.

In this embodiment, as shown in fig. 4, in the case of uniformly distributing STAs, after the AP polls and records the spatial location information of each STA, the AP coverage area is uniformly divided into different parts according to the spatial locations, so that STAs belonging to the same spatial part transmit data in the same allocated channel slot. If the slot number in one window RAW is N, 0 degree is expressed by taking the forward direction of the central point AP as a reference, the slot sequence numbers are distributed anticlockwise, and if the connection angle between the STA and the AP is the same as the slot sequence numberThe STA is at the ith degree if the degree is theta _slot The transmission in each time slot is as shown in formula (3):

another method for obtaining the slot sequence number is shown in formula (4):

in the above space grouping mode, in the process of allocating the time slots for the RAW mechanism, the time slot allocation sequence number can be obtained through the space position of the STA in the coverage area of the AP, instead of using the mapping function mode in fig. 1 to allocate the time slots, the RAW transmission mechanism based on the space grouping is realized, the influence of hidden nodes is reduced, and the performance of the 802.11ah network is improved.

In one embodiment, the AP coverage area is divided into multiple parts, which specifically includes:

uniformly dividing an AP coverage area into at least two parts by taking the AP as a center point, and continuously dividing the parts into at least two parts if the number of the STAs in a part is larger than a first preset threshold value; or,

and uniformly dividing the AP coverage area into at least two parts by taking the AP as a center point, and if the number of the STAs in one part is larger than a second preset threshold value and the number of the STAs in the other part is smaller than a third preset threshold value, reducing the angle of the part and expanding the angle of the other part.

In one embodiment, a group of STAs for each group specifically includes:

selecting a 0-degree datum line by taking an AP as a center point;

each STA is assigned the same slot number i in a clockwise or counterclockwise direction starting from the 0 ° reference line _slot 。

In this embodiment, as shown in fig. 5, fig. 5 describes a space on-demand grouping RAW scheme, after the AP polls and records the space position information of each STA, the AP coverage area is divided into different parts according to the space positions, and because the STAs in fig. 5 are unevenly distributed, the area with dense nodes can be divided twice as shown in fig. 5-b on the basis of the even grouping in fig. 5-a, and the angle of the space grouping in fig. 5-a can be adaptively adjusted, so that the number of STAs in each group is ensured to be in a proper range, and the problem of collision caused by excessive number of nodes in each slot is further solved.

In one embodiment, each group of STAs is allocated to the same timeslot of the RAW mechanism to access the AP channel, which specifically includes:

each STA is according to i _slot Corresponding time slots allocated to RAW mechanism so that the same group of STAs in each time slot compete for AP channel resources under mutually visible conditions

In this embodiment, after slot time slots are allocated to different areas based on spatial location division covered by an AP, STAs belonging to the same spatial packet are transmitted in the same allocated channel time slot, and STAs in the same group can compete for channel resources through a DCF/EDCA mechanism. In addition, the parameter of crossing the time slot boundary exists in the RAW transmission frame, under the condition that crossing the time slot boundary is not allowed, the STA in each packet can only access a channel in the corresponding RAW window, the STA in each RAW window competes for channel resources through a DCF/EDCA mechanism, stations of other packets cannot perform data transmission, enter a dormant state, reduce energy loss, wait until the corresponding allocated time slot is reached, and then start transmission; if the residual time of the STA which finally transmits data in the time slot is insufficient, transmission is not initiated; where cross-slot boundary is allowed, STA transmissions may extend beyond the allocated slots, and the present disclosure may allow or disallow STA cross-slot transmission of data by setting cross-slot boundary parameters.

Example 2:

as shown in fig. 5, the present disclosure provides a restricted access window RAW slot allocation apparatus, the apparatus comprising:

the acquisition module 1 is used for acquiring the spatial position of each station STA in the coverage area of the wireless access point AP;

the grouping module 2 is connected with the acquisition module 1 and is used for grouping the STAs according to the space position so that hidden nodes do not exist in each group;

an allocation module 3, connected to the grouping module 2, is configured to allocate each group of STAs to the same timeslot of the RAW mechanism to access the AP channel.

In one embodiment, the obtaining module 1 specifically includes:

a polling unit for polling each STA in its own coverage area by the AP,

and the recording unit is connected with the polling unit and is used for acquiring and recording the spatial positions of the STAs from the polling result.

In one embodiment, the grouping module 2 specifically includes:

an area dividing unit for dividing the AP coverage area into a plurality of copies,

a region grouping unit connected with the region dividing unit for grouping the STAs of each set after region division,

and the grouping detection unit is connected with the area grouping unit and is used for enabling the furthest detection range of any STA in each group to be more than or equal to the spatial range of the group in the coverage area of the AP.

In one embodiment, the area dividing unit is specifically configured to:

the AP coverage area is divided into at least three parts averagely by taking the AP as a center point, so that the radius of the farthest detection range of each required STA is smaller than 2r; or,

the AP coverage area is divided into at least six parts by taking the AP as a center point, so that the radius of the farthest detection range of each required STA is equal to r;

where r is the radius of the AP coverage area.

In one embodiment, the area grouping unit is specifically configured to:

selecting a 0-degree datum line by taking an AP as a center point;

time slot sequence number i of each STA is allocated according to the following _slot ：

Or->

Where θ is the line angle of each STA and the AP based on a 0 ° reference line in a clockwise or counterclockwise direction, and N is the number of copies of the AP coverage area divided equally.

In one embodiment, the area dividing unit is specifically configured to:

uniformly dividing an AP coverage area into at least two parts by taking the AP as a center point, and continuously dividing the parts into at least two parts if the number of the STAs in a part is larger than a first preset threshold value; or,

and uniformly dividing the AP coverage area into at least two parts by taking the AP as a center point, and if the number of the STAs in one part is larger than a second preset threshold value and the number of the STAs in the other part is smaller than a third preset threshold value, reducing the angle of the part and expanding the angle of the other part.

In one embodiment, the area grouping unit is specifically configured to:

selecting a 0-degree datum line by taking an AP as a center point;

each STA is assigned the same slot number i in a clockwise or counterclockwise direction starting from the 0 ° reference line _slot 。

In one embodiment, the distribution module 3 specifically includes:

a time slot allocation unit for allocating each STA according to i _slot The corresponding time slot allocated to the RAW mechanism,

and the channel access unit is connected with the time slot allocation unit and is used for enabling the same group of STAs in each time slot to compete for the AP channel resources under the condition of being mutually visible.

Example 3:

embodiment 3 of the present disclosure provides a computer-readable storage medium having a computer program stored therein, which when executed by a processor, implements the restricted access window RAW slot allocation method described in embodiment 1 or implements the restricted access window RAW slot allocation apparatus described in embodiment 2.

Computer-readable storage media includes volatile or nonvolatile, removable or non-removable media implemented in any method or technology for storage of information such as computer-readable instructions, data structures, computer program modules or other data. Computer-readable storage media includes, but is not limited to, RAM (Random Access Memory ), ROM (Read-Only Memory), EEPROM (Electrically Erasable Programmable Read Only Memory, charged erasable programmable Read-Only Memory), flash Memory or other Memory technology, CD-ROM (Compact Disc Read-Only Memory), digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer.

In addition, the present disclosure may further provide a computer apparatus including a memory and a processor, the memory having stored therein a computer program, the processor executing the restricted access window RAW time slot allocation method as described in embodiment 1 when the processor runs the computer program stored in the memory, the computer apparatus may be the restricted access window RAW time slot allocation apparatus as described in embodiment 2.

The memory is connected with the processor, the memory can be flash memory or read-only memory or other memories, and the processor can be a central processing unit or a singlechip.

Embodiments 1-3 of the present disclosure provide a RAW time slot allocation method, a RAW time slot allocation device, and a computer readable storage medium, which group STAs in an AP coverage area based on spatial locations, so as to realize mutual visibility of STAs in the same group, and avoid hidden node problems in the same group, thereby avoiding collision and collision problems when the STAs in the same group are allocated to the same time slot of a RAW mechanism to access an AP channel, and improving network access capability.

It is to be understood that the above embodiments are merely exemplary embodiments employed to illustrate the principles of the present disclosure, however, the present disclosure is not limited thereto. Various modifications and improvements may be made by those skilled in the art without departing from the spirit and substance of the disclosure, and are also considered to be within the scope of the disclosure.

Claims (10)

1. A method for restricting access window, RAW, slot allocation, the method comprising:

acquiring the spatial position of each station STA in the coverage area of a wireless access point AP;

grouping the STAs according to the spatial location so that hidden nodes do not exist in each group;

each group of STAs is assigned to the same slot of the RAW mechanism to access the AP channel.

2. The method of claim 1, wherein obtaining the spatial locations of STAs of stations within the coverage area of the AP specifically comprises:

each STA within its coverage area is polled by the AP to acquire and record the spatial location of each STA.

3. The method according to claim 1 or 2, wherein the STAs are grouped according to spatial location such that no hidden node exists in each group, specifically comprising:

the AP coverage area is divided into a plurality of parts, each part of STA is taken as a group, and the furthest detection range of any STA in each group is more than or equal to the spatial range of the part in the AP coverage area.

4. The method of claim 3, wherein dividing the AP coverage area into a plurality of shares, specifically comprises:

the AP coverage area is divided into at least three parts averagely by taking the AP as a center point, so that the radius of the farthest detection range of each required STA is smaller than 2r; or,

the AP coverage area is divided into at least six parts by taking the AP as a center point, so that the radius of the farthest detection range of each required STA is equal to r;

where r is the radius of the AP coverage area.

5. The method of claim 4, wherein the group of STAs for each set of STAs specifically comprises:

selecting a 0-degree datum line by taking an AP as a center point;

time slot sequence number i of each STA is allocated according to the following _slot ：

Or->

Where θ is the line angle of each STA and the AP based on a 0 ° reference line in a clockwise or counterclockwise direction, and N is the number of copies of the AP coverage area divided equally.

6. The method of claim 3, wherein dividing the AP coverage area into a plurality of shares, specifically comprises:

uniformly dividing an AP coverage area into at least two parts by taking the AP as a center point, and continuously dividing the parts into at least two parts if the number of the STAs in a part is larger than a first preset threshold value; or,

and uniformly dividing the AP coverage area into at least two parts by taking the AP as a center point, and if the number of the STAs in one part is larger than a second preset threshold value and the number of the STAs in the other part is smaller than a third preset threshold value, reducing the angle of the part and expanding the angle of the other part.

7. The method of claim 6, wherein the group of STAs for each set of STAs specifically comprises:

selecting a 0-degree datum line by taking an AP as a center point;

each STA is assigned the same slot number i in a clockwise or counterclockwise direction starting from the 0 ° reference line _slot 。

8. The method according to claim 5 or 7, wherein assigning each group of STAs to the same time slot of the RAW mechanism to access the AP channel, specifically comprises:

each STA is according to i _slot The corresponding time slots of the RAW mechanism are allocated such that the STAs of the same group within each time slot compete for AP channel resources under mutually visible conditions.

9. A restricted access window RAW slot allocation apparatus, the apparatus comprising:

the acquisition module is used for acquiring the spatial positions of all stations STA in the coverage area of the wireless access point AP;

the grouping module is connected with the acquisition module and is used for grouping the STAs according to the space positions so that hidden nodes do not exist in each group;

and the allocation module is connected with the grouping module and is used for allocating each group of STAs to the same time slot of the RAW mechanism to access the AP channel.

10. A computer readable storage medium, wherein a computer program is stored in the computer readable storage medium, which when executed by a processor, implements the restricted access window RAW time slot allocation method of any of claims 1-8.