EP4091390B1 - Coordination de transmissions sans fil basées sur un conflit - Google Patents

Coordination de transmissions sans fil basées sur un conflit Download PDF

Info

Publication number
EP4091390B1
EP4091390B1 EP20704263.1A EP20704263A EP4091390B1 EP 4091390 B1 EP4091390 B1 EP 4091390B1 EP 20704263 A EP20704263 A EP 20704263A EP 4091390 B1 EP4091390 B1 EP 4091390B1
Authority
EP
European Patent Office
Prior art keywords
access point
information
served
contention
wireless
Prior art date
Legal status (The legal status 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 status listed.)
Active
Application number
EP20704263.1A
Other languages
German (de)
English (en)
Other versions
EP4091390A1 (fr
Inventor
Leif Wilhelmsson
Miguel Lopez
Pramod Jacob MATHECKEN
Athanasios STAVRIDIS
Dennis SUNDMAN
Joao VIEIRA
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Telefonaktiebolaget LM Ericsson AB
Original Assignee
Telefonaktiebolaget LM Ericsson AB
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 Telefonaktiebolaget LM Ericsson AB filed Critical Telefonaktiebolaget LM Ericsson AB
Publication of EP4091390A1 publication Critical patent/EP4091390A1/fr
Application granted granted Critical
Publication of EP4091390B1 publication Critical patent/EP4091390B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/10—Dynamic resource partitioning
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • 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]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/10—Small scale networks; Flat hierarchical networks
    • H04W84/12—WLAN [Wireless Local Area Networks]

