Channel access method and device, and storage medium

Abstract

The invention provides a channel access method and device, and a storage medium. The method comprises the following steps: forming a corresponding candidate access point set by using each access point participating in cooperative operation and channel resource competition in a pre-configured access point set; and taking the first candidate access point successfully occupying the channel resource in the candidate access point set as a first type of access point, and sending a cooperative trigger frame to other access points in the access point set through the first type of access point, so that other access points in the access point set perform channel access.

Description

Technical Field

[0001] This application relates to the field of communication technologies, and particularly to a channel access method, device, and storage medium. Background Art

[0002] During the cooperative operation of multiple access points (APs), the channel utilization efficiency depends on the following three situations: First, whether the AP sharing the channel resources (abbreviated as sharing AP) detects that the primary channel is idle. Figure 1 FIG. 1 is a schematic diagram of the channel states of a sharing AP and a shared AP provided by the prior art. As Figure 1 shown, both the sharing AP and the AP sharing the channel resources (shared AP) operate in the 6 GHz band and 320 MHz bandwidth. The primary 20 MHz (P20) of the sharing AP is in the high-frequency band, while the P20 of the shared AP is in the low-frequency band. When the sharing AP detects channel interference on the P20, the sharing AP has to avoid and wait for the channel to be idle, resulting in a delay in the multi-AP cooperation this time. Second, in the state where the P20 channel is idle, the size of the random back-off window of the sharing AP directly determines the channel utilization efficiency. Figure 2 FIG. 2 is a schematic diagram of the implementation of a random back-off window and channel access provided by the prior art. As Figure 2 shown, the sharing AP sends a trigger frame (TF) in the case 1 random window state and in the case 2 random window state. Obviously, the larger the random window, the longer the waiting time for the sharing AP to access the channel, and the lower the channel utilization rate. Third, Figure 3 FIG. 3 is a schematic diagram of the implementation of the channel access delay caused by detecting a busy channel during the random window back-off process. In the state where the P20 channel is idle, the sharing AP randomly selects a back-off window and starts a countdown counter. According to the carrier sense multiple access / collision avoidance (CSMA / CA) channel access rule, during the back-off process, if an interference signal or other Wi-Fi signals are detected on the P20, the sharing AP will stop channel detection. After waiting for the interference signal or other Wi-Fi signals to be transmitted, it will continue to back off. The channel access delay during the entire multi-AP cooperation process is as Figure 3 shown. Therefore, how to improve the channel utilization efficiency during the multi-AP cooperation operation is an urgent problem to be solved. Summary of the Invention

[0003] In view of this, embodiments of the present application provide a channel access method, device, and storage medium, which improve the channel utilization efficiency.

[0004] Embodiments of the present application provide a channel access method, including:

[0005] Forming a corresponding candidate access point set for each access point participating in cooperative operations and channel resource competition in a pre-configured access point set;

[0006] Taking the first candidate access point that successfully preempts channel resources in the candidate access point set as a first type of access point, and sending a cooperative trigger frame to other access points in the access point set through the first type of access point, so that other access points in the access point set perform channel access.

[0007] Embodiments of the present application provide a channel access device, including:

[0008] A generation module configured to form a corresponding candidate access point set for each access point participating in cooperative operations and channel resource competition in a pre-configured access point set;

[0009] A channel access module configured to take the first candidate access point that successfully preempts channel resources in the candidate access point set as a first type of access point, and send a cooperative trigger frame to other access points in the access point set through the first type of access point, so that other access points in the access point set perform channel access.

[0010] Embodiments of the present application provide a communication device, including: a memory, and one or more processors;

[0011] The memory is configured to store one or more programs;

[0012] When the one or more programs are executed by the one or more processors, the one or more processors implement the method described in any of the above embodiments.

[0013] Embodiments of the present application provide a storage medium, which stores a computer program, and when the computer program is executed by a processor, the method described in any of the above embodiments is implemented. Brief Description of the Drawings

