# US 2019/0379482 A1 · Wireless transmission rate adaptation

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2019/0379482 A1
- Document ID: US20190379482A1
- Status: Published application
- Kind: A1
- Application number: 16/001,428
- Filed: 2018-06-06
- Published: 2019-12-12
- Earliest claimed: 2018-06-06
- Assignees: Hewlett Packard Enterprise Development LP
- Applicants: Hewlett Packard Enterprise Development LP
- Inventors: Gaurav Patwardhan; Sachin Ganu; Jose Tellado
- Web page: https://patentgrep.com/patent/US20190379482A1

## CPC

- H04L 1/002: {Algorithms with memory of the previous states, e.g. Markovian models}
- H04B 7/0697: {using spatial multiplexing}
- H04L 1/0005: {applied to payload information}
- H04L 1/0011: {applied to payload information}
- H04L 1/0021: {in which the algorithm uses adaptive thresholds}
- H04L 1/0034: {where the transmitter decides based on inferences, e.g. use of implicit signalling}
- H04L 1/0035: {evaluation of received explicit signalling}
- H04L 27/2646: {using feedback from receiver for adjusting OFDM transmission parameters, e.g. transmission timing or guard interval length}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04B: TRANSMISSION

## Abstract

An example method for altering a transmission rate of a networking device. The example method comprises transmitting a first set of packets using first transmission characteristics represented by a first state of a finite state machine. The example method further comprises receiving information including a success status of transmission of the first set of packets. The example method also comprises updating, based on the received information, a weight of a first edge of the finite state machine, the first edge corresponding to a transition from a state representing prior transmission characteristics to the first state.

## Claims

### Claim 1

A method for altering a transmission rate of a networking device, comprising:
transmitting a first set of packets using first transmission characteristics represented by a first state of a finite state machine;
receiving information including a success status of transmission of the first set of packets; and
updating, based on the received information, a weight of a first edge of the finite state machine, the first edge corresponding to a transition from a state representing prior transmission characteristics to the first state.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
transitioning, based on the received information, from the first state to a second state representing second transmission characteristics via a second edge of the finite state machine; and
transmitting a second set of packets using the second transmission characteristics.

### Claim 3 (depends on 2)

The method of claim 2, wherein the second edge is selected from a first plurality of edges between the first state and a plurality of other states.

### Claim 4 (depends on 3)

The method of claim 3, wherein the first plurality of edges represent success probabilities for transitioning from the first state to a head state of each respective edge of the first plurality, and wherein a second plurality of edges represent failure probabilities for transitioning from the first state to a head state of each respective edge of the second plurality.

### Claim 5 (depends on 4)

The method of claim 4, wherein the transition from the first state to the second state is selected based on the success probability of the second edge and the failure probability of a third edge from the first state to the second state.

### Claim 6 (depends on 4)

The method of claim 4, wherein each weight of each edge of the first plurality and the second plurality has an initial value and each weight is updated when information is received about packets transmitted using transmission characteristics associated with a head state of each respective edge.

### Claim 7 (depends on 2)

The method of claim 2, further comprising:
incrementing a counter for each packet of the second set of packets; and
initiating a state transition once the counter exceeds a threshold.

### Claim 8

A wireless access point, comprising:
a wireless transceiver;
processing circuitry; and
a storage medium including instructions that, when executed by the processing circuitry, cause the processing circuitry to:
transmit a first set of packets using first transmission characteristics represented by a first state of a finite state machine;
receive information including transmission success status for each packet of the first set of packets;
update, based on the transmission success status, weights of a first plurality of edges in a finite state machine corresponding to success and failure probabilities of packets transmitted using the first transmission characteristics; and
transition from the first state to a second state of the finite state machine corresponding to second transmission characteristics.

### Claim 9 (depends on 8)

The wireless access point of claim 8, wherein the instructions further cause the processing circuitry to:
transmit, via the wireless transceiver, a second set of packets using the second transmission characteristics;
receive information including transmission success status for each packet of the second set of packets;
update, based on the transmission success status for each packet of the second set of packets, weights of a second plurality of edges in the finite state machine corresponding to success and failure probabilities of packets transmitted using the second transmission characteristics; and
transition from the second state to the second state.

### Claim 10 (depends on 9)

The wireless access point of claim 9, wherein the profitability of transitioning from the second state to another state of the finite state machine is less than the profitability of transitioning back to the second state.

### Claim 11 (depends on 8)

The wireless access point of claim 8, wherein the finite state machine is a Markov chain.

### Claim 12 (depends on 8)

The wireless access point of claim 8, wherein transmission characteristics include a modulation and coding scheme, a number of spatial streams, and a guard interval.

### Claim 13 (depends on 12)

The wireless access point of claim 12, wherein the finite state machine is a three-dimensional finite state machine, wherein a first dimension represents modulation and coding schemes, a second dimension represents numbers of spatial streams, and a third dimension represents guard intervals.

### Claim 14 (depends on 8)

The wireless access point of claim 8, wherein the weights of the first plurality of edges are initialized based on an existing rate adaptation algorithm.

### Claim 15

A non-transitory computer-readable medium comprising instructions that, when executed by processing circuitry, cause the processing circuitry to:
wirelessly transmit a first set of packets using a first modulation and coding scheme, a first number of spatial streams, and a first guard interval;
receive information including whether each packet of the first set was successfully transmitted;
update, based on the received information, a weight of an edge of a Markov chain representing a transition to a first state corresponding to the first modulation and coding scheme, the first number of spatial streams, and the first guard interval;
transition from the first state to a second state of the finite state machine corresponding to a second modulation and coding scheme, a second number of spatial streams, and a second guard interval; and
wirelessly transmit a second set of packets using the second modulation and coding scheme, the second number of spatial streams, and the second guard interval.

### Claim 16 (depends on 15)

The computer-readable medium of claim 15, further comprising instructions that cause the processing circuitry to:
receive additional information including whether each packet of the second set was successfully transmitted;
update, based on the received additional information, a weight of another edge of the Markov chain representing a transition to the second state.

### Claim 17 (depends on 16)

The computer-readable medium of claim 16, wherein the first modulation and coding scheme is the same as the second modulation and coding scheme, and wherein the first number of spatial streams is the same as the second number of spatial streams.

### Claim 18 (depends on 15)

The computer-readable medium of claim 15, wherein each edge of the Markov chain further corresponds to a certain signal-to-noise ratio.

### Claim 19 (depends on 18)

The computer-readable medium of claim 18, wherein the Markov chain is four-dimensional, and wherein a first dimension corresponds to modulation and coding schemes, a second dimension corresponds to numbers of spatial streams, a third dimension corresponds to guard intervals, and a fourth dimension corresponds to signal-to-noise ratios.

### Claim 20 (depends on 15)

The computer readable medium of claim 15, wherein the weight of the edge corresponds to a success probability of packet transmission.
