Channel access method and apparatus

Abstract

A channel access method and apparatus. The channel access method comprises: acquiring node types of multiple nodes, wherein the multiple nodes include a first node; and on the basis of the node types of the multiple nodes, determining that the first node performs channel access by using a channel access mode matching the node type of the first node. The embodiments of the present application are applicable to multiple network environment scenarios, allowing a first node to access a channel more quickly and efficiently by using a suitable channel access mode. The delay of channel access is reduced, and the efficiency of channel access is improved.

Description

Channel access method and device

[0001] This application claims priority to the Chinese patent application filed with the State Intellectual Property Office on January 8, 2024, with application number "202410036596.4" and application name "Channel Access Method and Device", the entire contents of which are incorporated by reference into this application. Technical Field

[0002] The embodiments of the present application relate to the field of communications, and in particular to a channel access method and apparatus. Background Art

[0003] In wireless fidelity (WiFi) networks, the media access control (MAC) layer plays a crucial role in coordinating access between multiple devices on a shared wireless channel, ensuring efficient data transmission. Different channel access mechanisms determine when nodes can send data. However, for some nodes in a network environment, current channel access mechanisms introduce latency, resulting in low channel access efficiency. Summary of the Invention

[0004] Embodiments of the present application provide a channel access method and apparatus. An AP node can determine, based on the node types of each node in a network environment, that a node should access a channel using a channel access method that matches that node's type. This method, applicable to various network environments, enables faster and more efficient channel access, reduces channel access latency, and improves channel access efficiency.

[0005] To achieve the above objectives, the present invention adopts the following technical solutions:

[0006] In a first aspect, a channel access method is provided, comprising: obtaining node types of multiple nodes, wherein the multiple nodes include a first node; and determining, based on the node types of the multiple nodes, that the first node uses a channel access method that matches the node type of the first node for channel access.

[0007] The embodiments of the present application are applicable to various network environments, so that the first node can access the channel more quickly and efficiently by adopting an appropriate channel access method, thereby reducing the channel access delay and improving the channel access efficiency.

[0008] In one possible design, multiple nodes include access point (AP) nodes and station (STA) nodes, wherein the STA nodes are nodes that access the AP nodes for communication, and the STA nodes include STA nodes that support a first channel access mechanism and / or STA nodes that do not support the first channel access mechanism. The AP nodes support the first channel access mechanism, and the first channel access mechanism uses a random frequency band method for channel access.

[0009] The embodiments of the present application provide multiple possible node types. This allows different types of nodes to adopt appropriate channel access methods in different network scenarios, enabling faster and more efficient channel access, reducing channel access latency, and improving channel access efficiency.

[0010] In one possible design, the multiple nodes include an AP node and at least one STA node, wherein the at least one STA node is a STA node that supports a first channel access mechanism, and the one AP node is associated with the at least one STA node. The channel access is performed using a channel access method that matches the node type of the first node, including: the first node is an AP node, waiting for a first time duration and performing channel access; or the first node is any one of the at least one STA node, waiting for a second time duration and performing channel access using the first channel access mechanism, wherein the first time duration is less than the second time duration.

[0011] The embodiments of the present application are applicable to scenarios where there is one AP node and at least one STA node, and each STA node supports the first channel access mechanism. The corresponding node can directly access the channel by waiting for a certain period of time. This can reduce channel access latency and improve channel access efficiency. Furthermore, by giving AP nodes priority over STA nodes in channel access, this facilitates the AP node's decision-making regarding channel occupancy, thereby improving channel utilization efficiency.

[0012] In one possible design, the first node is the AP node. The waiting for the first duration and performing channel access includes: waiting for the first duration and determining, based on a service requirement of the AP node and a service requirement of a STA node associated with the AP node, that the AP node accesses a channel, or reserving a channel for the at least one STA node.

[0013] In the embodiment of the present application, the AP node can determine whether to access a channel or reserve a channel for other STA nodes based on the service requirements of each node in the network environment, so as to more flexibly allocate channels to appropriate nodes and improve the efficiency of node access to the channel.

[0014] In one possible design, the multiple nodes include an AP node and at least one STA node, wherein the at least one STA node includes at least a STA node that does not support a first channel access mechanism, and wherein the STA node that supports the first channel access mechanism is associated with the one AP node; or, the multiple nodes include multiple AP nodes and at least one STA node, wherein the STA node that supports the first channel access mechanism is associated with one of the multiple AP nodes. The adopting a channel access method that matches the node type of the first node to perform channel access includes: the first node is an AP node or the STA node that does not support the first channel access mechanism, and a distributed coordination function (DCF) mechanism is adopted to perform channel access; the first node is a STA node that supports the first channel access mechanism, and channel access is performed based on uplink scheduling of the AP node associated with the first node.

[0015] In an embodiment of the present application, in a scenario where there is one AP node and at least one STA node, and at least one STA node does not support the first channel access mechanism, or in a scenario where there are multiple AP nodes and at least one STA node, appropriate channel access methods can be used for different types of nodes to access the channel. This can reduce the latency of node access to the channel and improve the efficiency of channel access. In an embodiment of the present application, only AP nodes and STA nodes that do not support the first channel access mechanism compete for the channel, thereby reducing the number of nodes competing for the channel, thereby reducing frame collisions between different nodes, and improving the efficiency of each node accessing the channel.

[0016] In one possible design, the multiple nodes include multiple AP nodes and at least one STA node, wherein the at least one STA node is a STA node that supports a first channel access mechanism, and the STA node that supports the first channel access mechanism is associated with one of the multiple AP nodes. The channel access is performed using a channel access method that matches the node type of the first node, including: the first node is an AP node, and a second channel access mechanism is used for channel access, wherein the second channel access mechanism negotiates channel access using a wired connection between the multiple AP nodes; the first node is a STA node that supports the first channel access mechanism, and channel access is performed based on uplink scheduling of the AP node associated with the first node.

[0017] In scenarios with multiple AP nodes and at least one STA node, the present embodiment can employ appropriate channel access methods for different node types. This reduces the latency of node access and improves channel access efficiency. By determining the order of channel access through negotiation between AP nodes, the present embodiment avoids the waiting time associated with the DCF mechanism, reduces the latency of node access, and improves the efficiency of each node's channel access.

[0018] In one possible design, the first node is the AP node. The channel access includes: determining that the AP node performs channel access, or performing uplink scheduling on the STA node associated with the AP node, based on the service requirements of the AP node and the service requirements of the STA node associated with the AP node.

[0019] In the embodiment of the present application, the AP node can determine whether to access the channel or perform uplink scheduling for other STA nodes based on the business needs of each node in the network environment, and can more flexibly allocate channels to appropriate nodes, thereby improving the efficiency of node access to the channel.

[0020] In one possible design, the first node uses a DCF mechanism to access the channel, and the interframe interval duration that the first node waits for is a third duration. The third duration that the AP node waits for is less than the third duration that the STA node that does not support the first channel access mechanism waits for; or, the first value of the contention window length corresponding to the AP node is less than the first value of the contention window length corresponding to the STA node that does not support the first channel access mechanism; or, the transmission opportunity (TXOP) upper limit value after the AP node accesses the channel is greater than the TXOP upper limit value after the STA node that does not support the first channel access mechanism accesses the channel.

[0021] The embodiments of the present application provide multiple ways to enable the AP to access the channel with higher priority, thereby balancing the probability of each node accessing the channel.

[0022] In one possible design, the first value of the contention window length is at least one of the following values: a maximum value of the contention window length; a minimum value of the contention window length.

[0023] The embodiments of the present application provide multiple possible situations of the first value of the contention window length, thereby being applicable to balancing the probability of each node accessing the channel in various scenarios.

[0024] In one possible design, the AP node uses the DCF mechanism to compete for a channel, and when a first condition is met, the length of the contention window corresponding to the AP node is increased. The first condition includes at least one of the following: a frame collision occurs between the AP node and another node; the AP node has no pending traffic, and a STA node associated with the AP node has no pending traffic.

[0025] The embodiment of the present application can increase the contention window length when the AP accesses the channel when the first condition is met, thereby avoiding excessive and ineffective channel occupation by the AP node and improving channel access efficiency.

[0026] In one possible design, the method further includes: using the first channel access mechanism to query the service needs of the STA node associated with the AP node; and / or using a buffer status report query (BSRP) mechanism to query the service needs of the STA node associated with the AP node.

[0027] The embodiments of the present application provide multiple service query methods so that an AP node can obtain the service requirements of its associated STA nodes, thereby improving the rationality and accuracy of the AP's decision-making on which channel to use for downlink services or uplink scheduling.

[0028] In one possible design, the channel access is performed using a channel access method that matches the node type of the first node, including: the first node continuously monitors the channel to be accessed to be an idle channel within a fourth time period, and the first node accesses the idle channel at the end of the fourth time period, wherein the first node has service arriving at the starting time of the fourth time period.

[0029] The embodiment of the present application can continuously monitor the channel to see if it is an idle channel within a certain period of time after a service arrives, so that the first node can directly access the channel, thereby reducing the delay of the node accessing the channel and improving the efficiency of the node accessing the channel.

[0030] In one possible design, the channel access is performed using a channel access method that matches the node type of the first node, including: the first node continuously monitors the channel to be accessed to be an idle channel within a fourth time period, and the first node accesses the idle channel at the end of the fourth time period, wherein the first node has service arriving at the end of the fourth time period.

[0031] The embodiment of the present application can continuously monitor the channel for idleness within a certain period of time before a service arrives. Then, the first node can directly access the channel when a service arrives, thereby reducing the delay of the node accessing the channel and improving the efficiency of the node accessing the channel.

[0032] In a second aspect, a channel access device is provided, including: an acquisition unit for acquiring node types of multiple nodes, wherein the multiple nodes include a first node; a processing unit for determining, based on the node types of the multiple nodes, that the first node adopts a channel access method that matches the node type of the first node for channel access.

[0033] The embodiments of the present application are applicable to various network environments, so that the first node can access the channel more quickly and efficiently by adopting an appropriate channel access method, thereby reducing the channel access delay and improving the channel access efficiency.

[0034] In one possible design, the multiple nodes include an access device AP node and a site STA node, wherein the STA node is a node that accesses the AP node for communication, and the STA node includes a STA node that supports a first channel access mechanism and / or a STA node that does not support the first channel access mechanism. The AP node supports the first channel access mechanism, and the first channel access mechanism uses a random frequency band method for channel access.

[0035] In one possible design, the multiple nodes include an AP node and at least one STA node, wherein the at least one STA node is a STA node that supports a first channel access mechanism, and the one AP node is associated with the at least one STA node; the processing unit is also used to: the first node is an AP node, waits for a first time length and performs channel access; or, the first node is any one STA node among the at least one STA node, waits for a second time length and uses the first channel access mechanism to perform channel access, wherein the first time length is less than the second time length.

[0036] In one possible design, the first node is the AP node. The processing unit is further configured to: wait for the first duration and determine, based on a service requirement of the AP node and a service requirement of a STA node associated with the AP node, an access channel for the AP node, or reserve a channel for the at least one STA node.

[0037] In one possible design, the multiple nodes include an AP node and at least one STA node, wherein the at least one STA node includes at least a STA node that does not support the first channel access mechanism, wherein the STA node that supports the first channel access mechanism is associated with the one AP node; or, the multiple nodes include multiple AP nodes and at least one STA node, wherein the STA node that supports the first channel access mechanism is associated with one AP node among the multiple AP nodes; the processing unit is also used for: the first node is an AP node or the STA node that does not support the first channel access mechanism, and a distributed coordination function DCF mechanism is used for channel access; the first node is a STA node that supports the first channel access mechanism, and channel access is performed based on the uplink scheduling of the AP node associated with the first node.

