WO2023237039A1 - Procédé d'accès à un canal et produit associé - Google Patents

Procédé d'accès à un canal et produit associé Download PDF

Info

Publication number
WO2023237039A1
WO2023237039A1 PCT/CN2023/099073 CN2023099073W WO2023237039A1 WO 2023237039 A1 WO2023237039 A1 WO 2023237039A1 CN 2023099073 W CN2023099073 W CN 2023099073W WO 2023237039 A1 WO2023237039 A1 WO 2023237039A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
network node
neighbor
network
neighbor node
Prior art date
Application number
PCT/CN2023/099073
Other languages
English (en)
Chinese (zh)
Inventor
罗嘉俊
郭子阳
刘鹏
邵郁林
王滔滔
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2023237039A1 publication Critical patent/WO2023237039A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0808—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/02—Neural networks
    • G06N3/04—Architecture, e.g. interconnection topology
    • G06N3/044—Recurrent networks, e.g. Hopfield networks
    • G06N3/0442—Recurrent networks, e.g. Hopfield networks characterised by memory or gating, e.g. long short-term memory [LSTM] or gated recurrent units [GRU]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/02—Neural networks
    • G06N3/08—Learning methods
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computing arrangements using knowledge-based models
    • G06N5/04—Inference or reasoning models
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/002—Transmission of channel access control information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0808—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]
    • H04W74/0816—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA] with collision avoidance