[0014] Figure 1 It is a schematic diagram of the channel states of a sharing AP and a shared AP provided by the prior art;

[0015] Figure 2 It is a schematic diagram of the implementation of a random backoff window and channel access provided by the prior art;

[0016] Figure 3 It is a schematic diagram of the implementation of the channel access delay caused by detecting a busy channel during the random window backoff process provided by the prior art;

[0017] Figure 4 It is a schematic diagram of the implementation of a multi-link connection establishment process provided by the prior art;

[0018] Figure 5 It is a schematic diagram of the implementation of the multi-link synchronous transmission mode of AP MLD and NSTR non-AP MLD provided by the prior art;

[0019] Figure 6 It is a flowchart of a channel access method provided by an embodiment of the present application;

[0020] Figure 7 It is a schematic diagram of the implementation of the state transition relationship during the multi-AP collaboration process provided by an embodiment of the present application;

[0021] Figure 8 It is a schematic diagram of the implementation of two PAPs competing for channel resources simultaneously provided by an embodiment of the present application;

[0022] Figure 9 It is a schematic diagram of the implementation of two PAPs competing for channel resources non-simultaneously provided by an embodiment of the present application;

[0023] Figure 10 It is a schematic diagram of the implementation of PAP using an un-cleared backoff window to preempt channel resources and transmit PPDU provided by an embodiment of the present application;

[0024] Figure 11 It is a schematic diagram of the implementation of PAP delaying to wait for sending TF provided by an embodiment of the present application;

[0025] Figure 12 It is a block diagram of the structure of a channel access device provided by an embodiment of the present application;

[0026] Figure 13 It is a schematic diagram of the structure of a communication device provided by an embodiment of the present application. Detailed implementation manners

[0027] In the following, the embodiments of the present application will be described with reference to the accompanying drawings. The present application will be described below with reference to the accompanying drawings of the embodiments. The examples given are only for explaining the present application and are not intended to limit the scope of the present application.

[0028] For the convenience of understanding the solution of the present application, the channel access technology related to the present application will be described.

[0029] First, the Fiber-To-The-Room (FTTR) technology connects APs (such as routers) in different rooms or locations in scenarios such as homes or small and medium-sized enterprises through optical fibers, thereby providing high-bandwidth and highly reliable connections for networking between multiple APs. The connection between the master control AP and the slave APs can be realized by using a point-to-multipoint optical distribution network.

[0030] Second, the channel access technology based on CSMA / CA: In a Wi-Fi network, both the AP and the connected terminal devices share the same wireless medium for data communication. The principle of Wi-Fi wireless medium access is how to enable each device to adopt a mechanism of mutual avoidance and obtain the access right to the wireless medium in turn in an equal competition manner, and then send data.

[0031] Its basic principle is the CSMA / CA mechanism, that is, when multiple devices simultaneously use the wireless channel to send data, each device first needs to perform channel sensing. When it determines that the channel is idle, after a frame interval, by randomly selecting a backoff window and counting down, it obtains the opportunity to send data into the wireless channel.

[0032] Third, the Multi-Link Operation (MLO) technology is introduced in the Wi-Fi 7 protocol, that is, multi-link devices (Multi-Link Devices, MLDs) including network devices (AP MLDs) and terminal devices (non-AP MLDs) can simultaneously transmit data on multiple links, improving the throughput of data transmission and reducing the delay.

[0033] After the AP MLD and the non-AP MLD complete the four-way handshake on one link, they generate a pairwise transient key (PTK) at the MLO level and a group temporal key (GTK) at the link level, which are used to encrypt and decrypt the transmitted unicast data frames and the host data frames respectively, ensuring the security of data transmission. For example, Figure 4 is a schematic diagram of the implementation of a multi-link connection establishment process provided by the prior art, as Figure 4 shown. Both the AP MLD and the non-AP MLD include three links operating at 2.4 GHz, 5 GHz, and 6 GHz. After the AP MLD and the non-AP MLD complete the authentication, connection, and four-way handshake processes on the 2.4 GHz link and establish a multi-link connection, they can transmit data on the three links.