Definitions

  • the present invention relates to methods for controlling wireless transmissions and to corresponding devices, systems, and computer programs.
  • Wi-Fi has been the dominant standard in unlicensed bands when it comes to applications requiring support for high data rates. Due to the large available bandwidth and effectively no competing technology in the unlicensed band, Wi-Fi, which is based on the IEEE 802.11 standards, has adopted a very simple distributed channel access mechanism based on the so-called distributed coordination function (DCF).
  • DCF distributed coordination function
  • Distributed channel access means that a device, in IEEE 802.11 terminology known as a station (STA), tries to access the channel when it has something to send. Effectively there is no difference in channel access whether the station is an access point or a non-access point.
  • DCF works well as long as the load is not too high. When the load is high, and in particular when the number of stations trying to access the channel is large, channel access based on DCF does not work well. The reason for this is that there will be a high probability of collision on the channel, leading to poor channel usage.
  • TXOP transmission opportunity
  • a next natural step is to also coordinate the channel usage between cells, i.e., perform some kind of AP coordination.
  • a relatively straight-forward approach to this is to let a number of APs share a TXOP. Specifically, suppose there are two or more APs within range using the same channel. With no coordination, each of them would contend for the channel and the AP that wins the contention will then reserve the channel using the TXOP concept, whereas the other APs would have to defer from channel access and wait for the TXOP to end. Then a new contention begins and channel access may or may not be gained for a specific AP, implying that channel access becomes rather unpredictable and support for demanding QoS (Quality of Service) applications may be challenging.
  • QoS Quality of Service
  • COFDMA is basically a means to introduce another level of coordination, but in its basic form the total amount of available transmission resources is not increased. There is also a problem in that the different APs might not experience the same channel conditions, so it may be so that one AP belonging to the group may not experience an idle channel, and thus sharing resources with this AP may potentially result in a waste of resources.
  • a method of controlling wireless transmissions in a wireless communication system is provided.
  • an access point contends with at least one further access point for a set of transmission resources.
  • the access point shares at least a subset of the transmission resources with the at least one further access point.
  • the access point exchanges information with the at least one further access point.
  • the exchanged information comprises information on one or more wireless stations served by the at least one further access point and/or information on one or more wireless stations served by the access point. Based on the exchanged information, the access point coordinating wireless transmissions on the shared subset of transmission resources.
  • an access point for a wireless communication system is provided.
  • the access point is configured to contend with one or more further access points for a set of transmission resources. Further, the access point is configured to, in response to one of the one or more further access points winning contention for the set of transmission resources, be allowed to share at least a subset of the transmission resources with the access point winning the contention.
  • the access point is configured to exchange information with the access point winning the contention and, based on the exchanged information, coordinate wireless transmissions on the shared subset of transmission resources.
  • the exchanged information comprising information on one or more wireless stations served by the access point and/or information on one or more wireless stations served by the access point winning the contention.
  • execution of the program code causes the access point to exchange information with the access point winning the contention and, based on the exchanged information, coordinate wireless transmissions on the shared subset of transmission resources.
  • the exchanged information comprising information on one or more wireless stations served by the access point and/or information on one or more wireless stations served by the access point winning the contention.
  • Fig. 1 illustrates an exemplary wireless communication system according to an embodiment.
  • the wireless communication system includes multiple APs 10, in the illustrated example referred to as AP1 and AP2, and multiple stations (STAs) 11, in the illustrated example referred to as STA11, STA12, STA21, and STA22.
  • the STAs STA11 and STA12 are served by AP1 (in a first BSS denoted as BSS1) and the STAs STA21 and STA22 are served by AP2 (in a second BSS denoted as BSS2).
  • the stations 11 may correspond to various kinds of wireless devices, for example user terminals, such as mobile or stationary computing devices like smartphones, laptop computers, desktop computers, tablet computers, gaming devices, or the like. Further, the stations 11 could for example correspond to other kinds of equipment like smart home devices, printers, multimedia devices, data storage devices, or the like.
  • the winning AP can share the resources with the other contending APs in a dynamic fashion, i.e., it can share the resources differently in different TXOPs.
  • sharing of the resources involves that the individual resources can be used by at least two different transmitters at the same time.
  • Fig. 2 the procedure involves three APs, denoted as AP1, AP2, and AP3, which may for example correspond to the APs 10 of Fig. 1 and an additional AP serving one or more further stations in a further BSS.
  • AP1, AP2, and AP3 may for example correspond to the APs 10 of Fig. 1 and an additional AP serving one or more further stations in a further BSS.
  • three packets are transmitted before the actual scheduling of data can be sent to the participating stations.
  • the first packet is the Coordination Invitation Frame (CIF).
  • the CIF is sent by the AP winning the contention and by that reserving the TXOP, and it essentially is an invitation sent to the other APs that have agreed beforehand to participate in the COFDMA.
  • the second packet referred to as a Coordination Participation Request (CPR) is a request sent by the APs interested in participating in this particular TXOP.
  • the CPR is sent to the AP sending the CIF.
  • the details for how to send the CPR from the different APs are agreed beforehand and is preferably done by using OFDMA where different parts of the band is used by different APs.
  • the AP sending the CIF may determine how to use the resources on a global scale.
  • the AP winning the contention will in the following also be denoted as "MasterAP”, while other APs requesting to participate in the TXOP will be denoted as "Slave AP".
  • the AP which is Master AP may vary from one TXOP to the next, and the number of Slave APs may also vary from zero to the total number of APs participating the COFDMA except the one being the Master AP.
  • the third packet referred to as the Coordination Participation Grant (CPG) is a grant sent by the Master AP to the Slave APs with detailed information regarding resource allocation. As will be described in some details in some of the embodiments, different levels of information regarding the resource allocation is possible.
  • CPG Coordination Participation Grant
  • the involved APs are ready to schedule their respective associated stations in their respective basic service set (BSS).
  • BSS basic service set
  • TF trigger frame
  • COFDMA allows for information exchange for each TXOP
  • this information exchange may be enhanced in various ways, and it may also be the case that this enhanced information exchange is not transparent for the stations associated to the respective AP.
  • This information exchange that takes place at a lower rate and may be more involved or complex can be seen as an optional feature which can be used to further enhance the performance if found beneficial and needed.
  • the enhanced information exchange is described in detail in the following embodiment.
  • AP1 and AP2 are aware of each other and have agreed on COFDMA.
  • AP1 now wants to obtain and share more detailed information about how different transmissions within BSS1 impact the different transmissions in BSS2.
  • AP1 sends a measurement request (MRq-AP) to AP2, requesting that AP2 and its associated stations perform measurement on Non Data Packets (NDPs) that will be transmitted by AP1 and its associated stations, or possibly a subset of these.
  • NDPs Non Data Packets
  • the request would contain the details necessary to perform the requested measurement.
  • AP 1 has decided that it is only information related to a transmission by STA11 that is needed, and thus provides this information in the MRq-AP packet.
  • AP2 confirms the reception of the MRq-AP packet by sending a measurement accept (MA-AP) packet. After this AP2 sends a measurement request to the associated slaves (MRq-S), essentially relaying the necessary information from AP1.
  • the MRq-S packet may or may not be explicitly acknowledged. In the figure it is not acknowledged.
  • STA11 is transmitting the NDP, which is used by AP2, STA21, and STA22 for performing channel measurements.
  • the measurement reports (MRp-S) from theses slaves are transmitted to AP2, which forwards these reports together with its own measurement report (MRp-A)to AP1.
  • the information obtained in the above-described step will be valid and useful for a relatively long time.
  • the information only needs to be updated when a new station associates with one of the APs.
  • the information can be used for a time that is relatively long compared to the duration of the measurement procedure, e.g., at least a second.
  • a basic idea in COFDM is efficient sharing of the available resources in the sense that a specific resource is allocated to the user which by some metric is seen to need it the most.
  • This metric can for example be that the user is the one that has been waiting the longest time to be scheduled, has the largest difference between the number of lent resources vs. the number of borrowed resources, has the largest amount of data in its buffer, has the oldest packet in its buffer, or something similar.
  • Such an approach can improve the QoS, but it does not really improve the total amount of available resources or the total amount of data that on average can be sent.
  • information is exchanged between the APs involved in the COFDMA such that at least some of the available resources can be used in at least two of the BSSs.
  • One possibility to enable this is to share more detailed information with respect to how different transmissions interfere with one another and then use this knowledge to schedule more than one transmission on one specific resource if it is concluded that such scheduled transmissions can take place.
  • This embodiment is not limited to exactly how such information is obtained, but the preferred way to do it according to the present invention is by using a first step used for enhanced coordination as described in the first embodiment, i.e., a step corresponding to a procedure as illustrated in Fig. 3 .
  • AP1 has collected information about which ones of AP2, STA21, and STA22 suffer from transmission from STA11. It was here assumed that AP1 already had accurate knowledge concerning how the interference from AP1 and STA22 interfere with AP2, STA21, and STA22, so that AP1 has all knowledge that is required.
  • a specific resource may be used for more than one transmission.
  • AP1 wins the TXOP and moreover that AP1 wants to schedule STA11 for UL transmission.
  • BSS2 Based on knowledge for how a transmission from STA11 interferes with transmissions in BSS2, concurrent transmissions in BSS2 may be allowed.
  • the fact that the transmission in BSS2 can be either UL or DL means that e.g. a DL transmission can be sent and also acknowledged, as the acknowledgement packet implies that an UL transmission is required.
  • AP1 may have received detailed information in the request and this information was then used to determine how to restrict or otherwise control scheduling of the shared resources by AP2, which was then indicated to AP2 in the grant.
  • AP1 may already in the CIF, i.e., in the invitation packet, limit the invitation to a subset of possible transmissions in BSS2. In this case, it may happen that AP2 is not able to schedule any of the allowed transmissions, with the result that AP2 will not send a request to participate in the COFDMA transmission in the coming TXOP.
  • AP2 could also decide to actually schedule of at least some of the allowed transmissions from the subset.
  • the second embodiment may be applied in the context of single-port nodes (e.g. single antenna nodes), for both the APs as well as stations. However, there may be further room for improvement when it comes to efficiently reuse of the resources in different BSS, if some of the involved nodes are capable of performing multiple transmissions or receptions in the same resource by using beamformed multi-antenna transmission. In the following, such nodes are also referred to as multi-port nodes.
  • the third embodiment may thus further extend the second embodiment to cases where at least some of the involved nodes are multi-port nodes.
  • the master AP may have information concerning not only to one antenna port per given node (a station or slave AP), but potentially concerning multiple antenna ports per node (if said node is capable of such configuration). As a result, the master AP has further flexibility when deciding the network's coordinated settings. The basic idea is that, some of the available ports may result in lower overall interference signatures to the network, and these would preferably be considered when optimizing the coordinated transmissions.
  • One (out of several) antenna ports for a multi-port station or slave AP may, e.g., be associated with one of the node's physical different antenna elements, and/or different beams.
  • a multi-port station belonging to AP2 could perform multiple simultaneous measurements using the NDPs transmitted by STA11.
  • Each measurement would be associated with a possible receiver setting, e.g., an antenna port or beam. It may be assumed or not, that the master AP has knowledge on the number of multiple simultaneously channel settings such station can use.
  • measurement reports are transmitted from STA21 to AP2, where each report may have information regarding the measurements performed at the different antenna ports or beams of STA21.
  • AP1 After AP2 forwards this information to AP1, this means that both AP1 and AP2 now have knowledge about which ports or beams from STA21 and STA22 are interfered during a transmission from STA12. After repeating this process for all combinations of NW nodes, AP1 would have a higher flexibility on how to optimize the network COFDMA settings in order to ensure concurrent transmissions at different BSSs with lower interference.
  • the fourth embodiment is also applicable when the involved APs experience different channel conditions such that when the channel is sensed, not the entire bandwidth is found idle.
  • the IEEE 802.11ax technology introduces preamble puncturing, which enables bonding of non-contiguous bandwidth parts. This may be useful when multiple idle channels are separated by a busy channel. Since EHT will support even wider bandwidths than 802.1 1ax, preamble puncturing is even more important due to the increased probability of a busy channel in the middle of idle channels.
  • the utilization of the medium can be increased if the scheduler in the master AP takes into account preamble puncturing patterns that are required in the slave APs.
  • the CPR packets from the slave APs to the master AP may indicate the puncturing patterns that need to be applied at each slave AP.
  • the scheduler in the master AP may minimize or eliminate the punctured bandwidth parts that are allocated to each AP.
  • AP2 also contending for the 40 MHz, may at the same time have sensed that only the lower 20 MHz are idle, whereas the upper 20 MHz are found busy. In the CPR packet, this is indicated by AP2, i.e., that only the lower part is suitable since the upper part is busy.
  • This additional information has can be used such that if the two APs targets divide the resources evenly, AP1 will in this case allocated the lower part to AP2 and will allocate the upper 20 MHz for transmissions in BSS2.
  • the present disclosure also provides a method for performing scheduling in a wireless system, where two or more network nodes cooperate. These network nodes may for example correspond to the above-mentioned APs.
  • one of the two or more network nodes after having gained access to the channel, may also schedule resources to be used by other network nodes.
  • This scheduling may be non-trivial in the sense that the resources available to be scheduled for the two or more network nodes are not known prior to the channel access has been gained and all network nodes have announced their interest in being scheduled.
  • the same resource may be scheduled for being used by more than one of the network nodes.
  • the interference caused by transmission in a cell (e.g., BSS) controlled by one network nodes to devices in a cell controlled by another network node may be determined by performing measurements on a time-scale that is slower than the time-scaled used for the joint scheduling.
  • Fig. 4A shows a flowchart for illustrating a method, which may be utilized for implementing the illustrated concepts.
  • the method of Fig. 4A may be used for implementing the illustrated concepts in a network node, in particular an access point for a wireless communication system.
  • the wireless communication system may be based on a wireless local area network, WLAN, technology.
  • the access point may for example correspond to any of the above-mentioned APs 10, in particular to AP1 in the examples explained in connection with of Figs 1 , 2, and 3 .
  • At least some of the steps of the method of Fig. 4A may be performed and/or controlled by one or more processors of the access point.
  • Such access point may also include a memory storing program code for implementing at least some of the below described functionalities or steps of the method of Fig. 4A .
  • the access point contends with at least one further access point for a set of transmission resources.
  • Such further access point may for example correspond to any of the above-mentioned APs 10, in particular to AP2 or AP3 in the examples explained in connection with of Figs 1 , 2, and 3 .
  • the access point exchanges information with the at least one further access point.
  • the indication which is optionally sent at step 420 may be used for sending at least a part of the exchanged information.
  • the request which is optionally received at step 420 may be used for receiving at least a part of the exchanged information.
  • one or more other messages may be used for exchanging the information. Such messages may be transmitted on a longer time-scale than the request and/or indication for allowing sharing of the transmission resources.
  • the message(s) may be transmitted less frequently than the request and/or indication and may relate to multiple transmission opportunities, e.g., the above-mentioned TXOPs, in which sharing of the transmission resources can be individually controlled by the request and/or indication.
  • the above-mentioned packets MRq-AP, MA-AP, and MRp-A are examples of such messages which can be used for exchanging the information between the access points.
  • the exchanged information may include information on interference measured by the at least one further access point.
  • the exchanged information may include information on interference measured by the access point.
  • the exchanged information may include information on interference measured by one or more wireless stations served by the access point.
  • At least a part of the exchanged information may be antenna-port specific with respect to multiple antenna ports of the access point. Further, least a part of the exchanged information may be antenna-port specific with respect to multiple antenna ports of a wireless station served by the access point. In addition or as an alternative, at least a part of the exchanged information may be beam specific with respect to multiple transmission beams of the access point.
  • the multiple transmission beams may be transmission beams to or from the access point. Further, least a part of the exchanged information may be beam specific with respect to multiple transmission beams of a wireless station served by the access point.
  • the multiple transmission beams may be transmission beams to or from the wireless station served by the access point.
  • At least a part of the exchanged information may be antenna-port specific with respect to multiple antenna ports of the at least one further access point. Further, least a part of the exchanged information may be antenna-port specific with respect to multiple antenna ports of a wireless station served by the at least one further access point. Further, least a part of the exchanged information may be beam specific with respect to multiple transmission beams of a wireless station served by the further access point. Here, the multiple transmission beams may be transmission beams to or from the wireless station served by the further access point.
  • the access point and the at least one further access point may differ with respect to a supported bandwidth of wireless transmissions.
  • the exchanged information may include information on a bandwidth puncturing pattern applied by the at least one further access point.
  • the wireless transmissions may be based on OFDMA.
  • the access point 450 may include further modules for implementing other functionalities, such as known functionalities of a WLAN AP. Further, it is noted that the modules of the access point 450 do not necessarily represent a hardware structure of the access point 450, but may also correspond to functional elements, e.g., implemented by hardware, software, or a combination thereof.
  • Such access point may also include a memory storing program code for implementing at least some of the below described functionalities or steps of the method of Fig. 5A .
  • the access point contends with one or more further access points for a set of transmission resources.
  • the further access points may for example correspond to any of the above-mentioned APs 10, in particular to AP1, AP2, or AP3 in the examples explained in connection with of Figs 1 , 2, and 3 .
  • the exchanged information may include information on interference measured by one or more wireless stations served by the access point.
  • the exchanged information may include information on interference measured by the access point winning the contention.
  • At least a part of the exchanged information may be antenna-port specific with respect to multiple antenna ports of the access point. Further, least a part of the exchanged information may be antenna-port specific with respect to multiple antenna ports of a wireless station served by the access point. In addition or as an alternative, at least a part of the exchanged information may be beam specific with respect to multiple transmission beams of the access point.
  • the multiple transmission beams may be transmission beams to or from the access point. Further, least a part of the exchanged information may be beam specific with respect to multiple transmission beams of a wireless station served by the access point.
  • the multiple transmission beams may be transmission beams to or from the wireless station served by the access point.
  • the exchanged information may include information on a bandwidth puncturing pattern applied by the access point.
  • the exchanged information may apply to multiple transmission opportunities on the transmission resources, e.g., the above-mentioned TXOPs.
  • the subset of transmission resources may differ for at least some of the multiple transmission opportunities.
  • the wireless transmissions are based on OFDMA.
  • Fig. 5B shows a block diagram for illustrating functionalities of an access point 550 which operates according to the method of Fig. 5A .
  • the access point 550 may for example correspond to one of above-mentioned APs 10.
  • the access point 550 may be provided with a module 560 configured to contend with at least one further access point for a set of transmission resources, such as explained in connection with step 510.
  • the access point 550 may be provided with a module 570 configured for allowing the access point to share at least a subset of the transmission resources with the access point winning the contention, such as explained in connection with step 520.
  • the access point 550 may be provided with a module 580 configured to exchange information with the access point winning the contention, such as explained in connection with step 530. Further, the access point 550 may be provided with a module 590 configured to coordinate wireless transmissions on the shared subset of transmission resources based on the exchanged information, such as explained in connection with step 540.
  • the access point 550 may include further modules for implementing other functionalities, such as known functionalities of a WLAN AP. Further, it is noted that the modules of the access point 550 do not necessarily represent a hardware structure of the access point 550, but may also correspond to functional elements, e.g., implemented by hardware, software, or a combination thereof.
  • Figs. 4A and 4B could also be combined with the functionalities as described in connection with Figs. 5A and 5B , e.g., in a system including a first access point which operates according to the method of Fig. 4A , and one or more further access points which operate according to the method of Fig. 5A . Further, depending on whether the access point wins the contention or not, the same access point may select between operating according to the method of Fig. 4A or according to the method of Fig. 5A .
  • Fig. 6 illustrates a processor-based implementation of an access point 600 which may be used for implementing the above-described concepts.
  • the structures as illustrated in Fig. 6 may be used for implementing the concepts in any of the above-mentioned access points 10.
  • the access point 600 includes one or more radio interfaces 610.
  • the radio interface(s) 610 may for example be based on a WLAN technology, e.g., according to an IEEE 802.11 family standard. However, other wireless technologies could be supported as well, e.g., the LTE technology or the NR technology. In some scenarios, the radio interface(s) 610 may be based on multiple antennas of the access point 600, and in particular support beamformed multi-antenna port transmission.
  • the access point 600 may include one or more processors 650 coupled to the radio interface(s) 610 and a memory 660 coupled to the processor(s) 650.
  • the radio interface(s) 610, the processor(s) 650, and the memory 660 could be coupled by one or more internal bus systems of the access point 600.
  • the memory 660 may include a Read-Only-Memory (ROM), e.g., a flash ROM, a Random Access Memory (RAM), e.g., a Dynamic RAM (DRAM) or Static RAM (SRAM), a mass storage, e.g., a hard disk or solid state disk, or the like.
  • the memory 660 may include software 670 and/or firmware 680.
  • the memory 660 may include suitably configured program code to be executed by the processor(s) 650 so as to implement the above-described functionalities for controlling wireless transmissions, such as explained in connection with Figs. 4 and 5 .
  • the structures as illustrated in Fig. 6 are merely schematic and that the access point 600 may actually include further components which, for the sake of clarity, have not been illustrated, e.g., further interfaces or further processors.
  • the memory 660 may include further program code for implementing known functionalities of an access point.
  • a computer program may be provided for implementing functionalities of the access point 600, e.g., in the form of a physical medium storing the program code and/or other data to be stored in the memory 660 or by making the program code available for download or by streaming.
  • the concepts as described above may be used for efficiently controlling contention-based wireless transmissions, in particular with respect to coordination wireless transmissions controlled by different APs, thereby enabling efficient sharing of transmission resources.
  • the examples and embodiments as explained above are merely illustrative and susceptible to various modifications.
  • the illustrated concepts may be applied in connection with various kinds of wireless technologies, without limitation to WLAN technologies or OFDM based technologies.
  • the concepts may be applied with respect to various types of APs and stations.
  • the above concepts may be implemented by using correspondingly designed software to be executed by one or more processors of an existing device or apparatus, or by using dedicated device hardware.
  • the illustrated apparatuses or devices may each be implemented as a single device or as a system of multiple interacting devices or modules.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Claims (17)

  1. Procédé de commande de transmissions sans fil dans un système de communication sans fil, le procédé comprenant :
    un point d'accès (10 ; 450 ; 550 ; 600) étant en compétition avec au moins un autre point d'accès (10 ; 450 ; 550 ; 600) pour un ensemble de ressources de transmission ;
    en réponse au fait de gagner la compétition pour l'ensemble de ressources de transmission, le point d'accès (10 ; 450 ; 550 ; 600) partageant au moins un sous-ensemble des ressources de transmission avec l'au moins un autre point d'accès (10 ; 450 ; 550 ; 600) ;
    le point d'accès (10 ; 450 ; 550 ; 600) échangeant des informations avec l'au moins un autre point d'accès (10 ; 450 ; 550 ; 600), les informations échangées comprenant des informations sur une ou plusieurs stations sans fil (11) desservies par l'au moins un autre point d'accès (10 ; 450 ; 550 ; 600) et/ou des informations sur une ou plusieurs stations sans fil (11) desservies par le point d'accès (10 ; 450 ; 550 ; 600) ; et
    sur la base des informations échangées, le point d'accès (10 ; 450 ; 550 ; 600) coordonnant des transmissions sans fil sur le sous-ensemble partagé de ressources de transmission.
  2. Procédé selon la revendication 1,
    dans lequel les informations échangées comprennent des informations sur des positions des une ou plusieurs stations sans fil (11) desservies par l'au moins un autre point d'accès (10 ; 450 ; 550 ; 600), des informations sur des positions des une ou plusieurs stations sans fil (11) desservies par le point d'accès (10 ; 450 ; 550 ; 600), des informations sur des interférences mesurées par l'au moins un autre point d'accès (10 ; 450 ; 550 ; 600), des informations sur des interférences mesurées par une ou plusieurs stations sans fil (11) desservies par l'au moins un autre point d'accès (10 ; 450 ; 550 ; 600), des informations sur des interférences mesurées par le point d'accès (10 ; 450 ; 550 ; 600), et/ou des informations sur des interférences mesurées par une ou plusieurs stations sans fil (11) desservies par le point d'accès (10 ; 450 ; 550 ; 600).
  3. Procédé selon la revendication 1 ou 2,
    dans lequel au moins une partie des informations échangées est spécifique à un port d'antenne en ce qui concerne de multiples ports d'antenne du point d'accès (10 ; 450 ; 550 ; 600),
    dans lequel au moins une partie des informations échangées est spécifique à un port d'antenne en ce qui concerne de multiples ports d'antenne d'une station sans fil desservie par le point d'accès (10 ; 450 ; 550 ; 600),
    dans lequel au moins une partie des informations échangées est spécifique à un port d'antenne en ce qui concerne de multiples ports d'antenne de l'au moins un autre point d'accès (10 ; 450 ; 550 ; 600), et/ou
    dans lequel au moins une partie des informations échangées est spécifique à un port d'antenne en ce qui concerne de multiples ports d'antenne d'une station sans fil desservie par l'au moins un autre point d'accès (10 ; 450 ; 550 ; 600).
  4. Procédé selon l'une quelconque des revendications 1 à 3,
    dans lequel au moins une partie des informations échangées est spécifique à un faisceau en ce qui concerne de multiples faisceaux de transmission du point d'accès (10 ; 450 ; 550 ; 600),
    dans lequel au moins une partie des informations échangées est spécifique à un faisceau en ce qui concerne de multiples faisceaux de transmission d'une station sans fil desservie par le point d'accès (10 ; 450 ; 550 ; 600),
    dans lequel au moins une partie des informations échangées est spécifique à un faisceau en ce qui concerne de multiples faisceaux de transmission de l'au moins un autre point d'accès (10 ; 450 ; 550 ; 600), et/ou
    dans lequel au moins une partie des informations échangées est spécifique à un faisceau en ce qui concerne de multiples faisceaux de transmission d'une station sans fil desservie par l'au moins un autre point d'accès (10 ; 450 ; 550 ; 600).
  5. Procédé selon l'une quelconque des revendications 1 à 4,
    dans lequel le point d'accès (10 ; 450 ; 550 ; 600) et l'au moins un autre point d'accès (10 ; 450 ; 550 ; 600) diffèrent en ce qui concerne une bande passante prise en charge de transmissions sans fil, et/ou
    dans lequel les informations échangées comprennent des informations sur un motif de perforation de bande passante appliqué par l'au moins un autre point d'accès (10 ; 450 ; 550 ; 600).
  6. Procédé selon l'une quelconque des revendications 1 à 5,
    dans lequel les informations échangées s'appliquent à de multiples opportunités de transmission sur les ressources de transmission, et
    dans lequel le sous-ensemble de ressources de transmission diffère pour au moins certaines des multiples opportunités de transmission.
  7. Procédé de commande de transmissions sans fil dans un système de communication sans fil, le procédé comprenant :
    un point d'accès (10 ; 450 ; 550 ; 600) étant en compétition avec un ou plusieurs autres points d'accès (10 ; 450 ; 550 ; 600) pour un ensemble de ressources de transmission ;
    en réponse au fait que l'un des un ou plusieurs autres points d'accès (10 ; 450 ; 550 ; 600) gagne la compétition pour l'ensemble de ressources de transmission, le point d'accès (10 ; 450 ; 550 ; 600) étant autorisé à partager au moins un sous-ensemble des ressources de transmission avec le point d'accès (10 ; 450 ; 550 ; 600) gagnant la compétition ;
    le point d'accès (10 ; 450 ; 550 ; 600) échangeant des informations avec le point d'accès (10 ; 450 ; 550 ; 600) gagnant la compétition, les informations échangées comprenant des informations sur une ou plusieurs stations sans fil (11) desservies par le point d'accès (10 ; 450 ; 550 ; 600) et/ou des informations sur une ou plusieurs stations sans fil (11) desservies par le point d'accès (10 ; 450 ; 550 ; 600) gagnant la compétition ;
    sur la base des informations échangées, le point d'accès (10 ; 450 ; 550 ; 600) coordonnant des transmissions sans fil sur le sous-ensemble partagé de ressources de transmission.
  8. Procédé selon la revendication 7,
    dans lequel les informations échangées comprennent des informations sur des positions des une ou plusieurs stations sans fil (11) desservies par le point d'accès (10 ; 450 ; 550 ; 600), des informations sur des positions des une ou plusieurs stations sans fil (11) desservies par le point d'accès (10 ; 450 ; 550 ; 600) gagnant la compétition, des informations sur des interférences mesurées par le point d'accès (10 ; 450 ; 550 ; 600), des informations sur des interférences mesurées par une ou plusieurs stations sans fil (11) desservies par le point d'accès (10 ; 450 ; 550 ; 600), des informations sur des interférences mesurées par le point d'accès (10 ; 450 ; 550 ; 600) gagnant la compétition, et/ou des informations sur des interférences mesurées par une ou plusieurs stations sans fil (11) desservies par le point d'accès (10 ; 450 ; 550 ; 600) gagnant la compétition.
  9. Procédé selon la revendication 7 ou 8,
    dans lequel au moins une partie des informations échangées est spécifique à un port d'antenne en ce qui concerne de multiples ports d'antenne du point d'accès (10 ; 450 ; 550 ; 600),
    dans lequel au moins une partie des informations échangées est spécifique à un port d'antenne en ce qui concerne de multiples ports d'antenne d'une station sans fil desservie par le point d'accès (10 ; 450 ; 550 ; 600),
    dans lequel au moins une partie des informations échangées est spécifique à un port d'antenne en ce qui concerne de multiples ports d'antenne du point d'accès (10 ; 450 ; 550 ; 600) gagnant la compétition, et/ou
    dans lequel au moins une partie des informations échangées est spécifique à un port d'antenne en ce qui concerne de multiples ports d'antenne d'une station sans fil desservie par le point d'accès (10 ; 450 ; 550 ; 600) gagnant la compétition.
  10. Procédé selon l'une quelconque des revendications 7 à 9,
    dans lequel au moins une partie des informations échangées est spécifique à un faisceau en ce qui concerne de multiples faisceaux de transmission du point d'accès (10 ; 450 ; 550 ; 600),
    dans lequel au moins une partie des informations échangées est spécifique à un faisceau en ce qui concerne de multiples faisceaux de transmission d'une station sans fil desservie par le point d'accès (10 ; 450 ; 550 ; 600),
    dans lequel au moins une partie des informations échangées est spécifique à un faisceau en ce qui concerne de multiples faisceaux de transmission du point d'accès (10 ; 450 ; 550 ; 600) gagnant la compétition, et/ou
    dans lequel au moins une partie des informations échangées est spécifique à un faisceau en ce qui concerne de multiples faisceaux de transmission d'une station sans fil desservie par le point d'accès (10 ; 450 ; 550 ; 600) gagnant la compétition.
  11. Procédé selon l'une quelconque des revendications 7 à 10,
    dans lequel le point d'accès (10 ; 450 ; 550 ; 600) et le point d'accès (10 ; 450 ; 550 ; 600) gagnant la compétition diffèrent en ce qui concerne une bande passante prise en charge de transmissions sans fil, et/ou
    dans lequel les informations échangées comprennent des informations sur un motif de perforation de bande passante appliqué par le point d'accès (10 ; 450 ; 550 ; 600) .
  12. Procédé selon l'une quelconque des revendications 7 à 11,
    dans lequel les informations échangées s'appliquent à de multiples opportunités de transmission sur les ressources de transmission, et
    dans lequel le sous-ensemble de ressources de transmission diffère pour au moins certaines des multiples opportunités de transmission.
  13. Point d'accès (10 ; 450 ; 550 ; 600) pour un système de communication sans fil, le point d'accès (10 ; 450 ; 550 ; 600) étant configuré pour :
    - être en compétition avec au moins un autre point d'accès (10 ; 450 ; 550 ; 600) pour un ensemble de ressources de transmission ;
    - en réponse au fait de gagner la compétition pour l'ensemble de ressources de transmission, partager au moins un sous-ensemble des ressources de transmission avec l'au moins un autre point d'accès (10 ; 450 ; 550 ; 600) ;
    - échanger des informations avec l'au moins un autre point d'accès (10 ; 450 ; 550 ; 600), les informations échangées comprenant des informations sur une ou plusieurs stations sans fil (11) desservies par l'au moins un autre point d'accès (10 ; 450 ; 550 ; 600) et/ou des informations sur une ou plusieurs stations sans fil (11) desservies par le point d'accès (10 ; 450 ; 550 ; 600) ; et
    - sur la base des informations échangées, coordonner des transmissions sans fil sur le sous-ensemble partagé de ressources de transmission.
  14. Point d'accès (10 ; 450 ; 550 ; 600) selon la revendication 13,
    dans lequel le point d'accès est configuré pour réaliser un procédé selon l'une quelconque des revendications 2 à 6.
  15. Point d'accès (10 ; 450 ; 550 ; 600) pour un système de communication sans fil, le point d'accès (10 ; 450 ; 550 ; 600) étant configuré pour :
    - être en compétition avec un ou plusieurs autres points d'accès (10 ; 450 ; 550 ; 600) pour un ensemble de ressources de transmission ;
    - en réponse au fait que l'un des un ou plusieurs autres points d'accès (10 ; 450 ; 550 ; 600) gagne la compétition pour l'ensemble de ressources de transmission, être autorisé à partager au moins un sous-ensemble des ressources de transmission avec le point d'accès (10 ; 450 ; 550 ; 600) gagnant la compétition ;
    - échanger des informations avec le point d'accès (10 ; 450 ; 550 ; 600) gagnant la compétition, les informations échangées comprenant des informations sur une ou plusieurs stations sans fil (11) desservies par le point d'accès (10 ; 450 ; 550 ; 600) et/ou des informations sur une ou plusieurs stations sans fil (11) desservies par le point d'accès (10 ; 450 ; 550 ; 600) gagnant la compétition ;
    - sur la base des informations échangées, coordonner des transmissions sans fil sur le sous-ensemble partagé de ressources de transmission.
  16. Point d'accès (10 ; 450 ; 550 ; 600) selon la revendication 15,
    dans lequel le point d'accès (10 ; 450 ; 550 ; 600) est configuré pour réaliser un procédé selon l'une quelconque des revendications 8 à 12.
  17. Programme informatique ou produit programme informatique comprenant un code de programme à exécuter par au moins un processeur (650) d'un point d'accès (10 ; 450 ; 550 ; 600), de telle manière qu'une exécution du code de programme amène le point d'accès (10 ; 450 ; 550 ; 600) à réaliser un procédé selon l'une quelconque des revendications 1 à 12.