[0038] In one possible design, the multiple nodes include multiple AP nodes and at least one STA node, wherein the at least one STA node is a STA node that supports a first channel access mechanism, and the STA node that supports the first channel access mechanism is associated with one of the multiple AP nodes; the processing unit is also used for: the first node is an AP node, and a second channel access mechanism is used for channel access, wherein the second channel access mechanism uses a wired connection between the multiple AP nodes to negotiate channel access; the first node is a STA node that supports the first channel access mechanism, and channel access is performed based on the uplink scheduling of the AP node associated with the first node.

[0039] In one possible design, the first node is the AP node; the processing unit is also used to: determine the AP node for channel access, or perform uplink scheduling on the STA node associated with the AP node based on the business requirements of the AP node and the business requirements of the STA node associated with the AP node.

[0040] In one possible design, the first node uses the DCF mechanism to access the channel, and the interframe interval duration that the first node waits for is a third duration. The third duration that the AP node waits for is less than the third duration that the STA node that does not support the first channel access mechanism waits for; or, the first value of the contention window length corresponding to the AP node is less than the first value of the contention window length corresponding to the STA node that does not support the first channel access mechanism; or, the transmission opportunity TXOP upper limit value after the AP node accesses the channel is greater than the TXOP upper limit value after the STA node that does not support the first channel access mechanism accesses the channel.

[0041] In one possible design, the first value of the contention window length is at least one of the following values: a maximum value of the contention window length; a minimum value of the contention window length.

[0042] In one possible design, the AP node uses the DCF mechanism to compete for the channel, and the contention window length corresponding to the AP node is increased when a first condition is met; wherein the first condition includes at least one of the following: a frame collision occurs between the AP node and other nodes; the AP node has no business to be sent, and the STA node associated with the AP node has no business to be sent.

[0043] In one possible design, the processing unit is further used to: use the first channel access mechanism to query the service needs of the STA node associated with the AP node; and / or use the cache status report query BSRP mechanism to query the service needs of the STA node associated with the AP node.

[0044] In one possible design, the processing unit is also used for: the first node continuously monitors the channel to be accessed to be an idle channel within a fourth time period, and the first node accesses the idle channel at the end time of the fourth time period, wherein the first node has service arriving at the starting time of the fourth time period.

[0045] In one possible design, the processing unit is also used for: the first node continuously monitors the channel to be accessed to be an idle channel within a fourth time period, and the first node accesses the idle channel at the end of the fourth time period, wherein the first node has service arriving at the end of the fourth time period.

[0046] In a third aspect, a channel access device is provided, comprising: at least one processor and a communication interface, wherein the communication interface is used to receive and / or send signals, and the processor is configured to enable the communication method of any of the above aspects to be executed.

[0047] In a fourth aspect, a channel access device is provided, comprising: a processor and a memory; the memory is configured to store computer instructions, and when the processor executes the instructions, the channel access device executes the communication method according to any of the above aspects.

[0048] In the fifth aspect, a chip system is provided, which includes a processor and an input / output port, the processor is used to implement the processing functions involved in the communication method of any aspect of the above aspects, and the input / output port is used to implement the transceiver functions involved in the communication method of any aspect of the above aspects.

[0049] In one possible design, the chip system also includes a memory, which is used to store program instructions and data for implementing the functions involved in the communication method of any of the above aspects.

[0050] The chip system may be composed of chips, or may include chips and other discrete devices.

[0051] In a sixth aspect, a communication system is provided, which includes a plurality of nodes that execute any method of any of the above aspects.

[0052] In a seventh aspect, a computer-readable storage medium is provided. The computer-readable storage medium stores computer instructions, which, when executed on a computer, cause the computer to execute any communication method designed in any of the above aspects.

[0053] In an eighth aspect, a computer program product is provided, which includes a computer program or instructions, and when the computer program or instructions are run on a computer, causes the computer to execute any communication method designed in any of the above aspects. BRIEF DESCRIPTION OF THE DRAWINGS

[0054] FIG1 is an exemplary diagram of the architecture of a communication system provided in an embodiment of the present application;

[0055] FIG2 is a schematic diagram of a communication scenario provided in an embodiment of the present application;

[0056] FIG3 is a flow chart of a channel access method provided in an embodiment of the present application;

[0057] FIG4 is a schematic diagram of a channel access scenario provided in an embodiment of the present application;

[0058] FIG5 is a schematic diagram of a channel access timing provided by an embodiment of the present application;

[0059] FIG6 is a schematic diagram of another channel access scenario provided in an embodiment of the present application;

[0060] FIG7 is a schematic diagram of another channel access scenario provided in an embodiment of the present application;

[0061] FIG8 is a schematic diagram of a channel access device provided in an embodiment of the present application;

[0062] FIG9 is a schematic diagram of another channel access device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0063] The network architecture and business scenarios described in the embodiments of the present application are intended to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided in the embodiments of the present application. Ordinary technicians in this field will know that with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of the present application are also applicable to similar technical problems.

[0064] The network architecture and business scenarios described in the embodiments of the present application are intended to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided in the embodiments of the present application. Ordinary technicians in this field will know that with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of the present application are also applicable to similar technical problems.

[0065] The terms "first" and "second" in the description and drawings of the embodiments of the present application are used to distinguish different objects, or to distinguish different treatments of the same object. Words such as "first" and "second" can distinguish between identical or similar items with substantially the same functions and effects. For example, the first device and the second device are merely used to distinguish different devices and do not limit their order. Those skilled in the art will understand that words such as "first" and "second" do not limit the quantity and execution order, and words such as "first" and "second" do not necessarily limit differences.

[0066] "At least one" means one or more, and "a plurality" means two or more.

[0067] In the description of the embodiments of the present application, unless otherwise specified, " / " indicates that the objects associated before and after are in an "or" relationship, for example, A / B can represent A or B; "and / or" in the embodiments of the present application is merely a description of the association relationship of associated objects, indicating that three relationships may exist, for example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural.

[0068] In the description of the embodiments of this application, unless otherwise specified, "multiple" means two or more than two. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c can mean: a, b, c, ab, ac, bc, or abc, where a, b, and c can be single or plural.

[0069] In addition, to facilitate the clear description of the technical solutions of the embodiments of the present application, in the embodiments of the present application, the words "first" and "second" are used to distinguish between identical or similar items with substantially the same functions and effects. Those skilled in the art will understand that the words "first" and "second" do not limit the quantity or execution order, and the words "first" and "second" do not necessarily mean different.

[0070] In the embodiments of this application, words such as "exemplary" or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described as "exemplary" or "for example" in the embodiments of this application should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner to facilitate understanding.

[0071] It will be understood that the “embodiment” mentioned throughout the specification means that the specific features, structures or characteristics related to the embodiment are included in at least one embodiment of the embodiment of the present application. Therefore, the various embodiments in the entire specification do not necessarily refer to the same embodiment. In addition, these specific features, structures or characteristics can be combined in one or more embodiments in any suitable manner. It will be understood that in the various embodiments of the embodiment of the present application, the size of the sequence number of each process does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiment of the present application.

[0072] It can be understood that in the embodiments of the present application, "when" and "if" both mean that corresponding processing will be performed under certain objective circumstances, and do not limit the time, nor do they require any judgment action when implementing, nor do they mean that there are other limitations.

[0073] It is understood that some optional features in the embodiments of the present application may, in certain scenarios, be implemented independently of other features, such as the solution on which they are currently based, to solve corresponding technical problems and achieve corresponding effects. In certain scenarios, they may also be combined with other features as needed. Accordingly, the devices provided in the embodiments of the present application may also implement these features or functions accordingly, which will not be described in detail here.

[0074] In the embodiments of the present application, unless otherwise specified, the same or similar parts between the various embodiments can refer to each other. In the various embodiments of the present application, and the various implementation methods / implementation methods / implementation methods in the various embodiments, if there is no special explanation and logical conflict, the terms and / or descriptions between different embodiments and the various implementation methods / implementation methods / implementation methods in the various embodiments are consistent and can be referenced to each other. The technical features in different embodiments and the various implementation methods / implementation methods / implementation methods in the various embodiments can be combined to form new embodiments, implementation methods, implementation methods, or implementation methods according to their inherent logical relationships. The implementation methods of the embodiments of the present application described below do not constitute a limitation on the scope of protection of the embodiments of the present application.

[0075] FIG1 is an example diagram of the architecture of a communication system provided in an embodiment of the present application.

[0076] As shown in FIG. 1 , the communication system involved in the embodiment of the present application may include at least one terminal 110 and a network device 120 .

[0077] Terminal 110 and network device 120 communicate wirelessly. Network device 120 may be a wireless access network device. Terminals and wireless access network devices may be connected to each other via wired or wireless means. Figure 1 is merely a schematic diagram. The communication system may also include other network devices, such as wireless relay devices, wireless backhaul devices, and core network devices, which are not shown in Figure 1. The connection relationships between devices are not limited to the methods listed above.

[0078] A radio access network device can be a base station, an evolved NodeB (eNodeB), a transmission reception point (TRP), a next-generation NodeB (gNB) in a 5G mobile communication system, a next-generation base station in a 6th-generation (6G) mobile communication system, a base station in a future mobile communication system, or an access node in a WiFi system. It can also be a module or unit that performs some of the functions of a base station, such as a centralized unit (CU) or a distributed unit (DU). The CU performs the functions of the base station's radio resource control protocol and packet data convergence protocol (PDCP), as well as the service data adaptation protocol (SDAP). The DU performs the functions of the base station's radio link control layer and medium access control (MAC) layer, as well as some or all of the physical layer. For detailed descriptions of each of these protocol layers, please refer to the relevant technical specifications of the 3rd Generation Partnership Project (3GPP). The wireless access network device may be a macro base station, a micro base station or an indoor station, a relay node or a donor node, etc. In some other embodiments, the wireless access network device may also be an access network device in an open RAN (open RAN, O-RAN). In O-RAN, the CU may be referred to as an open CU (open CU, O-CU), the DU may be referred to as an open DU (open DU, O-DU), and the RU may be referred to as an open RU (open RU, O-RU). The embodiments of the present application do not limit the specific technology and specific device form adopted by the wireless access network device. The wireless access network device is sometimes also referred to as a network device. For ease of description, the following description takes a base station as an example of a wireless access network device.