[0034] Fourthly, in the Wi-Fi 7 protocol, a NonSimultaneous Transmit and Receive (NSTR) device is defined. When physical layer protocol data units (PPDUs) need to be transmitted on two links, the time for transmitting and receiving the PPDUs, especially the end time of the PPDU, needs to be aligned.

[0035] Figure 5 Figure 4 is a schematic diagram of the implementation of the multi-link synchronous transmission mode of an AP MLD and an NSTR non-AP MLD provided by the prior art. As Figure 5 shown, the AP MLD and the NSTR non-AP MLD establish connections on two links. AP1 and AP2 simultaneously transmit data to Station 1 (STA1) and STA2 on the two links and simultaneously receive the acknowledgment frames replied by STA1 and STA2.

[0036] Fifthly, in the Wi-Fi 8 protocol, Ultra High Reliability (UHR) technology is adopted, which can improve transmission stability, including reducing latency, increasing throughput, and reducing packet loss rate.

[0037] One way is that the Transmission Opportunity (TXOP) is shared between overlapping Basic Service Sets (BSSs), reducing the problem of channel utilization degradation caused by conflicts due to mutual competition for channels between mutual BSSs. Its general steps can be described as follows:

[0038] (1) Multiple APs negotiate to form a multi-AP cooperation group;

[0039] (2) Select one AP from the multi-AP cooperation group as the sharing AP, and one or more APs as the shared APs;

[0040] (3) The shared AP sends the channel resource requirements and / or cache data status to the sharing AP;

[0041] (4) After the sharing AP competes for the channel resources, it allocates the resource units (RUs) and / or TXOP time slices to one or more shared APs (including the sharing AP itself) in the Trigger frame according to the requirements of the shared APs;

[0042] (5) After obtaining the RU, the shared AP transmits downlink data to the STAs within the BSS on the given RU and / or in the TXOP time slice;

[0043] (6) Repeat the above process.

[0044] An embodiment of this application proposes a solution for improving channel utilization during multi-AP cooperation. The solution is generally described as follows: Select multiple candidate access points (which can also be referred to as Potential sharing APs, PAPs) to jointly seize the channel. The first AP that grabs the channel resource serves as the real sharing AP and sends a trigger frame for multi-AP cooperation operations to improve channel utilization efficiency.

[0045] In one embodiment, Figure 6 is a flowchart of a channel access method provided by an embodiment of this application. This embodiment is applied to the situation where multiple candidate access points jointly seize channel resources. This embodiment can be executed by an access point. As Figure 6 shown, this embodiment includes: S110 - S120.

[0046] S110. Form a corresponding candidate access point set for each access point in the pre-configured access point set that participates in cooperation operations and channel resource competition.

[0047] Among them, the access point set can be understood as all access points participating in this cooperation operation; the candidate access point set can be understood as all access points that simultaneously participate in this cooperation operation and channel resource competition. In one embodiment, the candidate access point set is a subset of the access point set, that is, all candidate access points included in the candidate access point set are access points in the access point set. Each access point in the access point set can also be called a participating access point, that is, the access point participating in this cooperation operation is called a participating access point. In one embodiment, multiple access points in the access point set can be changed into candidate access points through negotiation or configuration. In one embodiment, it can also be default to change all access points participating in this cooperation operation into candidate access points, that is, the access points included in the candidate access point set are exactly the same as the access points included in the access point set.

[0048] S120. Use the first candidate access point in the candidate access point set that successfully seizes the channel resource as the first type of access point, and send a cooperation trigger frame to other access points in the access point set through the first type of access point, so that other access points in the access point set can perform channel access.

