TRANSMITTING NODE AND METHOD THEREIN FOR PERFORMING DATA TRANSMISSIONS TO AT LEAST ONE RECEIVING NODE ON A RADIO CHANNEL IN A WIRELESS COMMUNICATIONS NETWORK

• US 20170156161A1
• Filed: 05/10/2016
• Published: 06/01/2017
• Est. Priority Date: 07/06/2015
• Status: Active Grant

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: KANG, Du Ho, FALAHATI, Sorour, FALCONETTI, Laetitia, CHENG, Jung-Fu, HIERTZ, Guido Roland, FURUSKR, Anders, LARSSON, Daniel, KOORAPATY, Havish
• Granted Patent: US 10,075,978 B2
• Time in Patent Office: Days
• CPC Class Codes: H04W 74/0808 using carrier sensing, e.g. carrier sense multiple access [CSMA]
• CPC Class Codes: H04W 74/0816 with collision avoidance
• CPC Class Codes: H04W 74/085 collision avoidance

Abstract

A transmitting node and a method performed by a transmitting node for performing data transmissions to at least one receiving node on a radio channel in a wireless communications network. First, the transmitting node sets at least two contention window sizes. The at least two contention window sizes are separately determined based on information associated with the least one receiving node. Then, the transmitting node defers a first transmission of data to the at least one receiving node for a first period and also defers at least one second transmission of data to the at least one receiving node Further, the transmitting node performs a first or at least one second transmission of data to the at least one receiving node when an outcome of a corresponding first and at least second periods of observation of the radio channel, respectively, is that the radio channel is idle.

Claims

1. A method performed by a transmitting node for performing data transmissions to at least one receiving node on a radio channel in a wireless communications network, the method comprising

setting at least two contention window sizes, the at least two contention window sizes being separately determined based on information associated with the least one receiving node;

deferring a first transmission of data to the at least one receiving node for a first period of observation of the radio channel determined by a first contention window size of the at least two contention window sizes;

deferring at least one second transmission of data to the at least one receiving node for at least one second period of observation of the radio channel determined by at least a second contention window size of the at least two contention window sizes; and

performing one of the first and the at least one second transmission of data to the at least one receiving node when an outcome of the at least one of the first and the at least second periods of observation of the radio channel, respectively, is that the radio channel is idle.

2. The method according to claim 1, wherein the first contention window size is determined based on a priority of a first class of services of at least two classes of services with different priorities in the at least one receiving node, and the at least second contention window size is determined based on a priority of at least one second class of services of the at least two classes of services with different priorities in the at least one receiving node.

3. The method according to claim 1, wherein the information associated with the least one receiving node is one or more of:

the types of the least one receiving node;

the service requirements of the least one receiving node;

at least one of observed successes and/or and failures of previously performed data transmissions to the least one receiving node;

statistical information of the least one receiving node; and

the number of the least one receiving node having transmissions of data scheduled at the same time.

4. The method according to claim 1, further comprising:

adapting each of the first and at least second contention window size separately based on the information associated with the least one receiving node.

5. The method according to claim 4, wherein the adapting further comprises increasing at least one of the first and at least second contention window size when the corresponding transmission of data to the at least one receiving node is determined to be unsuccessful.

6. The method according to claim 5, wherein the adapting further comprises increasing the at least one of the first and at least second contention window size in increments up to a determined maximum contention window size.

7. The method according to claim 1, wherein the adapting further comprises decreasing at least one of the first and at least second contention window size when the corresponding transmission of data to the at least one receiving node is determined to be successful.

8. The method according to claim 7, wherein the adapting further comprises resetting at least one of the first and at least second contention window size to a determined starting contention window size when the corresponding transmission of data to the at least one receiving node is determined to be successful.

9. The method according to claim 4, wherein the adapting further comprises increasing and/or decreasing the rate of change separately for each of the first and at least second contention window size based on the information associated with the least one receiving node.