EP20704263.1A 2020-01-13 2020-02-06 Coordination de transmissions sans fil basées sur un conflit Active EP4091390B1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US202062960460P 2020-01-13 2020-01-13
PCT/EP2020/053030 WO2021144039A1 (fr) 2020-01-13 2020-02-06 Coordination de transmissions sans fil basées sur un conflit

Publications (2)

Publication Number Publication Date
EP4091390A1 EP4091390A1 (fr) 2022-11-23
EP4091390B1 true EP4091390B1 (fr) 2023-12-13

Family

ID=69526254

Family Applications (1)

Application Number Title Priority Date Filing Date
EP20704263.1A Active EP4091390B1 (fr) 2020-01-13 2020-02-06 Coordination de transmissions sans fil basées sur un conflit

Country Status (5)

Country Link
US (1) US20230026426A1 (fr)
EP (1) EP4091390B1 (fr)
CN (1) CN115211208A (fr)
AR (1) AR121023A1 (fr)
WO (1) WO2021144039A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117998452A (zh) * 2022-10-31 2024-05-07 中兴通讯股份有限公司 数据传输方法、设备和存储介质

Also Published As

Publication number Publication date
EP4091390A1 (fr) 2022-11-23
CN115211208A (zh) 2022-10-18
AR121023A1 (es) 2022-04-06
US20230026426A1 (en) 2023-01-26
WO2021144039A1 (fr) 2021-07-22