[0049] In one embodiment, the first type of access point refers to the candidate access point that first successfully seizes the channel resources and shares the channel resources. Each candidate access point in the candidate access point set participates in the cooperative operation and channel resource competition. However, the candidate access point that first successfully seizes the channel resources serves as the first type of access point and sends a cooperative trigger frame to other access points in the access point set through the first type of access point, so that each access point in the access point set can perform channel access and transmit downlink data to the terminal devices within the BSS on the allocated resource unit and / or on the TXOP time slice.

[0050] In one embodiment, the second type of access point in the access point set includes at least one of the following: the access point that participates in the cooperative operation but does not participate in the channel resource competition; the access point that participates in the cooperative operation and participates in the channel resource competition but fails to successfully seize the channel resources; all access points in the candidate access point set that receive the cooperative trigger frame. In one example, the access point in the access point set that participates in this cooperative operation but does not participate in the channel resource competition serves as the second type of access point; in one example, the access point in the access point set that participates in this cooperative operation and participates in the channel resource competition but fails to successfully seize the channel resources serves as the second type of access point; the candidate access point in the candidate access point set that receives the cooperative trigger frame sent by the first type of access point becomes the second type of access point.

[0051] In one embodiment, after a cooperative operation is completed by the second type of access point and the first type of access point, the states of the first type of access point and the second type of access point are restored to the initial access points. During the multi-access point cooperation process, the initial state of each access point in the access point set is the initial access point. In one example, after the first type of access point and the second type of access point complete this cooperative operation, the states of the first type of access point and the second type of access point are restored to the initial access points.

[0052] In one embodiment, each candidate access point in the candidate access point set shares the resource demand information and its current channel state information. Each candidate access point in the candidate access point set shares its own resource demand information and its own current channel state information; the current channel state information is used to indicate whether the channel corresponding to each candidate access point itself is idle; the resource demand information is used to indicate the channel resources required by each candidate access point itself.

[0053] In one embodiment, each candidate access point in the candidate access point set records the resource demand information and its current channel state information of each candidate access point in the candidate access point set, so that when the candidate access point becomes the second type of access point, resource sharing can be performed on the candidate access point based on the resource demand information, and channel allocation can be performed on the candidate access point based on the current channel state information.

[0054] In one embodiment, the resource requirement information and the current channel state information among each candidate access point in the candidate access point set are interacted through a wired or wireless connection method.

[0055] In one embodiment, each access point participating in the cooperative operation in the access point set selects the same or different primary channels. Herein, the primary channel refers to the P20 working channel corresponding to each access point. In one example, each access point participating in the current cooperative operation in the access point set may select the same primary channel or different primary channels.

[0056] In one embodiment, each candidate access point in the candidate access point set randomly adopts different backoff windows and simultaneously initiates channel resource competition. Simultaneously initiating channel resource competition can be understood as initiating channel resource competition at the same moment.

[0057] In one embodiment, the reasons why each candidate access point in the candidate access point set does not simultaneously initiate channel resource competition include one of the following: the current channel states of the primary channels corresponding to each candidate access point are different; the internal scheduling states of each candidate access point are different. The current channel state is used to characterize whether the primary channel corresponding to each candidate access point is occupied, and the current channel state includes: busy state; idle state. In one example, when the busy states and idle states corresponding to the primary channels of each candidate access point in the candidate access point set are different, multiple candidate access points in the candidate access point set will not simultaneously initiate channel resource competition. In one example, when the internal scheduling states of each candidate access point in the candidate access point set are different, multiple candidate access points in the candidate access point set will not simultaneously initiate channel resource competition.

[0058] In one embodiment, before sending a cooperative trigger frame from a first type of access point to other access points in the access point set, a control frame is sent by the first type of access point to preempt the channel. When the backoff window countdown of a candidate access point in the candidate access point set reaches 0, this candidate access point becomes a first type of access point, and before sending the cooperative trigger frame, this candidate access point sends a control frame to preempt the channel and notifies other access points and terminal devices in the access point set that this candidate access point has successfully preempted the channel resources.

