WO2019239006A1 - Contention de canal dans un réseau sans fil - Google Patents

Contention de canal dans un réseau sans fil Download PDF

Info

Publication number
WO2019239006A1
WO2019239006A1 PCT/FI2019/050399 FI2019050399W WO2019239006A1 WO 2019239006 A1 WO2019239006 A1 WO 2019239006A1 FI 2019050399 W FI2019050399 W FI 2019050399W WO 2019239006 A1 WO2019239006 A1 WO 2019239006A1
Authority
WO
WIPO (PCT)
Prior art keywords
contention method
value
contention
frame
access
Prior art date
Application number
PCT/FI2019/050399
Other languages
English (en)
Inventor
Olli Alanen
Jari Pekka MUSTAJÄRVI
Hans Thomas HÖHNE
Janne Petteri Tervonen
Mika Kasslin
Original Assignee
Nokia Technologies Oy
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 Nokia Technologies Oy filed Critical Nokia Technologies Oy
Priority to EP19727445.9A priority Critical patent/EP3804444A1/fr
Publication of WO2019239006A1 publication Critical patent/WO2019239006A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0808—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]
    • H04W74/0816—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA] with collision avoidance
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0833—Random access procedures, e.g. with 4-step access
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0833—Random access procedures, e.g. with 4-step access
    • H04W74/0841—Random access procedures, e.g. with 4-step access with collision treatment
    • H04W74/085—Random access procedures, e.g. with 4-step access with collision treatment collision avoidance
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0866—Non-scheduled access, e.g. ALOHA using a dedicated channel for access
    • H04W74/0875—Non-scheduled access, e.g. ALOHA using a dedicated channel for access with assigned priorities based access

Definitions

  • the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus to receive, before the association, a third frame comprising the first value or the second value of the selection parameter.
  • one of the first value and the second value indicates that one of the first contention method and the second contention method is to be used for a first time interval before using the other one of the first contention method and the second contention method.
  • a computer program product embodied on a distribution medium readable by a computer and comprising program instructions which, when loaded into an apparatus, execute a computer process comprising: establishing an association with an access node of a wireless network; receiving, during the association, a first frame comprising a first value of a selection parameter for selection between a first contention method and a second contention method in the wireless network and select one of the first contention method and the second contention method on the basis of the first value; and receiving, during the association, a second frame comprising a second value, different from the first value, of the selection parameter for selection between the first contention method and the second contention method and select one of the first contention method and the second contention method on the basis of the second value.
  • Figure 2 illustrates a process for selecting a contention method according to an embodiment of the invention
  • Figure 5 illustrates a flow diagram of a process for selecting a contention method and estimating traffic intensity in an access node according to an embodiment of the invention
  • FIGS 10 and 11 illustrate block diagrams of structures of apparatuses according to some embodiments of the invention.
  • a station detecting the trigger frame with the UORA allocation may start channel contention.
  • the UORA-based channel contention may also employ the backoff factors, e.g. based on EDCA.
  • the station may access any the sub-band(s) allocated to the station for use in UORA channel access.
  • the frames transmitted in steps 204 and 212 are unicast or multicast frames addressed to the station.
  • access node may transmit a dedicated selection parameter value to each station.
  • the access node may also make the selection of the channel contention method per stations in blocks 202 and 210. This may allow flexible allocation of the stations to use any one or both channel contention methods.
  • the access node may, for example, schedule some stations to use the first contention method while other stations are scheduled to use the second contention method.
  • a resource allocation may be periodic, as illustrated by the resource allocations 312, 314 that are the same as resource allocations 300, 302, respectively.
  • the apparatus comprises the at least one processor and at least one memory 20 including a computer program code 22, wherein the at least one processor and the computer program code 22 perform the at least some of the functionalities of the access node according to any one of the embodiments of Figures 2 to 7 and 9.
  • the at least one processor, the memory, and the computer program code form processing means for carrying out some embodiments in the access node.
  • the apparatus carrying out some embodiments in the access node comprises a circuitry including at least one processor and at least one memory 20 including computer program code 22. When activated, the circuitry causes the apparatus to perform the at least some of the functionalities of the access node according to any one of the embodiments of Figures 2 to 7 and 9.

Landscapes

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

Abstract

