EP2594105B1 - Procédés et appareils pour la planification mimo mu montante - Google Patents

Procédés et appareils pour la planification mimo mu montante Download PDF

Info

Publication number
EP2594105B1
EP2594105B1 EP11807303.0A EP11807303A EP2594105B1 EP 2594105 B1 EP2594105 B1 EP 2594105B1 EP 11807303 A EP11807303 A EP 11807303A EP 2594105 B1 EP2594105 B1 EP 2594105B1
Authority
EP
European Patent Office
Prior art keywords
stas
sta
deadline
buffered traffic
frame
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.)
Not-in-force
Application number
EP11807303.0A
Other languages
German (de)
English (en)
Other versions
EP2594105A4 (fr
EP2594105A2 (fr
Inventor
Michelle X. Gong
Adrian P. Stephens
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.)
Intel Corp
Original Assignee
Intel Corp
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 Intel Corp filed Critical Intel Corp
Publication of EP2594105A2 publication Critical patent/EP2594105A2/fr
Publication of EP2594105A4 publication Critical patent/EP2594105A4/fr
Application granted granted Critical
Publication of EP2594105B1 publication Critical patent/EP2594105B1/fr
Not-in-force legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access, e.g. scheduled or random access
    • H04W74/04—Scheduled or contention-free access
    • H04W74/06—Scheduled or contention-free access using polling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413—MIMO systems
    • H04B7/0452—Multi-user MIMO systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/121—Wireless traffic scheduling for groups of terminals or users
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/1221—Wireless traffic scheduling based on age of data to be sent

Definitions

  • This disclosure relates generally to the field of wireless communication, and in particular to scheduling uplink transmissions in a network that utilizes Uplink (UL) Multi-User (MU) Multiple-Input and Multiple-Output (MIMO).
  • UL Uplink
  • MU Multi-User
  • MIMO Multiple-Input and Multiple-Output
  • MU MIMO is a signal transmission technique used in wireless communication systems where multiple mobile stations (STAs) are allowed to communicate with an access point (AP) having multiple antenna elements sharing a same transmission time and frequency.
  • STAs mobile stations
  • AP access point
  • UL MU MIMO the AP is configured to receive, via multiple spatially apart antenna elements, combined signals simultaneously transmitted from a plurality of STAs and separate the received signals into independent signals from each STA through appropriate signal processing.
  • DL downlink
  • the AP transmits directional radio signals via multiple spatially separated antenna elements towards intended STAs.
  • an AP schedules uplink transmissions from multiple STAs. Because all STAs participate in the same UL MU MIMO transmission needs to be transmitted simultaneously and thus, the AP needs to poll STAs that can participate in the same UL MU MIMO transmission. Scheduling mechanisms are required at the AP so that the AP can poll STAs more efficiently. Moreover, a signaling mechanism is needed for the AP to be informed of the buffered traffic at each STA and to determine when to poll and which STAs to poll.
  • US 2008/095124 relates to techniques and systems designed to dynamically control communications between wireless devices and an access point in a wireless local area network (WLAN) to enhance the quality of service (QoS). Described techniques and systems may be implemented to further enhance QoS in WLANs under IEEE 802.11e.
  • WLAN wireless local area network
  • US 2010/118798 relates to a method for transmitting data from the user equipment (UE) of a wireless communication system to the network comprising, upon receiving uplink scheduling information from the network, periodically transmitting uplink data to the network according to a first period, and if a buffer status of the user equipment (UE) satisfies a predetermined condition, transmitting buffer status information to the network.
  • the method further includes periodically transmitting uplink data to the network according to a second period different from the first period
  • Access Category A label for the common set of enhanced distributed channel access (EDCA) parameters that are used by a quality of service (QoS) station (STA) to contend for the channel in order to transmit medium access control (MAC) service data united (MSDUs) with certain priorities.
  • EDCA enhanced distributed channel access
  • Access Point Any entity that has a station (STA) functionality and provides access to the distribution services, via the WM for associated STAs.
  • PDUs protocol data units
  • STAs stations
  • EDCA Enhanced Distributed Channel Access
  • QoS quality of service
  • BSS QoS basic service
  • HCF hybrid coordination function
  • EDCAF Enhanced Distributed Channel Access Function
  • Frame A basic unit for data transmission between stations.
  • MS Mobile Station
  • MS A type of STA that uses network communications while in motion.
  • MIMO Multiple-Input and Multiple-Output
  • Piggyback The overloading of a data frame with an acknowledgement of a previously received medium access control (MAC) protocol data unit (MPDU) and/or a poll to the station (STA) to which the frame is directed.
  • MAC medium access control
  • MPDU protocol data unit
  • Prioritized Quality of Service The provisioning of service in which the medium access control (MAC) protocol data units (MPDUs) with higher priority are given a preferential treatment over MPDUs with a lower priority.
  • Prioritized QoS is provided through the enhanced distributed channel access (EDCA) mechanism.
  • EDCA enhanced distributed channel access
  • STA Any device that contains an IEEE 802.11-conformant medium access control (MAC) and physical layer (PHY) interface to the wireless medium (WM).
  • MAC medium access control
  • PHY physical layer
  • Uplink A unidirectional link from a non-access point (non-AP) station (STA) to an access point (AP).
  • Wireless medium The medium used to implement the transfer of protocol data units (PDUs) between peer physical layer (PHY) entities of a wireless local area network (LAN).
  • PDUs protocol data units
  • PHY peer physical layer
  • LAN wireless local area network
  • a computer-implemented method includes receiving a field or a frame from the one or more stations (STAs) at an access point (AP), wherein the field or the frame includes information on buffered traffic and a timeout value for a given access category (AC); and scheduling the one or more STAs to transmit uplink traffic simultaneously through a polling frame.
  • STAs stations
  • AP access point
  • AC timeout value for a given access category
  • an apparatus in accordance with an aspect of the present disclosure, includes a receiver arranged to receive a field or a frame from the one or more stations (STAs) at an access point (AP), wherein the field or the frame includes information on buffered traffic and a timeout value for a given access category (AC); and a schedule module arranged to schedule the one or more STAs to transmit uplink traffic simultaneously through a polling frame.
  • STAs stations
  • AP access point
  • AC access category
  • a method includes determining a timeout value per access channel (AC), by an access point (AP), when the AP receives buffered traffic information from one or more stations (STAs).
  • AC timeout value per access channel
  • STAs stations
  • an apparatus includes a processor that is arranged to execute instructions on a computer-readable storage medium including the functions of: determining a timeout value per access channel (AC), by an access point (AP), when the AP receives buffered traffic information from one or more stations (STAs).
  • AC timeout value per access channel
  • AP access point
  • STAs stations
  • a computer-implemented method includes transmitting, by station (STA), a field or a frame at an access point (AP), wherein the field or the frame includes information on buffered traffic and a timeout value for a given access category (AC).
  • STA station
  • AP access point
  • AC timeout value for a given access category
  • an apparatus in accordance with an aspect of the present disclosure, includes a transmitter arranged to transmit, by station (STA), a field or a frame at an access point (AP), wherein the field or the frame includes information on buffered traffic and a timeout value for a given access category (AC).
  • STA station
  • AP access point
  • AC timeout value for a given access category
  • Various embodiments disclosed herein relate to a computer-implemented method that allows an AP to efficiently poll various information from STAs and capable of transmitting various types of MAC frames using uplink mechanism.
  • an AP schedules uplink transmissions from multiple STAs. Because all STAs participate in the same UL MU MIMO transmission need to transmit simultaneously, the AP needs to poll STAs that can participate in the same UL MU MIMO transmission. To avoid blindly polling STAs without buffered traffic, the AP needs to estimate the buffered traffic at each STA and determines when to poll and which STAs to poll.
  • a STA signals its buffered traffic information to the AP. Upon receiving buffered traffic information from one or more STAs, the AP schedules some STAs to transmit uplink traffic simultaneously.
  • each STA with buffered traffic may include a buffered traffic status such as a request for a transmission right and/or queue size of buffered traffic in any uplink frame.
  • the STAs can contend to transmit uplink data frames using EDCA and the buffered traffic status may be piggybacked with the uplink data frames.
  • the AP may poll multiple STAs for an UL MU MIMO transmission. After a STA receives a polling frame including a particular transmission right granted to each of the STAs, it can transmit its buffered traffic during a period determined by the AP.
  • the UL MIMO STA may employ a signaling mechanism to notify the AP about buffered traffic from each UL MIMO STA per AC and a timeout value per AC.
  • Two scheduling mechanisms may be used to enable an AP to intelligently and effectively schedule UL MU MIMO transmissions from different STAs.
  • the first scheduling involves an earliest deadline first scheduling approach and the second scheduling mechanism involves a hybrid approach.
  • the QoS channel access method for the IEEE 802.11 Wireless LANs is the Enhanced Distributed Channel Access (EDCA) mechanism, which differentiates transmission treatments for data frames belonging to different traffic categories with four different levels of channel access priority.
  • Frames may be queued for transmission to an AP and frames may be of different size.
  • the AP may utilize information, including access category information, to formulate a relative priority between the pending data.
  • IEEE 802.11 specifies priorities, referred to as user priorities (UP) and a packet with a specific UP belongs to an access category (AC) ranging from packets having the lowest tolerance for delay (highest priority) to those having the most delay tolerance (lowest priority). For example, AC BK (Background) and AC_BE (Best Effort) tend to have the highest tolerance for delay. Theses ACs can include applications such as web surfing and email.
  • the ACs having the least tolerance for day include AC_VI (Video) and AC_VO (Voice).
  • FIG. 1 illustrates an example architecture of a system 100 in accordance with various aspects of the present disclosure.
  • the system 100 may include AP 102 configured to wirelessly communicate with associated STAs 106a, 106b, 106c and 106d (hereinafter "STA 106") via multiple spatially separated antenna elements 104a-104c.
  • STAs 106a and 106b may simultaneously transmit radio signals to AP 102 using same frequency band and same transmission time using, for example, UL mechanism.
  • AP 102 may receive the signals simultaneously transmitted from the STAs via the antenna elements 104a-104c and separate the received signals into a plurality of individual signals each corresponding to the transmission signal from each STA.
  • AP 102 may communicate with STA 106 various types of frames that may be used to coordinate schedules for frame transmissions between AP 102 and STA 106.
  • AP 102 may be configured as an Access Point (AP) in the IEEE 802.11 standard.
  • AP Access Point
  • FIG. 2 is a block diagram illustrating an example STA 106 in accordance with various aspects of the present disclosure.
  • STA 106 may include, among others, a transceiver 202, a control frame generation module 204 and buffered data management module 206.
  • Transceiver 202 may transmit to and receive various communications from AP 102 via the wireless medium.
  • transceiver 202 may receive from AP 102 various communications, including a group polling and polling frames; and transmit to AP 102 various communications.
  • FIG. 3 is a block diagram illustrating an example AP 102 in accordance with various aspects of the present disclosure.
  • AP 102 may include, among others, a transceiver 210, a polling module 212 and a scheduling module 214 arranged to execute a scheduling algorithm, discussed below.
  • Transceiver 210 may transmit data; i.e., but not limited to, polling frames, and receive data; i.e., but not limited to, control field or control frames, from STAs via the wireless medium.
  • the polling module 212 may interact with the scheduling module 214 to transmit the polling frames to the STAs and schedule buffered traffic from the STAs.
  • a STA indicates buffered traffic information in units of 256 octets either in the QoS control field of a QoS data packet or in a control frame.
  • the fields included in the control frame are illustrated in Figure 4.
  • Figure 4 shows example fields in a frame 400 sent from an UL MU MIMO STA to the AP.
  • Fields 405-425 include buffer traffic and timeout information on different ACs.
  • fields 405 and 410 include information on buffered traffic and timeout value for AC_VI, respectively.
  • Field 415 is a generic representative field that can be used for buffered traffic and timeout values for AC_VO and AC_BE.
  • Fields 420 and 425 include information on buffered traffic and timeout value for AC BK, respectively.
  • the AP maintains a data structure the records buffered traffic information for all UL MIMO-capable STAs. To improve QoS for different ACs, the AP also maintains a timeout value per STA per AC, which records a timeout interval in predetermined units of time, for example in units of 64 ⁇ s.
  • setting and maintaining the timeout value can be determined in a variety of manners.
  • the AP determines a timeout value per AC as soon as the AP receives buffered traffic information from a STA.
  • a STA indicates a timeout value along with the buffered traffic information in the frame that the STA transmits to the AP.
  • the AP can update the buffered traffic information per AC for the STA, record the received time of the frame, and reset the timeout value.
  • the sum of the frame received time and the timeout value is the deadline before which the AP needs to poll the corresponding STA. All deadlines associated with zero buffered traffic can be set to a predetermined value, for example, infinity (0xFFFF).
  • the AP can schedule STAs using an Earliest Deadline First Scheduling algorithm.
  • the AP schedules the STA with the earliest deadline.
  • the AP searches through the buffered traffic data structure to look for STAs that meet criterion (2).
  • i arg min k ⁇ ⁇ ; m ⁇ ⁇ d e a d l i n e k m
  • ⁇ denotes the set of STAs that have been chosen for the upcoming UL MU MIMO transmission and ⁇ represents a set of ACs at the AP.
  • Figure 5 illustrates a flow chart of the earliest deadline first scheduling algorithm.
  • the AP searches all STAs with non-zero buffered traffic and chooses a STA with the earliest deadline.
  • the AP determines if there are enough STAs in the set ⁇ . If the determination is no, then the process continues to 515 where a determination is made by the AP as to whether there is another STA with traffic to transmit. If the determination is yes indicating that there are still spatial streams left to accommodate more STAs, then the process continues to 520 where the AP chooses a STA that meets criterion (2) and adds, at 525, the STA to the set ⁇ . The process can then loop back to the determination at 510.
  • the process proceeds to 530 where the STAs are polled in the set ⁇ for UL MU MIMO transmissions.
  • the AP can schedule STAs using a Hybrid Scheduling algorithm.
  • An AP can aggregate as many packets as possible before transmitting them out in one transmission.
  • multiple STAs can transmit from different ACs.
  • the AP searches the deadlines associated with non-zero buffered traffic and looks for the STA with the earliest deadline.
  • the AP compares the earliest deadline with a pre-defined threshold for the AC. If the chosen deadline is below the pre-defined threshold for the AC, the AP schedules the STA. If the chosen deadline is above the threshold, the AP continues to search for an earliest deadline associated with other STAs.
  • the AP chooses STA with earliest deadlines that are below the pre-defined threshold with the corresponding AC until it has enough number of STAs to poll. If the AP has chosen all the STAs with the earliest deadlines that are below the thresholds but more STAs can be accommodated in one UL MU MIMO transmission, the AP can choose the rest of STAs based on the medium duration.
  • ⁇ denotes the set of STAs that have been chosen for the upcoming UL MU MIMO transmission and ⁇ represents a set of ACs.
  • Figure 6 illustrates the flow chart of the hybrid scheduling algorithm.
  • the AP chooses a STA j with the earliest deadline. If the AP determines, at 610, that the earliest deadline is below the pre-defined threshold, the AP chooses the STA as the first user i in the set ⁇ at 615.
  • the AP determines whether there are enough STAs in the set ⁇ . If the result of the determination at 620 is yes, then the AP includes other STAs i that meet criteria (2) in the set ⁇ at 630. If the result of the determination at 620 is yes or the no at 625 indicating that there are enough STAs in ⁇ , the AP polls the STAs in ⁇ for UL MU MIMO transmission at 665.
  • the process can loop back to 610 after 630 to determine whether the deadline is below a threshold. If the AP determines, at 610, that no STA meets the threshold criterion, the AP determines whether all STAs have been searched at 635. If the result of the determination at 635 is no, then the AP chooses anther STA at 640 the process begins again at 605. If the AP determines that all STAs have been search at 635, then the AP chooses STAs i that meets criterion (4) at 645. At 650, the AP adds STA i to the set ⁇ . At 655, the AP determines whether there are enough STAs in the set ⁇ .
  • the AP determines if there is another STA with traffic at 660, and if so, then the process loops back to 645. If there are enough STAs in ⁇ as determined at 655 or there is not another STA with traffic at 660, the AP polls the STAs in ⁇ for UL MU MIMO transmission at 665.
  • various embodiments of this disclosure may be made in hardware, firmware, software, or any suitable combination thereof. Aspects of this disclosure may also be implemented as instructions stored on a machine-readable medium, which may be read and executed by one or more processors.
  • a machine-readable medium may include any mechanism for storing or transmitting information in a form readable by a machine (e.g., a computing device).
  • a machine-readable storage medium may include read only memory, random access memory, magnetic disk storage media, optical storage media, flash memory devices, and others.
  • firmware, software, routines, or instructions may be described herein in terms of specific exemplary embodiments that may perform certain actions. However, it will be apparent that such descriptions are merely for convenience and that such actions in fact result from computing devices, processors, controllers, or other devices executing the firmware, software, routines, or instructions.

Claims (13)

  1. Procédé mis en oeuvre par ordinateur pour une programmation de liaison montante, UL, multi-utilisateur, MU, à entrées multiples et sorties multiples, MIMO, comprenant :
    la réception d'un champ (405-425) ou d'une trame (400) à partir d'une ou de plusieurs stations, STA (106 a-d), au niveau d'un point d'accès, AP (102), le champ (405-425) ou la trame (400) comprenant des informations sur le trafic mis en mémoire tampon et une valeur de temporisation pour une catégorie d'accès donnée, AC, la somme du temps de réception du champ (405-425) ou de la trame (400) et la valeur de temporisation fournissant un délai avant lequel l'AP doit interroger la STA correspondante ; et
    la programmation de la ou des STA (106 a-d) pour transmettre un trafic de liaison montante simultanément par l'intermédiaire d'une trame d'interrogation, la programmation comprenant :
    la recherche, par un AP, de délais pour la ou les STA associées à un trafic mis en mémoire tampon non nul :
    la détermination d'un délai le plus précoce pour la ou les STA, la détermination étant effectuée selon j = arg min k ∈ Θ ; m ∈ ϑ d é l a i k m
    Figure imgb0015
    le délai [k][m] représentant le délai associé à la mième file d'attente CA du kieme utilisateur, Θ représentant un ensemble de STA qui ont un trafic mis en mémoire tampon non nul, et ϑ représentant un ensemble d'AC ; et
    la programmation de la STA avec le délai le plus précoce.
  2. Procédé selon la revendication 1, dans lequel le champ (405-425) est dans la trame (400) ou une trame différente, et le champ (405-425) comprend un champ de commande de qualité de service, QoS, d'un paquet de données QoS.
  3. Procédé selon la revendication 1 ou la revendication 2, comprenant en outre le maintien d'une structure de données qui est agencée pour enregistrer les informations de trafic mises en mémoire tampon et la valeur de temporisation pour la ou les STA (106 a-d) par AC, la ou les STA (106 a-d) étant des STA à capacité UL MU MIMO.
  4. Procédé selon l'une quelconque des revendications précédentes, comprenant en outre la détermination de la valeur de temporisation par AC après que l'AP (102) reçoit les informations de trafic mises en mémoire tampon à partir de la ou des STA (106 a-d).
  5. Procédé selon la revendication 1, comprenant en outre la recherche dans les données de trafic mises en mémoire tampon pour déterminer quelles STA (106 a-d) satisfont i = arg min k ∉ Ω ; m ∈ ϑ d é l a i k m
    Figure imgb0016
     Q représentant l'ensemble de STA (106 a-d) qui ont été choisies pour la transmission UL MU MIMO et ϑ représentant un ensemble d'AC au niveau de l'AP (102).
  6. Procédé selon l'une quelconque des revendications précédentes, la programmation comprenant :
    la recherche, au niveau de l'AP (102), des délais associés à un trafic mis en mémoire tampon non nul ;
    le choix d'une STA (106 a-d) à l'intérieur de la ou des STA (106 a-d) avec le délai le plus précoce ;
    la comparaison du délai le plus précoce avec un seuil prédéfini pour un AC donné ; et
    la programmation de la STA (106 a-d) si le délai le plus précoce est inférieur au seuil prédéfini pour l'AC donné.
  7. Procédé selon la revendication 6, comprenant en outre la recherche du délai le plus précoce associé à une autre STA parmi la ou les STA (106 a-d) si le délai choisie est au-dessus du seuil prédéfini.
  8. Procédé selon la revendication 6 ou la revendication 7, comprenant en outre le choix d'une STA (106 A-d) avec le délai le plus précoce qui est inférieur au seuil prédéfini avec l'AC correspondant jusqu'à ce que l'AP (102) ait suffisamment de nombre de STA (106 a-d) pour interroger.
  9. Procédé selon la revendication 6, la revendication 7 ou la revendication 8, comprenant en outre le choix d'un reste de la ou des STA (106 A-d) sur la base d'une durée moyenne s'il existe une réception supplémentaire dans une transmission UL MU MIMO.
  10. Procédé selon l'une quelconque des revendications 6 à 9 consistant en outre à choisir une STA (106 a-d) par l'AP (102) avec une durée moyenne maximale selon j = arg max k ∈ Θ ; m ∈ ϑ a g g r e g a t e _ p k t _ l e n k m / d a t a _ r a t e k
    Figure imgb0017
  11. Procédé selon la revendication 10, comprenant en outre la recherche dans la structure de données de trafic mis en mémoire tampon une fois que l'AP (102) a choisi le premier utilisateur pour rechercher une STA (106 a-d) satisfaisant i = arg max k ∉ Ω a g g r e g a t e _ p k t _ l e n k A C / d a t a _ r a t e k
    Figure imgb0018
     Q représentant l'ensemble de STA (106 a-d) qui ont été choisies pour la transmission UL MU MIMO et ϑ représentant un ensemble d'AC.
  12. Appareil comprenant des moyens pour mettre en oeuvre un procédé selon l'une quelconque des revendications précédentes.
  13. Support lisible par ordinateur comprenant des instructions lisibles par ordinateur physiquement intégrées sur celui-ci, qui lorsqu'elles sont exécutées, mettent en oeuvre un procédé ou réalisent un appareil selon l'une quelconque des revendications précédentes.
EP11807303.0A 2010-07-12 2011-07-07 Procédés et appareils pour la planification mimo mu montante Not-in-force EP2594105B1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US12/834,165 US8730993B2 (en) 2010-07-12 2010-07-12 Methods and apparatus for uplink MU MIMO scheduling
PCT/US2011/043187 WO2012009205A2 (fr) 2010-07-12 2011-07-07 Procédés et appareils pour la planification mimo mu montante

Publications (3)

Publication Number Publication Date
EP2594105A2 EP2594105A2 (fr) 2013-05-22
EP2594105A4 EP2594105A4 (fr) 2017-01-18
EP2594105B1 true EP2594105B1 (fr) 2018-08-22

Family

ID=45438540

Family Applications (1)

Application Number Title Priority Date Filing Date
EP11807303.0A Not-in-force EP2594105B1 (fr) 2010-07-12 2011-07-07 Procédés et appareils pour la planification mimo mu montante

Country Status (5)

Country Link
US (1) US8730993B2 (fr)
EP (1) EP2594105B1 (fr)
KR (1) KR101529862B1 (fr)
CN (1) CN103081552B (fr)
WO (1) WO2012009205A2 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20200196350A1 (en) * 2015-05-07 2020-06-18 Kabushiki Kaisha Toshiba Wireless communication device, wireless communication terminal and wireless communication method
US11923926B2 (en) 2015-05-07 2024-03-05 International Semiconductor Group Wireless communication device, wireless communication terminal and wireless communication method

Families Citing this family (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8306010B2 (en) * 2010-04-28 2012-11-06 Intel Corporation Systems and methods for uplink multi-user multiple input multiple output (MU MIMO) medium access and error recovery
US8842760B2 (en) * 2012-07-17 2014-09-23 Broadcom Corporation Enhanced multi user MIMO scheduling
US9379794B2 (en) * 2012-10-02 2016-06-28 Qualcomm Incorporated Scheduling transmission for multi-user, multiple-input, multiple-output data
US9131509B2 (en) 2013-04-05 2015-09-08 Cambium Networks Limited Mechanism for group polling without precise timing
CN109245807B (zh) * 2013-06-25 2019-11-19 华为技术有限公司 上行多用户数据传输方法及上行多用户输入输出系统
US20170063589A1 (en) * 2014-04-29 2017-03-02 Intel IP Corporation Packet structure for frequency offset estimation and method for ul mu-mimo communication in hew
WO2015172802A1 (fr) * 2014-05-12 2015-11-19 Telefonaktiebolaget L M Ericsson (Publ) Programmation dans des réseaux locaux sans fil
WO2016003056A1 (fr) * 2014-07-03 2016-01-07 엘지전자(주) Procédé et dispositif pour transmettre des données multiutilisateur de liaison montante dans un système de communication sans fil
US20160014803A1 (en) * 2014-07-09 2016-01-14 Qualcomm Incorporated Systems and methods for traffic information signaling in a wireless communications network
WO2016028117A1 (fr) 2014-08-21 2016-02-25 엘지전자 주식회사 Procédé et appareil de déclenchement de données en liaison montante dans un réseau local (lan) sans fil
US10257854B2 (en) 2015-02-02 2019-04-09 Samsung Electronics Co., Ltd. Management of uplink multi-user transmissions in wireless local area networks
US20160262173A1 (en) * 2015-03-03 2016-09-08 Samsung Electronics Co., Ltd Methods for uplink channel access in wireless local area networks
KR20160113797A (ko) 2015-03-23 2016-10-04 김동욱 현미를 원료로 하는 음료용 분말조성물
TWI710272B (zh) 2015-09-11 2020-11-11 美商內數位專利控股公司 無線區域網路(wlan)多使用者同時隨機存取方法及裝置
US20170265210A1 (en) * 2016-03-14 2017-09-14 Qualcomm Incorporated Techniques for separate scheduling and grouping in wlan
WO2017223228A1 (fr) 2016-06-21 2017-12-28 Marvell World Trade Ltd. Procédé et appareil de demande de ressource mu
WO2018151862A1 (fr) * 2017-02-17 2018-08-23 Qualcomm Incorporated Planification équitable spatio-temporelle pour transmission su et mu sur la base de capacités de couche physique

Family Cites Families (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6009077A (en) * 1997-04-08 1999-12-28 University Of Massachusetts Flow admission control for a router
US20050047425A1 (en) * 2003-09-03 2005-03-03 Yonghe Liu Hierarchical scheduling for communications systems
KR100894198B1 (ko) * 2004-10-28 2009-04-22 더 리젠츠 오브 더 유니버시티 오브 캘리포니아 개선된 서비스 품질을 갖는 무선 통신에 대한 동적어뎁테이션
US20060215686A1 (en) * 2005-03-28 2006-09-28 Nokia Corporation Communication method for accessing wireless medium under enhanced distributed channel access
US7577113B2 (en) * 2005-03-31 2009-08-18 Intel Corporation Device, system and method for coordinating power saving with access categories
US7693175B1 (en) * 2005-04-21 2010-04-06 Avaya Inc. Prioritized access in a multi-channel MAC protocol
KR20080079382A (ko) 2007-02-27 2008-09-01 삼성전자주식회사 무선통신시스템에서 대역폭 요청 처리 장치 및 방법
KR101397048B1 (ko) 2007-03-21 2014-05-20 엘지전자 주식회사 무선 통신 시스템에서의 데이터 전송 방법
WO2009064113A2 (fr) * 2007-11-12 2009-05-22 Lg Electronics Inc. Procédure pour un mode d'économie d'énergie dans un réseau sans fil à établissement de liaison directe
CN101499986B (zh) * 2008-01-31 2012-05-09 富士通株式会社 基站及基站中使用的调度方法
CN101656644A (zh) * 2008-08-18 2010-02-24 清华大学 接入点装置、移动终端、无线通信系统及其控制方法
KR101090765B1 (ko) 2008-12-10 2011-12-08 한국전자통신연구원 무선 통신 시스템에서 스케줄링 장치 및 방법
KR101591093B1 (ko) * 2009-03-16 2016-02-19 엘지전자 주식회사 무선자원 할당 방법
US20100278065A1 (en) * 2009-04-29 2010-11-04 Texas Instruments Inc. Traffic Load Estimation for Access Point Functionality Enabled Mobile Devices
US8885530B2 (en) * 2009-12-24 2014-11-11 Intel Corporation Method and system for power management in an ad hoc network
US9357565B2 (en) * 2010-03-09 2016-05-31 Qualcomm Incorporated Multi-user uplink communication using EDCA with polling

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
None *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20200196350A1 (en) * 2015-05-07 2020-06-18 Kabushiki Kaisha Toshiba Wireless communication device, wireless communication terminal and wireless communication method
US11606232B2 (en) * 2015-05-07 2023-03-14 International Semiconductor Group Wireless communication device, wireless communication terminal and wireless communication method
US11923926B2 (en) 2015-05-07 2024-03-05 International Semiconductor Group Wireless communication device, wireless communication terminal and wireless communication method
US11929857B2 (en) 2015-05-07 2024-03-12 International Semiconductor Group Wireless communication device, wireless communication terminal and wireless communication method

Also Published As

Publication number Publication date
EP2594105A4 (fr) 2017-01-18
CN103081552B (zh) 2016-07-06
KR20130041898A (ko) 2013-04-25
US20120008572A1 (en) 2012-01-12
WO2012009205A3 (fr) 2012-03-08
US8730993B2 (en) 2014-05-20
EP2594105A2 (fr) 2013-05-22
CN103081552A (zh) 2013-05-01
WO2012009205A2 (fr) 2012-01-19
KR101529862B1 (ko) 2015-06-19

Similar Documents

Publication Publication Date Title
EP2594105B1 (fr) Procédés et appareils pour la planification mimo mu montante
US11451269B2 (en) Method and system for multi-user transmit opportunity for multi-user multiple-input-multiple-output wireless networks
EP3133761B1 (fr) Opération sdma à liaison montante efficace
Ha et al. HE-MAC: Harvest-then-transmit based modified EDCF MAC protocol for wireless powered sensor networks
CN108924945A (zh) 一种接入方法及装置
US20100022261A1 (en) Unscheduled protocols for switched antenna arrays
EP1432177B1 (fr) Programme d'appel sélectif pour des sources périodiques du trafic
US10009280B2 (en) Method and apparatus for providing an efficient multi-client access
US20180227891A1 (en) Access method and device for wireless network
US9265064B2 (en) Method and system for transmitting channel feedback information
KR101722759B1 (ko) 무선랜에서의 채널 접근 방법 및 장치
EP3295720B1 (fr) Déclencheur d'économie d'énergie
JP6556268B2 (ja) 競合伝送方法及び装置、プログラムならびに記録媒体
EP3295721B1 (fr) Déclencheur d'économie d'énergie
Derakhshani et al. Cognitive MAC designs: Background

Legal Events

Date Code Title Description
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

17P Request for examination filed

Effective date: 20130130

AK Designated contracting states

Kind code of ref document: A2

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

DAX Request for extension of the european patent (deleted)
A4 Supplementary search report drawn up and despatched

Effective date: 20161215

RIC1 Information provided on ipc code assigned before grant

Ipc: H04W 72/12 20090101AFI20161209BHEP

Ipc: H04B 7/04 20170101ALI20161209BHEP

Ipc: H04W 74/06 20090101ALI20161209BHEP

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

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20170925

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

INTG Intention to grant announced

Effective date: 20180315

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: INTEL CORPORATION

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: AT

Ref legal event code: REF

Ref document number: 1033991

Country of ref document: AT

Kind code of ref document: T

Effective date: 20180915

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602011051367

Country of ref document: DE

REG Reference to a national code

Ref country code: NL

Ref legal event code: FP

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

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

Ref country code: IS

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: 20181222

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: 20180822

Ref country code: FI

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: 20180822

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: 20180822

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: 20181122

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: 20181123

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: 20181122

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: 20180822

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1033991

Country of ref document: AT

Kind code of ref document: T

Effective date: 20180822

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

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: 20180822

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: 20180822

Ref country code: AL

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: 20180822

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

Ref country code: RO

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: 20180822

Ref country code: IT

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: 20180822

Ref country code: CZ

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: 20180822

Ref country code: AT

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: 20180822

Ref country code: PL

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: 20180822

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: 20180822

Ref country code: EE

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: 20180822

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602011051367

Country of ref document: DE

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

Ref country code: SM

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: 20180822

Ref country code: DK

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: 20180822

Ref country code: SK

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: 20180822

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

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

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20190523

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

Ref country code: SI

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: 20180822

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602011051367

Country of ref document: DE

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

Ref country code: MC

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: 20180822

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20190707

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

Ref country code: TR

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: 20180822

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20190731

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

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190707

Ref country code: NL

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190801

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200201

REG Reference to a national code

Ref country code: NL

Ref legal event code: MM

Effective date: 20190801

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

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190707

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190731

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190731

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190731

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

Ref country code: PT

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: 20181222

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190731

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

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190707

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

Ref country code: CY

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: 20180822

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

Ref country code: HU

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

Effective date: 20110707

Ref country code: MT

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: 20180822

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

Ref country code: MK

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: 20180822