[0059] In one embodiment, the condition that the backoff window countdown of a candidate access point is 0 and no cooperative trigger frame is sent includes at least one of the following: the current channel state of other candidate access points in the candidate access point set is in a busy state; other links of the multi-link access device to which the candidate access point with a backoff window countdown of 0 belongs are in a busy state. In one example, the condition that the backoff window countdown of a candidate access point in the candidate access point set is 0 but the cooperative trigger frame is not immediately sent may include: other candidate access points in the candidate access point set are in a busy state; or, other links of the multi-link access device to which the candidate access point with a backoff window countdown of 0 belongs are in a busy state and multi-link synchronous transmission operation cannot be performed.

[0060] In one embodiment, when a candidate access point is converted into a second type of access point, the remaining time of the backoff window corresponding to the second type of access point is cleared. When a candidate access point in the candidate access point set is converted into a second type of access point, the remaining time of the backoff window corresponding to the candidate access point is cleared.

[0061] In one embodiment, when a candidate access point is converted into a second type of access point, the remaining time of the backoff window corresponding to the second type of access point is not cleared, and the remaining time of the backoff window is used for channel resource competition after this cooperative operation. When a candidate access point in the candidate access point set is converted into a second type of access point, the remaining time of the backoff window corresponding to the candidate access point is not cleared. At the same time, the remaining time of the backoff window is used for channel resource competition after this multi-access point cooperative operation.

[0062] In one embodiment, Figure 7 is a schematic diagram of the implementation of the state transition relationship in the multi-AP cooperation process provided by the embodiments of the present application. As Figure 7 shown, in the multi-AP cooperation process, the initial state of each AP in the multi-AP cooperation group is the initial AP.

[0063] Step 1: For the AP participating in this cooperative operation, its state becomes the Participator AP (abbreviated as Participator AP), that is, the corresponding access point set is formed.

[0064] Step 2: For the AP participating in channel resource competition, its state becomes the candidate AP, which can also be called the Potential sharing AP (PAP), that is, the corresponding candidate access point set is formed; and for the AP in the access point set that does not participate in channel resource competition, its state becomes the shared AP.

[0065] Step 3: The Potential sharing AP that successfully obtains the channel resource and sends the trigger frame first changes its state to sharing AP.

[0066] Step 4: The Potential sharing AP that receives the collaborative trigger frame sent by the above sharing AP changes its state to shared AP.

[0067] Step 5: When a collaborative operation is completed (or the TXOP time ends) between the Sharing AP and the Shared AP, their states both return to the initial AP.

[0068] In one embodiment, Figure 8 is a schematic diagram of the implementation where two PAPs in the embodiment of the present application compete for channel resources simultaneously. As Figure 8 shown, two candidate access points (PAP-1 and PAP-2 respectively) in the candidate access point set randomly adopt different backoff windows and count down simultaneously at time T0. When the backoff window countdown of PAP-2 reaches 0 (i.e., at time T1), PAP-2 sends a collaborative trigger frame to the multi-AP collaborative participants in the access point set including PAP-1. After a short inter-frame space (SIFS) time interval, the multi-APs transmit PPDUs on their respective allocated RU resources and within the TXOP time.

[0069] In one embodiment, Figure 9 is a schematic diagram of the implementation where two PAPs compete for channel resources non-simultaneously in the embodiment of the present application. As Figure 9 shown, two candidate access points (PAP-1 and PAP-2 respectively) in the candidate access point set select different P20 channels. PAP-1 detects that the channel is busy at time T0 and performs backoff waiting; PAP-2 randomly selects a backoff window and counts down at time T0. At time T1, PAP-1 detects that the channel is idle (including the IFS waiting interval), and PAP-1 randomly selects a backoff window and counts down. At the same time, PAP-2 detects that the channel is busy during the countdown process and has to pause the countdown and wait for the channel to be idle. At time T2, the countdown resumes. At time T3, the countdown of PAP-1 reaches 0 and the channel is idle, and PAP-1 sends a collaborative trigger frame to the multi-AP collaborative participants in the access point set including PAP-2. After the SIFS time interval, the multi-APs transmit PPDUs on their respective allocated RU resources and within the TXOP time.

