Abstract: Disclosed herein are aspects related to a device that can include a wireless communication interface and one or more processors. The wireless communication interface can transmit, using a wireless connection with a remote device, one or more data elements to the remote device. The one or more processors can identify a condition of the wireless connection, determine a rate, for transmission of the one or more data elements, based at least on the condition, retrieve a signal from the remote device indicative of at least one criterion for use of the one or more data elements, update the rate based at least on the at least one criterion to determine an updated rate for transmission of the one or more data elements to the remote device, and cause the wireless communication interface to transmit, at the updated rate, the one or more data elements to the remote device.

Abstract: A first device may one or more processors. The one or more processors may be configured to monitor wireless receive (Rx) traffic to a second device. The one or more processors may be configured to generate, based on the wireless Rx traffic, control information to control wireless transmit (Tx) traffic from the first device to avoid collision between the wireless Rx traffic and the wireless Tx traffic, the control information including at least one of a maximum Tx frame duration or a minimum Tx inter-frame gap. The one or more processors may be configured to wirelessly transmit, via a transceiver based on the control information, the wireless Tx traffic in a wireless local area network (WLAN).

Abstract: In a method for clients to transmit data via a shared medium network, a schedule assigns time slots to individual clients. A collision avoidance scheme determines an offset time to begin transmitting data, which upon expiration, a client senses if any of the clients is transmitting. If a second client is transmitting, then each client sets a first time slot assigned to the second client on the transmission schedule as a starting time slot. The clients track the schedule and transmit to the access point during the next time slot assigned to each client. If no other client is transmitting, then a client transmits data to the access point, sets the first time slot assigned to it as the starting time slot. The schedule is tracked by the clients and they transmit data to the access point during each successive time slot assigned to them.

Abstract: An optimal frequency hopping sequence (FHS) is proposed. The FHSs can be generated with low computation complexity using the disclosed FHS generation mechanism. The sequence generation according to the embodiments provides a way to generate optimal FHS when channel-number is power of 2 using only 1 sequence. This gives an efficient way to generate optimal FHSs with frequent used channel-numbers for example, channel-numbers 2, 4, 8, 16, and others. These FHSs also provide good interfering probability when channel-number is not a power of 2. This makes TSCH with blacklisting more suitable for IEEE 802.15.4e networks operating in the presence of interference due to decrease in power consumption.

Abstract: In a method for clients to transmit data via a shared medium network, a schedule assigns time slots to individual clients. A collision avoidance scheme determines an offset time to begin transmitting data, which upon expiration, a client senses if any of the clients is transmitting. If a second client is transmitting, then each client sets a first time slot assigned to the second client on the transmission schedule as a starting time slot. The clients track the schedule and transmit to the access point during the next time slot assigned to each client. If no other client is transmitting, then a client transmits data to the access point, sets the first time slot assigned to it as the starting time slot. The schedule is tracked by the clients and they transmit data to the access point during each successive time slot assigned to them.

Abstract: A device operated in a network using a channel hopping communication protocol may select a channel for each transmission by first generating and storing a sequence of pseudo-random index numbers. A list of good channels is selected from a plurality of channels. For each channel hop, one of the good channels is selected from the list of good channels for use by a transceiver in the device by using an index number selected from the sequence of pseudo-random index numbers. The list of good channels may be revised periodically and channels may be selected from the list of good channels for use by the transceiver without revising the sequence of pseudo-random index numbers.

Abstract: Disclosed examples include methods and network devices for communicating in a wireless network, in which the device generates frequency hopping sequence y(j) having a prime number sequence length p, using cyclotomic classes in a field of p or using a baby-step giant-step algorithm, where y(0)=p?1 and the remaining sequence values y(j)=log?(j) mod (p?1). In certain examples, ?=2 and the sequence is generated without solving logarithms using one or more algorithms to conserve memory and processing complexity for low power wireless sensors or other IEEE 802.15.4e based networks using Time-Slotted Channel Hopping (TSCH) communications.

Abstract: Disclosed examples include methods and network devices for communicating in a wireless network, in which the device generates frequency hopping sequence y(j) having a prime number sequence length p, using cyclotomic classes in a field of p or using a baby-step giant-step algorithm, where y(0)=p?1 and the remaining sequence values y(j)=log?(j) mod (p?1). In certain examples, ?=2 and the sequence is generated without solving logarithms using one or more algorithms to conserve memory and processing complexity for low power wireless sensors or other IEEE 802.15.4e based networks using Time-Slotted Channel Hopping (TSCH) communications.

Abstract: A device operated in a network using a channel hopping communication protocol may select a channel for each transmission by first generating and storing a sequence of pseudo-random index numbers. A list of good channels is selected from a plurality of channels. For each channel hop, one of the good channels is selected from the list of good channels for use by a transceiver in the device by using an index number selected from the sequence of pseudo-random index numbers. The list of good channels may be revised periodically and channels may be selected from the list of good channels for use by the transceiver without revising the sequence of pseudo-random index numbers.