10. The method according to claim 4, wherein the adapting is performed according to a Listen Before Talk, LBT, algorithm.

11. The method according to claim 1, further comprising determining a joint contention window size based on the first and at least second contention window size to be used when the transmitting node capable of serving more than one receiving node and scheduling more than one receiving node during a single transmission instance.

12. The method according to claim 1, further comprising obtaining the information associated with the least one receiving node from another node in the wireless communications network.

13. A transmitting node for performing data transmissions to at least one receiving node on a radio channel in a wireless communications network, the transmitting node having a processor and a memory, the memory storing computer executable instructions that, when executed by the processor, configure the processor to:

set at least two contention window sizes, the at least two contention window sizes are being separately determined based on information associated with the least one receiving node;

defer a first transmission of data to the at least one receiving node for a first period of observation of the radio channel determined by a first contention window size of the at least two contention window sizes;

defer at least one second transmission of data to the at least one receiving node for at least one second period of observation of the radio channel determined by at least a second contention window size of the at least two contention window sizes; and

perform one of the first and the at least one second transmission of data to the at least one receiving node when an outcome of the one of the first and the at least one second period of observation of the radio channel, respectively, is that the radio channel is idle.

14. The transmitting node according to claim 13, wherein the memory further stores computer executable instructions that, when executed by the processor, further configure the processor to determine the first contention window size based on a priority of a first class of services of at least two classes of services with different priorities in the at least one receiving node, and determine the at least one second contention window size based on a priority of at least one second class of services of the at least two classes of services with different priorities in the at least one receiving node.

15. The transmitting node according to claim 13, wherein the information associated with the least one receiving node is one or more of:

the types of the least one receiving node;

the service requirements of the least one receiving node;

observed successes and/or failures of previously performed data transmissions to the least one receiving node;

statistical information of the least one receiving node; and

the number of the least one receiving node having transmissions of data scheduled at the same time.

16. The transmitting node according to claim 13, further configured to adapt each of the first and at least second contention window size separately based on the information associated with the least one receiving node.

17. The transmitting node according to claim 16, wherein the memory further stores computer executable instructions that when executed by the processor, further configure the processor to increase at least one of the first and at least second contention window size when the corresponding transmission of data to the at least one receiving node is determined to be unsuccessful.

18. The transmitting node according to claim 17, wherein the memory further stores computer executable instructions that when executed by the processor, further configure the processor to increase at least one of the first and at least second contention window size in increments up to a determined maximum contention window size time interval.

19. The transmitting node according to claim 13, wherein the memory further stores computer executable instructions that, when executed by the processor, further configure the processor to decrease at least one of the first and at least second contention window size when the corresponding transmission of data to the at least one receiving node is determined to be successful.

20. The transmitting node according to claim 19, wherein the memory further stores computer executable instructions that, when executed by the processor, further configure the processor to reset at least one of the first and at least second contention window size to a determined starting contention window size when the corresponding transmission of data to the at least one receiving node is determined to be successful.

21. The transmitting node according to claim 16, wherein the memory further stores computer executable instructions that, when executed by the processor, further configure the processor to at least one of increase and decrease the rate of change separately for each of the first and at least second contention window size based on the information associated with the least one receiving node.

22. The transmitting node according to claim 16, wherein adapting each of the first and at least second contention window size is performed according to a Listen Before Talk, LBT, algorithm

23. The transmitting node according to claim 13, wherein the memory further stores computer executable instructions that, when executed by the processor, further configure the processor to determine a joint contention window size based on the first and at least second contention window size to be used when the transmitting node is capable of serving more than one receiving node and scheduling more than one receiving node during a single transmission instance.

24. The transmitting node according to claim 13, wherein the memory further stores computer executable instructions that when executed by the processor, further configure the processor to obtain the information associated with the least one receiving node from another node in the wireless communications network.

25-27. -27. (canceled)