[0079] A terminal may also be referred to as a terminal device, user equipment (UE), mobile station, mobile terminal, etc. Terminal devices can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (IOT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grid, smart furniture, smart office, smart wearable, smart transportation, smart city, etc. Terminal devices can be mobile phones, tablet computers, computers with wireless transceiver functions, wearable devices, vehicles, drones, helicopters, airplanes, ships, robots, robotic arms, smart home devices, etc. The embodiments of the present application do not limit the specific technology and specific device form adopted by the terminal devices.

[0080] Base stations and terminals can be fixed or mobile. They can be deployed on land, indoors or outdoors, handheld or vehicle-mounted; on water; or in the air on aircraft, balloons, and satellites. The embodiments of this application do not limit the application scenarios of base stations and terminal devices.

[0081] Communication between base stations and terminals, between base stations, and between terminals can be carried out through authorized spectrum, unauthorized spectrum, or both; communication can be carried out through spectrum below 6 gigahertz (GHz), spectrum above 6 GHz, or spectrum below 6 GHz and spectrum above 6 GHz. The embodiments of the present application do not limit the spectrum resources used for wireless communication.

[0082] In an embodiment of the present application, the function of the base station may also be performed by a module (such as a chip) in the base station, or by a control subsystem including a base station function. The control subsystem including the base station function here may be a control center in the application scenarios of the above-mentioned terminal devices such as smart grid, industrial control, intelligent transportation, smart city, etc. The function of the repeater may also be performed by a module (such as a chip or a modem) in the repeater, or by a device including a relay function. The function of the terminal may also be performed by a module (such as a chip or a modem) in the terminal, or by a device including a terminal function.

[0083] A wireless communication system includes communication devices that can communicate wirelessly using air interface resources. These devices can include network devices and terminal devices. Network devices can also be referred to as base stations. Air interface resources can include at least one of time domain resources, frequency domain resources, code resources, and space resources.

[0084] The solutions provided in the embodiments of this application can be applied to wireless communications between communication devices. Wireless communications can include wireless communications between network devices and terminals, wireless communications between network devices, and wireless communications between terminals. In the embodiments of this application, the term "wireless communications" can also be simply referred to as "communication," which can also be described as "data transmission," "information transmission," or "transmission."

[0085] The embodiments of the present application can be used for possible communication links such as uplink (UL), downlink (DL), access link, backhaul link, sidelink (SL), etc., and the embodiments of the present application are not limited here. From the perspective of business scenarios, the embodiments of the present application are applicable to various scenarios, such as layered data coding in XR services, uplink large capacity scenarios, etc., and the embodiments of the present application are not limited here.

[0086] For WiFi networks, the channel access mechanism determines when each node transmits data and is fundamental to communication. In related technologies, the channel access mechanism primarily utilizes a distributed coordination function (DCF) mechanism for competitive channel access. This process enables multiple nodes to compete for channel access through random backoff. For example, a node can first randomly generate a random number based on the numerical range of a contention window. This random number is used for backoff counting. The numerical range of the contention window corresponding to different nodes can be different. Furthermore, the random numbers generated by each node are likely to be different. Assume that a shared channel is currently occupied by a node, which is sending a physical protocol data unit (PPDU) for session communication. Other nodes wishing to occupy the channel wait until the node's communication ends. Nodes wishing to occupy the channel can wait for a fixed period of time. This fixed period of time is called the distributed coordination function inter-frame space (DIFS). After the DIFS period, the node wishing to occupy the channel can perform a backoff count. Assume that node A wants to occupy the channel, and the random number generated by node A is N, then node A can back off N after DIFS. Each time the random number decreases by 1, it can correspond to waiting for a fixed length of time. During this period, node A can continue to monitor whether the channel is idle, and if it is idle, it will continue to back off counting; if the channel is occupied by other nodes, node A can suspend the back off counting until the channel is idle again and continue to back off counting. For node A, until the random number N falls back to 0, if the channel is still idle at this time, node A occupies and accesses the channel and sends the corresponding data frame or control frame. Of course, for how to monitor whether the channel is idle, you can refer to the relevant technology, and the embodiments of the present application will not be repeated here.

[0087] For example, assume a network environment contains nodes B, C, and D. Node B uses a fallback random number of N1, node C uses a fallback random number of N2, and node D uses a fallback random number of N3, with N3 being smaller than N1 and N2. Assume a channel is occupied by a node and its occupation ends at t1. DIFS after t1, nodes B, C, and D simultaneously perform fallback counting. Because N3 is smaller than N1 and N2, node D falls back to 0 first and secures the channel. Node D can access the channel and send data or control frames. While node D is occupying the channel, nodes B and C suspend fallback counting until D's occupation ends. After another DIFS, nodes B and C can resume fallback counting. Because N1 is smaller than N2, node B secures the channel before node C. While node B is occupying the channel, node C suspends fallback counting until B's occupation ends. Suppose that while node B is occupying the channel, node E also attempts to occupy the channel. Node E then waits for Node B to finish occupying the channel, and after DIFS, it performs backoff counting with Node C. Of course, Node E also has its corresponding random number.

[0088] The above example only briefly describes the implementation process of the DCF mechanism. For specific implementation details, please refer to relevant technologies, and the embodiments of this application will not be repeated here.

[0089] It can be seen that in the above scheme, when each node competes for channel access, it needs to wait for different degrees based on random numbers, which makes the node access channel delay longer.

[0090] Therefore, embodiments of the present application provide a channel access method in which an AP node can determine, based on the node types of each node in a network environment, that a node should access the channel using a channel access method that matches the node type of the node. This method is applicable to various network environments, enabling the first node to access the channel more quickly and efficiently, reducing channel access latency and improving channel access efficiency.

[0091] FIG2 is a schematic diagram of a communication scenario provided in an embodiment of the present application.

[0092] This scenario illustrates a possible network structure, where the network structure shown in Figure 2 includes one or more access point (AP)-type stations (STAs) and one or more non-AP STAs (none access point stations). An AP-type STA can be considered a network device, and a non-AP STA can be a terminal. In some examples, an AP-type STA can be referred to as an AP, and a non-AP STA can be referred to as a STA. For ease of description, in the various embodiments of the present application, an AP-type STA is collectively referred to as an AP or an AP node, and a non-AP STA is collectively referred to as a STA or a STA node.

[0093] For example, the STAs shown in FIG2 may include STA1, STA2, STA3, STA4, STA5, and STA6. However, it should be understood that FIG2 only illustrates one possible number of APs and STAs. In other examples, more APs and more or fewer STAs may be included, and this is not limited in the present embodiment.

[0094] In some embodiments, an AP can be an access point for terminals to access a wired or wireless network. For example, it can be deployed in a home environment, inside a building, or within a campus. In some scenarios, the coverage radius can reach tens to hundreds of meters. In some scenarios, it can also be deployed outdoors. An access point can be considered a bridge between wired and wireless networks. Its primary function is to connect wireless network clients and then connect the wireless network to the Ethernet network. For example, an AP can be a terminal or network device equipped with a wireless fidelity (WiFi) chip. A terminal can be, for example, a mobile phone, and a network device can be, for example, a router. An AP can be a device that supports the 802.11bn standard. An access point can also be a device that supports various wireless local area network (WLAN) standards within the 802.11 family, such as 802.11be, 802.11ax, 802.11n, 802.11g, 802.11b, and 802.11a. In some examples, the AP may be a high efficiency (HE) AP, a very high throughput (VHT) AP, or an extramely high throughput (EHT) AP, and may also be an AP applicable to a future generation of WiFi standards.

[0095] A STA can be a wireless communication chip, wireless sensor, or wireless communication terminal, and can also be referred to as a user or user equipment. For example, a STA can be a mobile phone that supports WiFi communication, a tablet that supports WiFi communication, a set-top box that supports WiFi communication, a smart TV that supports WiFi communication, a smart wearable device that supports WiFi communication, an in-vehicle communication device that supports WiFi communication, or a computer that supports WiFi communication. Optionally, a station can support the 802.11bn standard. A station can also support multiple WLAN standards in the 802.11 family, such as 802.11be, 802.11ax, 802.11ac, 802.11n, 802.11g, 802.11b, and 802.11a. It is understood that the STA in the embodiments of the present application can be a HE STA, a VHT STA, or an EHT STA, and can also be a STA that complies with a future generation of WiFi standards.

[0096] In some examples, the AP may be the network device shown in FIG. 1 , and the STA may be the terminal shown in FIG. 1 .

[0097] In some examples, STAs and APs can be devices used in the Internet of Vehicles, IoT nodes and sensors in the Internet of Things (IoT), smart cameras and remote controls in smart homes, smart water meters and smart electricity meters, and sensors in smart cities.

[0098] It will be appreciated that the various embodiments of the present application may be applicable to networks that deploy IEEE 802.11, or to other networks that employ any standard or protocol. For example, Bluetooth, high-performance radio local area networks (HIPERLAN), wide area networks (WAN), WLAN, personal area networks (PAN), networks that employ the 3rd Generation Partnership Project (3GPP) standard, or other known or later developed networks. HIPERLAN may be considered a wireless standard similar to the IEEE 802.11 standard. Therefore, regardless of the coverage area and wireless access protocol used, the various embodiments of the present application may be applicable to any suitable wireless network.

[0099] In some embodiments, APs and STAs, and STAs and STAs can communicate using a licensed spectrum, an unlicensed spectrum, or both. They can also communicate using a spectrum below 6 gigahertz (GHz), a spectrum above 6 GHz, or both. The present application does not limit the spectrum resources used for wireless communications.

[0100] In some embodiments, the roles of AP and STA can be interchanged. For example, in a relay scenario, a terminal with a hotspot enabled can connect another terminal to the network. In this case, the role of the terminal with a hotspot enabled is equivalent to that of an AP.

[0101] FIG3 is a flow chart of a channel access method provided in an embodiment of the present application.

[0102] As shown in FIG3 , the channel access process can be applied to, but not limited to, the communication scenarios shown in FIG1 and FIG2 . The method can be applied to the AP node or STA node mentioned above. For example, the method can be applied to a network environment with multiple nodes, where any node among the multiple nodes can be referred to as the first node. The method can be applied to an AP node. The method may include the following steps:

[0103] S101: An AP node obtains node types of multiple nodes.

[0104] In some embodiments, an AP node may obtain node types of multiple nodes. The multiple nodes may be in the same network environment and may share the same channel for data communication. The multiple nodes may include a first node. The first node is any node among the multiple nodes.

[0105] For example, there may be multiple nodes in the same network environment. The AP node can obtain the node types of other nodes in the network environment. Of course, the AP node can also obtain its own corresponding node type. For example, when an AP node establishes a connection with multiple STA nodes, the STA node can report its own node type to the AP node. Alternatively, when a STA node occupies a channel to send a data frame or a control frame to an AP node, it also carries its own node type to inform the AP node. It is understandable that, under normal circumstances, a STA node will report its own node type to the AP node associated with it. When multiple nodes include multiple AP nodes, multiple AP nodes can share the node type of one or more nodes obtained by each AP node.

[0106] It is clear that any other feasible method may be used to obtain the node types of multiple nodes, and the embodiment of the present application does not limit this.

[0107] In some embodiments, a node may be of multiple types. For example, a node may be an AP node, or a STA node. A STA node requires access to an AP node to communicate with other nodes. For example, a STA node is a terminal, and an AP node is a router. A terminal requires access to a network through a router to communicate.

[0108] In some examples, the STA nodes may include STA nodes that support the first channel access mechanism. In some examples, the STA nodes may include STA nodes that do not support the first channel access mechanism. In some examples, the STA nodes may include STA nodes that support the first channel access mechanism and STA nodes that do not support the first channel access mechanism. The first channel access mechanism uses a random frequency band method for channel access.

[0109] In some examples, the AP node involved in each embodiment of the present application may be an AP node that supports the first channel access mechanism.

[0110] The embodiments of the present application provide multiple possible node types. This allows different types of nodes to access channels more quickly and efficiently using appropriate channel access methods in various network scenarios, thereby reducing channel access latency and improving channel access efficiency.

[0111] In some embodiments, the first channel access mechanism may be referred to as a random frequency channel access (RFCA) mechanism or other names. For example, the first channel access mechanism may also be referred to as random frequency band access, random channel access, etc. The embodiments of the present application do not limit the specific name of the first channel access mechanism. In some examples, the RFCA mechanism differs from the DCF mechanism. In the DCF mechanism, nodes need to perform corresponding backoffs using random numbers. When the random number backoffs to 0, the node can access the channel. Therefore, from a time perspective, if a certain unit of time is used as the first time slice, a node may successfully seize the channel in some time slices. In some time slices, all nodes may be performing random number backoffs. In such time slices, no node can access the channel, which is clearly a waste of resources. In the RFCA mechanism, the AP node can divide the entire channel bandwidth into multiple frequency bands in the frequency domain. STAs connected to the AP can perform uplink communication with the AP using a specific frequency band. It is understandable that, assuming that STA1 and STA2 are both connected to AP1, the STAs connected to AP1 are STA1 and STA2.

[0112] For example, AP1 is connected to STA1, STA2, STA3, and STA4. The AP can divide the entire bandwidth into four frequency bands, such as Band 1, Band 2, Band 3, and Band 4. The AP can assign a frequency band to be associated with a STA. For example, if the AP assigns Band 1 to be associated with STA3, Band 1 can be considered an exclusive frequency band for STA3. Band 1 is only allowed to be used by STA3. Of course, STA3 can use only Band 1 to send uplink data to the AP, or STA3 can also be allowed to randomly use other frequency bands at the same time, which is not limited in this embodiment of the present application. For STAs that are not assigned a frequency band, such as STA1, STA2, and STA4, they can randomly select a frequency band to send control frames or data frames to the AP when they need to access the channel. For example, if STA1 randomly selects Band 2, STA2 randomly selects Band 4, and STA4 randomly selects Band 1, the AP can parse the data frames sent by different STAs based on the different frequency bands. In this case, it can be considered that STA1, STA2, and STA4 have all successfully accessed the channel. Of course, there are also some cases where some STAs randomly select the same frequency band. In this case, multiple STAs that select the same frequency band may be considered to have a frame collision, and the AP cannot parse the frames sent on this frequency band.

[0113] Therefore, it can be considered that in the RFCA mechanism, as long as the AP successfully parses the control frame or data frame sent by the STA on a certain frequency band, it can be considered that the STA has successfully accessed the channel for that time slice. Therefore, the situation where some time slices are wasted in the DCF mechanism can be avoided. Since the RFCA mechanism does not require nodes to back off based on random numbers, the delay of node access to the channel can be reduced. At the same time, the RFCA mechanism divides the frequency bands into multiple bands, making it more likely that the STA node will successfully access the channel in a certain time slice. By reusing the same time slice in different frequency bands, the probability of frame collision when individual nodes access the channel is reduced.

[0114] S102: The AP node determines, based on node types of multiple nodes, that a first node uses a channel access method that matches the node type of the first node to perform channel access.

[0115] In some embodiments, the AP node may determine a channel access mode that matches the node type of the first node based on the node types of the multiple nodes obtained in S101. The AP node may configure the first node to use the channel access mode for channel access.

[0116] For example, the multiple nodes in the same network environment include five nodes, and any one of the five nodes can be the first node. The AP node can determine a channel access mode that matches the first node based on its own node type and the node types corresponding to the other four nodes. The AP node can configure the first node to use the matching channel access mode for channel access.

[0117] The embodiments of the present application are applicable to various network environments, so that the first node can access the channel more quickly and efficiently by adopting an appropriate channel access method, thereby reducing the channel access delay and improving the channel access efficiency.

[0118] Next, the method of the embodiment of the present application will be introduced in more detail according to different network scenarios.

[0119] The embodiments of the present application can define three possible scenarios. For example, scenario one is defined as follows: multiple nodes include one AP node and at least one STA node. Among them, at least one STA node is a STA node that supports the first channel access mechanism. Another example is defined as scenario two: multiple nodes include one AP node and at least one STA node. Among them, at least one STA node includes at least one STA node that does not support the first channel access mechanism. Another example is defined as scenario three: multiple nodes include multiple AP nodes and at least one STA node.

[0120] Scenario 1:

[0121] In the channel access method provided in an embodiment of the present application, the multiple nodes may include: an AP node and at least one STA node. Among them, at least one STA node is a STA node that supports a first channel access mechanism. The AP node is associated with at least one STA node. Then, in S102, channel access is performed using a channel access method that matches the node type of the first node, which may include: the first node is an AP node, waiting for a first time duration and performing channel access; or, the first node is any one of the at least one STA nodes, waiting for a second time duration and using the first channel access mechanism to perform channel access, wherein the first time duration is less than the second time duration.

[0122] In some embodiments, the multiple nodes in the same network environment may be an AP node and at least one STA node. At least one STA node in the network environment is a STA node that supports the first channel access mechanism. And at least one STA node in the network environment is associated with an AP node. For example, Figure 4 shows a schematic diagram of a possible channel access scenario. It can be seen that the scenario includes one AP node, namely AP41; and multiple STA nodes, such as STA411, STA412, STA413, STA414, STA415, STA416, STA417 and STA418. Among them, multiple STA nodes are associated with AP41, that is, the multiple STA nodes establish connections with AP41 and communicate. Therefore, the one AP node and the at least one STA node can be considered to constitute a basic service set (BSS). Returning to Figure 4, the multiple nodes circled with dotted lines can be considered to belong to one BSS. In some examples, the scenario shown in Figure 4 can also be referred to as a single BSS scenario.

[0123] In some examples, for example, the first node is an AP node, such as AP 41. The AP node may wait for a first time period, and may access the channel after the first time period has elapsed.

[0124] In some examples, the first node is any STA node, such as any STA node among the eight STA nodes shown in FIG4 . The STA node may wait for a second duration and may access the channel after the second duration has elapsed, wherein the first duration is less than the second duration.

[0125] In some examples, refer to the channel access diagram shown in Figure 5. Assuming that the channel is occupied by a node, the node can send PPDU within this time period. Corresponding to Figure 5 is the time corresponding to the previous node occupying the channel. It can be understood that this node can be considered as the previous node relative to the first node. In the process of this node occupying the channel, in addition to sending the PPDU, it can also end the occupation of the channel after the minimum inter-frame space (SIFS) and block acknowledgement (BA). After the previous node ends the occupation signal. In the case where the first node is an AP node, after the first time period, the first node can access the channel. In the case where the first node is a STA node, after the second time period, the first node can access the channel. It can be seen that since the first time period is less than the second time period, the AP node can have priority in channel access. This means that the AP node has a higher priority than the STA node in accessing the channel.

[0126] In some cases, if a STA node attempts to access a channel after the second duration, but the AP node is already occupying the channel, the STA node cannot access the channel and will continue to wait until the AP node finishes occupying the channel. In this case, the AP node still determines whether to access the channel after the first duration. If the AP does not access the channel or the channel is idle after the second duration, the STA can access the channel.

[0127] In some examples, because at least one STA node supports the first channel access mechanism, the at least one STA node may use the first channel access mechanism to access the channel. For example, after a second duration has passed since a previous node stopped occupying the channel, the at least one STA node may use the first channel access mechanism to access the channel, such as using the RFCA mechanism to access the channel.

[0128] In some examples, the first duration may be one DIFS. In some examples, the second duration may be one DIFS plus one time slot. Of course, the above description of the first duration and the second duration is merely an example, and the embodiments of the present application do not limit the specific values ​​of the first duration and the second duration.

[0129] In some examples, more specific examples are given in conjunction with Figures 4 and 5 for description. Taking the single BSS scenario shown in Figure 4 as an example, there is an AP node and multiple STA nodes in the network environment. For example, there are 8 STA nodes. The AP node and the 8 STA nodes all support the RFCA mechanism. Due to the possibility that there may be more uplink services and / or downlink services in a certain period of time, there may be more channel contention collisions. Therefore, the AP can decide to use the RFCA mechanism for channel access. The AP node can send a session establishment request frame to each of the 8 STA nodes, and wait for each STA node to reply with an information frame to express consent, and the AP establishes a session with each STA. It can be understood that there may be some STA nodes that support the RFCA mechanism, but may not reply, or reply with an information frame expressing disagreement. In this case, the AP can use the RFCA mechanism only with the STA nodes that reply with an information frame expressing consent for channel access. However, this situation can be temporarily ignored in this embodiment.

[0130] After the previous node ends its channel occupation (i.e., stops sending packets), the AP node determines whether to access the channel after a first duration has passed. For example, after accessing the channel, the AP node may determine whether to send downlink traffic. If the AP node needs to send downlink traffic, it occupies the channel and sends the downlink traffic. If the AP node does not need to send downlink traffic, it does not perform any operation. After a second duration has passed, each STA node determines whether to access the channel.

[0131] In the embodiment of the present application, the AP node can determine whether to access a channel or reserve a channel for other STA nodes based on the service requirements of each node in the network environment, so as to more flexibly allocate channels to appropriate nodes and improve the efficiency of node access to the channel.

[0132] In some embodiments, when the first node is an AP node, the AP node waiting for a first period of time and accessing the channel may include: waiting for the first period of time and determining the AP node access channel based on the business needs of the AP node and the business needs of the STA nodes associated with the AP node, or reserving the channel for the at least one STA node.

[0133] In some examples, if the AP does not access the channel, or the channel is idle after the previous node ends occupying the channel and the second time period has passed, each STA in the multiple STAs can choose whether to access the channel. For example, the RFCA mechanism can be used to access the channel. For example, the STA node can send a control frame to the AP node based on a randomly selected frequency band. Alternatively, the STA node can send a control frame to the AP node based on a fixed frequency band. It can be understood that whether the STA node is based on a random frequency band or a fixed frequency band can be determined by the AP, that is, whether a corresponding frequency band is allocated to a certain STA node. For the specific implementation process, please refer to the description of the corresponding embodiment above, and the embodiments of the present application will not be repeated here.

[0134] In some examples, still taking Figures 4 and 5 as examples, referring to Figure 5, assuming that the end time of the previous node occupying the channel is t2, then at the moment when t2 passes the end of the first duration, AP41 can determine whether to access the channel based on its own business needs. Of course, in other examples, time t2 can also be the moment when the channel is an idle channel and the AP node has business arriving, and the embodiments of the present application are not limited here. If AP41 has business to be sent, AP41 can access the channel at the end of the first duration and send the business to be sent. If AP41 does not have business to be sent, AP41 can not perform any operation at the end of the first duration. That is, the channel is reserved for STA nodes. Referring to Figure 5, at the end of the second duration, each STA node can determine whether to access the channel based on its own business needs. For example, the RFCA mechanism is used for channel access. For example, for a STA node with business to be sent, a random frequency band can be selected to send a control frame to AP41 to inform AP41 that the STA node wishes to access the channel. For another example, AP41 may allocate a fixed frequency band to some STA nodes. In the case of services to be sent, such STA nodes can send the control frame to AP41 through the allocated fixed frequency band. In some examples, the control frame used to inform AP41 that the STA node wishes to access the channel can be called a channel access frame, a channel access request frame, etc., and the embodiment of the present application does not limit the name of the control frame. In some examples, the control frame may include a buffer status report (BSR), and the AP node may learn the service requirements of the STA node that sends the BSR based on the BSR. The AP41 node can parse the control frame sent on the corresponding frequency band and decide how to schedule the STA node. For example, a certain STA node can be scheduled individually, or multiple STA nodes can be scheduled simultaneously based on multiple frequency bands. The specific implementation process can refer to the description of the aforementioned embodiment, and the embodiment of the present application will not be repeated here.

[0135] After the STA node finishes occupying the channel, the first duration elapses again. At the end of the first duration, AP 41 can determine the service requirements of the corresponding STA node based on the BSR previously reported by the STA node. Based on the service requirements of its own node, AP 41 can decide to access the channel to send downlink services at the end of the first duration. Alternatively, AP 41 can perform no operation and reserve the channel for the STA node.

[0136] In the embodiment of the present application, the AP node can determine whether to access a channel or reserve a channel for other STA nodes based on the service requirements of each node in the network environment, so as to more flexibly allocate channels to appropriate nodes and improve the efficiency of node access to the channel.

[0137] In some examples, the random frequency bands mentioned in the above embodiments may also be expressed as random resource blocks (RUs).

[0138] In some cases, when at least one STA node uses the RFCA mechanism to access a channel, the STA node that wishes to access the channel can send information to the AP node using a random frequency band. For example, the STA node can send a BSR. The AP node then decides whether to perform single-user scheduling or multi-user scheduling based on the BSRs sent by the STA node on each frequency band.

[0139] For example, the AP node decides to perform single-user scheduling. The AP node may send information to a STA node that wishes to schedule, indicating that the STA node is allowed to send uplink data. For example, the AP node sends a clear to send (CTS) message to the STA node that wishes to schedule. The CTS message may carry information indicating the duration for which the STA node is allowed to occupy the channel. For example, the CTS message may carry transmit opportunity (TXOP) information. The TXOP indicates the duration for which transmission is allowed. The STA node will have exclusive access to the channel during this period.

[0140] For example, an AP node decides to perform multi-user scheduling. The AP node can simultaneously send trigger frames to multiple STA nodes that wish to be scheduled, thereby implementing uplink scheduling for multiple STA nodes. For example, the trigger frame can be a basic trigger frame. Of course, the basic trigger frame sent to each STA node can also carry TXOP information for that STA node, indicating how long the STA node is allowed to occupy a certain frequency band.

[0141] It can be understood that the above-mentioned process of AP scheduling STA is only an exemplary description and is not limited to the embodiments of the present application.

[0142] The embodiments of the present application are applicable to scenarios where there is one AP node and at least one STA node, and each STA node supports the first channel access mechanism. The corresponding node can directly access the channel by waiting for a certain period of time. This can reduce channel access latency and improve channel access efficiency. Furthermore, by giving AP nodes priority over STA nodes in channel access, this facilitates the AP node's decision-making regarding channel occupancy, thereby improving channel utilization efficiency.

[0143] Scenario 2 and Scenario 3:

[0144] In the channel access method provided in an embodiment of the present application, the multiple nodes may include an AP node and at least one STA node. Among them, the at least one STA node includes at least a STA node that does not support the first channel access mechanism. The STA node that supports the first channel access mechanism is associated with an AP node. Alternatively, the multiple nodes include multiple AP nodes and at least one STA node. Among them, the STA node that supports the first channel access mechanism is associated with one AP node among the multiple AP nodes. For channel access in S102 using a channel access method that matches the node type of the first node, it may also include: the first node is an AP node or a STA node that does not support the first channel access mechanism, and a distributed coordination function DCF mechanism is used for channel access. The first node is a STA node that supports the first channel access mechanism, and channel access is performed based on the uplink scheduling of the AP node associated with the first node.

[0145] Scenario 2 may be:

[0146] In some embodiments, the multiple nodes in the same network environment may be an AP node and at least one STA node. Among the at least one STA node in the network environment, at least one STA node is a STA node that does not support the first channel access mechanism. In this network environment, at least one STA node is associated with an AP node. Reference FIG6 shows a schematic diagram of a possible channel access scenario. FIG6 is similar to FIG4, except that the black STA613 in FIG6 can be represented as a STA node that does not support the first channel access mechanism. The scenario shown in FIG6 can also be considered a single BSS scenario.

[0147] Scenario 3 may be:

[0148] In some embodiments, the multiple nodes in the same network environment may be multiple AP nodes and at least one STA node. The at least one STA node in the network environment may include a STA node that does not support the first channel access mechanism, may include a STA node that supports the first channel access mechanism, and may also include a STA node that supports the first channel access mechanism and a STA node that does not support the first channel access mechanism. In this network environment, at least one STA node is associated with any one of the multiple AP nodes. Reference Figure 7 shows a schematic diagram of a possible channel access scenario. Figure 7 is similar to Figures 4 and 6, except that Figure 7 includes multiple AP nodes, each of which can correspond to a BSS. Among them, the black STA733 can be represented as a STA node that does not support the first channel access mechanism. The scenario shown in Figure 7 can be considered as a multi-BSS scenario.

[0149] It's worth noting that some STAs in Figure 7 may be within the coverage of multiple APs. However, regardless of how many APs a STA is within, it is associated with only one of them. For example, STA713, STA714, STA715, and STA716 in Figure 7 may be within the coverage of different APs simultaneously, but they are all associated only with AP71. And STA734 may be within the coverage of different APs simultaneously, but it is only associated with AP73.

[0150] 6 and 7 , STA nodes that do not support the first channel access mechanism can also be associated with an AP node. For example, STA613 is associated with AP61, and STA733 is associated with AP73.

[0151] In some embodiments, for scenarios 2 and 3, if the first node is an AP node or a STA node that does not support the first channel access mechanism, the first node may use the DCF mechanism for channel access. That is, between AP nodes and STAs that do not support the first channel access mechanism, the DCF mechanism may be used for channel access when the previous node ends its channel occupation. If backoff is performed using a random number generated by each node, the node that first returns the random number to 0 will have priority in channel access.

[0152] Of course, the specific process of using the DCF mechanism for channel access can refer to the corresponding description in the aforementioned embodiment, and the embodiments of the present application will not be repeated here.

[0153] In some examples, after accessing the channel, the AP can query the business needs of other STAs associated with it, and then decide whether the AP should access the channel. For example, when the previous node ends occupying the channel, or when business arrives at the AP node and the channel is idle, the AP node can use the DCF mechanism to compete for the channel. In the case that the AP node uses the DCF mechanism to compete for the channel, the AP node can use the first channel access mechanism to query the business needs of the STA nodes associated with the AP node. For example, the AP node queries the business needs of each STA node associated with the AP node through the RFCA mechanism. In some examples, the AP can divide the channel into a fixed number of frequency bands, and for the STA with business needs, it can randomly select a frequency band to report the business cache status to the AP node.

[0154] For another example, an AP node can use the buffer status report poll (BSRP) mechanism to query the service needs of STA nodes associated with the AP node. For example, the AP node can send a control frame for querying service needs, such as a BSRP trigger frame, to multiple STA nodes. In the BSRP trigger frame sent to each STA node, the AP node allocates a frequency band for reporting service buffer status reports. The AP can complete the query of the service needs of at least one STA node through one or more query rounds.

[0155] In some examples, the AP node can also combine the RFCA mechanism and the BSRP mechanism to query the service needs of each STA node associated with the AP node. For example, the AP node can divide the channel into multiple frequency bands and then permanently allocate some of the multiple frequency bands to some STA nodes. For example, the AP node divides the channel into 8 frequency bands and then allocates 3 of the frequency bands to 3 different STA nodes. In other words, the 3 STA nodes will use the allocated frequency band to report the service cache status to the AP node. The remaining frequency bands can be used by other STA nodes, and a frequency band is randomly selected to report the service cache status report when there is a service demand.

[0156] It can be understood that in the above embodiments, the AP node receives the service cache status report reported by the STA node and can learn the service demand of the STA node based on the service cache status report.

[0157] Of course, the AP node may also use any other feasible query method to query the service requirements of at least one STA node, which is not limited in the embodiment of the present application.

[0158] The embodiments of the present application provide multiple service query methods so that an AP node can obtain the service requirements of its associated STA nodes, thereby improving the rationality and accuracy of the AP's decision-making on which channel to use for downlink services or uplink scheduling.

[0159] In some embodiments, assume that the first node is an AP node. The AP node can use the DCF mechanism to compete for the channel when the previous node ends its channel occupation, or if the channel is idle when traffic arrives at the AP node. If the AP node secures the channel using the DCF mechanism, it can obtain the traffic requirements of each STA node based on the various query methods mentioned above. The AP node can determine which channel to access to transmit downlink traffic based on its own traffic requirements and the traffic requirements of each STA node. Alternatively, the AP node can determine uplink scheduling for its associated STA nodes.

[0160] Of course, the specific decision-making process of the AP node can refer to relevant technical implementations, for example, based on factors such as the priority of business needs and the size of business volume, and the embodiments of this application are not limited here.

[0161] In some embodiments, for scenarios 2 and 3, if the first node is a STA node that supports the first channel access mechanism, the first node can achieve channel access through uplink scheduling performed by its associated AP node. In other words, for a STA node that supports the first channel access mechanism, its associated AP node must first compete for the channel through the DCF mechanism. The AP node can then determine which associated STA node to schedule based on service demand queries.

[0162] For example, in FIG6 , STA611, STA612, STA614, STA615, STA616, STA617, and STA618 access the channel, which requires AP61 and STA613 to compete for the channel through the DCF mechanism. After AP61 competes for the channel, it can use the various service query methods mentioned in the above embodiment to obtain the service requirements of each STA node. The AP node can select and schedule any one or more STA nodes among STA611, STA612, STA614, STA615, STA616, STA617, and STA618 to send uplink data based on service requirements. Similarly, the STA nodes supporting the first channel access mechanism in FIG7 are similar to the STA nodes supporting the first channel access mechanism in FIG6 , and the embodiments of the present application will not be repeated here.

[0163] Considering that STA nodes that support the first channel access mechanism need to compete for channels through AP nodes, in order to alleviate the imbalance in channel contention opportunities between STA nodes that do not support the first channel access mechanism and STA nodes that support the first channel access mechanism, the probability of AP accessing the channel can be increased, or it can be considered as increasing the priority of AP accessing the channel.

[0164] In some embodiments, the first node uses the DCF mechanism to access the channel, and the first node waits for a third interframe interval. For example, the first node may begin waiting for the third interval when the previous node stops occupying the channel, and then back off based on a random number. For another example, the first node may determine that the channel is idle when a service arrives, and then begin waiting for the third interval, and then back off based on a random number.

[0165] In some embodiments, the third waiting time period of the AP node may be shorter than the third waiting time period of a STA node that does not support the first channel access mechanism. It will be appreciated that by setting the third waiting time period of the AP node to be shorter than the third waiting time period of a STA node that does not support the first channel access mechanism, the AP node can be guaranteed to preferentially determine whether to access the channel.

[0166] For example, the third waiting time for an AP node can be set to DIFS, and the third waiting time for a STA node that does not support the first channel access mechanism can be DIFS plus one time slot. Of course, the third waiting time for different nodes can also be any other possible time length, and this embodiment of the application is not limited here. It should be understood that the third waiting time can be the same as or different from the first and second waiting times in the aforementioned embodiments, and this embodiment of the application is not limited here.

[0167] In some embodiments, a first value of a contention window (CW) length corresponding to an AP node is smaller than a first value of a contention window length corresponding to a STA node that does not support the first channel access mechanism.

[0168] In some embodiments, the first value of the contention window length is the maximum value of the contention window length, for example, denoted as CWmax.

[0169] For example, the CWmax corresponding to the AP node is smaller than the CWmax corresponding to the STA node that does not support the first channel access mechanism.

[0170] In some embodiments, the first value of the contention window length is the minimum value of the contention window length, for example, denoted as CWmin.

[0171] For example, the CWmin corresponding to the AP node is smaller than the CWmin corresponding to the STA node that does not support the first channel access mechanism.

[0172] It is clear that CWmax is the maximum contention window length, and CWmin is the minimum contention window length. During channel contention using the DCF mechanism, the random number is selected based on CWmin and CWmax. For example, a random number between 0 and Y can be selected as the random number. The value of Y must be between CWmin and CWmax, and Y can be either CWmin or CWmax. Therefore, it is clear that the random number selected will not exceed CWmax.

[0173] It can be seen that by making the first value of the contention window length corresponding to the AP node smaller than the first value of the contention window length corresponding to the STA node that does not support the first channel access mechanism, the random number generated by the AP node can be more likely to be smaller than the random number generated by the STA node that does not support the first channel access mechanism, thereby increasing the probability that the AP node will prioritize the random number back to 0 and access the channel.

[0174] The embodiments of the present application provide multiple possible situations of the first value of the contention window length, thereby being applicable to balancing the probability of each node accessing the channel in various scenarios.

[0175] In some embodiments, the maximum TXOP limit of an AP node after accessing a channel is greater than the maximum TXOP limit of a STA node that does not support the first channel access mechanism. In other words, the maximum duration that an AP node occupies a channel is greater than the maximum duration that a STA node that does not support the first channel access mechanism occupies a channel. This ensures that the AP node can occupy more channels for uplink scheduling of STA nodes that support the first channel access mechanism.

[0176] The embodiments of the present application provide multiple ways to enable the AP to access the channel with higher priority, thereby balancing the probability of each node accessing the channel.

[0177] In some embodiments, for a STA node that does not support the first channel access mechanism, in the process of competing for a channel using the DCF mechanism, service data may be directly sent after waiting for the third time period.

[0178] In some embodiments, when an AP node competes for a channel using a DCF mechanism, if a first condition is met, the contention window length corresponding to the AP node may be increased.

[0179] For example, if the first condition is met, the contention window length corresponding to the AP node can be doubled. Assume that the contention window length corresponding to the AP node is Y, where the value range of Y is [CWmin, CWmax] and the value of the random number is [0, Y]. If the first condition is met, Y can be increased to obtain Y'. In this case, the value range of the random number will become [0, Y']. For example, Y' can be 2Y. It should be noted that no matter what method is used to increase Y, the maximum value of Y is CWmax. In other words, if the value of Y is increased to be greater than CWmax, the contention window length corresponding to the AP node can be increased to CWmax.

