EP3804444A1 - Channel contention in wireless network - Google Patents
Channel contention in wireless networkInfo
- Publication number
- EP3804444A1 EP3804444A1 EP19727445.9A EP19727445A EP3804444A1 EP 3804444 A1 EP3804444 A1 EP 3804444A1 EP 19727445 A EP19727445 A EP 19727445A EP 3804444 A1 EP3804444 A1 EP 3804444A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- contention method
- value
- contention
- frame
- access
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 claims abstract description 550
- 238000013468 resource allocation Methods 0.000 claims description 78
- 238000004590 computer program Methods 0.000 claims description 63
- 230000005540 biological transmission Effects 0.000 claims description 43
- 238000004891 communication Methods 0.000 claims description 21
- 230000008569 process Effects 0.000 claims description 21
- 239000000872 buffer Substances 0.000 claims description 9
- 230000003068 static effect Effects 0.000 description 8
- 238000010586 diagram Methods 0.000 description 7
- 238000011156 evaluation Methods 0.000 description 7
- 238000012545 processing Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 6
- 230000000737 periodic effect Effects 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 3
- 238000007726 management method Methods 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 239000000969 carrier Substances 0.000 description 2
- 230000001413 cellular effect Effects 0.000 description 2
- 238000001514 detection method Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 230000011664 signaling Effects 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 230000002457 bidirectional effect Effects 0.000 description 1
- 230000010267 cellular communication Effects 0.000 description 1
- 230000001149 cognitive effect Effects 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 230000001788 irregular Effects 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 239000000523 sample Substances 0.000 description 1
- 238000010187 selection method Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
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
- Various embodiments described herein relate to the field of wireless networking and, particularly, to performing channel contention in a wireless network.
- channel contention is a media access method for a shared medium such as a radio channel.
- a wireless device transmitting first on the radio channel gains access to the shared medium.
- a typical problem in such a system realizes when two devices attempt to transmit at the same time. This is known as a collision.
- To avoid collisions several mechanisms have been proposed.
- One mechanism is carrier sensing mechanism where each device listens to the channel before attempting to transmit. If the channel is detected to be busy, a device waits until the channel is free again.
- Another method employs random backoff time. Upon detecting the channel to be free, a device starts a timer counting a random backoff time. If the channel remains free for the duration of the timer, the device accesses the channel.
- an apparatus comprising at least one processor and at least one memory including a computer program code, wherein the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus to: establish an association with a station of a wireless network; transmit, 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 transmit, 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.
- the first contention method is a single-access contention method where only a single station of the wireless network gains access to a transmission medium at a time
- the second contention method is a multi-access contention method where multiple stations are allowed to access the transmission medium at the same time.
- the first contention method is a backoff-based enhanced distributed channel access contention method of an 802.11 network
- the second contention method is an uplink orthogonal frequency division multiple access random access method.
- the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus to transmit each of the first frame and the second frame in a broadcast frame.
- the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus to transmit each of the first frame and the second frame as a beacon or trigger frame.
- the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus to transmit each of the first frame and the second frame as a unicast frame.
- one of the first value and the second value indicates that the second contention method is preferred over the first contention method
- the other one of the first value and the second value indicates that the first contention method is preferred over the second contention method
- one of the first value and the second value indicates that the second contention method is mandatory, and the other one of the first value and the second value indicates that the second contention method is not mandatory.
- 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.
- the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus to further transmit an information element indicating an estimate of density of resource allocations for the second contention method.
- a determined value of the information element indicates that there are currently no resource allocations to the channel contention according to the second contention method.
- the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus to transmit, before the association, a third frame comprising the first value or the second value of the selection parameter.
- an apparatus comprising
- At least one processor and at least one memory including a computer program code wherein the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus to: establish an association with an access node of a wireless network; receive, 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 receive, 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.
- the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus to transmit to the access node an uplink buffer status report by using the second contention method while another apparatus is performing uplink data transmission to the access node.
- the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus to further receive an information element indicating an estimate of density of resource allocations for the second contention method and to determine, on the basis the information element, whether or not to select the second contention method.
- a determined value of the information element indicates that there are currently no resource allocations to the channel contention according to the second contention method, and wherein the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus to select the first contention method upon detecting the determined value of the information element.
- the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus to: receive an information element indicating an estimate of a time interval between consecutive resource allocations for the second contention method; compare the time interval with delay requirement of a data stream in the apparatus; and select one of the first contention method and the second contention method on the basis of the comparison.
- the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus to: receive an information element indicating an estimate of a bandwidth allocation for the second contention method; compare the estimate of the bandwidth allocation with a quality requirement of a data stream in the apparatus; and select one of the first contention method and the second contention method on the basis of the comparison.
- the first contention method is a single-access contention method where only a single station of the wireless network gains access to a transmission medium at a time
- the second contention method is a multi-access contention method where multiple stations are allowed to access the transmission medium at the same time.
- the first contention method is a backoff-based enhanced distributed channel access contention method of an 802.11 network
- the second contention method is an uplink orthogonal frequency division multiple access random access method.
- the first frame and the second frame are broadcast frames.
- first frame and the second frame are beacon or trigger frames.
- first frame and the second frame are unicast frames.
- one of the first value and the second value indicates that the second contention method is preferred over the first contention method, and the other one of the first value and the second value indicates that the first contention method is preferred over the second contention method.
- one of the first value and the second value indicates that the second contention method is mandatory, and the other one of the first value and the second value indicates that the second contention method is not mandatory.
- 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.
- 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.
- the apparatus further comprises radio interface components providing the apparatus with radio communication capability.
- a method comprising: establishing, by an apparatus, an association with a station of a wireless network; transmitting, by the apparatus 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 transmitting, by the apparatus 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.
- the first contention method is a single-access contention method where only a single station of the wireless network gains access to a transmission medium at a time
- the second contention method is a multi-access contention method where multiple stations are allowed to access the transmission medium at the same time.
- the first contention method is a backoff-based enhanced distributed channel access contention method of an 802.11 network
- the second contention method is an uplink orthogonal frequency division multiple access random access method
- the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus to transmit each of the first frame and the second frame in a broadcast frame. In an embodiment, the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus to transmit each of the first frame and the second frame as a beacon or trigger frame.
- the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus to transmit each of the first frame and the second frame as a unicast frame.
- one of the first value and the second value indicates that the second contention method is preferred over the first contention method
- the other one of the first value and the second value indicates that the first contention method is preferred over the second contention method
- one of the first value and the second value indicates that the second contention method is mandatory, and the other one of the first value and the second value indicates that the second contention method is not mandatory.
- 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.
- the method further comprises transmitting, by the apparatus, an information element indicating an estimate of density of resource allocations for the second contention method.
- a determined value of the information element indicates that there are currently no resource allocations to the channel contention according to the second contention method.
- the method further comprises transmitting, by the apparatus before the association, a third frame comprising the first value or the second value of the selection parameter.
- a method comprising: establishing, by an apparatus, an association with an access node of a wireless network; receiving, by the apparatus 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, by the apparatus 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.
- the method further comprises transmitting, by the apparatus to the access node, an uplink buffer status report by using the second contention method while another apparatus is performing uplink data transmission to the access node.
- the method further comprises: receiving, by the apparatus, an information element indicating an estimate of density of resource allocations for the second contention method and determining, by the apparatus on the basis the information element, whether or not to select the second contention method.
- a determined value of the information element indicates that there are currently no resource allocations to the channel contention according to the second contention method, the method further comprising selecting, by the apparatus, the first contention method upon detecting the determined value of the information element.
- the method further comprises: receiving, by the apparatus, an information element indicating an estimate of a time interval between consecutive resource allocations for the second contention method; comparing, by the apparatus, the time interval with delay requirement of a data stream in the apparatus; and selecting, by the apparatus, one of the first contention method and the second contention method on the basis of the comparison.
- the method further comprises: receiving, by the apparatus, an information element indicating an estimate of a bandwidth allocation for the second contention method; comparing, by the apparatus, the estimate of the bandwidth allocation with a quality requirement of a data stream in the apparatus; and selecting, by the apparatus, one of the first contention method and the second contention method on the basis of the comparison.
- the first contention method is a single-access contention method where only a single station of the wireless network gains access to a transmission medium at a time
- the second contention method is a multi-access contention method where multiple stations are allowed to access the transmission medium at the same time.
- the first contention method is a backoff-based enhanced distributed channel access contention method of an 802.11 network
- the second contention method is an uplink orthogonal frequency division multiple access random access method
- the first frame and the second frame are broadcast frames.
- first frame and the second frame are beacon or trigger frames.
- the first frame and the second frame are unicast frames.
- one of the first value and the second value indicates that the second contention method is preferred over the first contention method
- the other one of the first value and the second value indicates that the first contention method is preferred over the second contention method
- one of the first value and the second value indicates that the second contention method is mandatory, and the other one of the first value and the second value indicates that the second contention method is not mandatory. In an embodiment, 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.
- the method further comprises receiving, by the apparatus before the association, a third frame comprising the first value or the second value of the selection parameter.
- an apparatus comprising: means for establishing an association with a station of a wireless network; means for transmitting, 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 means for transmitting, 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.
- an apparatus comprising: means for establishing, an association with an access node of a wireless network; means for 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 means for 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.
- 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 a station of a wireless network; transmitting, 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 transmitting, 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.
- 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 1 illustrates a wireless communication scenario to which some embodiments of the invention may be applied
- Figure 2 illustrates a process for selecting a contention method according to an embodiment of the invention
- Figure 3 illustrates an example of resource allocation when using a multiple access contention method according to an embodiment of the invention
- Figure 4 illustrates a flow diagram of a process for selecting a contention method in an access node 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
- Figures 6 and 7 illustrate some examples of resource allocations in the view of resource density estimation according to some embodiments of the invention
- Figure 8 illustrates a flow diagram of a process for selecting a channel contention method in a station according to an embodiment of the invention
- Figure 9 illustrates a signalling diagram of a procedure for switching a contention method 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.
- FIG. 1 illustrates a plurality of wireless devices 100, 110 112, 114.
- a wireless device 100 may operate as an access node managing a wireless network and providing the other wireless devices 110 to 114 with wireless access, e.g. to other networks 130 such as the Internet.
- the wireless devices 100 to 1 14 may employ a physical layer and a medium access control (MAC) layer that comply with wireless local area network (WLAN) specifications based on IEEE 802.11 but, in other embodiments, the wireless devices may support another wireless communication protocol as an alternative or in addition to the WLAN.
- MAC medium access control
- a wireless network may be called a basic service set (BSS), the access node may be called an access point, and the wireless devices 110 to 114 served by the access point are called stations (STA).
- BSS basic service set
- STA stations
- peer networks a wireless network operating according to the WLAN specifications may be established amongst the stations. While some embodiments of the invention are described in the context of the IEEE 802.11 , it should be appreciated that these or other embodiments of the invention may be applicable to wireless networks based on other specifications, e.g.
- WiMAX Worldwide Interoperability for Microwave Access
- UMTS LTE Long-term Evolution for Universal Mobile Telecommunication System
- 5G cellular communication systems including unlicensed radio variants, Multefire, mobile ad hoc networks (MANET), mesh networks, and other networks having cognitive radio features, e.g. transmission medium sensing features and adaptive capability to coexist with radio access networks based on different specifications and/or standards.
- Some embodiments may be applicable to networks having features under development by other IEEE task groups. Therefore, the following description may be generalized to other systems as well.
- the access node 100 may be a fixed access point or a mobile access point.
- the wireless devices 110 to 114 may be terminal devices or stations capable of connecting or associating to the access node 100.
- a station 110 may establish a connection with any one of access nodes it has detected to provide a wireless connection within the neighbourhood of the terminal device.
- the connection establishment may include authentication in which an identity of the terminal device is established in the access node.
- the authentication may comprise setting up an encryption key used in the BSS.
- the access node and the station may carry out association in which the station is fully registered in the BSS, e.g. by providing the station with an association identifier (AID).
- AID association identifier
- the separate user authentication may follow association, which may also comprise building an encryption key used in the BSS.
- association of the station to an access node should be understood broadly as establishing a connection between the station and the access node such that the station is in a connected state with respect to the access node and waiting for downlink frame transmissions from the access node and its own buffers for uplink frame transmissions.
- a station not associated to the access node is in an unassociated state.
- An unassociated station may still exchange some frames with the access node.
- Traditional WLAN networks employ a backoff-based channel contention procedure described in Background. As described in the Background, a device attempting channel access may, upon detecting the channel to be free, start a timer counting the backoff time.
- the device may pause the timer until the channel is detected to be free again.
- WLAN has improved the backoff-based channel contention by introducing Enhanced Distributed Channel Access contention protocol in which the backoff time of a station is determined by priority of traffic the station is transmitting. Access classes such as background, best effort, video, and voice were introduced to define the traffic priority classes. A higher priority traffic is associated with a shorter backoff time, thus providing a higher probability of winning the contention ln the EDCA, the channel contention is carried out on a primary channel of the wireless network. A station winning the contention gains the access to the primary channel to transmit one or more frames. Upon winning the contention on the primary channel, the station may employ all the channels of the wireless network in the frame transmission. The channels may include the primary channel and one or more secondary or auxiliary channels. This type of channel contention is suitable for situations where the number of stations performing the channel contention is very limited. When the number of active stations increase, the channel contention may cause high delays to the frame transmissions.
- 1EEE 802.1 lax defines the next generation of the WLAN standard ft adds new features such as support for orthogonal frequency division multiple access (OFDMA) where an access node is capable of scheduling multiple stations to either receive or transmit simultaneously by dividing a frequency band of the wireless network to sub-bands and allocating different sub-bands to different stations ln this context, a sub-band refers to a group of subcarriers of a channel, which may also be called a resource unit. Sub-bands or resource units may be allocated dynamically, i.e. they may not be static over time.
- the protocol also defines an uplink OFDMA random access (UORA) scheme that provides an alternative to the legacy backoff-based contention protocol for uplink communication.
- UORA uplink OFDMA random access
- UORA is based on OFDMA where multiple stations may gain channel access simultaneously. This results from the contention being performed separately per each parallel resource unit, e.g. a frequency sub-band. However, only one station may win the contention within a single resource unit.
- the legacy channel contention principle allows only one station to win the contention on the whole operating frequency band of the network and, thus, gain access to the channel. Therefore, the UORA provides a better channel contention method in a situation where the wireless network is crowded.
- UORA channel contention begins when the access node transmits a trigger frame comprising an information element indicating resource units, e.g. frequency sub-bands, reserved for the UORA channel contention.
- the trigger frame may additionally schedule other sub-bands of the wireless network for other uplink OFDMA frame transmissions, e.g. data frame transmissions for selected one or more associated stations.
- UORA serves for the following exemplary purposes: unassociated stations can transmit management packets such as an association request to the access node by using the UORA; and associated stations with payload data buffered for uplink transmission can send a buffer status report (BSR) to the access node by using the UORA.
- BSR buffer status report
- 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 channel contention allowing multiple stations to win the contention is suitable for certain traffic situations while the legacy principle where only a single station may win the contention at a time may be more optimal to other traffic situations.
- the wireless network may support both channel contention methods, and the selection of the channel may be important from the perspective of the performance of a single station and the whole wireless network.
- Figure 2 illustrates a signalling diagram of a procedure for performing selection of a channel contention method in a wireless network.
- the procedure comprises steps performed in an access node, e.g. the access node 100, and steps performed in a station such as any one of the wireless devices 110 to 114.
- the station and the access node establish an association in step 200.
- the association may be triggered by the station transmitting an association request to the access node.
- the station Upon establishing the association, the station is capable of carrying out data transmissions in the wireless network.
- the access node performs resource allocation and determine a value of a selection parameter for selection between a first contention method and a second contention method.
- the access node transmits, during the association, a first frame comprising the value.
- the station receives the frame comprising the value of the selection parameter. Thereafter, the station may select in block 206 one of the first contention method and the second contention method on the basis of the first value.
- the station may perform channel contention by using the selected channel contention method. Upon winning the contention, the station may transmit a frame to the access node.
- the access node may perform a new resource allocation in block 210 and determine a different value for the selection parameter.
- the access node may transmit a second frame comprising the different value of the selection parameter for the selection between the first contention method and the second contention method.
- the station receives the frame in step 212, and it may select one of the first contention method and the second contention method on the basis of the second value in block 214. Since the selection parameter now has a different value than in steps 202, 204, 206, the station may end up selecting a different channel contention method than in block 206. Thereafter, the station may perform a new channel contention in step 216 by using the channel contention method selected in block 214.
- the embodiment of Figure 2 enables the access node to select and recommend or enforce a determined channel contention method, and it also provides the station with multiple options for performing the channel contention.
- the provision and selection amongst multiple channel contention methods may improve the overall performance of the wireless network under various traffic scenarios.
- the first contention method is a single-access contention method where only a single station of the wireless network gains access to a transmission medium at a time
- the second contention method is a multi-access contention method where multiple stations are allowed to access the transmission medium at the same time.
- Such channel contention methods apply to the 802.11 networks where the first contention method may be the EDCA contention method, e.g. EDCA applied to a primary channel, and the second contention method may be the UORA contention method.
- similar multiple contention methods may be employed, e.g. in MANETs a master node may carry out the functions of the access node while another node performs the functions of the station.
- the frames transmitted in steps 208 and 212 are broadcast frames, e.g. beacon frames or other management frames carrying management information.
- 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.
- Figure 3 illustrates a time-frequency diagram describing some embodiments of the resource allocation for the second contention method.
- the access node may divide the frequency band of the wireless network into sub-bands , for a determined time interval, and allocate, for the determined time interval, some of the sub-bands for the channel contention according to the second contention method (UORA resource 300).
- the access node may further allocate other sub- bands of the same channel for uplink data transmission (data resource 302). This resource allocation may be indicated in the frame transmitted in step 204 and/or 212.
- the access node may select a value for the selection parameter that indicates, promotes, or recommends the use of the second contention method. Accordingly, a station receiving such a value may select the second contention method, or select the second contention method with a higher probability.
- the access node may allocate the whole frequency band to data transmissions (data resource 304).
- the access node may indicate unavailability of the second contention method or transmit a value of the selection parameter that indicates, promotes, or recommends the use of the first contention method. Accordingly, a station receiving such a value may select the first contention method, or select the first contention method with a higher probability.
- the access node may carry out no allocations 305. ln such a time interval, the channel may be free for any wireless device to access ln such a case, the access node may indicate unavailability of the second contention method or transmit a value of the selection parameter that indicates, promotes, or recommends the use of the first contention method. Accordingly, a station receiving such a value may select the first contention method with a higher probability.
- the resource units may be allocated flexibly for the uplink data transmissions and uplink channel contention according to the second contention method ln this case, the uplink data resource allocation 308 is between two channel contention resource allocations 306, 310 in the frequency domain.
- 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 access node may allocate the whole frequency band to the channel contention according to the second contention method ln such a case, the access node may indicate availability of the second contention method or transmit a value of the selection parameter that indicates, promotes, or recommends the use of the second contention method. Accordingly, a station receiving such a value may select the second contention method with a higher probability.
- the access node may evaluate the traffic situation in the wireless network in block 400.
- the evaluation may comprise evaluation of at least one of the following traffic characteristics: a number of associated stations 406, traffic load 404, quality of service (QoS) classification of traffic currently transferred, and QoS classes of the devices in the network.
- the device class may indicate a priority of each device regardless of the type of data the device is transmitting.
- the QoS may thus be a static parameter for a device.
- the access node may perform comparison between the result(s) of the evaluation and one or more criteria for selecting the contention method (block 408). ln the embodiment of Figure 4, the comparison involves determining whether or not the criterion/criteria for using the second contention method (e.g. UORA) have been met. Next, some examples of the criteria are described.
- the criterion for using the second contention method may include a certain threshold in terms of a number of associated stations lf the number of associated station is higher than the threshold, the access node may deem that the criterion for selecting the second contention method has been met.
- the criterion for using the second contention method may include a certain threshold in terms of the traffic load.
- a measure of the traffic load may be a channel utilisation rate, a number of detected collisions, a number of traffic streams, data throughput, or available data transfer capacity in the access node lf the traffic load is higher than the threshold, the access node may deem that the criterion for selecting the second contention method has been met.
- the criterion for using the second contention method may include a certain threshold in terms of the QoS for one or more associated stations or data streams lf the QoS or an average QoS is below the threshold, indicating that the average QoS is associated with lower priority than the level associated with the threshold, the access node may deem that the criterion for selecting the second contention method has been met.
- the comparison in block 408 may include a combination of multiple comparisons and compute an aggregation of the comparison result.
- the process may proceed to block 410 in which the access node allocates resources to the second contention method and transmits a frame indicating the availability of the second contention method. Accordingly, the access node may transmit a frame having a value of the selection parameter that indicates, promotes, or recommends the use of the second contention method ln this case, the selected value of the selection parameter may indicate that the second contention method is preferred over the first contention method.
- the frame may be transmitted in step 204 or 212 when the comparison is made in block 202 or 210, respectively.
- the process may proceed to block 412 in which the access node transmits a frame indicating the availability of the first contention method. Accordingly, the access node may transmit a frame having a value of the selection parameter that indicates, promotes, or recommends the use of the first contention method ln this case, the value of the selection parameter indicates that the first contention method is preferred over the second contention method.
- the frame may be transmitted in step 204 or 212 when the comparison is made in block 202 or 210, respectively.
- the access node performs the process of Figure 4 for associated stations and, separately, for unassociated stations.
- the access node may use different selection criteria for the associated stations than for the unassociated stations and, thus, select a different channel contention method for the associated stations than for the unassociated stations.
- the access node may indicate in the transmitted frame, two values of the selection parameter: one for the associated stations and another for the unassociated stations.
- An unassociated station may use the value of the selection parameter associated with the unassociated stations in the selection of the channel contention method.
- An associated station may use the value of the selection parameter associated with the associated stations in the selection of the channel contention method.
- the access node estimates density of the resources allocated to the second contention method and transmits, in the frame in step 204 or 212 indicating the availability of the second contention method, an information element indicating an estimate of the density of the resource allocations for the second contention method.
- Figure 5 illustrates an embodiment of a process for such operation of the access node.
- Figure 5 is illustrated as an embodiment of Figure 4 and, as a consequence, the same reference numbers may refer to the same or substantially similar operations as in Figure 4.
- the access node may, upon selecting the second contention method in block 408, perform the evaluation of the density of the resource allocations for the second contention method in block 500.
- the estimation may be carried out by evaluating the density in the previous resource allocations the access node has made. Machine learning can also be utilized for the estimation and optimal scheduling.
- the density is estimated in a time domain in terms of an interval between consecutive resource allocations for the second contention method.
- the time interval may be measured by the access node from the previous resource allocations. In embodiments that utilize only periodic resource allocations, the time interval may have a static value. However, in other embodiments the access node may allocate resources to the second contention method in an irregular/aperiodic manner, although some allocations may be periodic. In such a case, the measured density may vary over time, and the estimated density may represent an average time interval between consecutive resource allocations for the second contention method. The average may be computed as mean or median of the time intervals between consecutive resource allocations for the second contention method, for example. In this case, the access node may also compute and maintain variance of the estimate which indicates how regular the resource allocation is in general.
- the density is estimated in a frequency domain in terms of bandwidth allocated for the second contention method.
- the bandwidth may be represented in terms of a number of frequency resource units or sub- bands, for example.
- the bandwidth may be measured by the access node from the previous resource allocations. In embodiments that utilize a fixed bandwidth for resource allocations of the second contention method, the bandwidth may have a static value. However, in other embodiments the access node may employ dynamic bandwidth allocation. In such a case, the measured density may vary over time, and the estimated density may represent an average bandwidth of the resource allocations for the second contention method. The average may be computed as mean or median of the bandwidths allocated to the second contention method, for example. In this case, the access node may also compute and maintain variance of the estimate which indicates how regular the bandwidth of the resource allocation is in general.
- the density is estimated as a combination of the above-described embodiments.
- the density may be estimated both in the frequency domain in terms of a (average) bandwidth allocated for the second contention method and in the time domain in terms of an (average) interval between consecutive resource allocations for the second contention method.
- the access node may carry out block 502 where the access node transmits a frame indicating the estimated density to the station(s).
- the access node may insert also further information on the traffic situation in the frame, e.g. information used when performing the traffic evaluation in blocks 402, 404, and/or 406.
- Such information may thus include traffic QoS information (block 402), information on the load in the network (block 404), and/or information on the number stations in the network (block 406)
- the frame may be the frame transmitted in step 204 or 212, e.g. a frame indicating the availability of the second contention method.
- the station receiving the frame may then evaluate the density in the selection of the contention method, and, in case the further information is available, the further information in the estimation of a probability for winning the channel contention.
- the density and the described pieces of further information may be considered as embodiments of the value of the selection parameter.
- Figures 6 and 7 illustrate some examples of different densities of the resource allocations.
- the resource allocation for the second contention method is relatively static, e.g. periodic with static bandwidth allocation.
- the resources 600, 604 for the second contention method thus occur with a fixed periodicity and bandwidth.
- the remaining bandwidth may be allocated to the uplink data transmissions 610, 614.
- a non-scheduled interval 606 may be provided between the allocations to allow any station to gain access to the transmission medium.
- the resource allocation pattern comprises multiples sets of periodic or regular resource allocations for the second contention method.
- Resource allocations 700 and 712 may belong a static or semi-static resource allocation pattern having fixed periodicity and bandwidth
- resource allocations 706 and 718 may belong another static or semi-static resource allocation pattern having fixed periodicity and bandwidth.
- the bandwidths of these two sets of regular resource allocations for the second contention method have the same periodicity and different bandwidths but, in other embodiments, the periodicities may be different as well, or the periodicities may differ while the bandwidths are equal.
- the bandwidth may be defined in terms of a number of resource units. Each resource unit may have a fixed bandwidth, e.g. a fixed number of consecutive sub-carriers.
- a single resource unit may cover a sub-band of a frequency channel, and all the allocated resource units cover a larger sub-band of the frequency channel or, in a special case, the whole frequency channel of the network. Any combination is possible in a flexible and dynamic resource allocation policy, when employed by the access node.
- data allocations 702, 708, 714, 720 may be carried out to allow concurrent scheduled data transmissions and channel contention by using the second contention method ln some instances, the whole bandwidth may again be scheduled to data transmission (704), or no scheduling is made (716).
- the density is an aggregate of two regular densities, and the variance of the density may be low.
- the access node may employ no regular pattern when allocating resources to the second contention method and, in such a case, the variance may be substantially high.
- the station may employ the information on the density of the resource allocations for the second contention method when performing the selection between the first contention method and the second contention method.
- Figure 8 illustrates such an embodiment in the form of a process executed by the station.
- the station may record a stamp associated with the resource (block 802). The detection may be based on reception of a (beacon/trigger/probe response) frame comprising the resource allocation for the second contention method and the estimate of the resource density of the allocations for the second contention method.
- the stamp may be a time stamp indicating the timing of the resource, or the stamp may be a bandwidth stamp indicating the bandwidth of the resource, or the stamp may be a combination of the time stamp and the bandwidth stamp.
- the station may extract from the frame the indication of the estimated density of the resources for the second contention method. Since this example uses the time stamp, the estimated density may comprise the time interval between consecutive resource allocations for the second contention method.
- the station is able to estimate when the next resource allocation will be available (block 806), e.g. by using the following equation:
- T t+i T t + TI + delay (variance)
- T represents the timing of the previously detected resource allocation
- TI is the estimate of the time interval between the consecutive allocations
- delay is a parameter proportional to the variance. The higher the variance is, the higher is the value of the delay parameter.
- the station also evaluates delay requirement, e.g. QoS classification, of data traffic the station is has acquired for transmission and, in block 808, compares the delay requirement with the estimated next resource allocation. If the next resource allocation is estimated to be so far in the future that there is a risk for not meeting the delay requirement, the station may select the first contention method and proceed to block 812.
- the first contention method may be the single-access contention method such as the EDCA. If the next resource allocation is estimated to be available such that the delay requirement can be met, the station may select the second contention method and proceed to block 810.
- the second contention method may be the multiple access contention method such as the UORA, and block 810 may comprise waiting for the next UORA resource. From blocks 810 and 812, the process may return to block 800 for detection of the next resource of the second contention method.
- the station may perform the channel contention in the detected UORA resource by decrementing the backoff time and accessing the UORA resource when the backoff time reaches zero. If the station acquires the data for transmission after block 800 or after the UORA resource has passed, the station may estimate the time until the next UORA resource. If the time is estimated to be acceptable, the station may perform the channel contention of block 810 in the next UORA resource.
- the station may acquire the time stamps of a number of past UORA resource allocations, e.g. time stamps 0, 22, and 38 milliseconds (ms). The station may thus estimate that the next UORA resource allocation may be scheduled in a time window [55 ms; 65 ms]. If the station has buffered uplink data which expires (no longer meets the delay requirements of the data) at a time instant 45 ms, the station may decide to attempt the legacy channel contention in block 812 rather than wait for the next UORA resource allocation. Accordingly, the station may meet the delay requirements.
- the station may estimate in block 806 a delay for transmitting the buffer status report in the next UORA resource and, thereafter, to send the data.
- the station may estimate a delay for transmitting the data in the next UORA resource.
- the station may utilize the bandwidth as the resource density in blocks 806 and 808. If the station determines that the bandwidth is high enough for a sufficient probability of gaining the channel access by using the second contention method, the station may select the second contention method.
- the sufficiency of the bandwidth may be defined by a bandwidth threshold against which the comparison is made in block 808. The bandwidth threshold may depend on the access class of the traffic, for example. On the other hand, if the bandwidth of the estimated resource allocation is below the bandwidth threshold, the station may select the first contention method.
- the access node may estimate and transmit multiple different resource intensities, e.g. one density in terms of the time interval between consecutive resource allocations and another density in terms of the bandwidth of a resource allocation.
- multiple different resource intensities e.g. one density in terms of the time interval between consecutive resource allocations and another density in terms of the bandwidth of a resource allocation.
- Another example based on Figure 7 would be indication of multiple different time intervals, e.g. when the access node applies multiple different periodic patterns in the resource allocation.
- the access node may include the resource density /densities in the information element“Multiuser EDCA Parameter Set Element”.
- the information element carrying information on the resource density in the frame may include at least one of the following pieces of the resource density information: the (mean) time interval between consecutive resource allocations for the second contention method in time units such as microseconds (us), the (mean) bandwidth of a resource allocation for the second contention method in terms of a number of resource units, and a statistical parameters such as the variance indicating the accuracy of the estimate.
- a special value of the information element (e.g. zero) may indicate that there are currently no resource allocations for the second contention method.
- the access node may indicate the resource density for the second contention method, and the selection of the contention method is made autonomously by each station that decides to perform channel contention. As described above, the selection may include the evaluation of the further information on the traffic situation in the network, provided that such information is available to the station.
- the access node may transmit a recommendation of the contention method to be used in the frame, e.g. the beacon frame.
- the access node may recommend the use of the second contention method when the access node has allocated resources to the second contention method.
- the access node may recommend the use of the first contention method when even the access node has allocated resources to the second contention method.
- the recommendation may be based on the traffic situation in the wireless network, as described above ln such cases, each station may determine whether or not to obey the recommendation. However, each station may prioritize the use of the recommended contention method. Another factor such as the delay requirement of the uplink data traffic in the station may, however, cause the station to perform selection against the recommendation.
- Multiple recommendation classes may be provided for the access node to indicate the strength of the recommendation. The station may then assign a different weight for the second contention method in the decision-making on the bases of the recommendation class indicated by the access node.
- the access node may indicate in the frame whether or not the second contention method is mandatory to the stations. Accordingly, the access node may enforce the use of the second contention method, if it chooses to do so. Accordingly, one value of the selection parameter may indicate that the second contention method is mandatory, and another value of the selection parameter indicates that the second contention method is not mandatory.
- a background for making the second contention method mandatory may be that the second contention method is more efficient when evaluating the performance of the whole network, while the first contention method may be more efficient for a single station. Therefore, without the enforced use of the second contention method the stations may prefer the first contention method.
- the access node sets one of the first value and the second value to indicate 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.
- Figure 9 illustrates an embodiment where the access node configures the station to first use the second contention method and, upon failing to gain channel access with a determined time interval T, to switch to the first contention method. Referring to Figure 9, the process may proceed in the above-described manner in steps 200 to 206. Accordingly, in step 204 the access node transmits a frame where the value of the selection parameter indicates to the station that the second contention method shall be used for the determined time interval before the use of the first contention method is allowed.
- the station Upon receiving the frame and extracting the value of the selection parameter, the station starts the channel contention according to the second contention method in block 206. If the station manages to gain channel access within the time interval T (block 900), the station transmits an uplink frame in step 208. Upon failing to gain channel access within the time interval T (block 900), the station switches the contention method to the first contention method in block 902. In step 904 upon winning the contention by using the first contention method, the station transmits an uplink frame to the access node.
- the access node may include the recommendation of the contention method in the information element“Multiuser EDCA Parameter Set Element”.
- the indication of whether or not the second contention method is mandatory may be transmitted in the information element “Multiuser EDCA Parameter Set Element”.
- the indication of that the second contention method shall be used for a determined time interval before switching to the first contention method may be transmitted in the information element“Multiuser EDCA Parameter Set Element”.
- Figure 10 illustrates an embodiment of a structure of the above-mentioned functionalities of an apparatus executing the functions of the access node in the process of Figure 2 or any one of its embodiments.
- the apparatus may be the access node.
- the apparatus may comply with specifications of an IEEE 802.11 network and/or another wireless network.
- the apparatus may be or may be comprised in a computer (PC), a laptop, a tablet computer, a cellular phone, a palm computer, a sensor device, a router device, or any other apparatus provided with radio communication capability.
- the apparatus carrying out the above-described functionalities of the service provider device is comprised in such a device, e.g. the apparatus may comprise a circuitry, e.g. a chip, a chipset, a processor, a micro controller, or a combination of such circuitries in any one of the above-described devices.
- the apparatus may be an electronic device comprising electronic circuitries for realizing some embodiments of the access node.
- the apparatus may comprise radio interface components 12 configured to provide the apparatus with capability for bidirectional radio communication with other wireless devices in a wireless network.
- the radio interface components 12 may comprise analogue radio communication components and digital baseband processing components for processing received frames and frames to be transmitted.
- the radio interface components 12 may comprise standard well-known components such as a radio modem, an amplifier, filter, frequency-converter, (de)modulator, and encoder/decoder circuitries and one or more antennas.
- the apparatus may further comprise a memory 20 storing one or more computer program products 22 configuring the operation of at least one processor of the apparatus, e.g. a communication circuitry described below.
- the memory 20 may further store a configuration database 24 storing operational configurations of the apparatus.
- the configuration database may, for example, store configuration parameters for the selection of the contention method according to any one of the above-described embodiments.
- the configuration database 24 may, for example, store traffic parameters for the execution of block 400.
- the apparatus may further comprise a communication circuitry 14 configured to control or manage a wireless network operated by the access node.
- the communication circuitry 14 may comprise a frame handler 15 configured to manage the contents of the transmitted and received frames.
- the frame handler 15 may, for example, manage the contents of the frame that comprises the selection parameter.
- the communication circuitry may further comprise a contention method selector 18 configured to select the contention method for the wireless network.
- the contention method selector may make the selection between the first and second contention method.
- the contention method selector may select only one of the contention methods to be used at a time, or the contention method selector may at some occasions enable both or all contention methods.
- the contention method selector 16 may employ a traffic analysis module in the selection.
- the traffic analysis module 16 may be configured to execute block 400, for example.
- the contention method selector 18 may also determine the amount of resource to schedule for the second contention method.
- the contention method selector may then utilize a scheduler 17 to carry out the actual scheduling of the resources.
- the scheduler 17 may be configured to carry out scheduling of the resources for the second contention method in connection with scheduling resources to associated stations for uplink data transmission.
- the scheduler may employ any one of the above-described scheduling principles for scheduling the resources for the second contention method.
- the apparatus comprises at least one processor and at least one memory 20 including a computer program code 22, wherein the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus to carry out the functionalities of the access node according to any one of the embodiments of Figures 2 to 7 and 9.
- the computer program code when the at least one processor executes the computer program code, the computer program code causes the apparatus to carry out the functionalities according to any one of the embodiments of Figures 2 to 7 and 9.
- 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.
- Figure 11 illustrates an embodiment of a structure of the above-mentioned functionalities of the apparatus executing the process of Figure 2 or any one of the embodiments performed by the station.
- the apparatus may be the station.
- the apparatus may comply with 1EEE 802.11 technology and/or another wireless networking technology.
- the apparatus may be or may be comprised in a computer (PC), a laptop, a tablet computer, a cellular phone, a palm computer, a sensor device, or any other apparatus provided with radio communication capability ln another embodiment, the apparatus carrying out the above-described functionalities is comprised in such a station, e.g. the apparatus may comprise a circuitry, e.g. a chip, a chipset, a processor, a micro controller, or a combination of such circuitries in any one of the above-described devices.
- the apparatus may be an electronic device comprising electronic circuitries for realizing some embodiments of the present invention.
- the apparatus may comprise radio interface components 52 providing the apparatus with radio communication capability within one or more wireless networks.
- the radio interface components may comprise standard well-known components such as a radio modem, amplifier, filter, frequency-converter, (de)modulator, and encoder/decoder circuitries and one or more antennas.
- the apparatus may further comprise a memory 60 storing one or more computer program products 62 configuring the operation of at least one processor of the apparatus.
- the memory 60 may further store a configuration database 64 storing operational configurations of the apparatus.
- the configuration database 64 may, for example, store rules for selecting a contention method on the basis of a selection parameter received from the access node, as described in the embodiments above.
- the memory 60 may further store an uplink data buffer for uplink data waiting for transmission.
- the apparatus may further comprise a communication circuitry 54 managing wireless communications in the apparatus and controlling the operation of the radio interface according to any one of the above-described embodiments.
- the communication controller 54 may comprise a channel access controller 55 configured to manage channel access in the station.
- the channel access controller 55 may be configured to perform channel contention according to a contention method selected by a contention method selector 58.
- the contention method selector may be configured to select the contention method on the basis of the selection parameter received from the access node according to any one of the above-described embodiments. For example, when the selection parameter indicates the second selection method as mandatory, the contention method selector 58 may configure the channel access controller to use the second contention method without further considerations.
- the contention method selector 58 may perform the selection according to current operational conditions of the station, e.g. the delay requirement of the data stored in the buffer 66. Upon selecting the contention method, the contention method selector 58 may configure the channel access controller to employ the selected contention method.
- the apparatus comprises at least one processor and at least one memory 60 including a computer program code 62, wherein the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus to carry out the functionalities of the station according to any one of the embodiments of Figures 2 to 9.
- the computer program code when the at least one processor executes the computer program code, the computer program code causes the apparatus to carry out the functionalities according to any one of the embodiments of Figures 2 to 9.
- the apparatus comprises the at least one processor and at least one memory 60 including a computer program code 62, wherein the at least one processor and the computer program code 62 perform the at least some of the functionalities of the station according to any one of the embodiments of Figures 2 to 9.
- the at least one processor, the memory, and the computer program code form processing means for carrying out some embodiments of the present invention in the station.
- the apparatus carrying out some embodiments of the invention in the station comprises a circuitry including at least one processor and at least one memory 60 including computer program code 62. When activated, the circuitry causes the apparatus to perform the at least some of the functionalities of the station according to any one of the embodiments of Figures 2 to 9.
- the circuitries or modules of the communication circuitries 14, 54 may be realized as sub-circuitries of the respective communication circuitries.
- the circuitries or modules of the communication circuitries 14, 54 may be realized by computer program modules configured to execute of the respective functions of the circuitries or modules.
- circuitry refers to one or more of the following: (a) hardware-only circuit implementations such as implementations in only analog and/or digital circuitry; (b) combinations of circuits and software and/or firmware, such as (as applicable): (i) a combination of processor(s) or processor cores; or (ii) portions of processor(s)/software including digital signal processor(s), software, and at least one memory that work together to cause an apparatus to perform specific functions; and (c) circuits, such as a microprocessor(s) or a portion of a microprocessor(s), that require software or firmware for operation, even if the software or firmware is not physically present.
- circuitry applies to uses of this term in this application.
- the term“circuitry” would also cover an implementation of merely a processor (or multiple processors) or portion of a processor, e.g. one core of a multi-core processor, and its (or their) accompanying software and/or firmware.
- the term“circuitry” would also cover, for example and if applicable to the particular element, a baseband integrated circuit, an application-specific integrated circuit (ASIC), and/or a field-programmable grid array (FPGA) circuit for the apparatus according to an embodiment of the invention.
- ASIC application-specific integrated circuit
- FPGA field-programmable grid array
- the processes or methods described in Figures 2 to 9 may also be carried out in the form of one or more computer processes defined by one or more computer program.
- a separate computer program may be provided in one or more apparatuses that execute functions of the processes described in connection with the figures.
- the computer program(s) may be in source code form, object code form, or in some intermediate form, and it may be stored in some sort of carrier, which may be any entity or device capable of carrying the program.
- Such carriers include transitory and/or non-transitory computer media, e.g. a record medium, computer memory, read-only memory, electrical carrier signal, telecommunications signal, and software distribution package.
- the computer program may be executed in a single electronic digital processing unit or it may be distributed amongst a number of processing units.
- Embodiments described herein are applicable to wireless networks defined above but also to other wireless networks.
- the protocols used, the specifications of the wireless networks and their network elements develop rapidly. Such development may require extra changes to the described embodiments. Therefore, all words and expressions should be interpreted broadly and they are intended to illustrate, not to restrict, the embodiment. It will be obvious to a person skilled in the art that, as technology advances, the inventive concept can be implemented in various ways. Embodiments are not limited to the examples described above but may vary within the scope of the claims.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Description
Claims
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US201862683269P | 2018-06-11 | 2018-06-11 | |
PCT/FI2019/050399 WO2019239006A1 (en) | 2018-06-11 | 2019-05-23 | Channel contention in wireless network |
Publications (1)
Publication Number | Publication Date |
---|---|
EP3804444A1 true EP3804444A1 (en) | 2021-04-14 |
Family
ID=66676564
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP19727445.9A Pending EP3804444A1 (en) | 2018-06-11 | 2019-05-23 | Channel contention in wireless network |
Country Status (2)
Country | Link |
---|---|
EP (1) | EP3804444A1 (en) |
WO (1) | WO2019239006A1 (en) |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2543583B (en) * | 2015-10-23 | 2018-05-16 | Canon Kk | Improved contention mechanism for access to random resource units in an 802.11 channel |
JP6948622B2 (en) * | 2016-03-04 | 2021-10-13 | パナソニックIpマネジメント株式会社 | Access points, communication methods and integrated circuits |
GB2555143B (en) * | 2016-10-21 | 2019-08-21 | Canon Kk | QoS management for multi-user EDCA transmission mode in wireless networks |
-
2019
- 2019-05-23 EP EP19727445.9A patent/EP3804444A1/en active Pending
- 2019-05-23 WO PCT/FI2019/050399 patent/WO2019239006A1/en unknown
Also Published As
Publication number | Publication date |
---|---|
WO2019239006A1 (en) | 2019-12-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP3138314B1 (en) | Apparatus and method for communicating traffic over licensed or un-licensed spectrums based on quality of service (qos) constraints of the traffic | |
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 | |
CN107113795B (en) | Method and system for joint coordination and coexistence in unlicensed spectrum | |
EP3132571B1 (en) | Apparatus and method for dynamic resource allocation over licensed and unlicensed spectrums | |
US9191987B2 (en) | Determining “fair share” of radio resources in radio access system with contention-based spectrum sharing | |
US11863996B2 (en) | Centralized coordination for shared spectrum systems | |
US20130136013A1 (en) | Handshaking Protocol Using Bursts in OFDMA Frame Structure | |
US10693618B2 (en) | Multiplexed messaging in wireless network | |
EP3322242B1 (en) | Method and device for transmission instruction, transmission triggering and transmission implementation for multi-station | |
EP3017642A1 (en) | Performing measurements in wireless network | |
EP3079308A1 (en) | Communication processing method and apparatus for wireless network | |
US10348641B2 (en) | Method of joint optimization of channel selection and frame scheduling for coexistence of LTE and WLAN in unlicensed band | |
KR20190107118A (en) | Use of unused long term UL allocation | |
KR20170022105A (en) | Apparatus and method for controlling channel access in a wireless communication system | |
CN110832934B (en) | System and method for random access of UE (user equipment) on wide bandwidth with subset limitation | |
US10856294B2 (en) | Device-to-device data transmission method, apparatus, and system | |
WO2019239006A1 (en) | Channel contention in wireless network | |
US20220400514A1 (en) | Controlling transmission medium access in an open spectrum | |
CN118301743A (en) | Resource allocation method and device | |
CN116033566A (en) | Resource indication method, node and storage medium | |
CN116326094A (en) | Method and device for determining resource scheduling and storage medium |
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 |
|
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: 20210111 |
|
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 |
|
AX | Request for extension of the european patent |
Extension state: BA ME |
|
DAV | Request for validation of the european patent (deleted) | ||
DAX | Request for extension of the european patent (deleted) | ||
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: 20230123 |