[0070] In one embodiment, Figure 10This is a schematic diagram showing the implementation of a PAP using an un-cleared backoff window to preempt channel resources and transmit a PPDU. As shown in Figure 10 the figure, two candidate access points (PAP-1 and PAP-2 respectively) in the candidate access point set randomly select different backoff windows and start counting down at time T0. When the backoff window countdown of PAP-2 reaches 0 (i.e., at time T1), PAP-2 becomes the owner of the transmission opportunity (TXOP owner). PAP-2 sends a cooperative trigger frame to multi-AP cooperative participants including PAP-1. After a SIFS time interval, the multi-APs transmit PPDUs on their respective allocated RU resources and within the TXOP time.

[0071] After PAP-2, as the TXOP owner, finishes transmitting, after a DIFS or IFS time interval, if there is still uplink or downlink data on PAP-1, PAP-1 continues to back off based on the previous backoff window. When the backoff window countdown reaches 0 (i.e., at time T2), PAP-1 becomes the owner of the transmission opportunity and can schedule uplink or downlink data transmission.

[0072] In one embodiment, Figure 11 This is a schematic diagram showing the implementation of a PAP delaying to wait and send a TF. As shown in Figure 11 the figure, two candidate access points (PAP-1 and PAP-2 respectively) in the candidate access point set operate on different P20 channels. PAP-2 randomly selects a backoff window and starts counting down at time T0. Since PAP-1 detects an on-going PPDU and the channel is busy, it needs to wait for the channel to be idle. When the backoff window countdown of PAP-2 reaches 0 (i.e., at time T1), the main channel where PAP-1 is located is still busy, and PAP-2 delays waiting. At time T2, the channel of PAP-1 becomes idle, PAP-2 sends a cooperative trigger frame, and allocates channel resources for PAP-1.

[0073] In one embodiment, Figure 12 This is a structural block diagram of a channel access device provided by an embodiment of the present application. This embodiment is applied to an access point. As shown in Figure 12 the figure, the channel access device in this embodiment includes: a generation module 210 and a channel access module 220.

[0074] The generation module 210 is configured to form a corresponding candidate access point set for each access point participating in cooperative operations and channel resource competition in the pre-configured access point set.

[0075] The channel access module 220 is configured to use the first candidate access point that successfully preempts the channel resource in the set of candidate access points as the first type of access point, and send a cooperative trigger frame to other access points in the access point set through the first type of access point, so that other access points in the access point set perform channel access.

[0076] In one embodiment, the second type of access points in the access point set includes at least one of the following: access points that participate in cooperative operations and do not participate in channel resource competition; access points that participate in cooperative operations and participate in channel resource competition but do not successfully preempt the channel resource; all access points in the set of candidate access points that receive the cooperative trigger frame.

[0077] In one embodiment, after one cooperative operation is completed by the second type of access point and the first type of access point, the states of the first type of access point and the second type of access point are restored to the initial access points.

[0078] In one embodiment, resource requirement information and its current channel state information are shared among each candidate access point in the set of candidate access points.

[0079] In one embodiment, each candidate access point in the set of candidate access points records the resource requirement information of each candidate access point in the set of candidate access points and its current channel state information.

[0080] In one embodiment, the resource requirement information and the current channel state information among each candidate access point in the set of candidate access points are interacted through wired or wireless connection means.

[0081] In one embodiment, each access point participating in cooperative operations in the access point set selects the same or different primary channels.

[0082] In one embodiment, each candidate access point in the set of candidate access points randomly adopts different backoff windows and initiates channel resource competition simultaneously.

[0083] In one embodiment, the reasons why each candidate access point in the set of candidate access points does not initiate channel resource competition simultaneously include one of the following: the current channel states of the primary channels corresponding to each candidate access point are different; the internal scheduling states of each candidate access point are different.