[0180] In some examples, the first condition includes a frame collision between the AP node and another node.

[0181] For example, if an AP and other nodes simultaneously roll back their random numbers to 0 while accessing a channel using the DCF mechanism, they may simultaneously transmit information frames. For example, both nodes may transmit data frames, both nodes may transmit control frames, or some nodes may transmit data frames while others transmit control frames. Clearly, regardless of the type of frames transmitted by the AP and other nodes, a frame collision will occur. In this case, the contention window length corresponding to the AP can be increased.

[0182] In some examples, the first condition includes that the AP node has no traffic to be sent, and that a STA node associated with the AP node has no traffic to be sent.

[0183] For example, after an AP node secures a channel through the DCF mechanism, it determines that it has no pending traffic. Furthermore, the AP node queries and determines that its associated STA nodes also have no pending traffic. This indicates that the AP node is ineffectively occupying the channel. Therefore, the contention window length corresponding to the AP node can be increased to prevent frequent ineffective channel occupation by the AP node. In some examples, the pending traffic may include data frames and / or control frames.

[0184] In some examples, the first condition includes: a frame collision occurs between the AP node and other nodes; the AP node has no traffic to be sent, and a STA node associated with the AP node has no traffic to be sent.

[0185] The embodiment of the present application can increase the contention window length when the AP accesses the channel when the first condition is met, thereby avoiding excessive and ineffective channel occupation by the AP node and improving channel access efficiency.