Definitions

  • the present application relates to the field of communication technology, and in particular, to a channel access method and related products.
  • Wi-Fi wireless networks
  • channels are shared. If there are multiple nodes sending packets in a specific area, conflicts will occur, leading to transmission failure.
  • Channel access is the core algorithm protocol for nodes to decide whether to transmit in the above-mentioned shared channel environment.
  • the current Wi-Fi network uses the Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) access mechanism, which is based on Listen Before Talk (LBT). , that is, the node needs to perform carrier sensing to determine whether the channel is idle and then decide the access behavior.
  • LBT Listen Before Talk
  • hiding terminals has a very large impact on the performance of this access mechanism. For example, two network nodes cannot listen to each other's existence.
  • MAC Media Access Control
  • This application provides a channel access method and related products, which can improve the accuracy of the channel access behavior determined by network nodes and improve MAC performance.
  • embodiments of the present application provide a channel access method, which is applied in a first network node.
  • the method includes:
  • input information is input into the neural network to obtain an output result.
  • the input information is based on the historical channel access information of at least one first neighbor node of the first network node and the relationship between the first network node and the second network node.
  • the historical channel access information of at least one second neighbor node of the network node is determined, the first neighbor node is a node that the first network node can listen to, the second neighbor node is a node that the second network node can listen to, and the second neighbor node is a node that the first network node can listen to.
  • a network node cannot listen to the node.
  • the second network node may be a node that the first network node is ready to communicate with. For example, the first network node has data to be sent to the second network node.
  • the neighbor nodes of the first network node are classified.
  • One category is at least one first neighbor node that the first network node can listen to, and the other category is that the first network node cannot listen to it.
  • at least one second neighbor node that the second network node can listen to the input information input to the neural network is determined by the historical channel access information of the two categories, thereby improving the accuracy of the channel access behavior determined by the network node. Accuracy, improve MAC performance.
  • the input information is input into the neural network to obtain the output result, including:
  • the input information is input into the neural network to obtain an output result.
  • the input information can be input into the neural network to make a decision on the channel access behavior, thereby improving Accuracy of channel access decisions.
  • the method further includes:
  • the historical channel access information of the at least one first neighbor node the historical channel access information of the at least one second neighbor node, the historical channel access information of the first network node and the first network node
  • the historical carrier sensing results are used to determine the input information.
  • the historical channel access information of the first neighbor node, the historical channel access information of the second neighbor node, the historical channel access information of the first network node, and the historical carrier sensing results of the first network node can be used. Determining the input information means determining the input information through multiple factors, thereby further improving the accuracy of the channel access decision.
  • the historical channel access information of the first neighbor node includes the historical channel access behavior of the first neighbor node, the historical data transmission result of the first neighbor node, or the first interval One or more items of time, and the first interval time is the interval between the reference time corresponding to the input information and the last successful transmission of the first neighbor node;
  • the historical channel access information of the second neighbor node includes one or more of the historical channel access behavior of the second neighbor node, the historical data transmission result of the second neighbor node, or the second interval time, so
  • the second interval time is the interval between the reference time corresponding to the input information and the last successful transmission of the second neighbor node;
  • the historical channel access information of the first network node includes one or more of the historical channel access behavior of the first network node, historical data transmission results of the first network node, or a third interval, so
  • the third interval time is an interval between the reference time corresponding to the input information and the last successful transmission of the first network node.
  • the historical channel access information is further limited to include the historical channel access behavior of the network node, historical data transmission results, and the interval between the reference time corresponding to the input information and the network node's last successful transmission, thereby further improving channel access decision-making. accuracy.
  • the method further includes:
  • the first network node sends its at least one first neighbor node to the second network node, so that the second network node determines the first network node relative to the at least one second neighbor node of the second network node. node identifier.
  • the method further includes:
  • the sending the node identifier of the at least one first neighbor node to the second network node includes:
  • the node identification of the at least one first neighbor node is sent to the second network node.
  • the first network node when the second network node requests to obtain the first neighbor node, the first network node sends the node identifier of at least one first neighbor node to the second network node, which facilitates the first network node to obtain the second neighbor node. Neighbor nodes.
  • sending the node identifier of the at least one first neighbor node to the second network node includes:
  • Send a second request frame to the second network node the second request frame including the node identification of the at least one first neighbor node, and the second request frame is used to request to obtain the relative position of the first network node to The at least one second neighbor node of the second network node.
  • the first network node actively sends its first neighbor node to the second network node by requesting the second request frame of the second neighbor node, which facilitates the second network node to determine the second neighbor node.
  • One request frame can Realizes two functions and saves network transmission resources.
  • the method includes:
  • the at least one second neighbor node is determined based on the at least one first neighbor node and the at least one third neighbor node.
  • the first network node can determine at least one first neighbor node and at least one second neighbor node by itself.
  • the method further includes:
  • the node identification of the at least one fourth neighbor node is sent to the second network node.
  • the first network node can also determine at least one fourth neighbor node for the second network node, thereby facilitating the second network node to make a decision on channel access behavior.
  • the method further includes:
  • a third request frame is sent to the second network node, where the third request frame is used to request acquisition of the at least one third neighbor node of the second network node.
  • the method further includes:
  • the output result includes a first output value and a second output value, the first output value is used to indicate access to the channel, and the second output value is used to indicate not to access the channel.
  • Determining channel access behavior based on the output result includes:
  • the channel access behavior is determined through the first output value and the second output value in the neural network output result, thereby improving the accuracy of the channel access decision.
  • the method further includes:
  • the first network node can send at least one of the input information or the determined channel access behavior to the second network node to train the neural network, and receive the neural network parameter update from the second network node.
  • the latter parameters are trained by the second network node for the neural network of the first network node, which can reduce the processing load of the first network node and be applicable to more scenarios.
  • the first network node includes a personal basic service area control point (PBSS control point, PCP) or access point (access point, AP), and the second network node includes a station (station , STA); or, the first network node includes an STA, and the second network node includes an AP or a PCP.
  • PBSS control point PCP
  • AP access point
  • PCP personal basic service area control point
  • AP access point
  • AP access point
  • the second network node includes a station (station , STA); or, the first network node includes an STA, and the second network node includes an AP or a PCP.
  • embodiments of the present application provide a communication device for executing the method in any possible implementation of the first aspect.
  • the communication device includes means for performing the method in any possible implementation of the first aspect.
  • the above-mentioned communication device may include a transceiver unit and a processing unit.
  • inventions of the present application provide a communication device.
  • the communication device includes a processor, configured to execute the method shown in the above-mentioned first aspect or any possible implementation of the first aspect.
  • the processor is configured to execute a program stored in the memory. When the program is executed, the method shown in the above first aspect or any possible implementation of the first aspect is executed.
  • the memory is located outside the communication device.
  • the memory is located within the above communication device.
  • the processor and the memory can also be integrated into one device, that is, the processor and the memory can also be integrated together.
  • the communication device further includes a transceiver, which is used to receive signals or send signals.
  • inventions of the present application provide a communication device.
  • the communication device includes a logic circuit and an interface.
  • the logic circuit is coupled to the interface; the interface is used to receive input information, and the input information is generated according to the
  • the first network node is determined by the historical channel access information of at least one first neighbor node of the first network node and the historical channel access information of the first network node relative to at least one second neighbor node of the second network node.
  • a neighbor node is a node that the first network node can hear, and the second neighbor node is a node that the second network node can hear, but the first network node cannot hear;
  • the logic circuit is configured to input input information into the neural network to obtain an output result when a channel is detected to be idle.
  • the input information is based on the historical channel access of at least one first neighbor node of the first network node. information and the historical channel access information of at least one second neighbor node of the first network node relative to the second network node, where the first neighbor node is a node that the first network node can listen to, The second neighbor node is a node that can be heard by the second network node but cannot be heard by the first network node; the channel access behavior is determined according to the output result.
  • embodiments of the present application provide a computer-readable storage medium.
  • the computer-readable storage medium is used to store a computer program. When it is run on a computer, it enables the above-mentioned first aspect or any possible implementation of the first aspect. The method shown in the implementation is executed.
  • inventions of the present application provide a computer program product.
  • the computer program product includes a computer program or computer code. When run on a computer, the computer program product enables the above-mentioned first aspect or any possible implementation of the first aspect. The method shown is executed.
  • embodiments of the present application provide a computer program.
  • the computer program When the computer program is run on a computer, the above-mentioned The method shown in the first aspect or any possible implementation of the first aspect is executed.
  • inventions of the present application provide a wireless communication system.
  • the wireless communication system includes a first network node and a second network node.
  • the first network node is configured to perform the above-mentioned first aspect or any possibility of the first aspect.
  • the steps performed by the first network node in the method shown in the implementation manner, the second network node is used to perform the steps performed by the second network node in the method shown in any possible implementation manner of the first aspect or the first aspect. steps to perform.
  • Figure 1 is a schematic diagram of a hidden node provided by an embodiment of the present application.
  • Figure 2 is a schematic diagram of neighbor node division provided by an embodiment of the present application.
  • Figure 3 is a schematic diagram of a communication system provided by an embodiment of the present application.
  • Figure 4 is a schematic diagram of a Wi-Fi communication system provided by an embodiment of the present application.
  • Figure 5 is a schematic flow chart of a channel access method provided by an embodiment of the present application.
  • Figure 6a is a schematic structural diagram of a neural network provided by an embodiment of the present application.
  • FIG. 6b is a schematic diagram of the training framework of a Deep Q Network (Deep Q Network, DQN) provided by the embodiment of this application;
  • DQN Deep Q Network
  • Figure 6c is a method of carrying neighbor node information provided by an embodiment of the present application.
  • Figure 6d is a method of carrying neighbor node information provided by an embodiment of the present application.
  • Figure 6e is a schematic diagram of a network topology provided by an embodiment of the present application.
  • Figure 6f is a schematic diagram comparing throughput and delay provided by an embodiment of the present application.
  • Figure 7a is a schematic flow chart of a channel access method provided by an embodiment of the present application.
  • Figure 7b is a schematic flow chart of a channel access method provided by an embodiment of the present application.
  • Figure 8a is a schematic flow chart of a channel access method provided by an embodiment of the present application.
  • Figure 8b is a schematic flow chart of a channel access method provided by an embodiment of the present application.
  • Figure 9 is a schematic diagram of a reporting process of neural network parameters provided by an embodiment of the present application.
  • 10 to 12 are schematic structural diagrams of a communication device provided by embodiments of the present application.
  • an embodiment means that a particular feature, structure or characteristic described in connection with the embodiment may be included in at least one embodiment of the present application.
  • the appearances of this phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Those skilled in the art will understand, both explicitly and implicitly, that the embodiments described herein may be combined with other embodiments.
  • At least one (item) means one or more
  • plural means two or more
  • at least two (items) means two or three and three
  • “and/or” is used to describe the relationship between associated objects, indicating that there can be three relationships.
  • a and/or B can mean: only A exists, only B exists, and A and B exist simultaneously. In this case, A and B can be singular or plural.
  • the character “/” generally indicates that the related objects are in an "or” relationship.
  • At least one of the following” or similar expressions refers to any combination of these items.
  • at least one of a, b or c can mean: a, b, c, "a and b", “a and c", “b and c", or "a and b and c" ".
  • two network nodes cannot detect each other's presence when performing carrier sensing to determine whether the channel is idle, but the two network nodes send messages to the receiving node at the same time. If data conflicts occur, resulting in transmission failure, the two network nodes are each other's hidden nodes relative to the receiving node.
  • STA1 and STA2 cannot detect each other's presence, so STA1 and STA2 may send data to the AP at the same time, causing a conflict.
  • the hidden node problem occurs because the idle channel detected by the node is not really idle, which leads to erroneous access behavior.
  • This application classifies the neighbor nodes of a network node into first type neighbor nodes and second type neighbor nodes. It can be understood that the division of the second type neighbor nodes requires a designated receiving node.
  • the first type of neighbor nodes includes neighbor nodes that can be heard by the network node
  • the second type of neighbor nodes includes neighbor nodes that cannot be heard by the network node and neighbor nodes that can be heard by the receiving node. It can be understood that the If the network node and the second type neighbor node send packets to the receiving node at the same time, it will cause a conflict.
  • all nodes included in the first type neighbor node list are first type neighbor nodes
  • all nodes included in the second type neighbor node list are second type neighbor nodes.
  • the classification of neighbor nodes mentioned in the embodiment of the present application is illustrated below with reference to Figure 2.
  • the two circles can respectively represent a set of the first type of neighbor nodes of the first network node (which can also be called the first type of neighbor nodes of the first network node).
  • For a communication link composed of a first network node and a second network node if the first network node sends a data packet to the second network node, then the second network node is in the first type of neighbor node set, but is not in the first network.
  • Neighbor nodes in the first type of neighbor node set of a node are nodes that cannot be heard by the first network node, but at the same time sending packets will cause the first network node to fail to send packets to the second network node, that is, the first network node is relative to A second type of neighbor node of the second network node.
  • the neighbor nodes that are in the first type neighbor node set of the first network node but are not in the first type neighbor node set of the second network node are A node that cannot be heard by the second network node, but which simultaneously sends packets that causes the second network node to fail to send packets to the first network node, is a second type of neighbor node of the second network node relative to the first network node.
  • the neighbor node classification of the sending node is related to the receiving node, which means that the sending node may have different second-type neighbor node lists (or called second-type neighbor node sets) for different receiving nodes.
  • the AP can send data to multiple STAs, and the STA only sends data to the AP. Therefore, the AP needs to maintain the second type neighbor node list for each associated STA, and the STA only needs to maintain the second type neighbor node list for the AP. List of neighbor-like nodes.
  • the method provided by the embodiment of the present application can be applied to Wi-Fi, cellular, Device to Device (D2D) and other communication systems.
  • the communication system includes a first network node and a second network node.
  • the technical solution of the present application can be applied to data transmission between one node and one or more nodes.
  • data transmission between one node and one node is only an example.
  • the method provided by the embodiment of this application is suitable for uplink/downlink transmission of a single user, multiple User's uplink/downlink transmission is also applicable to D2D transmission.
  • Nodes in the network have artificial intelligence (AI) capabilities and can use neural networks to make decisions on channel access behaviors.
  • nodes in the network can also train neural networks.
  • AI artificial intelligence
  • the network node in the embodiment of the present application may be a device with wireless transceiver function, such as a terminal device.
  • the terminal equipment can also be called user equipment (UE), access terminal, terminal, subscriber unit, user station, mobile station, remote station, remote terminal, mobile device, user terminal , user agent or user device, etc.
  • UE user equipment
  • the terminal device can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; it can also be deployed on water (such as a ship, etc.).
  • the terminal device may be a handheld device with wireless communication function, a vehicle-mounted device, a wearable device, a sensor, a terminal in the Internet of Things, a terminal in the Internet of Vehicles, a drone, a fifth-generation ( 5th generation (5G) network and any form of terminal equipment in future networks, etc., the embodiments of this application are not limited to this.
  • 5G fifth-generation
  • terminal devices shown in the embodiments of this application can also communicate through device-to-device (D2D), machine-to-machine (M2M), etc.
  • D2D device-to-device
  • M2M machine-to-machine
  • the terminal device shown in the embodiment of this application can also be a device in the Internet of Things (IoT), etc.
  • the IoT network may include, for example, the Internet of Vehicles.
  • vehicle to X vehicle to X
  • V2X vehicle to X
  • X can represent anything).
  • the V2X can include: vehicle to vehicle (vehicle to vehicle, V2V) communication.
  • the network node in the embodiment of the present application can also provide wireless access services for terminal devices, schedule wireless resources for accessed terminal devices, and provide reliable wireless transmission protocols and data encryption protocols, etc.
  • evolutionary base station evolutional NodeB, eNB
  • next generation node B next generation node B, gNB
  • the method provided by the embodiment of this application can also be applied to the system architecture diagram shown in Figure 4.
  • the system architecture includes at least two WLAN devices (in Figure 4, one AP and three STAs are taken as an example).
  • the WLAN device can support the WLAN communication protocol.
  • the device that implements the method of this application may be a PCP/AP or STA in the WLAN, or a chip or processing system installed in the PCP/AP or STA.
  • PCP/AP is a device with wireless communication functions that supports communication using WLAN protocols and has the function of communicating with other devices in the WLAN network (such as sites or other access points). Of course, it can also have the function of communicating with other devices. Function.
  • an access point may be called an access point station (AP STA).
  • the device with wireless communication function can be a complete device, or it can be a chip or processing system installed in the complete device. The devices equipped with these chips or processing systems can be controlled by the chip or processing system. Methods and functions of the embodiments of this application.
  • the PCP/AP in the embodiment of this application is a device that provides services for STA and can support the 802.11 series protocols.
  • AP can be communication entities such as communication servers, routers, switches, and bridges;
  • PCP/AP can include various forms of macro base stations, micro base stations, relay stations, etc.
  • PCP/AP can also be among these various forms of equipment. chips and processing systems to implement the methods and functions of the embodiments of this application.
  • the station STA is a device with wireless communication functions that supports communication using the WLAN protocol and has the ability to communicate with other stations or access points in the WLAN network.
  • a station may be called a non-access point station (non-AP STA).
  • STA is any user communication device that allows users to communicate with PCP/AP and then communicate with WLAN.
  • the device can be a complete device, or it can be a chip or processing system installed in the complete device. These chips are installed or processing system equipment may be under the control of the chip or processing system, Implement the methods and functions of the embodiments of this application.
  • STA can be a tablet computer, desktop, laptop, notebook computer, ultra-mobile personal computer (UMPC), handheld computer, netbook, personal digital assistant (Personal Digital Assistant, PDA), mobile phone, etc.
  • User equipment that can be connected to the Internet, or IoT nodes in the Internet of Things, or in-vehicle communication devices or entertainment equipment, game equipment or systems, global positioning system equipment, etc. in the Internet of Vehicles.
  • STA can also be chips in these terminals or processing system.
  • the first network node in this embodiment of the present application may be an AP in the system shown in Figure 4, and the second network node may be an STA in the system shown in Figure 4; or, the first network node may be an AP in the system shown in Figure 4.
  • the second network node may be an AP in the system shown in Figure 4.
  • FIG. 5 is a schematic flowchart of a channel access method provided by an embodiment of the present application. This channel access method can be applied to the communication system as shown in Figure 3 or Figure 4. As shown in Figure 5, the method includes but is not limited to the following steps:
  • the input information is based on the historical channel access information of at least one first neighbor node of the first network node and the first network node.
  • a network node is determined by the historical channel access information of at least one second neighbor node of a second network node, the first neighbor node is a node that the first network node can listen to, and the second neighbor node The node is a node that can be heard by the second network node but cannot be heard by the first network node.
  • neighbor nodes of the first network node are classified, the at least one first neighbor node constitutes a category, each first neighbor node is a first type neighbor node, and the at least one first neighbor node constitutes a third category.
  • the at least one second neighbor node constitutes another category, each second neighbor node is a second category neighbor node, and the at least one second neighbor node constitutes a second category neighbor node list (or called a second category neighbor node set). .
  • the first neighbor node is a node that can be heard by the first network node when performing carrier sensing
  • the second neighbor node is a node that cannot be heard by the first network node when performing carrier sensing
  • the second network node The node that can be heard during carrier sensing, that is, for the first network node, the second neighbor node is a hidden node. If the first network node and the second neighbor node send data packets to the second network node at the same time, This will result in packet loss.
  • the second network node may be a receiving node of the first network node.
  • the method may be based on the historical channel access information of the at least one first neighbor node, the historical channel access information of the at least one second neighbor node, and the historical channel access information of the first network node. and historical carrier sensing results of the first network node to determine the input information.
  • the carrier sensing result may be the signal strength value obtained by measuring the channel, or the carrier sensing result may be the idle or busy status of the sensed channel, which is not limited in this application.
  • the historical channel access information of the first neighbor node includes one or more of the historical channel access behavior of the first neighbor node, the historical data transmission result of the first neighbor node, or the first interval time, and the first neighbor node
  • the interval time is the interval between the reference time corresponding to the input information and the last successful transmission of the first neighbor node. It can be understood that the first neighbor node
  • the historical channel access behavior may include the channel access behavior of the first neighbor node.
  • the historical data transmission results of the first neighbor node can be understood as the data transmission results after the first neighbor node accesses the channel.
  • the first interval can be understood as the interval between the reference time corresponding to the input information and the most recent successful transmission time of the first neighbor node. It should be noted that the most recent successful transmission of the first neighbor node can be the at least one Transmissions from any of the first neighbor nodes.
  • the historical channel access information of the second neighbor node includes one or more of the historical channel access behavior of the second neighbor node, the historical data transmission results of the second neighbor node, or the second interval time.
  • the second interval time It is the interval between the reference time corresponding to the input information and the last successful transmission of the second neighbor node. It can be understood that the historical channel access behavior of the second neighbor node may include the channel access behavior of the second neighbor node.
  • the historical data transmission result of the second neighbor node can be understood as the data transmission result after the second neighbor node accesses the channel.
  • the second interval can be understood as the interval between the reference time corresponding to the input information and the most recent successful transmission time of the second neighbor node. It should be noted that the most recent successful transmission of the second neighbor node can be the at least one Transmissions from any of the second neighbor nodes.
  • the historical channel access information of the first network node includes one or more of the historical channel access behavior of the first network node, the historical data transmission results of the first network node, or a third interval time.
  • the third interval time It is the interval between the reference time corresponding to the input information and the last successful transmission of the first network node.
  • the historical channel access behavior of the first network node may include the behavior of the first network node accessing the channel or the behavior of not accessing the channel.
  • the historical data transmission results of the first network node can be understood as the data transmission results after the first network node accesses the channel.
  • the reference time corresponding to the above input information can be understood as the time when the state corresponding to the input information is transferred to the next state, and the next state corresponds to the new input information.
  • the time may include whether the first network node decides whether The time of accessing the channel, or the time when the first network node listens to the acknowledgment (ACK) for the first neighbor node, or the time when the first network node listens to the ACK for the second neighbor node.
  • ACK acknowledgment
  • the time corresponding to the input information can also be understood as other times, such as the time when the input information is generated, etc., which is not limited in this application.
  • the input information is where a t is the access behavior of the first network node, ACK t is the data transmission result of the first network node access channel, It is the access behavior of the first type of neighbor node, that is, the access behavior of the at least one first neighbor node. For example, if any one or more first neighbor nodes in the at least one first neighbor node access the channel, then the is 1. It is the data transmission result of the first type of neighbor node, that is, the data transmission result of the at least one first neighbor node. For example, if one or more first neighbor nodes among the at least one first neighbor node access the channel and successfully transmit data , then the is 1.
  • the access behavior of the second type of neighbor node that is, the access behavior of the at least one second neighbor node. For example, if the at least one second neighbor node accesses the channel, then the is 1, is the data transmission result of the second type of neighbor node, that is, the data transmission result of the at least one second neighbor node, for example, if one or more second neighbor nodes among the at least one second neighbor node access the channel and successfully transmit data , then the is 1.
  • o t can be busy or idle for the channel, is the time interval between the reference time corresponding to s t and the last successful transmission of the first network node, is the time interval between the reference time corresponding to s t and the last successful transmission of the first type neighbor node, is the time interval between the reference time corresponding to s t and the last successful transmission of the second type node.
  • a t ,ACK t in the input information can be obtained according to the historical packet sending behavior of the first network node, o t can be obtained according to the historical carrier sensing results, The determination may be based on the ACK for the first type of neighbor node (ie, the at least one first neighbor node) or the ACK of the second type of neighbor node (ie, the at least one second neighbor node) on the historically monitored channel.
  • a s t can be understood as a state when the first network node makes a channel access decision, or when the When a network node listens to the ACK of the first type neighbor node, or when the first network node detects the ACK of the second type neighbor node, it will perform a state transfer and transfer to s t+1 , s t+1 and s At least one parameter in t is different. For example, over time, a sequence of states will be obtained.
  • the channel status is detected.
  • the input information s t is input into the neural network to obtain the output result, and based on the output result Determine the channel access behavior, which includes accessing the channel or not accessing the channel.
  • the structure of the neural network can be shown in Figure 6a.
  • the input of the neural network is s t , and then passes through a layer of GRU with 32 neurons, two layers of FC with 32 neurons, and the activation function is ReLU. Finally, the output is connected
  • the GRU layer can also be replaced by RNN, LSTM and their variants. If the Q value of the access channel is greater than the Q value of the non-access channel, the channel is accessed, otherwise the channel is not accessed.
  • DQN is an online learning method, that is, learning (training) while exploring (reasoning) until the neural network parameters converge.
  • the node obtains the input information s t from the wireless environment, sends it to the neural network for reasoning, determines the node's access behavior a t+1 , and then determines the reward r t based on the result of the behavior, which is used to train the neural network.
  • This access behavior will cause the environmental state to change, recorded as s t+1 .
  • r t -(N ON +N TN )
  • N ON is the number of first-type neighbor nodes, that is, the number of the above-mentioned at least one first neighbor node
  • N TN is the number of second-type neighbor nodes, that is, the number of the above-mentioned second neighbor nodes.
  • DQN is trained based on the obtained experience e t .
  • the training process of DQN can adopt the network framework shown in Figure 6b.
  • the network framework includes the target Q network (target network) and the prediction Q network (prediction network).
  • the loss function of DQN is:
  • r t represents reward
  • ⁇ discount factor (discount factor)
  • ⁇ 0.9
  • e t represents experience
  • B batch (batch)
  • BS batch size (batch size)
  • Q (s, a; ⁇ - ) represents the output of the target Q network
  • ⁇ - is the parameter of the target Q network
  • Q(s,a; ⁇ ) represents the output of the predicted Q network
  • ⁇ is the parameter of the predicted Q network.
  • each node in the network can respectively correspond to a neural network.
  • the first network node corresponds to a neural network, and the neural network is trained. , when making a decision on whether the first network node accesses the channel, the input information is input into the neural network corresponding to the first network node to make the decision.
  • the second network node corresponds to another neural network.
  • the structures of the neural networks corresponding to different nodes can be the same, and the parameters of the neural networks can be the same or different.
  • the neighbor nodes of the first network node are classified.
  • One category is that the first network node can At least one first neighbor node that can be heard, and another category is at least one second neighbor node that the first network node cannot hear and the second network node can hear.
  • the input information input to the neural network is determined by the The historical channel access information of the two categories is determined respectively, thereby improving the accuracy of the channel access behavior determined by the network node and improving the MAC performance.
  • RTS/CTS-assisted CSMA/CA means that STA uses the CSMA/CA mechanism to compete for the channel and sends an RTS (Request To Send) request at the end of the backoff. After receiving the RTS, the AP broadcasts CTS (Clear To Send) to clear the channel for the STA.
  • the AP can directly send the CTS packet at the end of the backoff to provide itself with an interference-free sending environment to solve the problem of inconsistent access behavior caused by the presence of hidden nodes. Exact question.
  • the four downlinks AP0->STA0, AP1->STA1, AP2->STA2, and AP3->STA3 work on the same channel, and AP0-AP4 are all saturated Poisson services.
  • the classification of neighbor nodes of AP0-AP4 is shown as a circle in the figure.
  • the neighbor nodes inside the circle are the first type of neighbor nodes, and the neighbor nodes outside the circle are the second type neighbor nodes.
  • AP1, AP3, and STA0-3 are the first type neighbor nodes of AP0
  • AP2 is the second type neighbor node of AP0.
  • the Probability-Delay simulation diagram in Figure 6f is a comparison diagram of the cumulative distribution function (CDF) of the average delay of the entire network using the technical solution of this application and the technical solution using RTS/CTS-assisted CSMA/CA. , it can be seen from the figure that the maximum delay can be significantly reduced by adopting the technical solution of this application.
  • the throughput-time simulation diagram in Figure 6f is a comparison diagram of the throughput of the entire network using the technical solution of the present application and the technical solution of RTS/CTS-assisted CSMA/CA. It can be seen from the figure that the technical solution of the present application can Significantly improve network throughput.
  • Figure 7a is a schematic flowchart of a channel access method provided by an embodiment of the present application.
  • the second network node determines the second type of neighbor nodes of the first network node relative to the second network node, as shown in Figure 7a.
  • the method includes but is not limited to the following steps:
  • the first network node determines at least one first neighbor node of the first network node.
  • the second network node determines at least one third neighbor node of the second network node.
  • the first network node and the second network node may each determine their own first-type neighbor nodes, which may also be referred to as determining respective first-type neighbor node lists.
  • the at least one first neighbor node is a first-type neighbor node of the first network node, that is, the first neighbor node is a node that the first network node can listen to.
  • the first-type neighbor node list of the first network node may include The MAC addresses of all other nodes that the first network node can listen to are the node identifiers of the at least one first neighbor node.
  • the at least one third neighbor node is a first-type neighbor node of the second network node, that is, the second neighbor node is a node that the second network node can listen to.
  • the first-type neighbor node list of the second network node may include The MAC addresses of all other nodes that the second network node can listen to are the node identifiers of the at least one third neighbor node. It can be understood that the at least one first neighbor node in this application may or may not include a second network node, which is not limited in this application. Similarly, at least one third neighbor node may also include the first network node, or may not include the first network node.
  • the first network node sends the node identifier of at least one first neighbor node to the second network node.
  • the second network node determines at least one second neighbor node and at least one fourth neighbor node based on at least one first neighbor node and at least one third neighbor node.
  • the second network node sends the node identifier of at least one second neighbor node to the first network node.
  • the node identifier of the node may be the MAC address of the node, and the first network node lists the determined first type neighbor nodes.
  • the table i.e., the node identification of at least one first neighbor node
  • the second network node determines the second type of neighbor node list (i.e., at least one second neighbor node) of the first network node relative to the second network node. the identity of the neighbor node).
  • the second network node may also determine a second type of neighbor node list (ie, the node identifier of at least one fourth neighbor node) of the second network node relative to the first network node.
  • the second neighbor node is a node that cannot be heard by the first network node and can be heard by the second network node.
  • the fourth neighbor node is a node that cannot be heard by the second network node and can be heard by the first network node.
  • the second network node After the second network node determines the second type of neighbor node list (ie, the node identifier of at least one second neighbor node) of the first network node relative to the second network node, the second network node adds the second type of neighbor node list (That is, the node identifier of at least one second neighbor node) is sent to the first network node.
  • the second type of neighbor node list ie, the node identifier of at least one second neighbor node
  • Two exemplary ways of carrying neighbor node information are given below. It can be understood that these two examples are only examples and do not constitute a limitation on the present application. It should be noted that these two ways of carrying neighbor node information may be applicable to the scenario where the first network node reports the first type of neighbor node list to the second network node, and is also applicable to the scenario where the second network node sends the list of neighbor nodes to the first network node. A scenario of a second type neighbor node list of a first network node relative to a second network node.
  • a new information element IE can be defined to carry neighbor node information.
  • the neighbor node information can include the type of neighbor node (first type or second type). class), the number of neighbor nodes, and the MAC address of each neighbor node. It is understood that this new information element can be used for broadcast or unicast.
  • the neighbor node information can also be carried in the A-control subfield in the HT control field.
  • the neighbor node information can include the type of the neighbor node (first type or Category 2), the number of neighbor nodes, and the MAC address of each neighbor node. It can be understood that this neighbor node information carrying method can be applied to unicast.
  • the first network node may send the node identifier of the at least one first neighbor node to the second network node when requesting to obtain the first type neighbor node list of the first network node. the second network node.
  • the first network node receives a first request frame sent by the second network node.
  • the first request frame is used to request to obtain at least one first neighbor node of the first network node.
  • the first network node receives the first request frame according to the first network node.
  • the first request frame sends the node identification of the at least one first neighbor node to the second network node.
  • the second network node is an AP and the first network node is an STA.
  • the AP sends a first request frame to request to obtain the first type of neighbor node of the STA (which may also be called the first type of neighbor node list).
  • a request frame can be sent by broadcast to all associated STAs, or it can be sent by unicast to a specific STA. It is understandable that in some scenarios, it can also be sent by multicast.
  • the STA sends the determined first-type neighbor node list to the AP, where the list includes the node identifier of at least one first neighbor node. It can be understood that if the first request frame is a broadcast frame, each STA reports its own first-type neighbor node list.
  • the STA that receives the first request frame reports its own A list of first-class neighbor nodes.
  • the AP can determine the AP based on its own first-type neighbor node list (including the node identifier of at least one third neighbor node) and the STA's first-type neighbor node list (including the node identifier of at least one first neighbor node).
  • the second type neighbor node list relative to the STA, and the second type neighbor node list of the STA relative to the AP The AP sends the corresponding second type neighbor node list to the STA, which contains the node identifier of at least one second neighbor node.
  • the AP can broadcast and send a response frame, where the response frame includes a list of second-type neighbor nodes corresponding to all STAs relative to the AP. It is understandable that the AP can also unicast the response frame to the corresponding STA.
  • the first network node may also actively send the first type of neighbor node list of the first network node to the second network node.
  • the first type of neighbor node list includes at least one node of first neighbor node Click logo.
  • the first network node sends a second request frame to the second network node, the second request frame is used to request to obtain a second type of neighbor node list of the first network node relative to the second network node, wherein , the second request frame includes a first-type neighbor node list of the first network node, and the first-type neighbor node list includes a node identifier of at least one first neighbor node.
  • the second network node is an STA and the first network node is an AP.
  • the AP sends a second request frame to request the second type neighbor node list of the AP relative to the STA.
  • the second request frame also carries the AP's third type of neighbor node list.
  • the first type of neighbor node list includes at least one first neighbor node of the AP.
  • the second request frame may be broadcast to all associated STAs or unicast to a specific STA. It is understandable that in some scenarios it can also be sent in a multicast manner.
  • the STA that receives the second request frame can obtain the AP's second-type neighbor node list relative to the STA based on the AP's first-type neighbor node list carried in the second request frame and the STA's own first-type neighbor node list.
  • the second type neighbor node list of the STA relative to the AP where the second type neighbor node list of the AP relative to the STA includes the node identifier of at least one second neighbor node, and the second type neighbor node list of the STA relative to the AP includes at least one The node ID of the fourth neighbor node.
  • the STA sends the second type neighbor node list of the AP relative to the STA to the AP.
  • the first network node determines input information based on historical channel access information of at least one first neighbor node and historical channel access information of at least one second neighbor node.
  • the first network node When detecting that the channel is idle, the first network node inputs the input information into the neural network to obtain an output result.
  • the first network node when the first network node has data sent to the second network node, it is detected whether the channel is idle. If the channel is idle, the input information is input into the neural network to obtain the output result. It can be understood that the neural network in step 207 may be the neural network corresponding to the first network node.
  • the first network node determines the channel access behavior according to the output result.
  • the second network node determines input information based on historical channel access information of at least one third neighbor node and historical channel access information of at least one fourth neighbor node.
  • step 209 and the input information in step 206 may be different or the same.
  • the second network node When detecting that the channel is idle, the second network node inputs the input information into the neural network to obtain an output result.
  • the second network node when the second network node has data sent to the first network node, it is detected whether the channel is idle. If the channel is idle, the input information is input into the neural network to obtain the output result. It can be understood that the neural network in step 210 may be a neural network corresponding to the second network node.
  • the second network node determines the channel access behavior according to the output result.
  • each node in the network can obtain each node's own first-type neighbor node list and its own second-type neighbor node list for all possible receiving nodes.
  • Each node can obtain input information based on the first type neighbor node list and the second type neighbor node list, and when there is data sent to the receiving node, input the input information into the neural network to make channel access decisions.
  • the specific process can be referred to the above. The description of the embodiment will not be repeated here.
  • Figure 7b is a schematic flowchart of a channel access method provided by an embodiment of the present application.
  • the first network node determines the second type of neighbor nodes of the first network node relative to the second network node.
  • the method includes but is not limited to the following steps:
  • the first network node determines at least one first neighbor node of the first network node.
  • the second network node determines at least one third neighbor node of the second network node.
  • steps 301-302 in the embodiment of this application reference can be made to steps 201 and 202 of the embodiment in Figure 7a, which will not be described again here.
  • the second network node sends the node identifier of at least one third neighbor node to the first network node.
  • the first network node determines at least one second neighbor node and at least one fourth neighbor node based on at least one first neighbor node and at least one third neighbor node.
  • the first network node sends the node identifier of at least one fourth neighbor node to the second network node.
  • the second network node may send the determined first type neighbor node list of the second network node to the first network node, where the first type neighbor node list of the second network node includes the node identifier of at least one third neighbor node.
  • the first network node may determine a second type neighbor node list of the first network node relative to the second network node based on the first type neighbor node list of the first network node and the first neighbor node list of the second network node, and the A second type neighbor node list of the second network node relative to the first network node.
  • the second type neighbor node list of the first network node relative to the second network node includes a node identifier of at least one second neighbor node, and the second type neighbor node list of the second network node relative to the first network node includes at least one fourth The node ID of the neighbor node.
  • the first network node may send a second type neighbor node list of the second network node relative to the first network node to the second network node.
  • the neighbor node information can be carried in the manner of Figure 6c or Figure 6d.
  • the first network node may send a third request frame to the second network node to request to obtain the first type neighbor node list of the second network node, that is, to obtain at least one of the second network node's neighbor node lists.
  • the node ID of the third neighbor node may be used to obtain the first type neighbor node list of the second network node, that is, to obtain at least one of the second network node's neighbor node lists.
  • the first network node is an AP and the second network node is an STA.
  • the AP sends a third request frame to request to obtain the first type neighbor node list of the STA.
  • the third request frame may be broadcast to all associated nodes.
  • STA can also send unicast to a specific STA. It is understandable that in some scenarios, it can also be sent by multicast.
  • the STA sends the determined first-type neighbor node list to the AP, where the list includes the node identifier of at least one third neighbor node. It can be understood that if the third request frame is a broadcast frame, each STA reports its own first-type neighbor node list.
  • the STA that receives the third request frame reports its own A list of first-class neighbor nodes.
  • the AP can determine the AP based on its own first-type neighbor node list (including the node identifier of at least one first neighbor node) and the STA's first-type neighbor node list (including the node identifier of at least one third neighbor node).
  • the second type neighbor node list relative to the STA, and the second type neighbor node list of the STA relative to the AP The AP sends the corresponding second type neighbor node list to the STA, which contains the node identifier of at least one fourth neighbor node.
  • the AP can broadcast and send a response frame, where the response frame includes a list of second-type neighbor nodes corresponding to all STAs relative to the AP. It is understandable that the AP can also unicast the response frame to the corresponding STA.
  • the first network node determines input information based on historical channel access information of at least one first neighbor node and historical channel access information of at least one second neighbor node.
  • the first network node When detecting that the channel is idle, the first network node inputs the input information into the neural network to obtain the output result.
  • the neural network in step 307 may be the neural network corresponding to the first network node.
  • the first network node determines the channel access behavior according to the output result.
  • the second network node determines input information based on historical channel access information of at least one third neighbor node and historical channel access information of at least one fourth neighbor node.
  • step 309 and the input information in step 306 may be different or the same.
  • the second network node When detecting that the channel is idle, the second network node inputs the input information into the neural network to obtain an output result.
  • the second network node when the second network node has data sent to the first network node, it is detected whether the channel is idle. If the channel is idle, the input information is input into the neural network to obtain the output result. It can be understood that the neural network in step 210 may be a neural network corresponding to the second network node.
  • the second network node determines the channel access behavior according to the output result.
  • each node in the network can obtain each node's own first-type neighbor node list and its own second-type neighbor node list for all possible receiving nodes.
  • Each node can obtain input information based on the first type neighbor node list and the second type neighbor node list, and when there is data sent to the receiving node, input the input information into the neural network to make channel access decisions.
  • the specific process can be referred to the above. The description of the embodiment will not be repeated here.
  • Figure 8a is a schematic flowchart of a channel access method provided by an embodiment of the present application.
  • the method includes but is not limited to the following steps. It can be understood that the sequence number of each step does not indicate the execution order of each step.
  • Step 1 Obtain a first-type neighbor node list of the AP.
  • the neighbor nodes in the first-type neighbor node list are nodes that the AP can listen to.
  • Step 2 Obtain the first-type neighbor node list of STA i.
  • the neighbor nodes in the first-type neighbor node list are nodes that STA i can listen to.
  • Step 3 The AP requests the first type neighbor node list of STA i. For example, it may request the first type neighbor node list of STA i through a request frame.
  • the request frame may be sent in a broadcast or unicast manner.
  • Step 4 STA i reports the first type neighbor node list of STA i to the AP.
  • Step 5 Obtain the second-type neighbor node list of AP and STA i based on the first-type neighbor node list of AP and STA i.
  • the second type neighbor node list of AP and the first type neighbor node list of STA i obtain the second type neighbor node list of AP relative to STA i and the second type neighbor node list of STA i relative to AP. list.
  • Step 6 The AP delivers the second type neighbor node list of STA i.
  • the AP can deliver the second type neighbor node list of STA i through broadcast or unicast.
  • the second type neighbor node list can be the second type neighbor node list of STA i relative to the AP.
  • the second type neighbor node list can be The nodes in the neighbor node list are nodes that cannot be monitored by STA i and can be monitored by the AP.
  • Step 7 The AP obtains input information based on the neighbor list and makes channel access decisions.
  • the AP can obtain input information based on the AP's first-type neighbor node list and second-type neighbor node list, and input it into the neural network for decision-making.
  • Step 8 STA i obtains input information based on the neighbor list and makes channel access decisions.
  • STA i can obtain input information based on STA i's first-type neighbor node list and second-type neighbor node list, and input it into the neural network for decision-making.
  • Figure 8b is a schematic flowchart of a channel access method provided by an embodiment of the present application.
  • the method includes but is not limited to the following steps. It can be understood that the sequence number of each step does not indicate the execution order of each step.
  • Step 1 Obtain a first-type neighbor node list of the AP.
  • the neighbor nodes in the first-type neighbor node list are nodes that the AP can listen to.
  • Step 2 Obtain the first type neighbor node list of STA i.
  • the neighbor nodes in the first type neighbor node list are STA Nodes that i can listen to.
  • Step 3 Deliver the AP's first-type neighbor node list and request the AP's second-type neighbor node list.
  • the AP sends a request frame.
  • the request frame is used to request to obtain the AP's second-type neighbor node list relative to STA i.
  • the request frame also includes the AP's first-type neighbor node list.
  • the first-type neighbor node list is what the AP can detect. Hearing node.
  • Step 4 STA i obtains the second-type neighbor node list of AP and STA i based on the first-type neighbor node list of AP and STA i.
  • the second type neighbor node list of AP and the first type neighbor node list of STA i obtain the second type neighbor node list of AP relative to STA i and the second type neighbor node list of STA i relative to AP. list.
  • Step 5 STA i reports the second type neighbor node list of the AP.
  • Step 6 The AP obtains input information based on the neighbor list and makes channel access decisions.
  • the AP can obtain input information based on the AP's first-type neighbor node list and second-type neighbor node list, and input it into the neural network for decision-making.
  • Step 7 STA i obtains input information based on the neighbor list and makes channel access decisions.
  • STA i can obtain input information based on STA i's first-type neighbor node list and second-type neighbor node list, and input it into the neural network for decision-making.
  • Figure 9 is a schematic diagram of a reporting process of neural network parameters provided by an embodiment of the present application.
  • the second network node trains a neural network for the first network node.
  • the method includes but is not limited to the following steps:
  • the first network node determines at least one first neighbor node and at least one second neighbor node of the first network node.
  • the first network node determines input information based on historical channel access information of at least one first neighbor node and historical channel access information of at least one second neighbor node.
  • the first network node sends at least one of input information or channel access behavior to the second network node.
  • the second network node trains the neural network based on the information reported by the first network node.
  • the second network node sends the network parameters to the first network node.
  • the first network node updates the parameters of the neural network according to the network parameters.
  • nodes with strong capabilities in the network have AI training capabilities
  • other nodes such as STAs or terminals
  • nodes that do not support neural network online training can have nodes that support neural network online training perform neural network training for them.
  • the following uses the first network node that does not support online neural network training, and the second network node that supports neural network training as an example. It is understandable that the second network node does not support online neural network training, and the first network node supports neural network. Training, there is no limit to this.
  • the specific method of determining the reward may refer to the description of the foregoing embodiments, and will not be described again here.
  • the first network node may report at least one of s t , a t+1 , r t , and s t+1 to the second network node.
  • the first network node may report at least one of the input information s t or the decided channel access behavior to the second network node.
  • the first network node may also report the reward rt to the third network node.
  • the second network node uses the information reported by the first network node to train the neural network corresponding to the first network node to obtain updated neural network parameters.
  • the updated neural network parameters may be parameters of the predicted Q network.
  • the second network node sends the updated network parameters to the first network node, and the first network node uses the updated network parameters to The neural network updates parameters, so that the updated neural network is subsequently used to make channel access decisions.
  • the first network node is an STA.
  • the STA reports at least one of input information, channel access behavior or rewards to the AP.
  • the AP uses the information reported by one or more STAs to train the corresponding neural network, and then uses the corresponding neural network.
  • the neural network parameters are sent to STA. This information can be reported to neighbors - the neural network parameter distribution process may be carried out multiple times until the neural network parameters converge.
  • This application divides the communication device into functional modules according to the above method embodiments.
  • each functional module can be divided corresponding to each function, or two or more functions can be integrated into one processing module.
  • the above integrated modules can be implemented in the form of hardware or software function modules. It should be noted that the division of modules in this application is schematic and is only a logical function division. In actual implementation, there may be other division methods.
  • the communication device according to the embodiment of the present application will be described in detail below with reference to FIGS. 10 to 12 .
  • FIG 10 is a schematic structural diagram of a communication device provided by an embodiment of the present application.
  • the communication device 1000 includes a processing unit 1200 and a transceiver unit 1100.
  • the communication device 1000 may be the first network node shown above or a chip in the first network node, or the like. That is, the communication device 1000 can be used to perform the steps or functions performed by the first network node in the above method embodiment.
  • the processing unit 1200 is configured to input input information into the neural network to obtain an output result when an idle channel is detected, where the input information is based on the history of at least one first neighbor node of the first network node.
  • the channel access information and the historical channel access information of at least one second neighbor node of the first network node relative to the second network node are determined, and the first neighbor node is one that the first network node can listen to. node, the second neighbor node is a node that the second network node can listen to, and the first network node cannot listen to;
  • the processing unit 1200 is also configured to determine channel access behavior according to the output result.
  • the processing unit 1200 is specifically configured to input the input information into the neural network to obtain an output result when it is detected that the channel is idle and the first network node has data to be sent to the second network node. .
  • the processing unit 1200 is further configured to perform the processing according to the historical channel access information of the at least one first neighbor node, the historical channel access information of the at least one second neighbor node, and the historical channel access information of the first network node.
  • Channel access information and historical carrier sensing results of the first network node are used to determine the input information.
  • the historical channel access information of the first neighbor node includes one of the historical channel access behavior of the first neighbor node, the historical data transmission result of the first neighbor node, or the first interval time, or Multiple items
  • the first interval time is the interval between the reference time corresponding to the input information and the last successful transmission of the first neighbor node
  • the historical channel access information of the second neighbor node includes one or more of the historical channel access behavior of the second neighbor node, the historical data transmission result of the second neighbor node, or the second interval time, so
  • the second interval time is the interval between the reference time corresponding to the input information and the last successful transmission of the second neighbor node;
  • the historical channel access information of the first network node includes one or more of the historical channel access behavior of the first network node, historical data transmission results of the first network node, or a third interval, so
  • the third interval time is an interval between the reference time corresponding to the input information and the last successful transmission of the first network node.
  • the processing unit 1200 is also configured to determine the at least one first neighbor node of the first network node;
  • Transceiver unit 1100 configured to send the node identification of the at least one first neighbor node to the second network node
  • the transceiver unit 1100 is further configured to receive the node identifier of the first network node relative to the at least one second neighbor node of the second network node sent by the second network node.
  • the transceiver unit 1100 is further configured to receive a first request frame sent by the second network node, where the first request frame is used to request acquisition of the at least one first neighbor node of the first network node. ;
  • the transceiver unit 1100 is specifically configured to send the node identifier of the at least one first neighbor node to the second network node according to the first request frame.
  • the transceiver unit 1100 is specifically configured to send a second request frame to the second network node.
  • the second request frame includes the node identification of the at least one first neighbor node.
  • the second request frame is The request is to obtain the at least one second neighbor node of the first network node relative to the second network node.
  • the processing unit 1200 is also configured to determine the at least one first neighbor node of the first network node;
  • the transceiver unit 1100 is also configured to receive the node identifier of at least one third neighbor node sent by the second network node, where the third neighbor node is a node that the second network node can listen to;
  • the processing unit 1200 is further configured to determine the at least one second neighbor node according to the at least one first neighbor node and the at least one third neighbor node.
  • the processing unit 1200 is further configured to determine, based on the at least one first neighbor node and the at least one third neighbor node, at least one fourth node of the second network node relative to the first network node. Neighbor nodes, the at least one fourth neighbor node is a node that cannot be heard by the second network node and can be heard by the first network node;
  • the transceiver unit 1100 is further configured to send the node identification of the at least one fourth neighbor node to the second network node.
  • the transceiver unit 1100 is further configured to send a third request frame to the second network node, where the third request frame is used to request acquisition of the at least one third neighbor node of the second network node.
  • the transceiver unit 1100 is further configured to receive a fourth request frame sent by the second network node, where the fourth request frame includes the at least one third neighbor node, and the fourth request frame is used to request Obtain the at least one fourth neighbor node of the second network node relative to the first network node.
  • the output result includes a first output value and a second output value, the first output value is used to indicate access to the channel, and the second output value is used to indicate not to access the channel;
  • the processing unit 1200 is specifically configured to determine an access channel when the first output value is greater than the second output value.
  • the transceiver unit 1100 is further configured to send at least one of the input information or the channel access behavior to the second network node;
  • the transceiver unit 1100 is also configured to receive network parameters sent by the second network node;
  • the processing unit 1200 is also configured to update parameters of the neural network according to the network parameters.
  • the first network node includes an access point AP
  • the second network node includes a station STA
  • the first network node includes an STA
  • the second network node includes an AP
  • transceiver unit and the processing unit shown in the embodiments of the present application are only examples.
  • specific functions or steps performed by the transceiver unit and the processing unit reference may be made to the above method embodiments, which will not be described in detail here.
  • the communication device according to the embodiment of the present application has been introduced above. Possible product forms of the communication device are introduced below. It should be understood that any form of product that has the functions of the communication device 1000 described above in FIG. 10 falls within the protection scope of the embodiments of the present application. It should also be understood that the following introduction is only an example, and does not limit the product form of the communication device in the embodiment of the present application to Here it is.
  • the processing unit 1200 shown in Figure 10 can be one or more processors, and the transceiver unit 1100 shown in Figure 10 can be a transceiver, or a transceiver.
  • the unit 1100 may also be a sending unit and a receiving unit, the sending unit may be a transmitter, and the receiving unit may be a receiver, and the sending unit and the receiving unit are integrated into one device, such as a transceiver.
  • the processor and the transceiver may be coupled, etc., and the embodiment of the present application does not limit the connection method between the processor and the transceiver.
  • the communication device 2000 includes one or more processors 2200 and a transceiver 2100.
  • the processor 2200 is used to input the input information into the neural network to obtain the output result when detecting that the channel is idle,
  • the input information is based on historical channel access information of at least one first neighbor node of the first network node and historical channel access information of the first network node relative to at least one second neighbor node of the second network node.
  • the information determines that the first neighbor node is a node that the first network node can hear, the second neighbor node is a node that the second network node can hear, and the first network node cannot
  • the intercepted node determines the channel access behavior according to the output result.
  • the transceiver 2100 is configured to receive messages from the second network node or send messages to the second network node.
  • transceiver 2100 and the processor 2200 reference can be made to the above method embodiments, and also to the description of the processing unit and the transceiver unit in Figure 10, which will not be described in detail here.
  • the transceiver may include a receiver and a transmitter.
  • the receiver is configured to perform a function (or operation) of receiving.
  • the transmitter is configured to perform a function (or operation) of transmitting. ). and transceivers for communication over transmission media and other equipment/devices.
  • the communication device 2000 may also include one or more memories 2300 for storing program instructions and/or data.
  • Memory 2300 and processor 2200 are coupled.
  • the coupling in the embodiment of this application is an indirect coupling or communication connection between devices, units or modules, which may be in electrical, mechanical or other forms, and is used for information interaction between devices, units or modules.
  • Processor 2200 may cooperate with memory 2300.
  • Processor 2200 can execute program instructions stored in memory 2300.
  • at least one of the above one or more memories may be included in the processor.
  • connection medium between the above-mentioned transceiver 2100, processor 2200 and memory 2300 is not limited in the embodiment of the present application.
  • the memory 2300, the processor 2200 and the transceiver 2100 are connected through a bus 2400 in Figure 11.
  • the bus is represented by a thick line in Figure 11.
  • the connection methods between other components are only schematically explained. , is not limited.
  • the bus can be divided into address bus, data bus, control bus, etc. For ease of presentation, only one thick line is used in Figure 11, but it does not mean that there is only one bus or one type of bus.
  • the processor may be a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, etc., which can be implemented Or execute the disclosed methods, steps and logical block diagrams in the embodiments of this application.
  • a general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the methods disclosed in conjunction with the embodiments of the present application can be directly implemented by a hardware processor, or executed by a combination of hardware and software modules in the processor, etc.
  • the memory may include, but is not limited to, non-volatile memories such as hard disk drive (HDD) or solid-state drive (SSD), random access memory (Random Access Memory, RAM), Erasable Programmable ROM (EPROM), Read-Only Memory (ROM) or Compact Disc Read-Only Memory (CD-ROM), etc.
  • Memory is any storage medium that can be used to carry or store program codes in the form of instructions or data structures, and that can be read and/or written by a computer (such as the communication device shown in this application), but is not limited thereto.
  • the memory in the embodiment of this application It can also be a circuit or any other device capable of realizing a storage function, used to store program instructions and/or data.
  • the processor 2200 is mainly used to process communication protocols and communication data, control the entire communication device, execute software programs, and process data of the software programs.
  • Memory 2300 is mainly used to store software programs and data.
  • the transceiver 2100 may include a control circuit and an antenna.
  • the control circuit is mainly used for conversion of baseband signals and radio frequency signals and processing of radio frequency signals.
  • Antennas are mainly used to send and receive radio frequency signals in the form of electromagnetic waves.
  • Input and output devices, such as touch screens, display screens, keyboards, etc., are mainly used to receive data input by users and output data to users.
  • the processor 2200 can read the software program in the memory 2300, interpret and execute the instructions of the software program, and process the data of the software program.
  • the processor 2200 performs baseband processing on the data to be sent, and then outputs the baseband signal to the radio frequency circuit.
  • the radio frequency circuit performs radio frequency processing on the baseband signal and then sends the radio frequency signal out in the form of electromagnetic waves through the antenna.
  • the radio frequency circuit receives the radio frequency signal through the antenna, converts the radio frequency signal into a baseband signal, and outputs the baseband signal to the processor 2200.
  • the processor 2200 converts the baseband signal into data and performs processing on the data. deal with.
  • the radio frequency circuit and antenna can be arranged independently of the processor that performs baseband processing.
  • the radio frequency circuit and antenna can be arranged remotely and independently of the communication device. .
  • the communication device shown in the embodiment of the present application may also have more components than in Figure 11 , and the embodiment of the present application does not limit this.
  • the methods performed by the processor and transceiver shown above are only examples. For specific steps performed by the processor and transceiver, please refer to the method introduced above.
  • the processing unit may be one or more logic circuits, and the transceiver unit may be an input-output interface, also known as a communication interface, or an interface circuit, or Interfaces and so on.
  • the transceiver unit can also be a sending unit and a receiving unit.
  • the sending unit can be an output interface
  • the receiving unit can be an input interface.
  • the sending unit and the receiving unit are integrated into one unit, such as an input-output interface.
  • the communication device shown in FIG. 12 includes a logic circuit 3001 and an interface 3002 . That is, the above-mentioned processing unit can be implemented by the logic circuit 3001, and the transceiver unit can be implemented by the interface 3002.
  • the logic circuit 3001 can be a chip, a processing circuit, an integrated circuit or a system on chip (SoC) chip, etc.
  • the interface 3002 can be a communication interface, an input/output interface, a pin, etc.
  • FIG. 12 takes the above communication device as a chip.
  • the chip includes a logic circuit 3001 and an interface 3002.
  • the logic circuit and the interface may also be coupled to each other.
  • the embodiments of this application do not limit the specific connection methods of the logic circuits and interfaces.
  • the interface 3002 is used to input the input information; the logic circuit 3001 is used to input the input information when the channel is idle.
  • Information is input into the neural network to obtain an output result, and the input information is based on historical channel access information of at least one first neighbor node of the first network node and at least one first network node relative to the second network node.
  • the historical channel access information of two neighbor nodes is determined, the first neighbor node is a node that the first network node can listen to, and the second neighbor node is a node that the second network node can listen to, And the node that the first network node cannot listen to; determines the channel access behavior according to the output result.
  • the logic circuit 3001 is specifically configured to input the input information into the neural network to obtain an output result when it is detected that the channel is idle and the first network node has data to be sent to the second network node. .
  • the logic circuit 3001 is also configured to perform the operation according to the historical channel access information of the at least one first neighbor node, the historical channel access information of the at least one second neighbor node, and the history of the first network node.
  • Channel access information and historical carrier sensing results of the first network node are used to determine the input information.
  • the historical channel access information of the first neighbor node includes the historical channel access information of the first neighbor node.
  • the first interval time is the difference between the reference time corresponding to the input information and the last time of the first neighbor node. The interval between successful transmissions;
  • the historical channel access information of the second neighbor node includes one or more of the historical channel access behavior of the second neighbor node, the historical data transmission result of the second neighbor node, or the second interval time, so
  • the second interval time is the interval between the reference time corresponding to the input information and the last successful transmission of the second neighbor node;
  • the historical channel access information of the first network node includes one or more of the historical channel access behavior of the first network node, historical data transmission results of the first network node, or a third interval, so
  • the third interval time is an interval between the reference time corresponding to the input information and the last successful transmission of the first network node.
  • the logic circuit 3001 is also used to determine the at least one first neighbor node of the first network node;
  • the logic circuit 3001 is also configured to send the node identification of the at least one first neighbor node to the second network node through the interface 3002;
  • the logic circuit 3001 is also configured to receive, through the interface 3002, the node identification of the first network node relative to the at least one second neighbor node of the second network node sent by the second network node. .
  • the logic circuit 3001 is also configured to receive a first request frame sent by the second network node through the interface 3002, where the first request frame is used to request acquisition of the at least one of the first network node.
  • first neighbor node
  • the logic circuit 3001 is specifically configured to send the node identification of the at least one first neighbor node to the second network node according to the first request frame through the interface 3002.
  • the logic circuit 3001 is specifically configured to send a second request frame to the second network node through the interface 3002.
  • the second request frame includes the node identification of the at least one first neighbor node, and the second request frame includes the node identifier of the at least one first neighbor node.
  • the second request frame is used to request to obtain the at least one second neighbor node of the first network node relative to the second network node.
  • the logic circuit 3001 is also used to determine the at least one first neighbor node of the first network node;
  • the logic circuit 3001 is also configured to receive, through the interface 3002, the node identifier of at least one third neighbor node sent by the second network node, where the third neighbor node is a node that the second network node can listen to;
  • the logic circuit 3001 is further configured to determine the at least one second neighbor node according to the at least one first neighbor node and the at least one third neighbor node.
  • the logic circuit 3001 is further configured to determine, based on the at least one first neighbor node and the at least one third neighbor node, at least one fourth node of the second network node relative to the first network node. Neighbor nodes, the at least one fourth neighbor node is a node that cannot be heard by the second network node and can be heard by the first network node;
  • the logic circuit 3001 is also configured to send the node identification of the at least one fourth neighbor node to the second network node through the interface 3002.
  • the logic circuit 3001 is also configured to send a third request frame to the second network node through the interface 3002, where the third request frame is used to request acquisition of the at least one third neighbor node of the second network node.
  • the logic circuit 3001 is also configured to receive a fourth request frame sent by the second network node through the interface 3002.
  • the fourth request frame includes the at least one third neighbor node.
  • the fourth request frame The frame is used to request acquisition of the at least one fourth neighbor node of the second network node relative to the first network node.
  • the output result includes a first output value and a second output value, the first output value is used to indicate access to the channel, and the second output value is used to indicate not to access the channel;
  • the logic circuit 3001 is specifically configured to determine the access channel when the first output value is greater than the second output value.
  • the logic circuit 3001 is also configured to send at least one of the input information or the channel access behavior to the second network node through the interface 3002;
  • the logic circuit 3001 is also used to receive the network parameters sent by the second network node through the interface 3002, and update the parameters of the neural network according to the network parameters.
  • the first network node includes an access point AP
  • the second network node includes a station STA
  • the first network node includes an STA
  • the second network node includes an AP
  • An embodiment of the present application also provides a wireless communication system.
  • the wireless communication system includes a first network node and a second network node.
  • the first network node and the second network node can be used to perform any of the foregoing embodiments. method.
  • this application also provides a computer program, which is used to implement the operations and/or processing performed by the first network node in the method provided by this application.
  • This application also provides a computer program, which is used to implement the operations and/or processing performed by the second network node in the method provided by this application.
  • This application also provides a computer-readable storage medium that stores computer code.
  • the computer code When the computer code is run on a computer, it causes the computer to perform the operations performed by the first network node in the method provided by this application. and/or processing.
  • This application also provides a computer-readable storage medium.
  • Computer code is stored in the computer-readable storage medium. When the computer code is run on a computer, it causes the computer to perform the operations performed by the second network node in the method provided by this application. and/or processing.
  • the present application also provides a computer program product.
  • the computer program product includes a computer code or a computer program.
  • the operations performed by the first network node in the method provided by the present application are performed. /or processing is performed.
  • the present application also provides a computer program product.
  • the computer program product includes a computer code or a computer program.
  • the operations performed by the second network node in the method provided by the present application are performed. /or processing is performed.
  • the disclosed systems, devices and methods can be implemented in other ways.
  • the device embodiments described above are only illustrative.
  • the division of the units is only a logical function division. In actual implementation, there may be other division methods.
  • multiple units or components may be combined or can be integrated into another system, or some features can be ignored, or not implemented.
  • the coupling or direct coupling or communication connection between each other shown or discussed may be an indirect coupling or communication connection through some interfaces, devices or units, or may be electrical, mechanical or other forms of connection.
  • the units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place, or they may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the technical effects of the solutions provided by the embodiments of the present application.
  • each functional unit in various embodiments of the present application may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit.
  • the above integrated units can be implemented in the form of hardware or software functional units.
  • the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it may be stored in a computer-readable storage medium.
  • the technical solution of the present application is essentially or contributes to the existing technology, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a readable
  • the storage medium includes a number of instructions for causing a computer device (which can All or part of the steps of the methods described in various embodiments of this application can be executed using a personal computer, server, or network device, etc.
  • the aforementioned readable storage media include: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), magnetic disk or optical disk, etc., which can store program code. medium.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • General Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Computational Linguistics (AREA)
  • Mathematical Physics (AREA)
  • Evolutionary Computation (AREA)
  • Artificial Intelligence (AREA)
  • Health & Medical Sciences (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Biomedical Technology (AREA)
  • Biophysics (AREA)
  • General Health & Medical Sciences (AREA)
  • Molecular Biology (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente demande concerne un procédé d'accès à un canal et un produit associé, qui peuvent être appliqués à des systèmes de réseau local sans fil qui prennent en charge des protocoles de la série des normes de l'institut des ingénieurs électriques et électroniques (IEEE) 802.11 tels que des protocoles Wi-Fi de prochaine génération des normes 802.11ax, par exemple 802.11be, Wi-Fi 7 ou EHT, et la prochaine génération des normes 802.11be, c'est-à-dire Wi-Fi 8, et peuvent également être appliqués à des systèmes de réseau personnel sans fil à bande ultra-large (UWB) et à des systèmes de détection. Le procédé comprend les étapes suivantes : lorsqu'il est détecté qu'un canal est inactif, entrée d'informations d'entrée dans un réseau neuronal afin d'obtenir un résultat de sortie ; et, selon le résultat de sortie, détermination d'un comportement d'accès à un canal. La mise en oeuvre de la présente demande peut améliorer la précision de prise de décision d'accès à un canal.
PCT/CN2023/099073 2022-06-10 2023-06-08 Procédé d'accès à un canal et produit associé WO2023237039A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210652243.8A CN117279113A (zh) 2022-06-10 2022-06-10 信道接入方法和相关产品
CN202210652243.8 2022-06-10

Publications (1)

Publication Number Publication Date
WO2023237039A1 true WO2023237039A1 (fr) 2023-12-14

Family

ID=89117645

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/099073 WO2023237039A1 (fr) 2022-06-10 2023-06-08 Procédé d'accès à un canal et produit associé

Country Status (2)

Country Link
CN (1) CN117279113A (fr)
WO (1) WO2023237039A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106788622A (zh) * 2017-01-13 2017-05-31 西安电子科技大学 无线局域网以用户为中心的下行多点协作传输方法
US10356244B1 (en) * 2019-02-08 2019-07-16 Fmr Llc Automated predictive call routing using reinforcement learning
CN111770534A (zh) * 2020-07-08 2020-10-13 中国人民解放军国防科技大学 无线自主选频系统动态接入控制方法及相关组件
CN113747485A (zh) * 2020-05-30 2021-12-03 华为技术有限公司 多ap协作传输的信道探测方法及相关装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106788622A (zh) * 2017-01-13 2017-05-31 西安电子科技大学 无线局域网以用户为中心的下行多点协作传输方法
US10356244B1 (en) * 2019-02-08 2019-07-16 Fmr Llc Automated predictive call routing using reinforcement learning
CN113747485A (zh) * 2020-05-30 2021-12-03 华为技术有限公司 多ap协作传输的信道探测方法及相关装置
CN111770534A (zh) * 2020-07-08 2020-10-13 中国人民解放军国防科技大学 无线自主选频系统动态接入控制方法及相关组件

Also Published As

Publication number Publication date
CN117279113A (zh) 2023-12-22

Similar Documents

Publication Publication Date Title
US7881277B2 (en) Communication method and apparatus for distributed network system where cognitive radio technology is applied
US9706576B2 (en) Method for multicast frame transmission and duplicated multicast frame detection
WO2020014985A1 (fr) Procédé d'émission de données dans une liaison latérale et dispositif terminal
CN102067515B (zh) 用于无线局域网中多播传送的竞争缓解
TWI433577B (zh) 用於異質無線網路之多重無線射頻協調的設備及方法
US20170026853A1 (en) System and method for coordinated beamforming for overlapping basic service set in wlan
WO2020234507A1 (fr) Rapport et amélioration de procédures d'accès aléatoire pour réseaux sans fil
JP2023541594A (ja) 無線ｌａｎシステムにおけるセンシングを実行する方法及び装置
EP3414964A1 (fr) Procédés et appareil de configuration de modes de communication dans un réseau sans fil à haut rendement
US20230345536A1 (en) Channel access method and apparatus
WO2017041629A1 (fr) Procédé de traitement par balayage actif et dispositif associé, et système de communication
JP2023504840A (ja) 無線ネットワークの伝送方法、装置、通信ノード及び記憶媒体
WO2023237039A1 (fr) Procédé d'accès à un canal et produit associé
WO2022262734A1 (fr) Procédé d'accès à un canal et appareil associé
US20210345401A1 (en) Spatial reuse for wireless network
Kiran et al. Wi-Fi and LTE Coexistence in Unlicensed Spectrum
JP5360653B2 (ja) 電力制御装置およびそれを備えた通信ネットワークシステム
WO2018018602A1 (fr) Procédés, terminaux et stations de base pour une communication de bout en bout
CN116057970A (zh) 在无线局域网系统中执行用于感测的分群的方法和装置
CN107251639A (zh) 用于处理信道接入的接收节点、传输节点以及其中的方法
WO2023202206A1 (fr) Procédé et appareil de communication
US20240020513A1 (en) Data processing method and apparatus
WO2024027539A1 (fr) Procédé de communication prenant en charge la perception wi-fi, et produit associé
WO2024032228A1 (fr) Procédé d'entraînement par apprentissage par renforcement et dispositif associé
WO2023109572A1 (fr) Procédé et appareil de configuration

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23819203

Country of ref document: EP

Kind code of ref document: A1