Abstract: Examples pertaining to optimization for device provisioning protocol (DPP) onboarding in wireless networks are described. An apparatus acting as a controller of a wireless network receives, from a smart device, information related to a unconfigured device as an enrollee not yet onboarded into the wireless network. The apparatus then causes a plurality of configured agents in the wireless network to participate simultaneously in attempting to onboard the unconfigured device via a DPP mechanism responsive to receiving the information related to the unconfigured device.

Abstract: Examples pertaining to optimization for device provisioning protocol (DPP) onboarding in wireless networks are described. An apparatus acting as a controller of a wireless network receives, from a smart device, information related to a unconfigured device as an enrollee not yet onboarded into the wireless network. The apparatus then causes a plurality of configured agents in the wireless network to participate simultaneously in attempting to onboard the unconfigured device via a DPP mechanism responsive to receiving the information related to the unconfigured device.

Abstract: A technique for loop avoidance in repeater networks involves a first repeater, having a first node number or a first weight, connecting to a second repeater with the second repeater being a child node of the first repeater. The first repeater assigns a second node number or the first weight to the second repeater. At least a portion of the second node number of the second repeater includes the first node number of the first repeater. At least a portion of the first node number includes a node number that is an identification unique to one of a plurality of repeaters as a root node in a tree structure formed by at least some of the repeaters including the first and the second repeaters. Loops may be avoided by comparing the weights of two nodes in a repeater network that attempt to establish connection between nodes having the same weight.

Abstract: Each independent repeater network may be associated with a respective network weight and a respective group identifier. When two repeater networks with the same group identifier merge, configuration may flow from the network with a higher network weight to the network with a lower network weight. When two repeater networks with different group identifiers merge, configuration may flow from the connecting host interface of a repeater of one of the networks to the connecting client interface of a repeater of the other network. In cases of simultaneous connection between two networks, group identifier change may take precedence over configuration update caused by the merging of the two networks.

Abstract: Concepts and examples pertaining to virtual roaming are described. A processor of an electronic apparatus hosts a main repeater and one or more virtual repeaters by functioning as the main repeater and the one or more virtual repeaters with each of the one or more virtual repeaters mimicking a respective one of one or more remote repeaters. The processor services a station by communicating with the station as the main repeater. The processor requests a first remote repeater of the one or more remote repeaters to service the station. The processor also ceases to service the station upon completion of handoff of the station to the first remote repeater.

Abstract: A technique for loop avoidance in repeater networks involves a first repeater, having a first node number or a first weight, connecting to a second repeater with the second repeater being a child node of the first repeater. The first repeater assigns a second node number or the first weight to the second repeater. At least a portion of the second node number of the second repeater includes the first node number of the first repeater. At least a portion of the first node number includes a node number that is an identification unique to one of a plurality of repeaters as a root node in a tree structure formed by at least some of the repeaters including the first and the second repeaters. Loops may be avoided by comparing the weights of two nodes in a repeater network that attempt to establish connection between nodes having the same weight.

Abstract: Each independent repeater network may be associated with a respective network weight and a respective group identifier. When two repeater networks with the same group identifier merge, configuration may flow from the network with a higher network weight to the network with a lower network weight. When two repeater networks with different group identifiers merge, configuration may flow from the connecting host interface of a repeater of one of the networks to the connecting client interface of a repeater of the other network. In cases of simultaneous connection between two networks, group identifier change may take precedence over configuration update caused by the merging of the two networks.

Abstract: A technique for loop detection in repeater networks involves a first communication device of a plurality of communication devices establishing a communication link with a second communication device of the plurality of communication devices. The first communication device transmits to the second communication device a first action frame containing a unique identifier of the first communication device. Upon receiving a second action frame from a third communication device, the first communication device determines whether the second action frame meets a condition related to the unique identifier of the first communication device. Depending on a result of the determination, the first communication device either maintains or disconnects the communication link with the second communication device. The communication link between the first and second communication devices may be on two frequency bands, and loop formation can be detected by either of the first and second communication devices.