Abstract: Example methods relate to avoiding beacon collisions between a repeater and a root AP, optimizing traffic flows based on buffers queued within hardware, and/or optimizing transmissions through a trigger-based mechanism. An example method includes determining loads on buffers within a repeater configured to communicate according to a DBVC protocol. The loads on the buffers correspond to data to be transmitted within upstream and downstream networks. The method includes determining whether to adjust a DBVC duty cycle of the repeater based on the loads. The DBVC duty cycle includes: an on channel duty cycle comprising a ratio of time on an on channel to total time on both the on and off channels; or an off channel duty cycle comprising a ratio of time on the off channel to total time on both the on and off channels. The method includes adjusting the DBVC duty cycle of the repeater.

Abstract: An air disc brake pad 10 for inserting into a brake pad carrier 12, the brake pad 10 including a backplate 14 and a friction material 16 mounted on one side of the backplate 14, the pad periphery 30 including an inner side 20, an outer side 18 and first and second ends 22, 24; in which at least a portion of the pad periphery 30 includes a thickened edge 36, 38, the thickened edge 36, 38 extending in a direction opposing the friction material 16; and at least one rear protrusion 26, 28 is provided, the at least one rear protrusion 26, 28 extending from the backplate 14 in a direction opposing the friction material 16; and in which the depth of the at least one rear protrusion 26, 28 being greater than the depth of the thickened edge 36, 38. See FIG. 3.

Abstract: Example methods relate to avoiding beacon collisions between a repeater and a root AP, optimizing traffic flows based on buffers queued within hardware, and/or optimizing transmissions through a trigger-based mechanism. An example method includes determining loads on buffers within a repeater configured to communicate according to a DBVC protocol. The loads on the buffers correspond to data to be transmitted within upstream and downstream networks. The method includes determining whether to adjust a DBVC duty cycle of the repeater based on the loads. The DBVC duty cycle includes: an on channel duty cycle comprising a ratio of time on an on channel to total time on both the on and off channels; or an off channel duty cycle comprising a ratio of time on the off channel to total time on both the on and off channels. The method includes adjusting the DBVC duty cycle of the repeater.

Abstract: An example method may include identifying a first transmit identifier (TID) associated with a first node of a wireless network as ready to transmit and adding the first TID to a ready to transmit queue at a first point in time. The method may also include identifying a second TID associated with a second node of the wireless network as ready to transmit, and adding the second TID to the ready to transmit queue at a second point in time later than the first point in time. The method may additionally include selecting the second TID from the ready to transmit queue before selecting the first TID based on a projected increased overall throughput of packets within the wireless network when communicating with the second node before communicating with the first node.

Abstract: An example method may include identifying a first transmit identifier (TID) associated with a first node of a wireless network as ready to transmit and adding the first TID to a ready to transmit queue at a first point in time. The method may also include identifying a second TID associated with a second node of the wireless network as ready to transmit, and adding the second TID to the ready to transmit queue at a second point in time later than the first point in time. The method may additionally include selecting the second TID from the ready to transmit queue before selecting the first TID based on a projected increased overall throughput of packets within the wireless network when communicating with the second node before communicating with the first node.

Abstract: Example methods relate to avoiding beacon collisions between a repeater and a root AP, optimizing traffic flows based on buffers queued within hardware, and/or optimizing transmissions through a trigger-based mechanism. An example method includes determining loads on buffers within a repeater configured to communicate according to a DBVC protocol. The loads on the buffers correspond to data to be transmitted within upstream and downstream networks. The method includes determining whether to adjust a DBVC duty cycle of the repeater based on the loads. The DBVC duty cycle includes: an on channel duty cycle comprising a ratio of time on an on channel to total time on both the on and off channels; or an off channel duty cycle comprising a ratio of time on the off channel to total time on both the on and off channels. The method includes adjusting the DBVC duty cycle of the repeater.

Abstract: Example methods of advanced DBVC for WiFi relate to one or more of avoiding beacon collisions between a repeater and a root AP, optimizing traffic flows based on buffers queued within hardware, optimizing TCP throughput through DPI and prioritization of TCP ACK packets, or optimizing transmissions through a trigger-based mechanism. An example method may include receiving a transmission from a root AP. The method may include obtaining a next root AP TBTT of a next beacon to be sent by the root AP from the transmission. The method may include determining an amount of time to delay a next repeater TBTT of a next beacon to be sent by a repeater to avoid conflict between the next root AP TBTT and the next repeater TBTT. The method may include delaying the next repeater TBTT based on the determined amount of time.

Abstract: An example method may include identifying a first transmit identifier (TID) associated with a first node of a wireless network as ready to transmit and adding the first TID to a ready to transmit queue at a first point in time. The method may also include identifying a second TID associated with a second node of the wireless network as ready to transmit, and adding the second TID to the ready to transmit queue at a second point in time later than the first point in time. The method may additionally include selecting the second TID from the ready to transmit queue before selecting the first TID based on a projected increased overall throughput of packets within the wireless network when communicating with the second node before communicating with the first node.

Abstract: An example method may include identifying a first transmit identifier (TID) associated with a first node of a wireless network as ready to transmit and adding the first TID to a ready to transmit queue at a first point in time. The method may also include identifying a second TID associated with a second node of the wireless network as ready to transmit, and adding the second TID to the ready to transmit queue at a second point in time later than the first point in time. The method may additionally include selecting the second TID from the ready to transmit queue before selecting the first TID based on a projected increased overall throughput of packets within the wireless network when communicating with the second node before communicating with the first node.