[0084] In one embodiment, before sending a cooperative trigger frame to other access points in the access point set through the first type of access point, a control frame is sent through the first type of access point for channel preemption.

[0085] In one embodiment, the conditions that the backoff window countdown of a candidate access point is 0 and no cooperative trigger frame is sent include at least one of the following: the current channel state of other candidate access points in the candidate access point set is a busy state; other links of the multi-link access device to which the candidate access point with a backoff window countdown of 0 belongs are in a busy state.

[0086] In one embodiment, when a candidate access point is converted into a second type of access point, the remaining time of the backoff window corresponding to the second type of access point is cleared.

[0087] In one embodiment, when a candidate access point is converted into a second type of access point, the remaining time of the backoff window corresponding to the second type of access point is not cleared, and the remaining time of the backoff window is used for channel resource contention after this cooperative operation.

[0088] The channel access device provided in this embodiment is configured to implement Figure 6 the channel access method of the illustrated embodiment. The implementation principle and technical effects of the channel access device provided in this embodiment are similar and will not be elaborated here.

[0089] In one embodiment, Figure 13 is a schematic structural diagram of a communication device provided in an embodiment of the present application. As Figure 13 shown, the device provided in the present application includes: a processor 310, a memory 320, and a communication module 330. The number of processors 310 in this device can be one or more, Figure 13 and one processor 310 is taken as an example here. The number of memories 320 in this device can be one or more, Figure 13 and one memory 320 is taken as an example here. The processor 310, the memory 320, and the communication module 330 of this device can be connected through a bus or other means, Figure 13 and taking connection through a bus as an example here. In this embodiment, this device can be an access point.

[0090] The memory 320, being a computer-readable storage medium, can be configured to store software programs, computer-executable programs, and modules, such as the program instructions / modules corresponding to the devices in any embodiment of the present application (e.g., the generation module 210 and the channel access module 220 in the channel access device). The memory 320 can include a program storage area and a data storage area. Among them, the program storage area can store an operating system and application programs required for at least one function; the data storage area can store data created according to the use of the device, etc. In addition, the memory 320 can include high-speed random access memory and can also include non-volatile memory, such as at least one magnetic disk storage device, a flash memory device, or other non-volatile solid-state storage devices. In some instances, the memory 320 can further include a memory remotely set relative to the processor 310, and these remote memories can be connected to the device through a network. Examples of the above networks include but are not limited to the Internet, an enterprise intranet, a local area network, a mobile communication network, and combinations thereof.

[0091] The communication device provided above can be configured to execute the channel access method provided in any of the above embodiments and has corresponding functions and effects.

[0092] The embodiments of the present application also provide a storage medium containing computer-executable instructions. The computer-executable instructions are used to execute a channel access method when executed by a computer processor. The method includes: forming a corresponding candidate access point set for each access point participating in cooperative operation and channel resource competition in a pre-configured access point set; using the first candidate access point that successfully preempts the channel resource in the candidate access point set as a first type of access point, and sending a cooperative trigger frame to other access points in the access point set through the first type of access point, so that other access points in the access point set perform channel access.

[0093] Those skilled in the art should understand that the term user equipment covers any suitable type of wireless user equipment, such as a mobile phone, a portable data processing device, a portable network browser, or an in-vehicle mobile station.

[0094] Generally speaking, various embodiments of the present application can be implemented in hardware or a dedicated circuit, software, logic, or any combination thereof. For example, some aspects can be implemented in hardware, while other aspects can be implemented in firmware or software that can be executed by a controller, a microprocessor, or other computing devices, although the present application is not limited thereto.

[0095] Embodiments of the present application can be implemented by a data processor of a mobile device executing computer program instructions, for example, in a processor entity, or by hardware, or by a combination of software and hardware. The computer program instructions can be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-related instructions, microcode, firmware instructions, status setting data, or source code or object code written in any combination of one or more programming languages.