[0186] As can be seen from the above embodiments, the embodiments of the present application can use appropriate channel access methods for different types of nodes in scenarios with one AP node and at least one STA node, where at least one STA node does not support the first channel access mechanism, or with multiple AP nodes and at least one STA node. This can reduce the latency of node access to the channel and improve the efficiency of channel access.

[0187] In some embodiments, a more specific example is given with reference to FIG6 for description. For example, in the single BSS scenario shown in FIG6 , there is one AP node and multiple STA nodes in the network environment. For example, there are 8 STA nodes. The AP node and 7 STA nodes support the RFCA mechanism, of which STA613 does not support the RFCA mechanism. Considering that there may be a lot of uplink and / or downlink services in a certain period of time, there may be more channel contention collisions. Therefore, the AP may decide to use the RFCA mechanism for channel access. The AP node can send a session establishment request frame to each of the 8 STA nodes. For some or all STA nodes that support the RFCA mechanism, an information frame can be replied to indicate consent, and the AP establishes a session with such STA.

[0188] It is understood that some STA nodes may support the RFCA mechanism but do not reply or reply with a frame indicating disagreement. In this case, the AP can use the RFCA mechanism for channel access only with STA nodes that reply with a frame indicating consent. Such STA nodes that support the RFCA mechanism can use the same channel access method as STA nodes that do not support the RFCA mechanism. This will not be explained separately below.