L'invention concerne une solution pour sélectionner un procédé de contention dans un réseau sans fil. Selon un aspect, un procédé consiste à : établir, par un appareil, une association avec un nœud d'accès d'un réseau sans fil; recevoir, par l'appareil pendant l'association, une première trame comprenant une première valeur d'un paramètre de sélection pour une sélection entre un premier procédé de contention et un second procédé de contention dans le réseau sans fil et sélectionner l'un parmi le premier procédé de contention et le second procédé de contention sur la base de la première valeur; et recevoir, par l'appareil pendant l'association, une seconde trame comprenant une seconde valeur, différente de la première valeur, du paramètre de sélection pour une sélection entre le premier procédé de contention et le second procédé de contention et sélectionner l'un parmi le premier procédé de contention et le second procédé de contention sur la base de la seconde valeur.
PCT/FI2019/050399 2018-06-11 2019-05-23 Contention de canal dans un réseau sans fil WO2019239006A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP19727445.9A EP3804444A1 (fr) 2018-06-11 2019-05-23 Contention de canal dans un réseau sans fil

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201862683269P 2018-06-11 2018-06-11
US62/683,269 2018-06-11

Publications (1)

Publication Number Publication Date
WO2019239006A1 true WO2019239006A1 (fr) 2019-12-19

Family

ID=66676564

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/FI2019/050399 WO2019239006A1 (fr) 2018-06-11 2019-05-23 Contention de canal dans un réseau sans fil

Country Status (2)

Country Link
EP (1) EP3804444A1 (fr)
WO (1) WO2019239006A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2543583A (en) * 2015-10-23 2017-04-26 Canon Kk Improved contention mechanism for access to random resource units in an 802.11 channel
WO2017150041A1 (fr) * 2016-03-04 2017-09-08 Panasonic Intellectual Property Management Co., Ltd. Appareil et procédé de priorisation d'accès aléatoire dans un système de communication sans fil à utilisateurs multiples
GB2555143A (en) * 2016-10-21 2018-04-25 Canon Kk QoS management for multi-user EDCA transmission mode in wireless networks

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2543583A (en) * 2015-10-23 2017-04-26 Canon Kk Improved contention mechanism for access to random resource units in an 802.11 channel
WO2017150041A1 (fr) * 2016-03-04 2017-09-08 Panasonic Intellectual Property Management Co., Ltd. Appareil et procédé de priorisation d'accès aléatoire dans un système de communication sans fil à utilisateurs multiples
GB2555143A (en) * 2016-10-21 2018-04-25 Canon Kk QoS management for multi-user EDCA transmission mode in wireless networks

Also Published As

Publication number Publication date
EP3804444A1 (fr) 2021-04-14

Similar Documents

Publication Publication Date Title
EP3138314B1 (fr) Appareil et procédé de communication d'un trafic sur des spectres sans licence ou sous licence sur la base de contraintes de qualité de service (qos) du trafic
US11252576B2 (en) Method and system for dynamic optimization of a time-domain frame structure
Alshamrani et al. QoS provisioning for heterogeneous services in cooperative cognitive radio networks
EP3132571B1 (fr) Appareil et procédé d'attribution dynamique de ressources sur des spectres avec licence et sans licence
CN107113795B (zh) 用于非授权频谱中联合协调和共存的方法和系统
US9191987B2 (en) Determining “fair share” of radio resources in radio access system with contention-based spectrum sharing
US20130136013A1 (en) Handshaking Protocol Using Bursts in OFDMA Frame Structure
US10693618B2 (en) Multiplexed messaging in wireless network
US11863996B2 (en) Centralized coordination for shared spectrum systems
EP3322242B1 (fr) Procédé et dispositif de commande de transmission, de déclenchement de transmission, et d'implémentation de transmission pour une pluralité de stations
US10348641B2 (en) Method of joint optimization of channel selection and frame scheduling for coexistence of LTE and WLAN in unlicensed band
WO2015002656A1 (fr) Exécution de mesures dans un réseau sans fil
EP3079308A1 (fr) Procédé et appareil de traitement de communications pour réseau sans fil
KR20190107118A (ko) 사용되지 않은 장기간 ul 할당의 사용
CN110832934B (zh) Ue在具有子集限制的宽带宽上随机接入的系统及方法
KR20170022105A (ko) 무선 통신 시스템에서 채널 액세스를 제어하기 위한 장치 및 방법
US10856294B2 (en) Device-to-device data transmission method, apparatus, and system
EP3804444A1 (fr) Contention de canal dans un réseau sans fil
US20220400514A1 (en) Controlling transmission medium access in an open spectrum
CN116033566A (zh) 资源指示方法、节点和存储介质
CN116326094A (zh) 资源调度的确定方法、装置及存储介质

Legal Events

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

Ref document number: 19727445

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2019727445

Country of ref document: EP

Effective date: 20210111