[0096] Any block diagram of a logical process in the drawings of the present application can represent program steps, or can represent interconnected logical circuits, modules, and functions, or can represent a combination of program steps and logical circuits, modules, and functions. The computer program can be stored in a memory. The memory can be of any type suitable for the local technical environment and can be implemented using any suitable data storage technology, such as, but not limited to, read-only memory (ROM), random access memory (RAM), optical memory devices and systems (digital video disc (DVD) or compact disk (CD)), etc. The computer-readable medium can include a non-transitory storage medium. The data processor can be of any type suitable for the local technical environment, such as, but not limited to, a general-purpose computer, a special-purpose computer, a microprocessor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FGPA), and a processor based on a multi-core processor architecture.

[0097] The above are only the preferred embodiments of the present application and are not intended to limit the present application. For those skilled in the art, the present application can have various changes and modifications. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included within the protection scope of the present application.

Claims

1. A channel access method, characterized in that, Including: Forming a corresponding set of candidate access points for each access point in a pre-configured set of access points that participate in cooperative operations and channel resource competition; Taking the candidate access point that first successfully seizes channel resources in the set of candidate access points as a first type of access point, and sending a cooperative trigger frame to other access points in the set of access points through the first type of access point, so that other access points in the set of access points perform channel access.

2. The method according to claim 1, wherein The second type of access points in the set of access points includes at least one of the following: access points that participate in cooperative operations but do not participate in channel resource competition; candidate access points that participate in cooperative operations and channel resource competition but do not successfully seize channel resources; all access points in the set of candidate access points that receive the cooperative trigger frame.

3. The method according to claim 2, wherein After a cooperative operation is completed by the second type of access point and the first type of access point, the states of the first type of access point and the second type of access point return to the initial access points.

4. The method according to any one of claims 1 to 3, characterized in that, Each candidate access point in the set of candidate access points shares resource demand information and its current channel state information.

5. The method according to any one of claims 1 to 3, characterized in that Each candidate access point in the set of candidate access points records the resource demand information and its current channel state information of each candidate access point in the set of candidate access points.

6. The method according to any one of claims 1 to 3, characterized in that, The resource demand information and the current channel state information among each candidate access point in the set of candidate access points are interacted through wired or wireless connection means.

7. The method according to any one of claims 1 to 3, characterized in that Each access point in the set of access points that participates in cooperative operations selects the same or different primary channels.

8. The method according to any one of claims 1 to 3, characterized in that Each candidate access point in the set of candidate access points randomly adopts different backoff windows and simultaneously initiates channel resource competition.

9. The method according to any one of claims 1 to 3, characterized in that The reasons why each candidate access point in the set of candidate access points does not initiate channel resource competition simultaneously include one of the following: the current channel states of the primary channels corresponding to each candidate access point are different; the internal scheduling states of each candidate access point are different.

10. The method according to any one of claims 1 to 3, characterized in that, Before sending a cooperative trigger frame to other access points in the set of access points through the first type of access point, a control frame is sent through the first type of access point for channel preemption.

11. The method according to any one of claims 1-3, characterized in that, The conditions for the backoff window countdown of the candidate access point to be 0 and no cooperative trigger frame being sent include at least one of the following: the current channel state of other candidate access points in the set of candidate access points is a busy state; other links of the multi-link access device to which the candidate access point with a backoff window countdown of 0 belongs are in a busy state.

12. The method according to any one of claims 1-3, characterized in that In the case where the candidate access point is converted into a second type of access point, the remaining time of the backoff window corresponding to the second type of access point is cleared.

13. The method according to any one of claims 1 to 3, characterized in that In the case where the candidate access point is converted into a second type of access point, the remaining time of the backoff window corresponding to the second type of access point is not cleared, and the remaining time of the backoff window is used for channel resource competition after this cooperative operation.

14. A communication device, characterized in that, Including: A memory, and one or more processors; The memory is configured to store one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1-13 above.

15. A storage medium, characterized in that, The storage medium stores a computer program, and when the computer program is executed by a processor, the method according to any one of claims 1-13 above is implemented.

Images