[0189] After the previous node finishes occupying the channel, i.e., stops sending packets, the AP node and STA nodes that do not support the RFCA mechanism can use the DCF mechanism to compete for the channel. If a STA node that does not support the RFCA mechanism wins the channel, it can directly send service data. If the AP node wins the channel, it can decide to send downlink service data or perform uplink scheduling for STA nodes that support the RFCA mechanism.

[0190] In some examples, to ensure that the AP node can have a higher priority access channel, the third waiting time during which the AP node competes for the channel using the DCF mechanism can be set to the point coordination function inter-frame space (PIFS), the CWmin can be set to 7, and the maximum TXOP can be set to 5 milliseconds (ms).

[0191] In some cases, if the AP node has no downlink traffic to send after competing for a channel and determines that it does not need to perform uplink scheduling for a STA node, the channel contention is considered invalid and the contention window length can be doubled. The CWmin value will be restored until the next time the AP node sends downlink traffic or performs uplink scheduling for a STA node.

[0192] In some cases, if the AP determines that air interface traffic is low, it may send a delete session frame. A session frame can be considered a frame that synchronizes the AP and STA nodes using the RFCA mechanism, and a delete session frame can be considered a frame used to terminate the synchronization between the AP and STA nodes using the RFCA mechanism. Upon receiving the delete session frame, the STA node will no longer compete for the channel using the RFCA mechanism, and the AP that sent the delete session frame will no longer use the RFCA mechanism to schedule STA nodes for channel access.

[0193] In some embodiments, a more specific example is provided with reference to FIG7 for description. For example, in the multi-BSS scenario shown in FIG7 , there are multiple AP nodes and multiple STA nodes in the network environment, such as 14 STA nodes. These multiple AP nodes and some STA nodes support the RFCA mechanism, but STA733 does not. AP71 is associated with STA711, STA712, STA713, STA714, STA715, STA716, STA717, and STA718; AP72 is associated with STA721 and STA722; and AP73 is associated with STA731, STA732, STA733, and STA734. Considering that there may be a high volume of uplink and / or downlink traffic during a certain period, channel contention collisions may be frequent. For example, one of the multiple AP nodes may determine to use the RFCA mechanism for channel access. This AP node may send a session establishment request frame to each of the other AP nodes. The AP node that receives the session establishment request frame may reply with a consent to establish the session. After establishing sessions between the multiple AP nodes, each AP node establishes a session with the other STA nodes within its BSS. For details, please refer to the description of the aforementioned embodiments, and the embodiments of the present application will not be repeated here.

[0194] Similar to Figure 6, after the previous node finishes occupying the channel, i.e., stops sending packets, AP nodes and STA nodes that do not support the RFCA mechanism can use the DCF mechanism to compete for the channel. If a STA node that does not support the RFCA mechanism wins the channel, it can directly send service data. If an AP node wins the channel, it can decide to send downlink service data or perform uplink scheduling for STA nodes that support the RFCA mechanism.

[0195] In some examples, for AP nodes with a large number of associated STA nodes, the RFCA mechanism can be used to query the service needs of STA nodes. For AP nodes with a small number of associated STA nodes, the BSRP mechanism can be used to query the service needs of STA nodes. For example, a threshold for the number of STA nodes can be set. If the number is greater than or equal to the threshold, the AP node is considered to have a large number of associated STA nodes; conversely, if the number is less than the threshold, the AP node is considered to have a small number of associated STA nodes. The specific value of the threshold can be set based on actual conditions and is not limited in this embodiment of the present application.

[0196] In some cases, if an AP node has no downlink traffic to send after competing for a channel and has determined that it does not need to perform uplink scheduling for a STA node, the channel contention is considered invalid and the contention window length can be doubled. The CWmin value will be restored until the next time the AP node sends downlink traffic or performs uplink scheduling for a STA node.

[0197] It is clear that part of the implementation process of the embodiment corresponding to Figure 6 can be reused in the scenario of Figure 7. For example, the configuration of a higher priority access channel for an AP node is not repeated here for the sake of convenience.

[0198] As can be seen in the scenario shown in Figure 7, the original 17 nodes competing for the channel are now reduced to three AP nodes and one STA node. This significantly reduces the number of nodes competing for the channel, which helps lower the collision rate. Furthermore, some STA nodes scheduled by the AP may have low-latency services to transmit. After these STA nodes secure a channel through the AP, they can be directly scheduled for uplink transmission by the AP. This improves the efficiency of channel access for these STA nodes compared to competing for the channel using only the DCF mechanism.

[0199] In an embodiment of the present application, in a scenario where there is one AP node and at least one STA node, and at least one STA node does not support the first channel access mechanism, or in a scenario where there are multiple AP nodes and at least one STA node, appropriate channel access methods can be used for different types of nodes to access the channel. This can reduce the latency of node access to the channel and improve the efficiency of channel access. In an embodiment of the present application, only AP nodes and STA nodes that do not support the first channel access mechanism compete for the channel, thereby reducing the number of nodes competing for the channel, thereby reducing frame collisions between different nodes, and improving the efficiency of each node accessing the channel.

[0200] In the channel access method provided in the embodiment of the present application, the multiple nodes include multiple AP nodes and at least one STA node. Among them, at least one STA node is a STA node that supports a first channel access mechanism, and the STA node that supports the first channel access mechanism is associated with an AP node among the multiple AP nodes. In S102, channel access is performed using a channel access method that matches the node type of the first node, which may include: the first node is an AP node, and channel access is performed using a second channel access mechanism, wherein the second channel access mechanism negotiates channel access using a wired connection between multiple AP nodes. The first node is a STA node that supports the first channel access mechanism, and channel access is performed based on the uplink scheduling of the AP node associated with the first node.

[0201] In some embodiments, referring to the scenario shown in FIG7 , when the multiple nodes include multiple AP nodes and at least one STA node, the AP nodes may use the second channel access mechanism for channel access instead of the DCF mechanism. In this scenario, at least one STA node is a STA node that supports the first channel access mechanism.

[0202] In some examples, the second channel access mechanism uses a wired connection between multiple AP nodes to negotiate channel access. For example, the second channel access mechanism can be called a fiber-to-the-room (FTTR) mechanism. In some examples, the wired connection between multiple AP nodes can be achieved through optical fiber. Of course, other methods can also be used for wired connection, which is not limited in the embodiments of the present application. After the multiple AP nodes are connected through a wired connection, they can negotiate with each other which node will access the channel first and which node will access the channel later, that is, negotiate the order of channel access. Afterwards, each AP node can access the channel in sequence according to the negotiated order.

[0203] In some examples, for STA nodes that support the first channel access mechanism, uplink scheduling is still performed by the AP node associated with it to achieve channel access. The specific implementation process can refer to the corresponding embodiments above, and the embodiments of this application will not be repeated here.