Abstract: An example method may include identifying a first transmit identifier (TID) associated with a first node of a wireless network as ready to transmit and adding the first TID to a ready to transmit queue at a first point in time. The method may also include identifying a second TID associated with a second node of the wireless network as ready to transmit, and adding the second TID to the ready to transmit queue at a second point in time later than the first point in time. The method may additionally include selecting the second TID from the ready to transmit queue before selecting the first TID based on a projected increased overall throughput of packets within the wireless network when communicating with the second node before communicating with the first node.

Abstract: An example method may include receiving, from a wireless sniffer, sniffer data for a window of time, where the sniffer data may include wireless signal data. The method may also include obtaining corresponding access point data from an access point in a wireless network for at least part of the window of time for which the sniffer data is received. The method may additionally include analyzing the sniffer data and the corresponding access point data to assess performance of the wireless network.

Abstract: A wireless access point (WAP) configured to supporting wireless communications with station nodes on a selected communication channel of an associated wireless local area network (WLAN). The WAP includes multiple multiple-input multiple-output (MIMO) transmit and receive paths. The WAP is to intermittently switch one of the multiple MIMO receive paths to concurrently process both communications on a selected communication channel together with monitoring communications on unselected channels of the multiple communication channels associated with the WLAN.

Abstract: Example methods of advanced DBVC for WiFi relate to one or more of avoiding beacon collisions between a repeater and a root AP, optimizing traffic flows based on buffers queued within hardware, optimizing TCP throughput through DPI and prioritization of TCP ACK packets, or optimizing transmissions through a trigger-based mechanism. An example method may include receiving a transmission from a root AP. The method may include obtaining a next root AP TBTT of a next beacon to be sent by the root AP from the transmission. The method may include determining an amount of time to delay a next repeater TBTT of a next beacon to be sent by a repeater to avoid conflict between the next root AP TBTT and the next repeater TBTT. The method may include delaying the next repeater TBTT based on the determined amount of time.

Abstract: An example method may include receiving, from a wireless sniffer, sniffer data for a window of time, where the sniffer data may include wireless signal data. The method may also include obtaining corresponding access point data from an access point in a wireless network for at least part of the window of time for which the sniffer data is received. The method may additionally include analyzing the sniffer data and the corresponding access point data to assess performance of the wireless network.

Abstract: A wireless access point (WAP) configured to supporting wireless communications with station nodes on a selected communication channel of an associated wireless local area network (WLAN). The WAP includes multiple multiple-input multiple-output (MIMO) transmit and receive paths.

Abstract: A wireless access point (WAP) configured to support a wireless home network among multiple wireless devices over a shared wireless communication medium on a selected channel. In an embodiment of the invention the WAP includes a channel tracker configured to track performance metrics over time for at least the selected channel; and to predict based on the tracked performance metrics at least one of: a predicted time of an impending channel changeover requirement in which a projected demand for the selected channel exceeds a projected capacity thereof and a predicted time of an impending monitoring interval for monitoring an unselected channel with relatively minimal disruption of communications on the selected channel. In another embodiment of the invention the WAP includes receive path components configured to concurrently process both communications on the selected channel together with monitored communications on an unselected channel.

Abstract: A technique for utilizing an intermediate access point (IAP) with a wireless access point (WAP) that uses 3-address mode involves making use of a bridge table that includes media access control (MAC) addresses of stations registered with the IAP and internet protocol (IP) addresses of the stations stored in association with the corresponding MAC address. A bridging engine can obtain an IP address from a WAP IP frame and match the IP address to an IP address in the bridge table to find the corresponding MAC address. The bridging engine can encapsulate at least a portion of the WAP IP frame to create an IAP frame with the corresponding MAC address as the receiver address (RA).

Abstract: A method performed by a wireless media device such as a wireless loudspeaker subsystem for configuring and connecting to a media wireless network. The wireless media device first associates to an existing infrastructure based wireless network at a first phase. At a second phase, the wireless media device establishes a secure communications tunnel with a complementary wireless device that has also previously associated to the existing wireless network. Using the secure tunnel, the wireless media device shares with the complementary wireless device data indicative of a set of parameters for a second wireless media wireless network at a third phase. Once this sharing is complete, the wireless media device connects to the second wireless network at a fourth phase.

Abstract: In a network environment such as a wireless packet network, a source node transmits a data stream, e.g., a stream of media packets to a plurality of sink nodes, including the source node transmitting a first data stream of unicast packets addressed to at least a first one of the sink nodes, while other ones of said sink nodes receive while in promiscuous mode traffic on the network including the data stream. Individual ones of the other sink nodes, upon ascertaining that there are packets of the stream that were not received, transmit a re-transmission request to the source node so that the source node can take corrective action, and so all the sink nodes can receive the data stream, even though sent as unicast addressed to fewer than all the sink nodes.

Abstract: A method, a software product, and an apparatus to operate in a wireless device of a wireless network. The wireless device acts as a plurality of APs. The method includes transmitting bursts of management frames containing a broadcast-buffered indication for a corresponding subset of network identifiers of the wireless device, and transmitting bursts of management frames not containing any broadcast-buffered indication. The broadcast-buffered indication indicates that broadcast data is buffered at the AP of the device. Thus, management frames are sent in bursts, and the burst are staggered to reduce the likelihood that two bursts of management frames containing a broadcast-buffered indication are transmitted in immediate succession.