Similar Documents

Publication Publication Date Title
EP3395117B1 (fr) Procédure d'accès à un canal d'écoute avant de parler pour un laa de liaison montante
US10292182B2 (en) Listen before talk channel access procedure for uplink LAA
JP6833988B2 (ja) ダウンリンク制御信号を伝送する方法及び装置
US20200252960A1 (en) Wireless communication method for saving power and wireless communication terminal using same
EP4115687B1 (fr) Commande de transmissions sans fil de liaison montante dans une txop partagée
CN110832934B (zh) Ue在具有子集限制的宽带宽上随机接入的系统及方法
EP4162757B1 (fr) Coordination de rts/cts pour partage txop
EP4091390B1 (fr) Coordination de transmissions sans fil basées sur un conflit
EP3197221B1 (fr) Procédé d'accès et dispositif
EP4147474B1 (fr) Gestion du compteur de délai d'attente pour le partage de txop
EP4215011B1 (fr) Coordination de rétroaction d'accusé de réception pour un partage de txop basé sur la réutilisation spatiale
EP4115673B1 (fr) Partage de txop sur la base d'un multiplexage spatial
EP4209097B1 (fr) Transmission à faible latence dans une txop réservée
US20240214945A1 (en) Spatial-Reuse Based TXOP Sharing for Random Access Transmissions
WO2023104320A1 (fr) Configuration de coopération de points d'accès polyvalents
EP4387146A1 (fr) Procédé de communication et appareil de communication
CN118283809A (zh) 一种通信方法及装置
JP2024507320A (ja) マルチリンク動作ベースの測定報告

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: UNKNOWN

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20220811

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

RIC1 Information provided on ipc code assigned before grant

Ipc: H04W 84/12 20090101ALN20230112BHEP

Ipc: H04W 72/12 20090101AFI20230112BHEP

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
INTG Intention to grant announced

Effective date: 20230215

GRAJ Information related to disapproval of communication of intention to grant by the applicant or resumption of examination proceedings by the epo deleted

Free format text: ORIGINAL CODE: EPIDOSDIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

INTC Intention to grant announced (deleted)
RIC1 Information provided on ipc code assigned before grant

Ipc: H04W 84/12 20090101ALN20230615BHEP

Ipc: H04W 72/12 20090101AFI20230615BHEP

INTG Intention to grant announced

Effective date: 20230703

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602020022648

Country of ref document: DE

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: NL

Ref legal event code: FP

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20240314

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG9D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231213

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: NL

Payment date: 20240226

Year of fee payment: 5

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231213

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231213

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20240314

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231213

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20240313

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20240228

Year of fee payment: 5

Ref country code: GB

Payment date: 20240227

Year of fee payment: 5

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1641556

Country of ref document: AT

Kind code of ref document: T

Effective date: 20231213

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231213

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231213

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20240313

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231213

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20231213