[0204] Of course, in this scenario, for a STA node that does not support the first channel access mechanism, if it can be connected to the AP node in a wired manner, it can negotiate an access order with the AP node.

[0205] This second channel access mechanism avoids the random number backoff wait time in the DCF mechanism through negotiation. This allows for faster channel allocation between nodes. After accessing the channel, each AP can then proceed with the channel access process for a single BSS scenario.

[0206] In scenarios with multiple AP nodes and at least one STA node, the present embodiment can employ appropriate channel access methods for different node types. This reduces the latency of node access and improves channel access efficiency. By determining the order of channel access through negotiation between AP nodes, the present embodiment avoids the waiting time associated with the DCF mechanism, reduces the latency of node access, and improves the efficiency of each node's channel access.

[0207] In the channel access method provided in an embodiment of the present application, when the first node is an AP node, channel access may include: determining that the AP node performs channel access, or performing uplink scheduling on the STA node associated with the AP node, based on the business requirements of the AP node and the business requirements of the STA node associated with the AP node.

[0208] In some embodiments, for each of the above embodiments, when the AP node determines that channel access is possible, it may determine whether the AP node itself performs channel access for sending downlink data based on the service requirements of the AP node itself and the service requirements of the STA node associated with the AP node. Alternatively, the AP node may determine to perform uplink scheduling on the STA node associated with it that supports the first channel access mechanism. Regarding how the AP node obtains the service requirements of the STA node associated with the AP node, reference may be made to the various service query methods mentioned in the above embodiments, and the embodiments of the present application will not be repeated here.

[0209] In the embodiment of the present application, the AP node can determine whether to access the channel or perform uplink scheduling for other STA nodes based on the business needs of each node in the network environment, and can more flexibly allocate channels to appropriate nodes, thereby improving the efficiency of node access to the channel.

[0210] In the channel access method provided in an embodiment of the present application, performing channel access in S102 using a channel access method that matches the node type of the first node may include: the first node continuously monitoring the channel to be accessed to determine whether it is an idle channel during a fourth time period, and the first node accessing the idle channel at the end of the fourth time period. A service arrives at the first node at the start of the fourth time period.

[0211] In some embodiments, the first node may continuously monitor the channel. The first node may continuously monitor the channel for idleness during a fourth duration. Assuming that a service arrives at the first node at the start of the fourth duration, the first node may directly access the channel at the end of the fourth duration, for example, by directly sending a data frame or a control frame.

[0212] The embodiment of the present application can continuously monitor the channel to see if it is an idle channel within a certain period of time after a service arrives, so that the first node can directly access the channel, thereby reducing the delay of the node accessing the channel and improving the efficiency of the node accessing the channel.

[0213] In the channel access method provided in an embodiment of the present application, performing channel access in S102 using a channel access method that matches the node type of the first node may include: the first node continuously monitoring the channel to be accessed to determine whether it is an idle channel during a fourth time period, and the first node accessing the idle channel at the end of the fourth time period. A service arrives at the first node at the end of the fourth time period.

[0214] In some embodiments, the first node may continuously monitor the channel. The first node may continuously monitor the channel for idleness during a fourth duration. Assuming that a service arrives at the first node at the end of the fourth duration, the first node may directly access the channel at that moment, such as by directly sending a data frame or a control frame.

[0215] The embodiment of the present application can continuously monitor the channel for idleness within a certain period of time before a service arrives. Then, the first node can directly access the channel when a service arrives, thereby reducing the delay of the node accessing the channel and improving the efficiency of the node accessing the channel.

[0216] In some possible embodiments, the fourth duration may be DIFS plus one time slot. Of course, the fourth duration may also be any other possible duration, which is not limited in the embodiments of the present application.

[0217] In the above embodiments, the channel access method in which the AP performs uplink scheduling for STA nodes can be referred to as AP full scheduling. In some embodiments, during the channel access process using the RCFA mechanism between the AP node and the STA node, orthogonal frequency division multiple access (OFDMA) technology can be used to divide multiple frequency bands and schedule different STA nodes based on the multiple frequency bands. The specific implementation process of OFDMA technology can be referenced in related technologies and will not be further described in this embodiment of the present application.

[0218] It can be understood that in the above embodiment, the first node continuously monitors the channel to be accessed to be an idle channel within the fourth time period, and the first node can access the idle channel, which is applicable to any of the scenarios mentioned above, such as scenario one, scenario two and scenario three.

[0219] It should be noted that the above-mentioned multiple embodiments can be combined and the combined solutions can be implemented. Optionally, some operations in the process of each method embodiment are optionally combined, and / or the order of some operations is optionally changed. In addition, the execution order between the steps of each process is only exemplary and does not constitute a limitation on the execution order between the steps. There can also be other execution orders between the steps. It is not intended to indicate that the execution order is the only order in which these operations can be performed. Ordinary technicians in this field will think of many ways to reorder the operations of this article. In addition, it should be pointed out that the process details involved in a certain embodiment of this article are also applicable to other embodiments in a similar manner, or different embodiments can be used in combination.

[0220] It is understood that in order to implement the functions in the above embodiments, the base station and the terminal include hardware structures and / or software modules that perform the corresponding functions. Those skilled in the art should readily appreciate that, in combination with the units and method steps of the various examples described in the embodiments disclosed in the present application, the embodiments of the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in hardware or in a computer software-driven hardware manner depends on the specific application scenario and design constraints of the technical solution.

[0221] Figures 8 and 9 are schematic diagrams of the structures of possible channel access devices provided in embodiments of the present application. These channel access devices can be used to implement the functions of any possible node in the above-mentioned method embodiments, thereby also achieving the beneficial effects of the above-mentioned method embodiments. In the embodiments of the present application, the channel access device can be an AP node or a STA node, or a module applied to an AP node or a STA node, for example, a chip.

[0222] As shown in FIG8 , the channel access device 800 includes a processing unit 810 .

[0223] In a possible implementation, the channel access device 800 may further include a transceiver unit 820 .

[0224] In a possible implementation, the channel access device 800 may further include a storage unit 830 .

[0225] In a possible implementation, the channel access device 800 may further include a transceiver unit 820 and a storage unit 830 .

[0226] The channel access device 800 is used to implement the functions of any node in the method embodiment shown in FIG. 3 .

[0227] When the channel access device 800 is used to implement the functions of any node in the method embodiment shown in Figure 3: the transceiver unit 820 is used to obtain the node types of multiple nodes. The processing unit 810 is used to determine, based on the node types of multiple nodes, that the first node adopts a channel access method that matches the node type of the first node for channel access. The processing unit 810 is also used to execute all operations other than the transceiver operations performed by the channel access device 800 in the embodiment shown in Figure 3, and / or other processes for supporting the technology described herein. The storage unit 830 is used to store any data, computer instructions and / or computer programs that may be involved in the various embodiments of the present application.

[0228] For a more detailed description of the processing unit 810 and the transceiver unit 820, please refer to the relevant description of the method embodiment shown in Figure 3. The processing unit 810 and the transceiver unit 820 may also perform other steps, and the specific implementation can refer to the method embodiment, which will not be repeated here.

[0229] Optionally, the transceiver unit 820 may be a transceiver, which may include an antenna and a radio frequency circuit, etc.

[0230] The processing unit 810 may be a processor (or a processing circuit), such as a baseband processor, which may include one or more CPUs.

[0231] As shown in FIG9 , the channel access device 900 includes at least one processor 910. In a possible implementation, the channel access device 900 may further include an interface circuit 920.

[0232] In a possible implementation, the channel access device 900 may further include a memory 930 .

[0233] In a possible implementation, the channel access device 900 may further include a memory 930 and an interface circuit 920 .

[0234] In some embodiments, the processor 910 and the memory 930 are coupled to each other; and / or the processor 910 and the interface circuit 920 are coupled to each other. It will be appreciated that the interface circuit 920 may be a transceiver or an input / output interface. The memory 930 may be used to store computer instructions executed by the processor 910, input data required by the processor 910 to execute computer instructions, or data generated by the processor 910 after executing computer instructions.

[0235] When the channel access device 900 is used to implement the method shown in Figure 3, the processor 910 can be used to implement the functions of the above-mentioned processing unit 810, and / or the interface circuit 920 can be used to implement the functions of the above-mentioned transceiver unit 820, and / or the memory 930 can be used to implement the functions of the above-mentioned storage unit 830.

[0236] When the channel access device is a chip implemented in a terminal, the terminal chip implements the functions of the terminal in the above-described method embodiments. When the terminal chip receives information from a network device, it can be understood that the information is first received by other modules in the terminal (such as a radio frequency module or antenna) and then sent to the terminal chip by these modules. When the terminal chip sends information to a network device, it can be understood that the information is first sent to other modules in the terminal (such as a radio frequency module or antenna) and then sent to the network device by these modules.

[0237] When the channel access device is a chip used in a network device, the network device chip implements the functions of the network device in the above-mentioned method embodiment. When the network device chip receives information from the terminal, it can be understood that the information is first received by other modules in the network device (such as a radio frequency module or antenna) and then sent to the network device chip by these modules. When the network device chip sends information to the terminal, it can be understood that the information is sent to other modules in the network device (such as a radio frequency module or antenna) and then sent to the terminal by these modules.

[0238] The channel access device shown in Figure 8 or Figure 9 is only an example, and in actual applications the channel access device may have more or fewer components than shown in Figure 8 or Figure 9, may combine two or more components, or may have a different component configuration.

[0239] In the embodiments of the present application, when entity A sends information to entity B, A may send the information directly to B or indirectly to B through another entity. Similarly, when entity B receives information from entity A, entity B may directly receive the information sent by entity A or indirectly receive the information sent by entity A through another entity. Entities A and B herein may be RAN nodes or terminals, or modules within a RAN node or terminal. The sending and receiving of information may be information exchange between a RAN node and a terminal, for example, information exchange between a network device and a terminal; the sending and receiving of information may also be information exchange between two RAN nodes, for example, information exchange between a CU and a DU; the sending and receiving of information may also be information exchange between different modules within a device, for example, information exchange between a terminal chip and other modules of the terminal, or information exchange between a network device chip and other modules within the network device.

[0240] In the embodiments of the present application, a network device sends downlink signals or downlink information to a terminal device, and the downlink information is carried on a downlink channel. The terminal device sends uplink signals or uplink information to the network device, and the uplink information is carried on an uplink channel. To communicate with the network device, the terminal device needs to establish a wireless connection with a cell controlled by the network device. The cell with which the terminal device has established a wireless connection is called the serving cell of the terminal device.

[0241] It can be understood that in the embodiment of the present application, PDSCH and PUSCH are only used as examples of downlink data channels and uplink data channels. In different systems and different scenarios, data channels and control channels may have different names, and the embodiment of the present application does not limit this.

[0242] It is understood that the processor in the embodiments of the present application may be a central processing unit (CPU), or may be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. The general-purpose processor may be a microprocessor or any conventional processor.

[0243] The method steps in the embodiments of the present application can be implemented in hardware or in software instructions that can be executed by a processor. The software instructions can be composed of corresponding software modules, and the software modules can be stored in random access memory, flash memory, read-only memory, programmable read-only memory, erasable programmable read-only memory, electrically erasable programmable read-only memory, registers, hard disk, mobile hard disk, CD-ROM or any other form of storage medium well known in the art. An exemplary storage medium is coupled to the processor so that the processor can read information from the storage medium and write information to the storage medium. The storage medium can also be an integral part of the processor. The processor and storage medium can be located in an ASIC. In addition, the ASIC can be located in a network device or a terminal. The processor and storage medium can also exist in a network device or a terminal as discrete components.

[0244] In the above embodiments, all or part of the embodiments may be implemented using software, hardware, firmware, or any combination thereof. When implemented using software, all or part of the embodiments may be implemented in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in the embodiments of the present application are performed in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, a network device, a user device, or other programmable device. The computer program or instructions may be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another. For example, the computer program or instructions may be transferred from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means. The computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server or data center that integrates one or more available media. The available medium may be a magnetic medium, such as a floppy disk, hard disk, or magnetic tape; an optical medium, such as a digital video disk; or a semiconductor medium, such as a solid-state drive. The computer-readable storage medium may be a volatile or nonvolatile storage medium, or may include both volatile and nonvolatile types of storage media.

[0245] In each embodiment of the present application, unless otherwise specified or provided by logic, the terms and / or descriptions between different embodiments are consistent and can be referenced to each other. The technical features in different embodiments can be combined to form a new embodiment based on their inherent logical relationships.

[0246] It is understood that the various numbers used in the embodiments of this application are merely for ease of description and are not intended to limit the scope of the embodiments of this application. The order of the sequence numbers of the above-mentioned processes does not necessarily imply a specific order of execution; the order of execution of the processes should be determined by their functions and inherent logic.

Claims

1. A channel access method, characterized in that, Including: Obtaining node types of multiple nodes, where the multiple nodes include a first node; Determining that the first node performs channel access using a channel access method matching the node type of the first node according to the node types of the multiple nodes.

2. The method according to claim 1, wherein The multiple nodes include an access device AP node and a station STA node. Among them, the STA node is a node that accesses the AP node for communication. The STA node includes a STA node supporting a first channel access mechanism and / or a STA node not supporting the first channel access mechanism. The AP node supports the first channel access mechanism, and the first channel access mechanism uses a random frequency band method for channel access.

3. The method according to claim 2, wherein The multiple nodes include one AP node and at least one STA node. Among them, the at least one STA node is a STA node supporting the first channel access mechanism, and the one AP node is associated with the at least one STA node; Performing channel access using a channel access method matching the node type of the first node includes: When the first node is an AP node, waiting for a first duration and performing channel access; or, When the first node is any one of the at least one STA node, waiting for a second duration and performing channel access using the first channel access mechanism, where the first duration is less than the second duration.

4. The method according to claim 3, characterized in that, The first node is the AP node; the waiting for the first duration and performing channel access includes: Waiting for the first duration and determining, according to the service requirements of the AP node and the service requirements of the STA nodes associated with the AP node, for the AP node to access the channel or reserving the channel for the at least one STA node.

5. The method according to claim 2, wherein The multiple nodes include one AP node and at least one STA node. Among them, the at least one STA node at least includes a STA node not supporting the first channel access mechanism, and the STA node supporting the first channel access mechanism is associated with the one AP node; or, the multiple nodes include multiple AP nodes and at least one STA node. Among them, the STA node supporting the first channel access mechanism is associated with one of the multiple AP nodes; Performing channel access using a channel access method matching the node type of the first node includes: When the first node is an AP node or the STA node not supporting the first channel access mechanism, using the distributed coordination function DCF mechanism for channel access; When the first node is a STA node supporting the first channel access mechanism, performing channel access based on the uplink scheduling of the AP node associated with the first node.

6. The method according to claim 2, wherein The multiple nodes include multiple AP nodes and at least one STA node. Among them, the at least one STA node is a STA node supporting the first channel access mechanism, and the STA node supporting the first channel access mechanism is associated with one of the multiple AP nodes; Performing channel access using a channel access method matching the node type of the first node includes: The first node is an AP node, and a second channel access mechanism is adopted for channel access. Among them, the second channel access mechanism negotiates for channel access in a wired connection manner among the multiple AP nodes; The first node is a STA node that supports the first channel access mechanism, and performs channel access based on the uplink scheduling of the AP node associated with the first node.

7. The method according to claim 5 or 6, characterized in that, The first node is the AP node; the performing of channel access includes: According to the service requirements of the AP node and the service requirements of the STA node associated with the AP node, determine that the AP node performs channel access, or perform uplink scheduling on the STA node associated with the AP node.

8. The method according to claim 5, characterized in that The first node adopts the DCF mechanism for channel access, and the frame spacing duration waited by the first node is the third duration; Among them, the third duration waited by the AP node is less than the third duration waited by the STA node that does not support the first channel access mechanism; or, The first value of the contention window length corresponding to the AP node is less than the first value of the contention window length corresponding to the STA node that does not support the first channel access mechanism; or, The upper limit value of the transmission opportunity TXOP after the AP node accesses the channel is greater than the TXOP upper limit value after the STA node that does not support the first channel access mechanism accesses the channel.

9. The method according to claim 8, characterized in that The first value of the contention window length is at least one of the following numerical values: The maximum value of the contention window length; The minimum value of the contention window length.

10. The method according to claim 5, 8 or 9, characterized in that The AP node competes for the channel by using the DCF mechanism, and increases the contention window length corresponding to the AP node when the first condition is satisfied; Among them, the first condition includes at least one of the following: The AP node has a frame collision with other nodes; The AP node has no traffic to be sent, and the STA node associated with the AP node has no traffic to be sent.

11. The method according to claim 7, characterized in that The method further includes: Querying the service requirements of the STA node associated with the AP node by using the first channel access mechanism; and / or, Querying the service requirements of the STA node associated with the AP node by using the buffer status report query BSRP mechanism.

12. The method according to any one of claims 1-11, characterized in that, The performing of channel access by using a channel access method matching the node type of the first node includes: The first node continuously monitors that the channel to be accessed is an idle channel within the fourth duration, and the first node accesses the idle channel at the end moment of the fourth duration, where the first node has traffic arriving at the start moment of the fourth duration.

13. The method according to any one of claims 1-11, characterized in that, The performing of channel access by using a channel access method matching the node type of the first node includes: The first node continuously monitors that the channel to be accessed is an idle channel within the fourth duration, and the first node accesses the idle channel at the end moment of the fourth duration, where the first node has traffic arriving at the end moment of the fourth duration.

14. A channel access device, characterized in that, Includes: An obtaining unit, configured to obtain the node types of multiple nodes, where the multiple nodes include a first node; A processing unit, configured to determine that the first node performs channel access by using a channel access mode matching the node type of the first node according to the node types of the multiple nodes.

15. The device according to claim 14, wherein The multiple nodes include an access device AP node and a station STA node. Among them, the STA node is a node that accesses the AP node for communication. The STA node includes a STA node supporting a first channel access mechanism and / or a STA node not supporting the first channel access mechanism. The AP node supports the first channel access mechanism, and the first channel access mechanism performs channel access by using a random frequency band method.

16. The device according to claim 15, characterized in that, The multiple nodes include one AP node and at least one STA node. Among them, the at least one STA node is a STA node supporting a first channel access mechanism, and the one AP node is associated with the at least one STA node; The processing unit is further configured to: If the first node is an AP node, wait for a first duration and perform channel access; or, If the first node is any one of the at least one STA node, wait for a second duration and perform channel access by using the first channel access mechanism, where the first duration is less than the second duration.

17. The device according to claim 16, characterized in that, The first node is the AP node; the processing unit is further configured to: Wait for the first duration and determine, according to the service requirements of the AP node and the service requirements of the STA nodes associated with the AP node, to access the channel by the AP node or reserve the channel for the at least one STA node.

18. The device according to claim 15, characterized in that, The multiple nodes include one AP node and at least one STA node. Among them, the at least one STA node at least includes a STA node not supporting the first channel access mechanism, and the STA node supporting the first channel access mechanism is associated with the one AP node; or, the multiple nodes include multiple AP nodes and at least one STA node. Among them, the STA node supporting the first channel access mechanism is associated with one of the multiple AP nodes; The processing unit is further configured to: If the first node is an AP node or the STA node not supporting the first channel access mechanism, perform channel access by using a distributed coordination function DCF mechanism; If the first node is a STA node supporting the first channel access mechanism, perform channel access based on the uplink scheduling of the AP node associated with the first node.

19. The device according to claim 15, characterized in that, The multiple nodes include multiple AP nodes and at least one STA node. Among them, the at least one STA node is a STA node supporting the first channel access mechanism, and the STA node supporting the first channel access mechanism is associated with one of the multiple AP nodes; The processing unit is further configured to: If the first node is an AP node, perform channel access by using a second channel access mechanism, where the second channel access mechanism negotiates channel access by using a wired connection mode among the multiple AP nodes; If the first node is a STA node supporting the first channel access mechanism, perform channel access based on the uplink scheduling of the AP node associated with the first node.

20. The device according to claim 18 or 19, characterized in that, The first node is the AP node; the processing unit is further configured to: Determine that the AP node performs channel access or perform uplink scheduling on the STA node associated with the AP node according to the service requirements of the AP node and the service requirements of the STA node associated with the AP node.

21. The device according to claim 18, characterized in that The first node performs channel access using the DCF mechanism, and the inter-frame spacing duration waited by the first node is the third duration; Wherein, the third duration waited by the AP node is less than the third duration waited by the STA node that does not support the first channel access mechanism; or, The first value of the contention window length corresponding to the AP node is less than the first value of the contention window length corresponding to the STA node that does not support the first channel access mechanism; or, The upper limit value of the transmission opportunity TXOP after the AP node accesses the channel is greater than the upper limit value of the TXOP after the STA node that does not support the first channel access mechanism accesses the channel.

22. The device according to claim 21, wherein The first value of the contention window length is at least one of the following values: The maximum value of the contention window length; The minimum value of the contention window length.

23. The device according to claim 18, 21 or 22, characterized in that, When the AP node competes for the channel using the DCF mechanism and meets the first condition, increase the contention window length corresponding to the AP node; Wherein, the first condition includes at least one of the following: The AP node has a frame collision with other nodes; The AP node has no traffic to be sent, and the STA node associated with the AP node has no traffic to be sent.

24. The device according to claim 20, characterized in that, The processing unit is further configured to: Query the service requirements of the STA node associated with the AP node using the first channel access mechanism; and / or, Query the service requirements of the STA node associated with the AP node using the buffer status report query BSRP mechanism.

25. The device according to any one of claims 14 - 24, characterized in that The processing unit is further configured to: The first node continuously monitors that the channel to be accessed is an idle channel within the fourth duration, and the first node accesses the idle channel at the end of the fourth duration, wherein the first node has traffic arriving at the start of the fourth duration.

26. The device according to any one of claims 14-24, characterized in that, The processing unit is further configured to: The first node continuously monitors that the channel to be accessed is an idle channel within the fourth duration, and the first node accesses the idle channel at the end of the fourth duration, wherein the first node has traffic arriving at the end of the fourth duration.

27. A channel access device, characterized in that, Comprising: At least one processor and a communication interface, the communication interface is used for receiving and / or sending signals, and the processor is configured to enable the method according to any one of claims 1 to 13 to be executed.

28. A channel access device, characterized in that, Comprising: At least one processor and a memory, the memory is used for storing computer instructions, and the processor is configured to execute the computer instructions so that the channel access device executes the method according to any one of claims 1 to 13.

29. A communication system, characterized in that, The system includes: a plurality of nodes that execute the method according to any one of claims 1 to 13.

30. A computer-readable storage medium, characterized in that, Instructions or programs are stored in the computer-readable storage medium, and when the instructions or programs run on the communication device, the communication device is enabled to execute the method according to any one of claims 1 - 13.

31. A computer program product, characterized in that, The computer program product includes a computer program or instructions that, when run on a computer, cause the computer to perform the method according to any one of claims 1 to 13.

Images