Forming a conditionally connected network in a wireless mesh deployment scenario

Abstract

This disclosure provides methods, components, devices and systems for forming a conditionally connected network in a wireless mesh deployment scenario. Some aspects more specifically relate to how two wireless nodes may conditionally establish a logical path to each other in accordance with comparing respective capabilities and determining whether a first capability of a first of the two wireless nodes is complementary to a second capability of a second of the two wireless nodes. In some aspects, the two capabilities may be complementary to each other in accordance with at least one element of the first capability having a mapping to at least one element of the second capability. The two wireless nodes may support conditional logical path establishment via a capability based exchange of path request (PREQ) and path reply (PREP) frames or via capability based beacon assisted routing.

Description

FORMING A CONDITIONALLY CONNECTED NETWORK IN A WIRELESS MESH DEPLOYMENT SCENARIOCROSS REFERENCE

[0001] The present Application for Patent claims priority to India Patent Application No. 202341062119 by KRISHNAMOORTHY et al., entitled “FORMING A CONDITIONALLY CONNECTED NETWORK IN A WIRELESS MESH DEPLOYMENT SCENARIO,” filed September 15, 2023, assigned to the assignee hereof, and expressly incorporated by reference in its entirety herein.TECHNICAL FIELD

[0002] This disclosure relates to wireless communication and, more specifically, to forming a conditionally connected network in a wireless mesh deployment scenario.DESCRIPTION OF THE RELATED TECHNOLOGY

[0003] A wireless local area network (WLAN) may be formed by one or more wireless access points (APs) that provide a shared wireless communication medium for use by multiple client devices also referred to as wireless stations (STAs). The basic building block of a WLAN conforming to the Institute of Electrical and Electronics Engineers (IEEE) 802.11 family of standards is a Basic Service Set (BSS), which is managed by an AP. Each BSS is identified by a Basic Service Set Identifier (BSSID) that is advertised by the AP. An AP periodically broadcasts beacon frames to enable any STAs within wireless range of the AP to establish or maintain a communication link with the WLAN.

[0004] Some communication devices may communicate with one or more other communication devices within a wireless mesh network, which may refer to a communication system or network in which any communication device may communicate with one or more other communication devices in accordance with a relative proximity of the communication devices. In some deployments, at least some communication devices within a wireless mesh network may change locations relatively frequently, resulting in relatively frequent topology changes and routing updates withinthe wireless mesh network as paths between communication devices may change in accordance with the mobility of the communication devices.SUMMARY

[0005] The systems, methods, and devices of this disclosure each have several innovative aspects, no single one of which is solely responsible for the desirable attributes disclosed herein.

[0006] One innovative aspect of the subject matter described in this disclosure can be implemented in a first wireless node. The first wireless node may include a processing system that includes processor circuitry and memory circuitry that stores code. The processing system may be configured to cause the first wireless node to transmit, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a first capability associated with the first wireless node, receive a path reply frame associated with the path request frame, the path reply frame including information indicative of a second wireless node within the wireless mesh network and indicating, in accordance with the path reply frame being associated with the path request frame, that a second capability associated with the second wireless node is complementary to the first capability, and generate a routing table to include a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node.

[0007] Another innovative aspect of the subject matter described in the disclosure can be implemented in a method for wireless communication performable by a first wireless node. The method may include transmitting, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a first capability associated with the first wireless node, receiving a path reply frame associated with the path request frame, the path reply frame including information indicative of a second wireless node within the wireless mesh network and indicating, in accordance with the path reply frame being associated with the path request frame, that a second capability associated with the second wireless node is complementary to the first capability, and generating a routing table to include alogical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node.

[0008] Another innovative aspect of the subject matter described in this disclosure can be implemented in a first wireless node. The first wireless node may include means for transmitting, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a first capability associated with the first wireless node, means for receiving a path reply frame associated with the path request frame, the path reply frame including information indicative of a second wireless node within the wireless mesh network and indicating, in accordance with the path reply frame being associated with the path request frame, that a second capability associated with the second wireless node is complementary to the first capability, and means for generating a routing table to include a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node.

[0009] Another innovative aspect of the subject matter described in this disclosure can be implemented in a non-transitory computer-readable medium storing code for wireless communication at a first wireless node. The code may include instructions executable by one or more processors, individually or collectively, to transmit, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a first capability associated with the first wireless node, receive a path reply frame associated with the path request frame, the path reply frame including information indicative of a second wireless node within the wireless mesh network and indicating, in accordance with the path reply frame being associated with the path request frame, that a second capability associated with the second wireless node is complementary to the first capability, and generate a routing table to include a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node.

[0010] Some examples of the method, first wireless nodes, and non-transitory computer-readable medium described herein may further include operations, features, means, or instructions for obtaining, from an application layer associated with the first wireless node, an indication of the first capability, where transmitting the path requestframe including the information indicative of the first capability may be in association with obtaining the indication of the first capability from the application layer.

[0011] Some examples of the method, first wireless nodes, and non-transitory computer-readable medium described herein may further include operations, features, means, or instructions for transmitting the information indicative of the first capability via one or more information elements or subfields of the path request frame.

[0012] In some examples of the method, first wireless nodes, and non-transitory computer-readable medium described herein, the first capability includes one or more first capability elements and the second capability includes one or more second capability elements and the first capability may be complementary to the second capability in accordance with at least one of the one or more first capability elements having a mapping to at least one of the one or more second capability elements.

[0013] In some examples of the method, first wireless nodes, and non-transitory computer-readable medium described herein, the one or more first capability elements and the one or more second capability elements may be within a complete capability set associated with the wireless mesh network and the complete capability set includes a first set of multiple capability elements of a first capability set, a second set of multiple capability elements of a second capability set, and a cartesian product of the first set of multiple capability elements of the first capability set and the second set of multiple capability elements of the second capability set.

[0014] In some examples of the method, first wireless nodes, and non-transitory computer-readable medium described herein, the mapping may be between the first set of multiple capability elements of the first capability set and the second set of multiple capability elements of the second capability set, each capability element of the first capability set mapping to at least one capability element of the second capability set, and each capability element of the second capability set mapping to at least one capability element of the first capability set.

[0015] Another innovative aspect of the subject matter described in this disclosure can be implemented in a first wireless node. The first wireless node may include a processing system that includes processor circuitry and memory circuitry that stores code. The processing system may be configured to cause the first wireless node toreceive, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a second capability associated with a second wireless node, transmit, in accordance with a first capability associated with the first wireless node being complementary to the second capability associated with the second wireless node, a path reply frame associated with the path request frame, the path reply frame including information indicative of the first wireless node, and generate a routing table to include a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node.

[0016] Another innovative aspect of the subject matter described in the disclosure can be implemented in a method for wireless communication performable by a first wireless node. The method may include receiving, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a second capability associated with a second wireless node, transmitting, in accordance with a first capability associated with the first wireless node being complementary to the second capability associated with the second wireless node, a path reply frame associated with the path request frame, the path reply frame including information indicative of the first wireless node, and generating a routing table to include a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node.

[0017] Another innovative aspect of the subject matter described in this disclosure can be implemented in a first wireless node. The first wireless node may include means for receiving, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a second capability associated with a second wireless node, means for transmitting, in accordance with a first capability associated with the first wireless node being complementary to the second capability associated with the second wireless node, a path reply frame associated with the path request frame, the path reply frame including information indicative of the first wireless node, and means for generating a routing table to include a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node.

[0018] Another innovative aspect of the subject matter described in this disclosure can be implemented in a non-transitory computer-readable medium storing code for wireless communication at a first wireless node. The code may include instructions executable by one or more processors, individually or collectively, to receive, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a second capability associated with a second wireless node, transmit, in accordance with a first capability associated with the first wireless node being complementary to the second capability associated with the second wireless node, a path reply frame associated with the path request frame, the path reply frame including information indicative of the first wireless node, and generate a routing table to include a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node.

[0019] Some examples of the method, first wireless nodes, and non-transitory computer-readable medium described herein may further include operations, features, means, or instructions for obtaining, from an application layer associated with the first wireless node, an indication of the first capability, where transmitting the path reply frame may be in association with obtaining the indication of the first capability from the application layer.

[0020] Some examples of the method, first wireless nodes, and non-transitory computer-readable medium described herein may further include operations, features, means, or instructions for transmitting a forwarded version of the path request frame to one or more other wireless nodes within the wireless mesh network in association with receiving the path request frame, the forwarded version of the path request frame including the information indicative of the second capability associated with the second wireless node.

[0021] In some examples of the method, first wireless nodes, and non-transitory computer-readable medium described herein, the first capability includes one or more first capability elements and the second capability includes one or more second capability elements and the first capability may be complementary to the second capability in accordance with at least one of the one or more first capability elements having a mapping to at least one of the one or more second capability elements.

[0022] Another innovative aspect of the subject matter described in this disclosure can be implemented in a first wireless node. The first wireless node may include a processing system that includes processor circuitry and memory circuitry that stores code. The processing system may be configured to cause the first wireless node to receive, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a second capability associated with a second wireless node, transmit a forwarded version of the path request frame, without transmitting a path reply frame associated with the path request frame, in accordance with a first capability associated with the first wireless node being non- complementary to the second capability associated with the second wireless node, and generate a routing table to exclude a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node.

[0023] Another innovative aspect of the subject matter described in the disclosure can be implemented in a method for wireless communication performable by a first wireless node. The method may include receiving, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a second capability associated with a second wireless node, transmitting a forwarded version of the path request frame, without transmitting a path reply frame associated with the path request frame, in accordance with a first capability associated with the first wireless node being non-complementary to the second capability associated with the second wireless node, and generating a routing table to exclude a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node.

[0024] Another innovative aspect of the subject matter described in this disclosure can be implemented in a first wireless node. The first wireless node may include means for receiving, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a second capability associated with a second wireless node, means for transmitting a forwarded version of the path request frame, without transmitting a path reply frame associated with the path request frame, in accordance with a first capability associated with the first wireless node being non-complementary to the second capability associated withthe second wireless node, and means for generating a routing table to exclude a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node.

[0025] Another innovative aspect of the subject matter described in this disclosure can be implemented in a non-transitory computer-readable medium storing code for wireless communication at a first wireless node. The code may include instructions executable by one or more processors, individually or collectively, to receive, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a second capability associated with a second wireless node, transmit a forwarded version of the path request frame, without transmitting a path reply frame associated with the path request frame, in accordance with a first capability associated with the first wireless node being non- complementary to the second capability associated with the second wireless node, and generate a routing table to exclude a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node.

[0026] Some examples of the method, first wireless nodes, and non-transitory computer-readable medium described herein may further include operations, features, means, or instructions for obtaining, from an application layer associated with the first wireless node, an indication of the first capability, where transmitting the forwarded version of the path request frame, without transmitting the path reply frame, may be in association with obtaining the indication of the first capability from the application layer.

[0027] Some examples of the method, first wireless nodes, and non-transitory computer-readable medium described herein may further include operations, features, means, or instructions for transmitting the information indicative of the second capability via one or more information elements or subfields of the forwarded version of the path request frame.

[0028] Some examples of the method, first wireless nodes, and non-transitory computer-readable medium described herein may further include operations, features, means, or instructions for receiving a path reply frame associated with the forwardedversion of the path request frame, the path reply frame including information indicative of a third wireless node within the wireless mesh network and indicating, in accordance with the path reply frame being associated with the forwarded version of the path request frame, that a third capability associated with the third wireless node may be complementary to the second capability and transmitting a forwarded version of the path reply frame in association with receiving the path reply frame.

[0029] In some examples of the method, first wireless nodes, and non-transitory computer-readable medium described herein, the first capability includes one or more first capability elements and the second capability includes one or more second capability elements and the first capability may be non-complementary to the second capability in accordance with none of the one or more first capability elements having a mapping to at least one of the one or more second capability elements.

[0030] Another innovative aspect of the subject matter described in this disclosure can be implemented in a first wireless node. The first wireless node may include a processing system that includes processor circuitry and memory circuitry that stores code. The processing system may be configured to cause the first wireless node to generate a routing table to include a logical path between the first wireless node and a second wireless node of a wireless mesh network in accordance with a second capability associated with the second wireless node being complementary to a first capability associated with the first wireless node and transmit, via a first beacon frame, information indicative of the routing table, the routing table including a respective identifier of each of one or more first target wireless nodes, a respective hop count to each of the one or more first target wireless nodes, and a respective cumulative path metric to each of the one or more first target wireless nodes, the one or more first target wireless nodes including at least the second wireless node.

[0031] Another innovative aspect of the subject matter described in the disclosure can be implemented in a method for wireless communication performable by a first wireless node. The method may include generating a routing table to include a logical path between the first wireless node and a second wireless node of a wireless mesh network in accordance with a second capability associated with the second wireless node being complementary to a first capability associated with the first wireless node and transmitting, via a first beacon frame, information indicative of the routing table,the routing table including a respective identifier of each of one or more first target wireless nodes, a respective hop count to each of the one or more first target wireless nodes, and a respective cumulative path metric to each of the one or more first target wireless nodes, the one or more first target wireless nodes including at least the second wireless node.

[0032] Another innovative aspect of the subject matter described in this disclosure can be implemented in a first wireless node. The first wireless node may include means for generating a routing table to include a logical path between the first wireless node and a second wireless node of a wireless mesh network in accordance with a second capability associated with the second wireless node being complementary to a first capability associated with the first wireless node and means for transmitting, via a first beacon frame, information indicative of the routing table, the routing table including a respective identifier of each of one or more first target wireless nodes, a respective hop count to each of the one or more first target wireless nodes, and a respective cumulative path metric to each of the one or more first target wireless nodes, the one or more first target wireless nodes including at least the second wireless node.

[0033] Another innovative aspect of the subject matter described in this disclosure can be implemented in a non-transitory computer-readable medium storing code for wireless communication at a first wireless node. The code may include instructions executable by one or more processors, individually or collectively, to generate a routing table to include a logical path between the first wireless node and a second wireless node of a wireless mesh network in accordance with a second capability associated with the second wireless node being complementary to a first capability associated with the first wireless node and transmit, via a first beacon frame, information indicative of the routing table, the routing table including a respective identifier of each of one or more first target wireless nodes, a respective hop count to each of the one or more first target wireless nodes, and a respective cumulative path metric to each of the one or more first target wireless nodes, the one or more first target wireless nodes including at least the second wireless node.

[0034] Some examples of the method, first wireless nodes, and non-transitory computer-readable medium described herein may further include operations, features, means, or instructions for receiving, via a second beacon frame, information indicativeof a second routing table, the second routing table including a respective identifier of each of one or more second target wireless nodes, a respective hop count to each of the one or more second target wireless nodes, and a respective cumulative path metric to each of the one or more second target wireless nodes and updating the routing table, at least in part, in accordance with the second routing table indicating a new logical path associated with a target wireless node.

[0035] Some examples of the method, first wireless nodes, and non-transitory computer-readable medium described herein may further include operations, features, means, or instructions for transmitting, via a third beacon frame, information indicative of an updated routing table of the first wireless node in accordance with the second routing table indicating the new logical path associated with the target wireless node.

[0036] Some examples of the method, first wireless nodes, and non-transitory computer-readable medium described herein may further include operations, features, means, or instructions for receiving, via a second beacon frame, information indicative of a second routing table, the second routing table including the respective identifier of each of the one or more first target wireless nodes, the respective hop count to each of the one or more first target wireless nodes, and the respective cumulative path metric to each of the one or more first target wireless nodes, where generating the routing table to include the logical path between the first wireless node and the second wireless node may be in accordance with receiving the information indicative of the second routing table.

[0037] Details of one or more implementations of the subject matter described in this disclosure are set forth in the accompanying drawings and the description below. Other features, aspects, and advantages will become apparent from the description, the drawings and the claims. Note that the relative dimensions of the following figures may not be drawn to scale.BRIEF DESCRIPTION OF THE DRAWINGS

[0038] Figure 1 shows a pictorial diagram of an example wireless communication network.

[0039] Figure 2 shows an example wireless mesh network that illustrates communication between wireless nodes within the wireless mesh network, the communication including path request (PREQ) frames and associated path reply (PREP) frames.

[0040] Figure 3 shows example objective- or use case-based capabilities that illustrate how node capabilities may be complementary in accordance with a capability mapping between elements of a first capability set and elements of a second capability set and how the node capabilities relate to the elements of the first capability set and the elements of the second capability set.

[0041] Figure 4 shows an example conditionally connected network that illustrates how some connections between wireless nodes may be allowed and how other connections between wireless nodes may not be allowed in accordance with a capability mapping between elements of a first capability set and elements of a second capability set.

[0042] Figure 5 shows an example signaling diagram that illustrates a propagation of a PREQ frame through a wireless mesh network from an origin wireless node and conditional transmissions of associated PREP frames by other wireless nodes of the wireless mesh network.

[0043] Figure 6 shows an example wireless mesh network that illustrates beacon assisted routing via one or more beacon frame transmissions by each of the wireless nodes within the wireless mesh network.

[0044] Figure 7 shows example node type-dependent capability subsets that illustrates how different node types may have capabilities from different subsets of a complete capability set.

[0045] Figure 8 shows example beacon assisted routing that illustrates a sequence of steps according to which various wireless nodes of a wireless mesh network may establish logical paths toward an edge node.

[0046] Figure 9 shows an example process flow that illustrates a sequence of steps according to which a wireless node may leverage beacon assisted routing to generate arouting table, update a routing table, advertise routing information, establish forward and reverse paths, or any combination thereof.

[0047] Figure 10 shows an example signaling diagram that illustrates a path recovery procedure according to which various wireless nodes of a wireless mesh network may re-establish a data path via transmission and propagation of an introductory frame carrying routing information.

[0048] Figure 11 shows a block diagram of an example wireless communication device that supports forming a conditionally connected network in a wireless mesh deployment scenario via a capability based PREQ / PREP frame exchange, capability based beacon assisted routing, or any combination thereof.

[0049] Figures 12-14 show flowcharts illustrating example processes performable by or at a first wireless node that supports forming a conditionally connected network in a wireless mesh deployment scenario via a capability based PREQ / PREP frame exchange.

[0050] Figure 15 shows a flowchart illustrating a process performable by or at a first wireless node that supports forming a conditionally connected network in a wireless mesh deployment scenario via beacon assisted routing.

[0051] Like reference numbers and designations in the various drawings indicate like elements.DETAILED DESCRIPTION

[0052] The following description is directed to some particular examples for the purposes of describing innovative aspects of this disclosure. However, a person having ordinary skill in the art will readily recognize that the teachings herein can be applied in a multitude of different ways. Some or all of the described examples may be implemented in any device, system or network that is capable of transmitting and receiving radio frequency (RF) signals according to one or more of the Institute of Electrical and Electronics Engineers (IEEE) 802.11 standards, the IEEE 802.15 standards, the Bluetooth® standards as defined by the Bluetooth Special Interest Group (SIG), or the Long Term Evolution (LTE), 3G, 4G or 5G (New Radio (NR)) standards promulgated by the 3rd Generation Partnership Project (3GPP), among others. Thedescribed examples can be implemented in any device, system or network that is capable of transmitting and receiving RF signals according to one or more of the following technologies or techniques: code division multiple access (CDMA), time division multiple access (TDMA), orthogonal frequency division multiplexing (OFDM), frequency division multiple access (FDMA), orthogonal FDMA (OFDMA), singlecarrier FDMA (SC-FDMA), spatial division multiple access (SDMA), rate-splitting multiple access (RSMA), multi-user shared access (MUSA), single-user (SU) multipleinput multiple-output (MIMO) and multi-user (MU)-MIMO (MU-MIMO). The described examples also can be implemented using other wireless communication protocols or RF signals suitable for use in one or more of a wireless personal area network (WPAN), a wireless local area network (WLAN), a wireless wide area network (WWAN), a wireless metropolitan area network (WMAN), or an internet of things (IOT) network.

[0053] Various aspects relate generally to wireless communication in a wireless mesh network, including wireless mesh networks in which logical paths between wireless nodes are conditionally (such as optionally or selectively) established in accordance with respective capabilities of each of the wireless nodes. Some aspects more specifically relate to how two wireless nodes may conditionally establish a logical path to each other in accordance with comparing respective capabilities and determining whether a first capability of a first of the two wireless nodes is complementary to a second capability of a second of the two wireless nodes. In some implementations, the first capability may be complementary to the second capability in accordance with a classification of node capabilities into two capability sets Si and S2, with each capability element of Si having a mapping to at least one capability element of S2, and vice versa. As such, the first capability may be complementary to the second capability if the first capability includes at least one capability element that has a mapping to a capability element included in the second capability. A complete capability set C (which may be defined such that C = {Si, S2, Si x S2}, with “x” being the cartesian product) may be pre-configured or pre-loaded at the two wireless nodes and, in some implementations, the respective capabilities (which may be understood as Ci and Cj, both of which are elements of C) of the two wireless nodes may be provided by an application layer associated with each wireless node. As such, application layer functionalities andapplication layer information associated with the two wireless nodes may influence whether the two wireless nodes are able to establish a logical path to each other. In other words, application layer information may influence, contribute to, or be a component in a routing algorithm.

[0054] In some examples, the two wireless nodes may support such a conditional logical path establishment via an exchange of path request (PREQ) and path reply (PREP) frames during a discovery procedure associated with the wireless mesh network. For example, the first wireless node may be an origin node that transmits a PREQ frame and the first wireless node may include, in an information element (IE) or subfield of the PREQ frame, information indicative of the first capability of the first wireless node. In such examples, the second wireless node may receive the PREQ frame, parse (such as decode) the PREQ frame to identify the first capability of the first wireless node, and compare the first capability with the second capability of the second wireless node. If the second wireless node determines that the first capability and the second capability are complementary (in accordance with the mapping between capability elements of Si and S2), the second wireless node may transmit a PREP frame associated with (such as responsive to) the PREQ frame. In such examples, the first wireless node and the second wireless node may establish a logical path to each other. Alternatively, if the second wireless node determines that the first capability and the second capability are non-complementary (in accordance with the mapping between capability elements of Si and S2), the second wireless node may refrain from transmitting a PREP frame associated with (such as responsive to) the PREQ frame. In such examples, the first wireless node and the second wireless node may refrain from establishing a logical path to each other. Regardless of whether the first and second capabilities are complementary, the second wireless node may forward the PREQ frame of the first wireless node and, in some scenarios, may act as a relay (such as a “via point”) between the first wireless node and a third wireless node having a third capability that is complementary to the first capability.

[0055] Particular aspects of the subject matter described in this disclosure can be implemented to realize one or more of the following potential advantages. In some examples, by allowing logical paths between wireless nodes having complementary capabilities and not allowing logical paths between wireless nodes having non-complementary capabilities, some implementations may support a mechanism of building routing tables that reduces a fully connected network to a conditionally connected network for a set of generically definable objectives or use cases. For example, such implementations may reduce (or eliminate) connections that are redundant for a given objective or use case. Further, in accordance with realizing (such as facilitating) such a conditionally connected network via PREQ / PREP frame exchanges, some example implementations of the present disclosure may reduce an amount of path selection frames (and PREP frames in particular) in mesh networks including nodes having different capabilities. Such implementations may reduce flooding in the network by limiting the quantity of connections in the network.

[0056] By reducing the size of routing tables (such as by reducing the quantity of redundant connections) and reducing how many path selection frames are transmitted, the described aspects also may lower network and device complexity, reduce power consumption, and lower signaling overhead, which may further result in greater spectral efficiency, higher data rates, and greater system capacity, among other benefits. Moreover, the described capability based conditionally connected network formation may be applied to any routing protocol associated with wireless mesh networks, which provides compatibility and may result in greater adoption of wireless mesh technology. For example, the described routing algorithms may be especially efficient for a drone mesh use case, but can be extended for various other use cases as well in accordance with reducing complexity and being application layer configurable to function in any wireless protocol.

[0057] Additionally, or alternatively, two wireless nodes may support a conditional logical path establishment via beacon assisting routing. For example, one or more wireless nodes may transmit one or more beacon frames, each beacon frame including routing information to other wireless nodes in a wireless mesh network. In such examples, each wireless node that receives a beacon frame may update its routing table if a best path has changed or if a new path is to be added for a given target wireless node. In accordance with each wireless node of a wireless mesh network transmitting routing information via one or more beacon frames and each wireless node updating respective routing tables in accordance with beacon-provided routing information, wireless nodes of the wireless mesh network may propagate up-to-date routinginformation throughout the wireless mesh network. In some implementations, wireless nodes may employ beacon assisted routing in conjunction with whether respective capabilities of the wireless nodes are complementary (such as in accordance with the mapping between the two capability sets Si and S2). In such implementations, different capability subsets may be defined for various types of nodes, such as edge and non-edge nodes, such that non-edge nodes may have complementary capabilities to edge nodes but may not have complementary capabilities to any other non-edge nodes. Non-edge nodes may refrain from establishing logical paths to each other and may broadcast routing information via beacon frames accordingly.

[0058] Further, in some implementations, wireless nodes may support transmission of unicast introductory frames in accordance with detecting and / or identifying a link loss or change of path. For example, a wireless node that detects and / or identifies a link loss or a change of path may select a new forward path to an edge node and may transmit the introductory frame in the selected forward path. In some aspects, the introductory frame may include routing information associated with other wireless nodes for which the wireless node (an originator node) is a “via point.” Each wireless node in the selected forward path may receive the introductory frame, update its routing table in accordance with the routing information conveyed by the introductory frame, and transmit a forwarded (such as relayed or propagated) version of the introductory frame further along the selected forward path. The wireless nodes of such a wireless mesh network may allow subsequent beacon frames to propagate the updated (modified) routing information throughout the network or may use one or more path change frames to propagate the updated (modified) routing information throughout the network.

[0059] Particular aspects of the subject matter described in this disclosure can be implemented to realize one or more of the following potential advantages. In some examples, by employing beacon assisted routing, wireless nodes of a wireless mesh network may reduce or eliminate reliance on broadcast path selection frames to establish (conditionally) connected networks, which may reduce signaling overhead and mitigate network flooding sometimes associated with broadcast path selection frames. For example, some wireless mesh networks may employ beacon assisted routing instead of broadcast path selection frames. Further, by enabling a path recovery procedure via aunicast introductory frame transmitted in a selected forward path (which may be aided by beacon-provided routing information), wireless nodes may dynamically adapt to changing link conditions without relying on broadcast frame transmissions, which also may reduce signaling overhead and mitigate network flooding along with enabling bidirectional data transfer in the absence of PREQ / PREP frames. As such, the described techniques may be implemented to realize an ability to convert cascading broadcast signaling into unicast messages for route discovery and for handling various routing situations that may occur, together with beacon aided information. By reducing signaling overhead and mitigating network flooding, the described aspects also may lower network and device complexity, reduce power consumption, and lower signaling overhead, which may further result in greater spectral efficiency, higher data rates, and greater system capacity, among other benefits.

[0060] Figure 1 shows a pictorial diagram of an example wireless communication network 100. According to some aspects, the wireless communication network 100 can be an example of a wireless local area network (WLAN) such as a Wi-Fi network. For example, the wireless communication network 100 can be a network implementing at least one of the IEEE 802.11 family of wireless communication protocol standards (such as defined by the IEEE 802.11-2020 specification or amendments thereof including, but not limited to, 802.1 lay, 802.1 lax, 802.11 az, 802.11ba, 802.11bd, 802.1 Ibe, 802.1 Ibf, and 802.1 Ibn). In some other examples, the wireless communication network 100 can be an example of a cellular radio access network (RAN), such as a 5G or 6G RAN that implements one or more cellular protocols such as those specified in one or more 3GPP standards. In some other examples, the wireless communication network 100 can include a WLAN that functions in an interoperable or converged manner with one or more cellular RANs to provide greater or enhanced network coverage to wireless communication devices within the wireless communication network 100 or to enable such devices to connect to a cellular network’s core, such as to access the network management capabilities and functionality offered by the cellular network core.

[0061] The wireless communication network 100 may include numerous wireless communication devices including at least one wireless access point (AP) 102 and any number of wireless stations (STAs) 104. While only one AP 102 is shown in Figure 1,the wireless communication network 100 can include multiple APs 102. The AP 102 can be or represent various different types of network entities including, but not limited to, a home networking AP, an enterprise-level AP, a single-frequency AP, a dual-band simultaneous (DBS) AP, a tri -band simultaneous (TBS) AP, a standalone AP, a non- standalone AP, a software-enabled AP (soft AP), and a multi-link AP (also referred to as an AP multi-link device (MLD)), as well as cellular (such as 3GPP, 4G LTE, 5G or 6G) base stations or other cellular network nodes such as a Node B, an evolved Node B (eNB), a gNB, a transmission reception point (TRP) or another type of device or equipment included in a radio access network (RAN), including Open-RAN (O-RAN) network entities, such as a central unit (CU), a distributed unit (DU) or a radio unit (RU).

[0062] Each of the STAs 104 also may be referred to as a mobile station (MS), a mobile device, a mobile handset, a wireless handset, an access terminal (AT), a user equipment (UE), a subscriber station (SS), or a subscriber unit, among other examples. The STAs 104 may represent various devices such as mobile phones, other handheld or wearable communication devices, netbooks, notebook computers, tablet computers, laptops, Chromebooks, augmented reality (AR), virtual reality (VR), mixed reality (MR) or extended reality (XR) wireless headsets or other peripheral devices, wireless earbuds, other wearable devices, display devices (such as TVs, computer monitors or video gaming consoles), video game controllers, navigation systems, music or other audio or stereo devices, remote control devices, printers, kitchen appliances (including smart refrigerators) or other household appliances, key fobs (such as for passive keyless entry and start (PKES) systems), Internet of Things (loT) devices, and vehicles, among other examples.

[0063] A single AP 102 and an associated set of STAs 104 may be referred to as a basic service set (BSS), which is managed by the respective AP 102. Figure 1 additionally shows an example coverage area 108 of the AP 102, which may represent a basic service area (BSA) of the wireless communication network 100. The BSS may be identified by STAs 104 and other devices by a service set identifier (SSID), as well as a basic service set identifier (BSSID), which may be a medium access control (MAC) address of the AP 102. The AP 102 may periodically broadcast beacon frames (“beacons”) including the BSSID to enable any STAs 104 within wireless range of theAP 102 to “associate” or re-associate with the AP 102 to establish a respective communication link 106 (hereinafter also referred to as a “Wi-Fi link”), or to maintain a communication link 106, with the AP 102. For example, the beacons can include an identification or indication of a primary channel used by the respective AP 102 as well as a timing synchronization function (TSF) for establishing or maintaining timing synchronization with the AP 102. The AP 102 may provide access to external networks to various STAs 104 in the wireless communication network 100 via respective communication links 106.

[0064] To establish a communication link 106 with an AP 102, each of the STAs 104 is configured to perform passive or active scanning operations (“scans”) on frequency channels in one or more frequency bands (such as the 2.4 GHz, 5 GHz, 6 GHz, 45 GHz, or 60 GHz bands). To perform passive scanning, a STA 104 listens for beacons, which are transmitted by respective APs 102 at periodic time intervals referred to as target beacon transmission times (TBTTs). To perform active scanning, a STA 104 generates and sequentially transmits probe requests on each channel to be scanned and listens for probe responses from APs 102. Each STA 104 may identify, determine, ascertain, or select an AP 102 with which to associate in accordance with the scanning information obtained through the passive or active scans, and to perform authentication and association operations to establish a communication link 106 with the selected AP 102. The selected AP 102 assigns an association identifier (AID) to the STA 104 at the culmination of the association operations, which the AP 102 uses to track the STA 104.

[0065] As a result of the increasing ubiquity of wireless networks, a STA 104 may have the opportunity to select one of many BSSs within range of the STA 104 or to select among multiple APs 102 that together form an extended service set (ESS) including multiple connected BSSs. For example, the wireless communication network 100 may be connected to a wired or wireless distribution system that may enable multiple APs 102 to be connected in such an ESS. As such, a STA 104 can be covered by more than one AP 102 and can associate with different APs 102 at different times for different transmissions. Additionally, after association with an AP 102, a STA 104 also may periodically scan its surroundings to find a more suitable AP 102 with which to associate. For example, a STA 104 that is moving relative to its associated AP 102 may perform a “roaming” scan to find another AP 102 having more desirable networkcharacteristics such as a greater received signal strength indicator (RSSI) or a reduced traffic load.

[0066] In some examples, STAs 104 may form networks without APs 102 or other equipment other than the STAs 104 themselves. One example of such a network is an ad hoc network (or wireless ad hoc network). Ad hoc networks may alternatively be referred to as mesh networks or peer-to-peer (P2P) networks. In some examples, ad hoc networks may be implemented within a larger network such as the wireless communication network 100. In such examples, while the STAs 104 may be capable of communicating with each other through the AP 102 using communication links 106, STAs 104 also can communicate directly with each other via direct wireless communication links 110. Additionally, two STAs 104 may communicate via a direct communication link 110 regardless of whether both STAs 104 are associated with and served by the same AP 102. In such an ad hoc system, one or more of the STAs 104 may assume the role filled by the AP 102 in a BSS. Such a STA 104 may be referred to as a group owner (GO) and may coordinate transmissions within the ad hoc network. Examples of direct wireless communication links 110 include Wi-Fi Direct connections, connections established by using a Wi-Fi Tunneled Direct Link Setup (TDLS) link, and other P2P group connections.

[0067] In some networks, the AP 102 or the STAs 104, or both, may support applications associated with high throughput or low-latency requirements, or may provide lossless audio to one or more other devices. For example, the AP 102 or the STAs 104 may support applications and use cases associated with ultra-low-latency (ULL), such as ULL gaming, or streaming lossless audio and video to one or more personal audio devices (such as peripheral devices) or AR / VR / MR / XR headset devices. In scenarios in which a user uses two or more peripheral devices, the AP 102 or the STAs 104 may support an extended personal audio network enabling communication with the two or more peripheral devices. Additionally, the AP 102 and STAs 104 may support additional ULL applications such as cloud-based applications (such as VR cloud gaming) that have ULL and high throughput requirements.

[0068] As indicated above, in some implementations, the AP 102 and the STAs 104 may function and communicate (via the respective communication links 106) according to one or more of the IEEE 802.11 family of wireless communication protocolstandards. These standards define the WLAN radio and baseband protocols for the physical (PHY) and MAC layers. The AP 102 and STAs 104 transmit and receive wireless communications (hereinafter also referred to as “Wi-Fi communications” or “wireless packets”) to and from one another in the form of PHY protocol data units (PPDUs).

[0069] Each PPDU is a composite structure that includes a PHY preamble and a payload that is in the form of a PHY service data unit (PSDU). The information provided in the preamble may be used by a receiving device to decode the subsequent data in the PSDU. In instances in which a PPDU is transmitted over a bonded or wideband channel, the preamble fields may be duplicated and transmitted in each of multiple component channels. The PHY preamble may include both a legacy portion (or “legacy preamble”) and a non-legacy portion (or “non-legacy preamble”). The legacy preamble may be used for packet detection, automatic gain control and channel estimation, among other uses. The legacy preamble also may generally be used to maintain compatibility with legacy devices. The format of, coding of, and information provided in the non-legacy portion of the preamble is associated with the particular IEEE 802.11 wireless communication protocol to be used to transmit the payload.

[0070] The APs 102 and STAs 104 in the wireless communication network 100 may transmit PPDUs over an unlicensed spectrum, which may be a portion of spectrum that includes frequency bands traditionally used by Wi-Fi technology, such as the 2.4 GHz, 5 GHz, 6 GHz, 45 GHz, and 60 GHz bands. Some examples of the APs 102 and STAs 104 described herein also may communicate in other frequency bands that may support licensed or unlicensed communications. For example, the APs 102 or STAs 104, or both, also may be capable of communicating over licensed operating bands, where multiple operators may have respective licenses to operate in the same or overlapping frequency ranges. Such licensed operating bands may map to or be associated with frequency range designations of FR1 (410 MHz - 7.125 GHz), FR2 (24.25 GHz - 52.6 GHz), FR3 (7.125 GHz - 24.25 GHz), FR4a or FR4-1 (52.6 GHz - 71 GHz), FR4 (52.6 GHz - 114.25 GHz), and FR5 (114.25 GHz - 300 GHz).

[0071] Each of the frequency bands may include multiple sub-bands and frequency channels (also referred to as subchannels). For example, PPDUs conforming to the IEEE 802.1 In, 802.1 lac, 802.1 lax, 802.11be and 802.11bn standard amendments maybe transmitted over one or more of the 2.4 GHz, 5 GHz, or 6 GHz bands, each of which is divided into multiple 20 MHz channels. As such, these PPDUs are transmitted over a physical channel having a minimum bandwidth of 20 MHz, but larger channels can be formed through channel bonding. For example, PPDUs may be transmitted over physical channels having bandwidths of 40 MHz, 80 MHz, 160 MHz, 240 MHz, 320 MHz, 480 MHz, or 640 MHz by bonding together multiple 20 MHz channels.

[0072] In some aspects, the wireless communication network 100, or a subset or portion thereof, may be an example of or operate as a wireless mesh network. Although described in the example of a Wi-Fi network, the wireless communication network 100 may be an example of a Wi-Fi mesh network or any other type of wireless mesh network. For example, one or more APs 102 or one or more STAs 104, or any combination thereof, may operate or function as wireless nodes within any generic wireless mesh network. A wireless node may refer to or be understood as any wireless communication device that is capable of wireless communication in addition to, or as an alternative to, wired communication. As such, a wireless node is not a device strictly without a wired connection, but rather a device that is at least capable of wireless communication. A wireless node may be an edge node (which may be equivalently referred to as a sink device) or a non-edge node (which may be equivalently referred to as an end device or a source device), although a wireless node may operate as either an edge node or a non-edge node over time. For example, a wireless node may sometimes operate as an edge node and may at other times operate as a non-edge node.

[0073] A wireless mesh network may include a variety of wireless nodes (such as communication devices) that are capable of obtaining, exchanging, and processing data. These wireless nodes may, in some implementations, be referred to as non-edge nodes, end devices, edge nodes, cloud edges, cloud entities, storage nodes, processing nodes, controller nodes, or the like. The terms “non-edge node” and “edge node” may be relative terms that define or are associated with a relationship between two wireless nodes with respect to one or more of device or node capability, task execution, or proximity to a core network or core processing entity (such as proximity to a wired connection to the Internet). For example, a non-edge node may refer to a wireless node with relatively fewer processing resources or reduced processing capabilities, and an edge node may refer to a wireless node with relatively more processing resources orgreater processing capabilities. Additionally, or alternatively, a non-edge node may refer to a wireless node that solicits or requests a processing task, and an edge node may refer to a wireless node that executes a processing task. Wireless nodes such as APs 102, STAs 104, user equipments (UEs), drones (including terrestrial drones, aerial drones, underwater drones, or any combination thereof), routers, mobile devices (smartphones), cars, laptops, gaming consoles, extended reality (XR) glasses or headsets, augmented reality (AR) devices, virtual reality (VR) headsets, thermostats, sensors, loT devices, and other consumer devices may serve as edge nodes, non-edge nodes, or both at different times.

[0074] In some implementations, various wireless nodes of the wireless communication network 100 may support a conditionally connected network in accordance with whether the wireless nodes have complementary capabilities. For example, different wireless nodes may have different capabilities and, to reduce a size of a routing table at each of the wireless nodes and reduce signaling overhead, the wireless nodes of the wireless communication network may selectively or conditionally establish logical paths in view of (such as in accordance with) node capabilities. For example, if two wireless nodes have complementary capabilities, the two wireless nodes may establish a logical path to each other (and include an entry to each other in respective routing tables). Alternatively, if the two wireless nodes have non- complementary capabilities, the two wireless nodes may refrain from establishing a logical path to each other (and exclude an entry to each other in respective routing tables).

[0075] An application layer may provide an indication of a capability of a wireless node to a host of the wireless node. In other words, the capability of the wireless node may be defined or otherwise indicated by the application layer of the wireless node. The application layer may support communication with another application program on a network. For example, the application layer may specify a shared communication protocol and interface techniques used by two or more hosts in the wireless communication network 100. The application layer may enable users to send data, access data, and use networks. In some aspects, the host of the wireless node may obtain the indication of the capability of the wireless node and the capability of the wireless node may relate to such functionality of the application layer or informationaccessible by the application layer, or both. For example, the application layer of the wireless node may have information (in accordance with, for example, a user input or selection) of a generically definable objective or use case of the wireless node. For example, the capability of the wireless node may be selected (and provided to the host via the application layer) in accordance with a type of application running at the wireless node. In accordance with the application layer providing the capability, the application layer of the wireless node may influence, impact, control, define, inform, restrict, condition, or enable how connections involving the wireless node are made.

[0076] In some examples, a first wireless node may inform other wireless communication devices of its capability via a PREQ frame. In such examples, a second wireless node that receives the PREQ frame may parse the PREQ frame for the capability of the first wireless node, compare the first capability to a second capability of the second wireless node, and selectively reply to the PREQ frame in accordance with whether the first and second capabilities are complementary. For example, the second wireless node may transmit a PREP frame associated with the PREQ frame if the first and second capabilities are complementary and may refrain from transmitting a PREP frame associated with the PREQ frame if the first and second capabilities are non-complementary.

[0077] Figure 2 shows an example wireless mesh network 200 that illustrates communication between wireless nodes 202 within the wireless mesh network 200, the communication including PREQ frames 206 and associated PREP frames 208. The wireless mesh network 200 may implement or be implemented to realize aspects of the wireless communication network 100. For example, the wireless mesh network 200 illustrates communication between wireless nodes 202, which may be examples of corresponding devices or nodes as illustrated by and described with reference to Figure 1. For example, the wireless nodes 202 may be examples of APs 102, STAs 104, UEs, drones (including terrestrial drones, aerial drones, underwater drones, or any combination thereof), routers, mobile devices, cars, laptops, gaming consoles, XR glasses or headsets, AR devices, VR headsets, thermostats, sensors, loT devices, other consumer or industrial devices, or any combination thereof.

[0078] As illustrated in the example of the wireless mesh network 200, the wireless nodes 202 may collectively refer to any one or more of a wireless node 202-a, a wirelessnode 202-b, a wireless node 202-c, a wireless node 202-d, a wireless node 202-e, a wireless node 202-f, a wireless node 202-g, and a wireless node 202-h, although the wireless mesh network 200 may include any quantity of two or more wireless nodes. Although described in some examples in the context of a Wi-Fi mesh network, the wireless mesh network 200 may be an example of any type of wireless mesh network, such as any network in which two or more peer devices may connect with each and data routing may dynamically update as nodes change location.

[0079] Some device types (such as drones) are receiving increasing market interest, which is driving demands for greater connectivity and a mesh network delivered with low latency in multi-hop mesh networks, fast adaptation to varying topologies, low (including zero) downtime path change, and an ability to multi-cast or broadcast data (such as drone or other non-edge node generated data) to multiple sink devices (such as multiple edge nodes), among others. Wi-Fi mesh networks are common in some deployment scenarios and applications due to ease of availability, low cost, and convenience of having an independent network (as opposed to being dependent on an infrastructure such as cellular). In some other deployment scenarios, cellular mesh networks are relatively more common. Some mesh deployments may be for home, carrier, enterprise, or any combination thereof, including services associated with wireless distribution or upstream mesh associated with a mesh protocol, such as the 802.11s protocol.

[0080] Drone and loT use cases may typically operate in low bandwidths, which may amplify the cost of overhead incurred for network management as compared to some traditional networks. For example, a route discovery packet having a 100 microsecond length operating in 20 MHz (in a standard mesh network) may become 400 microseconds in length in a half-rate system of 5 MHz. As such, a PREQ packet + PREP packet signaled across two hops may occupy 100 microseconds x 2 x 2 = 400 microseconds in 20 MHz may become 400 microseconds x 2 x 2 = 1.6 milliseconds (for each potential path), which may incur a relatively high latency that could be further complicated by other aspects of some routing protocols that could result in high overhead or sub-optimal path selection, or both.

[0081] The 802.1 Is-based mesh network may allow nodes (such as all nodes) within the mesh network to establish peer-to-peer connections with each other and be able tocommunicate directly if a link strength is sufficient. A Hybrid Wireless Mesh Protocol (HWMP), which may be a default routing protocol in 802.1 Is-based networks, may offer or support two modes of operation including an on-demand mode and a proactive mode. The on-demand mode may be associated with a Radio Metric Ad-Hoc OnDemand Distance Vector (RM-AODV) routing protocol. The on-demand mode may support low latency routing, but may flood (such as overload) a system with many management frames in accordance with a forwarding and propagation of path selection frames (such as PREQ and PREP frames). Further, collision and hidden nodes in the system may hinder on-demand path selection, as a missing PREQ broadcast could lead to a selection of a sub-optimal path. Moreover, in a fully connected network, a routing table size and the overheads involved may be relatively high, which may add complexity and increase power consumption. Some 802. I ls networks may use on- demand routing using PREQ broadcast frames and may aim for a fully connected network. This further contributes to high overheads, especially in scenarios associated with fast changing topologies.

[0082] The proactive mode may be associated with a tree-based routing with a root node, with a tree-based topology created using broadcast PREQ or Root Announcement (RNN) frames. In the proactive mode, there may only be one root node and the tree may be the only topology that the proactive mode results in. As such, the proactive mode may be suited for topologies that do not change, as rebuilding the tree may be costly when nodes move. Further, the proactive node may result in a sub-optimal path selection as nodes may not know other nodes in the tree and the routing may happen via the root node.

[0083] Additionally, or alternatively, some networks may employ Radio Aware- Optimized Link State Routing (RA-OLSR), which may be associated with a link-state routing protocol. RA-OLSR may support on-demand routing and may have reduced overhead compared to some 802.1 Is-based networks. For example, RA-OLSR may aim to create a fully connected network with multi-point relays (MPRs), which may be a limited set of peers used to achieve connectedness. In accordance with RA-OLSR, only MPRs may emit (such as transmit) topology or routing information, thus reducing the signaling overhead. The selection of the limited set of MPRs, however, may becomecomplex in a system with dynamically changing topology. Further, a sub-optimal selection of MPRs may lead to a sub-optimal selection of paths.

[0084] Accordingly, in some implementations of the present disclosure, various wireless nodes 202 of the wireless mesh network 200 may support one or more signaling- or configuration-based mechanisms associated with building routing tables to reduce a fully connected network to a conditionally connected network. In some implementations, such mechanisms may be further associated with reducing a fully connected network to a conditionally connected network in accordance with a set of objectives or use cases, such as user or application defined objectives or use cases. Additionally, or alternatively, the wireless nodes 202 may support one or more signaling- or configuration-based mechanisms associated with reducing routing overhead in the wireless mesh network 200 with broadcast advertising of routes to special (such as complementary) nodes, which may reduce overheads from message flooding that occurs when a link re-routing is performed.

[0085] In accordance with establishing a conditionally connected network associated with the wireless mesh network 200, the wireless nodes 202 may support a mechanism of classifying the wireless nodes 202 and forming a conditionally connected network in accordance with the classifications of the wireless nodes 202. In some aspects, the classifications of the wireless nodes 202 may relate to or be associated with node capabilities 204. For example, the capabilities 204 of the wireless nodes 202 in the wireless mesh network 200 may be classified into two sets Si and S2, with elements of Si having a mapping to elements of S2. In other words, each element of Si may have a mapping to at least one element of S2. Similarly, each element of S2 may have a mapping to at least one element of Si. The sets Si and S2 may be understood or referred to as a first capability set and a second capability set, respectively, and each may include one or more elements (which may be referred to as capability elements).

[0086] For example, Si may be defined such that Si = {A, B, C, ... N} with A, B, C, . . . N being the capabilities (such as the capability elements). Similarly, S2 may be defined such that S2 = {A’, B’, C’, ... N’} with A’, B’, C’, ... N’ being the capabilities (such as the capability elements). The elements of Si and S2 may be associated with an objective, application, or use case associated with the wireless mesh network 200. Additionally, or alternatively, the elements of Si and S2 may be associated with afunctionality or characteristic of a wireless nodes 202 (such as whether a wireless node 202 is a designated relay node), a geographic location associated with one or more wireless nodes 202, a geographic location associated with the wireless mesh network 200, or any other factors or characteristics associated with the wireless mesh network 200 or any specific wireless node 202 that could relate to an interoperability between two or more wireless nodes 202. In some aspects, the elements of Si and S2 may be preconfigured or pre-loaded at the wireless nodes 202 (such that the elements of Si and S2 may be statically configured for a given objective, application, or use case). Each wireless node 202 in the wireless mesh network 200 may be associated with (such as have or be defined by) a capability 204. A capability 204 may be defined by Ci, with Ci being an element in complete capability set C, the complete capability set C being defined such that C = {Si, S2, Si x S2}, with “x” being the cartesian product.

[0087] In accordance with some example implementations in this disclosure, a path between any two wireless nodes 202 with capabilities Ci and Cj may be established if there exists at least one element in Ci with a mapping to an element in Cj, and may not be established otherwise. In some aspects, any two capabilities 204 that include mapping elements may be understood or referred to as being complementary capabilities 204. In accordance with limiting the allowed connections to being between wireless nodes 202 having complementary capabilities 204, the described techniques may be implemented to reduce a quantity of path selection frames in the wireless mesh network 200 (or any other mesh network with nodes having different capabilities 204).

[0088] In some implementations, each wireless node 202 may send its capabilities 204 along with a PREQ frame 206 (which may be equivalently referred to as a PREQ element, a PREQ message, or a PREQ packet, and which may include information indicative of a broadcast address). In such implementations, one or more information elements (IES) or subfields, such as a capability IE 210, of the PREQ frame 206 may include or carry information indicative of the capabilities 204 (as defined by, for example, a capability Ci) of the wireless node 202. The capability IE 210 may be an example of one or more vendor specific IEs. In some implementations, a wireless node 202 may indicate its capability 204 via the capability IE 210 in various ways. For example, information indicative of a capability 204 may include an explicit indication of each capability element included in the capability 204, an index value correspondingto the capability 204, an enumerated value corresponding to the capability 204, or any combination thereof. Further, a quantity of available capabilities 204 may increase over time and such explicit indications, index values, and enumerated values may be updated (such as via signaling or via new or updated configurations) accordingly. In some aspects, a wireless node 202 may transmit a PREQ frame 206 as an origin node in accordance with a discovery procedure associated with the wireless mesh network 200. Such a discovery procedure may be referred to as or may be associated with a path selection procedure, and may include any signaling mechanism or procedure according to which a wireless node 202 discovers or selects a path to at least one other wireless node 202 in the wireless mesh network 200.

[0089] Each wireless node 202 in the wireless mesh network 200 may respond to the PREQ frame 206 with a PREP frame 208 (which may be equivalently referred to as a PREP element, a PREP message, or a PREP packet) if the capability 204 of the wireless node 202 that transmitted the PREQ frame 206 and the wireless node 202 receiving the PREQ frame 206 have mapping elements (in accordance with the mapping between Si and S2). Otherwise, the wireless node 202 receiving the PREQ frame 206 may refrain from transmitting a PREP frame 208 associated with (such as responsive to) the PREQ frame 206.

[0090] For example, the wireless node 202-a may have a capability 204-a (such as Ci) and may transmit the PREQ frame 206 (such that the wireless node 202-a may be an example of an origin node). In accordance with some implementations, the wireless node 202-a may include information indicative of the capability 204-a in the capability IE 210 of the PREQ frame 206. In examples in which the wireless node 202-a transmits the PREQ frame 206 as a broadcast PREQ frame, each wireless node 202 in range of the wireless node 202-a may receive and parse the PREQ frame 206. In some examples, the wireless node 202-b and the wireless node 202-c may be in range of the wireless node 202-a and, as such, may receive the PREQ frame 206 and determine whether to transmit an associated PREP frame 208 in accordance with a capability comparison.

[0091] For example, the wireless node 202-b may have a capability 204-b (such as Cj), may parse the PREQ frame 206 to identify the capability 204-a of the wireless node 202-a, and may selectively transmit a PREP frame 208 in accordance with whether thecapability 204-b is complementary to the capability 204-a. In the example illustrated by the wireless mesh network 200, the capability 204-a and the capability 204-b may be complementary and the wireless node 202-b may transmit a PREP frame 208 associated with the PREQ frame 206 accordingly. For example, the PREQ frame 206 may indicate that the capability 204-a of the wireless node 202-a includes an element A (such as video rendering) and the capability 204-b of the wireless node 202-b may include an element A’ (such as video generation) that maps to the element A. In some implementations, the wireless node 202-b may include information indicative of the capability 204-b in one or more IES or subfields of the PREP frame 208 transmitted by the wireless node 202-b. In such implementations, both the wireless node 202-a and the wireless node 202-b may have a mutual understanding as to which specific elements map between the capability 204-a and the capability 204-b. In addition to transmitting the PREP frame 208 associated with the PREQ frame 206, the wireless node 202-b may transmit a forwarded (such as relayed or propagated) version of the PREQ frame 206 (such that other wireless nodes 202 in range of the wireless node 202-b are able to receive and learn about the presence and capability 204-a of the wireless node 202-a).

[0092] For further example, the wireless node 202-c may have a capability 204-c (such as Ck), may parse the PREQ frame 206 to identify the capability 204-a of the wireless node 202-a, and may selectively transmit a PREP frame 208 in accordance with whether the capability 204-c is complementary to the capability 204-a. In the example illustrated by the wireless mesh network 200, the capability 204-a and the capability 204-c may be non-complementary and the wireless node 202-c may refrain from transmitting a PREP frame 208 associated with the PREQ frame 206 accordingly. Instead of transmitting an associated PREP frame 208, the wireless node 202-c may transmit a forwarded (such as relayed or propagated) version of the PREQ frame 206 (such that other wireless nodes 202 in range of the wireless node 202-c are able to receive and learn about the presence and capability 204-a of the wireless node 202-a). In other words, wireless nodes 202 (including the wireless node 202-c) that are not capable of an element A’ that maps to an element A included in the capability 204-a may still forward the PREQ frame 206 and may act (such as operate or function) as a relay (such as a via point) for other wireless nodes 202 that have a capability 204 including the element A’ . For example, the wireless node 202-c may act as a via pointfor the wireless node 202-e, which may have a capability 204 complementary to the capability 204-a.

[0093] Such a selective transmission of PREP frames 208 associated with the PREQ frame 206 in accordance with node capabilities may reduce a quantity of PREP frames 208 in the wireless mesh network 200, which may reduce overhead. For instance, in the example illustrated by the wireless mesh network 200, the wireless node 202-b and the wireless node 202-e may transmit PREP frames 208 (and one or more other wireless nodes may forward those PREP frames 208), while each of the wireless node 202-c, the wireless node 202-d, the wireless node 202-f, the wireless node 202-g, and the wireless node 202-h may refrain from transmitting their own PREP frames 208 (although one or more of such wireless nodes 202 may forward the PREP frames 208 transmitted by the wireless node 202-b and the wireless node 202-e). Such a reduction in the quantity of PREP frames 208 in the wireless mesh network 200 may provide more airtime for other transmissions, increasing spectral efficiency and system capacity and potentially reducing complexity and latency.

[0094] Figure 3 shows example objective- or use case-based capabilities 300 that illustrate how node capabilities may be complementary in accordance with a capability mapping 302 between elements 306 of a first capability set 304-a and elements 306 of a second capability set 304-b and how the node capabilities relate to the elements 306 of the first capability set 304-a and the elements 306 of the second capability set 304-b. The objective- or use case-based capabilities 300 may be implemented to realize or facilitate aspects of the wireless communication network 100 and the wireless mesh network 200.

[0095] For example, the objective- or use case-based capabilities 300 illustrate an example capability mapping 302 between the capability set 304-a and the capability set 304-b, each of the capability set 304-a and the capability set 304-b including one or more elements 306 (which may be understood or referred to as capability elements). The capability set 304-a may be an example of a capability set Si and the capability set 304-b may be an example of a capability set S2 and the capability mapping 302 may define or indicate how elements 306 of the capability set 304-a (Si) map to elements 306 of the capability set 304-b (S2).

[0096] The objective- or use case-based capabilities 300 may further illustrate a complete capability set 308, which may be an example of a complete capability set C defined such that C = {Si, S2, Si x S2}, with “x” being the cartesian product. As such, if the capability set 304-a includes an element A and an element B and the capability set 304-b includes an element A’ and an element B’, the complete capability set 308 may include a finite list of options for device capabilities including a first capability including element A, a second capability including element A’, a third capability including element B, a fourth capability including element B’, a fifth capability including elements A and B, a sixth capability including elements A and B’, a seventh capability including elements A’ and B, and an eighth capability including elements A’ and B’. In such examples, wireless nodes of a wireless mesh network (such as the wireless nodes 202 of the wireless mesh network 200) may select a capability from the finite list of options available in the complete capability set 308 (such as in accordance with an indication from an application layer).

[0097] In the example of the wireless mesh network 200 in which the capability 204-a of the wireless node 202-a is complementary to the capability 204-b of the wireless node 202-b, the capability 204-a may include the element B (such that Ci = {B }) and the capability 204-b may include the element B’ (such that Cj = { B’ }). As such, the capability 204-a and the capability 204-b may be understood as being complementary to each other in accordance with the capability 204-a including an element 306 (the element B) that maps to an element 306 (the element B’) included in the capability 204-b. In further example of the wireless mesh network 200 in which the capability 204-a of the wireless node 202-a is non-complementary to the capability 204-c of the wireless node 202-c, the capability 204-a may include the element B (such that Ci = {B }) and the capability 204-c may include the elements A and B (such that Ck = {A, B }). As such, the capability 204-a and the capability 204-c may be understood as being non-complementary to each other in accordance with the capability 204-a not including an element 306 that maps to at least one element 306 included in the capability 204-c.

[0098] Some example combinations of a capability Ci and a capability Cj and whether or not connections are allowed between devices having such capabilities are illustrated by Table 1, shown below.TABLE 1: Example Combinations of Two Capabilities Ci and Cj

[0099] Further, a user, application, objective, or use case may impact or determine the objective- or use case-based capabilities 300. For example, which specific capabilities are reflected in the complete capability set 308 may depend on the objective or use case associated with the wireless nodes. In some implementations, a host of a wireless node may obtain an indication of a capability of the wireless node (from the finite list of options available in the complete capability set 308) from an application layer associated with the wireless node. In such implementations, a host of a wireless node may store the capability associated with the wireless node, the complete capability set 308, and information indicative of the capability mapping 302. In some implementations, an application of a wireless node or an application layer associated with the wireless node may expose an application programming interface (API) through which an application can view a configuration of the complete capability set 308 and identify to which other wireless nodes the wireless node might connect.

[0100] Figure 4 shows an example conditionally connected network 400 that illustrates how some connections between wireless nodes 408 may be allowed and how other connections between wireless nodes 408 may not be allowed in accordance with a capability mapping 402 between elements 406 of a first capability set 404-a and elements 406 of a second capability set 404-b. The conditionally connected network 400 may implement or be implemented to realize or facilitate aspects of the wireless communication network 100, the wireless mesh network 200, or the objective- or use case-based capabilities 300.

[0101] For example, the conditionally connected network 400 illustrates an example topology and a reduced quantity of paths per a conditionally connected routing algorithm. The conditionally connected network 400 may be associated with an example capability mapping 402 between the capability set 404-a and the capability set 404-b, with each of the capability set 404-a and the capability set 404-b including one or more elements 406 (which may be understood or referred to as capability elements). The capability set 404-a may be an example of a capability set Si and the capability set 404-b may be an example of a capability set S2. The capability mapping 402 may define or indicate how elements 406 of the capability set 404-a (Si) map to elements 406 of the capability set 404-b (S2).

[0102] In accordance with the capability mapping 402, an element A may map to an element A’, an element B may map to an element B’, an element C may map to an element C’, and an element N may map to elements B’, C’, and N’. In some implementations, the wireless nodes 408 (which may collectively refer to any one or more of a wireless node 408-a, a wireless node 408-b, a wireless node 408-c, and a wireless node 408-d and which may be examples of wireless nodes 202 as illustrated by and described with reference to Figure 2) may conditionally establish connections (such as logical paths) with each other in accordance with a respective capability 410 of each of the wireless nodes 408 and the capability mapping 402. For example, the wireless node 408-a may be associated with a capability 410-a including elements A and B’, the wireless node 408-b may be associated with a capability 410-b including element B, the wireless node 408-c may be associated with a capability 410-c including elements A’ and C, and the wireless node 408-d may be associated with a capability 410-d including element C’.

[0103] In such examples, the wireless node 408-a may have an allowed connection 412 (which may be an example of a logical path, a logical path including 0, 1, 2, 3, or any other quantity of hops between two wireless nodes 408) with the wireless node 408-b in accordance with a mapping between the elements B and B’. Further, the wireless node 408-a may have an allowed connection 412 with the wireless node 408-c in accordance with a mapping between the elements A and A’ and the wireless node 408-c may have an allowed connection 412 with the wireless node 408-d in accordance with a mapping between the elements C and C’. As such, within the conditionallyconnected network 400, PREQ and PREP message transactions may happen (such as occur) between a defined subset of wireless nodes 408 (such as between the wireless node 408-a and the wireless node 408-b, between the wireless node 408-a and the wireless node 408-c, and between the wireless node 408-c and the wireless node 408-d).

[0104] Other potential pairings of nodes may be associated with not allowed connections 414 (which may be an example of a logical path, a logical path including 0, 1, 2, 3, or any other quantity of hops between two wireless nodes 408) in accordance with such nodes having non-complementary capabilities 410. For example, the wireless node 408-a and the wireless node 408-d may be associated with a not allowed connection 414 in accordance with an absence of any mapping between elements 406 of the capability 410-a and elements 406 of the capability 410-d. Similarly, the wireless node 408-b and the wireless node 408-c may be associated with a not allowed connection 414 in accordance with an absence of any mapping between elements 406 of the capability 410-b and elements 406 of the capability 410-c. Further, the wireless node 408-b and the wireless node 408-d may be associated with a not allowed connection 414 in accordance with an absence of any mapping between elements 406 of the capability 410-b and elements 406 of the capability 410-d. In accordance with the capability mapping 402, connections that are redundant for a use case may be avoided. For example, two wireless nodes 408 that are both video generation devices may refrain from establishing a logical path (such as refrain from forming a routing entry) to each other, as neither of such wireless nodes 408 may have a capability to do any processing with generated video. Instead, such wireless nodes 408 may look to establish logical paths with video storage or streaming devices, which may be understood as being associated with capabilities that are more complementary to video generation.

[0105] If the wireless nodes 408 formed a fully connected network, six connections would be made, whereas in accordance with the example of the conditionally connected network 400, three connections are made. In accordance with such a reduction in the quantity of connections (such as by limiting connections to nodes having complementary capabilities 410 and avoiding connections that are redundant to a specific use case), the described techniques may be further implemented to reduce network overhead due to path selection frame exchanges, among other benefits. For example, in accordance with the conditionally connected network 400, if a topologychanges or a wireless node 408 otherwise goes offline or becomes unreachable, propagation of path error (PERR) frames may be reduced or limited to being between wireless nodes that have an allowed connection 412, and may not be transmitted by wireless devices associated with a not allowed connection 414.

[0106] Figure 5 shows an example signaling diagram 500 that illustrates a propagation of a PREQ frame 504 through a wireless mesh network from an origin wireless node 502 and conditional transmissions of associated PREP frames 506 by other wireless nodes 502 of the wireless mesh network. The signaling diagram 500 may implement or be implemented to realize or facilitate aspects of the wireless communication network 100, the wireless mesh network 200, the objective- or use casebased capabilities 300, or the conditionally connected network 400.

[0107] For example, the signaling diagram 500 may illustrate signaling (such as path selection frame exchanges) between various wireless nodes 502 within a wireless mesh network. The wireless nodes 502 (which may refer collectively to any one or more of a wireless node 502-a, a wireless node 502-b, a wireless node 502-c, a wireless node 502-d, a wireless node 502-e, and a wireless node 502-f) may be examples of the wireless nodes 202 or the wireless nodes 408 as illustrated by and described with reference to Figures 2 and 4, respectively.

[0108] The signaling diagram 500 illustrates an exchange of PREQ frames 504 and associated PREP frames 506 in accordance with selective transmission of PREP frames 506 and in the context of an example in which the wireless node 502-b, the wireless node 502-d, and the wireless node 502-e have capabilities complementary to a capability of the wireless node 502-a (which may be an origin node) and in which the wireless node 502-c and the wireless node 502-f have capabilities that are non- complementary to the capability of the wireless node 502-a.

[0109] The wireless node 502-a may be an example of an origin node and may transmit a PREQ frame 504, which may be forwarded or propagated throughout the wireless mesh network by each of the wireless node 502-b, the wireless node 502-c, the wireless node 502-d, the wireless node 502-e, and the wireless node 502-f. As illustrated in the example of the signaling diagram 500, each iteration of the PREQ frame 504 may be associated with a hop count to the originator field. This field may beincremented by each wireless node 502 that forwards the PREQ frame 504 and may enable each wireless node 502 to determine its hop count to the originator. This field also may be used by a wireless node 502 to avoid looping the PREQ frame 504. For example, the PREQ frame 504 forwarded by the wireless node 502-b may be associated with a hop count to the originator field value of 1, the PREQ frame 504 forwarded by the wireless node 502-c may be associated with a hop count to the originator field value of 2, and the PREQ frame 504 forwarded by the wireless node 502-d may be associated with a hop count to the originator field value of 3.

[0110] In accordance with having complementary capabilities, the wireless node 502-b, the wireless node 502-d, and the wireless node 502-e may each transmit a PREP frame 506 associated with the PREQ frame 504 originating from the wireless node 502-a. In some aspects, the wireless node 502-b may transmit a PREP frame 506 indicating the wireless node 502-b as a target (such as via a “Target B” indication), the wireless node 502-d may transmit a PREP frame 506 indicating the wireless node 502-d as a target (such as via a “Target D” indication), and the wireless node 502-e may transmit a PREP frame 506 indicating the wireless node 502-e as a target (such as via a “Target E” indication). Intermediate nodes between the wireless node 502-a (the origin node) and each target node may forward PREP frames 506 such that the wireless node 502-a receives (directly or indirectly via one or more via points) PREP frames 506 from each of the wireless node 502-b, the wireless node 502-d, and the wireless node 502-e. In accordance with having non-complementary capabilities, the wireless node 502-c and the wireless node 502-f may refrain from responding to the PREQ frame 504 originating from the wireless node 502-a. The wireless node 502-c and the wireless node 502-f may transmit (such as broadcast) a forwarded version of the PREQ frame 504 without transmitting a PREP frame 506 associated with the PREQ frame 504, and may forward any received PREP frames 506 originating from other target nodes in the wireless mesh network.[OHl] In systems that implement other mechanisms outside of such a conditional transmission of PREP frames 506, PREP frames 506 indicative of all of the wireless nodes 502 may be present in the wireless mesh network, which may flood the network and result in high signaling overhead and large, complex routing tables. For example, such a system may result in at least twelve PREP frames 506, while the signalingdiagram 500 may include at least six PREP frames 506 (such that the described mechanism associated with a conditional transmission of PREP frames 506 may reduce a quantity of PREP frames 506 in the network by approximately half in the example of the signaling diagram 500).

[0112] Figure 6 shows an example wireless mesh network 600 that illustrates beacon assisted routing via one or more beacon frame transmissions by each of the wireless nodes 602 within the wireless mesh network 600. The wireless mesh network 600 may implement or be implemented to realize or facilitate aspects of the wireless communication network 100, the wireless mesh network 200, the objective- or use casebased capabilities 300, the conditionally connected network 400, or the signaling diagram 500. For example, the wireless mesh network 600 includes wireless nodes 602, which may generally refer to any one or more of a wireless node 602-a, a wireless node 602-b, a wireless node 602-c, a wireless node 602-d, a wireless node 602-e, and a wireless node 602-n, and which may be examples of the wireless nodes 202, the wireless nodes 408, or the wireless nodes 502 as illustrated by and described with reference to Figures 2, 4, or 5, respectively.

[0113] In accordance with beacon assisted routing, each wireless node 602 in the wireless mesh network 600 may transmit a beacon including routing information to other nodes in the wireless mesh network 600. For example, each wireless node 602 may transmit a beacon frame with a vendor specific IE containing the routing information to other wireless nodes 602 in the wireless mesh network 600. The routing information may include a list of edge nodes in the system and a metric associated with a distance from itself to each of the advertised edge nodes. Additionally, or alternatively, the routing information may include a medium access control (MAC) identifier (ID) of a target wireless node 602 (which may be equivalently referred to as a destination node), a hop-count to reach the target wireless node 602, and a cumulative metric to reach the target wireless node 602, among other parameters. Each wireless node 602, upon receiving a beacon frame carrying such routing information, may update its routing table 604 if a best path has changed or a new path is to be added for the target wireless node 602. A wireless node 602 that receives such a beacon frame may update the routing information carried in future beacon frame transmitted by the wireless node 602 in accordance with updating its routing table 604. As such, wireless nodes 602 inthe wireless mesh network 600 may propagate neighbor routing information throughout the wireless mesh network 600. In some aspects, each wireless node 602 may maintain more than one path for reliability and faster path switching, which may meet one or more performance indicators in some ultra-reliable deployment scenarios.

[0114] In the example illustrated by the wireless mesh network 600, the wireless node 602-n may join the wireless mesh network 600 (such as after the other wireless nodes 602) and the wireless node 602-n may learn about other wireless nodes 602 (such as receive routing information associated with, such as to, each of the other wireless nodes 602) via one or more beacon frames transmitted by the wireless node 602-b. For example, in accordance with receiving one or mor beacon frames transmitted by the wireless node 602-b, the wireless node 602-n may generate or update a routing table 604-n in accordance with the routing information conveyed by the one or more beacon frames. The wireless node 602-n may transmit one or more beacon frames, which may include routing information to the wireless node 602-n.

[0115] The wireless node 602-b may listen to (such as monitor for and parse) the one or more beacon frames transmitted by the wireless node 602-n and add the wireless node 602-n to a routing table 604-b of the wireless node 602-b. Likewise, future or subsequent beacon frames transmitted by the wireless node 602-b may include routing information to the wireless node 602-n. Other wireless nodes 602 in the wireless mesh network may similarly update their respective routing tables 604 and the routing information conveyed by their beacon frames. For example, the wireless node 602-a and the wireless node 602-d may update a routing table 604-a and a routing table 604-d, respectively, in accordance with receiving one or more beacon frames from the wireless node 602-b including routing information to the wireless node 602-n. As such, information (such as routing information) associated with the wireless node 602-n may be propagated throughout the wireless mesh network 600 and a routing table 604 (or an entry to a routing table 604) may be added for the wireless node 602-n.

[0116] In some implementations, the wireless nodes 602 may transmit and receive one or more of such beacon frames carrying routing information instead of transmitting path selection frames. In such implementations, the wireless nodes 602 may avoid path selection frames and any corresponding flooding of the wireless mesh network 600. Further, each wireless node 602 may maintain more than one path to any destination,which may assist with faster path switching and greater reliability, which may in turn support greater connectivity, higher data rates, and fewer communication errors. In some implementations, the wireless nodes 602 may further employ a conditional routing mechanism to limit a size of such routing assisting beacons and a size of routing tables at each of the wireless nodes 602, as such sizes may become large if the quantity of wireless nodes 602 in the wireless mesh network 600 becomes large. Such a conditional routing mechanism may include techniques associated with forming a conditionally connected network, with or without classifying different node types with capabilities from different subsets of a complete capability set C.

[0117] Figure 7 shows example node type-dependent capability subsets 700 that illustrates how different node types may have capabilities from different subsets of a complete capability set. The node type-dependent capability subsets 700 may implement or be implemented to realize or facilitate aspects of the wireless communication network 100, the wireless mesh network 200, the objective- or use casebased capabilities 300, the conditionally connected network 400, the signaling diagram 500, or the wireless mesh network 600.

[0118] In some implementations, the node type-dependent capability subsets 700 may be associated with a capability mapping 702 between a capability set 704-a and a capability set 704-b, with each of the capability set 704-a and the capability set 704-b including one or more elements 706 (which may be referred to as capability elements). The capability set 704-a may be an example of a capability set Si and the capability set 704-b may be an example of a capability set S2. Additional details relating to such a capability mapping between different capability sets are illustrated by and described with reference to Figures 2-4.

[0119] For example, each wireless node in a wireless mesh network may be assigned capabilities in accordance with a finite list of options provided by a complete capability set C. In some implementations, such as for implementations involving a drone mesh network, two types of nodes may be defined or classified in accordance with respective capabilities. Such types of nodes may include edge nodes and non-edge nodes. In some examples, edge nodes may be nodes having a capability within a second subset of capabilities 708-b. The second subset of capabilities 708-b may be referred to or understood as a capability within Cesuch that CeE C. Non-edge nodes may be nodeshaving a capability within a first subset of capabilities 708-a. The first subset of capabilities 708-a may be referred to or understood as a capability within Cne such that Cne E C, there is no mapping between any two elements 706 of Cne, and Cne fl Ce = {} (with “{}” being indicative of an empty set). For example, in accordance with the example of the capability mapping 702, a first non-edge node having capabilities {A, B’, C} may imply that there is not another non-edge node with capabilities including elements A’, B, or C’. In other words, if {A, B’, C} E Cne, then A’, B, or C’ may not be any element of Cne. In examples of drone mesh networks, potential use cases may include surveillance, swarming, lifting, machining, or delivery, among other examples.

[0120] In the context of a drone mesh with edge nodes and non-edge nodes, edge nodes and non-edge nodes may be associated with (such as have) different capabilities or serve different functions. For example, an edge node may be any active node in the network that has one or more control plane functions and can be of any one or more of various different capabilities. Such various different capabilities may be associated with different types of nodes or devices, including a drone controller (such as a device generating instructions for drone movements), a video streaming screen (which may be associated with a rendering capability and equivalently referred to as a rendering device), a video storing device, or a gateway to the Cloud (which may be a controller, storage, or video rendering device). A non-edge node may be any node in the network that is not configured or operating as an edge node and can be of any one or more of various different capabilities. Such various capabilities may include video generation, telemetry data generation, or sensing data generation, among other examples. Further, as described herein, a forward path (such as a forward logical path) may refer to a path from a non-edge node to an edge node and a reverse path (such as a reverse logical path) may refer to a path from an edge node to a non-edge node.

[0121] In some implementations, each wireless node may advertise, via one or more beacon frames, a type of that wireless node and a capability (such as the capability elements 706) associated with that wireless node. As such, non-edge nodes (such as every non-edge node) may have a route to one or more edge nodes (such as every edge node) in the network with a matching capability (in accordance with the capability mapping 702 and a forming of a conditionally connected network). In some aspects, non-edge nodes may not have an entry, in a routing table, to other non-edge nodes(unless that other non-edge node is a via point in a reverse path for another non-edge node). Further, edge nodes (such as every edge node) may have a route to one or more nodes (such as every other node, including edge and non-edge nodes) in the network (in accordance with the capability mapping 702 and the definitions of Cne and Ce). Such a connection or path establishment procedure may significantly reduce the size of routing tables, including at least at non-edge nodes, may allow multiple root-like nodes to be present in a network, and allow the forward path to be created (non-edge to edge) without flooding the network with cascading broadcast messages (such as PREQ and / or PREP frames).

[0122] In some implementations, a wireless node may advertise routing information to all other wireless nodes via one or more beacon frames. In some other implementations, such as in accordance with the node type information included in beacon frames, a wireless node may advertise routing information to a limited, relevant set of nodes (such as only to the edge nodes). In other words, a beacon frame may include routing information to wireless nodes that have complementary capabilities (relative to a capability of the broadcasting node) and may exclude routing information to wireless nodes that have non-compl ementary capabilities (relative to a capability of the broadcasting node). In such implementations, the quantity of nodes advertised in a beacon frame may be significantly reduced, thereby also reducing signaling overhead and leaving more space in beacon frames for other information. In some implementations, and in accordance with such beaconing mechanisms, non-edge nodes may refrain from maintaining a routing table entry to other non-edge nodes in the network.

[0123] Figure 8 shows example beacon assisted routing 800 that illustrates a sequence of steps according to which various wireless nodes 802 of a wireless mesh network may establish logical paths to an edge node. The beacon assisted routing 800 may implement or be implemented to realize or facilitate aspects of the wireless communication network 100, the wireless mesh network 200, the objective- or use casebased capabilities 300, the conditionally connected network 400, the signaling diagram 500, the wireless mesh network 600, or the node type-dependent capability subsets 700. In some implementations, the beacon assisted routing 800 may illustrate how wireless nodes may obtain routing information to one or more other wireless nodes in a wirelessmesh network via one or more beacon frames. Further, in some implementations, the beacon assisted routing 800 may illustrate an example of a forward path selection procedure.

[0124] In the example of the beacon assisted routing 800, a wireless node 802-a may be an example of an edge node (“A” edge = Ae), and wireless nodes 802-b, 802-c, 802-d, 802-e, and 802-f may be examples of non-edge nodes. The wireless nodes 802 may be examples of the wireless nodes 202, the wireless nodes 408, the wireless nodes 502, or the wireless nodes 602 as illustrated by and described with reference to Figures 2, 4, 5, or 6, respectively.

[0125] In the example of the beacon assisted routing 800, a hop count (which may be referred to as HopCount) may be indicated in each arrow and each non-edge node may select a path to the edge node (such as the wireless node 802-a) in accordance with routing information advertised in one or more beacons transmitted by at least a subset (if not all) of the wireless nodes 802. In some aspects, the wireless node 802-b, the wireless node 802-c, and the wireless node 802-d may active as via points to reach the wireless node 802-a. In some implementations, only the routing information to reach the wireless node 802-a (the edge node) is advertised in the beacon frame of each node. Further, at the end of the forward path selection, all of the wireless nodes 802 may have a routing able with entries to only the edge nodes (such as only to the wireless node 802-a). In some deployments, non-edge nodes may maintain more than one path to an edge node in a sorted order of cost. In accordance with the beacon assisted routing 800, one or more wireless nodes 802 may generate a routing table in accordance with powering on, establishing initial connections, and / or receiving one or more beacon frames from neighboring wireless nodes 802.

[0126] As described herein, to “generate” a routing table may include to build or generate a routing table from scratch (such that the built or generated routing table is completely new) or to update a routing table (such that the routing table includes new or updated routing information relative to a previous version of the routing table). Updating a routing table may include adding routing information (such as adding a new entry) to a routing table or editing or modifying previously included routing information (such as editing or modifying an existing entry) in the routing table.

[0127] At 804, in accordance with the forward path selection procedure illustrated by the beacon assisted routing 800, the wireless node 802-a and the wireless node 802-b may come up (such as turn on or become in range). The wireless node 802-b may form a forward path to the wireless node 802-a and may begin advertising the wireless node 802-a in one or more beacon frames transmitted by the wireless node 802-b.

[0128] At 806, the wireless node 802-c may come up (such as turn on or become in range). The wireless node 802-c may form a forward path to the wireless node 802-a in accordance with the routing information beaconed by the wireless node 802-b and may begin advertising the wireless node 802-a in one or more beacon frames transmitted by the wireless node 802-c.

[0129] At 808, the wireless node 802-f may come up (such as turn on). The wireless node 802-f may not be in the neighborhood of (such as in range of) any other wireless node 802 that is connected to the wireless node 802-a. As such, no routes may be added at 808.

[0130] At 810, the wireless node 802-d may come up (such as turn on or become in range). The wireless node 802-d may form a forward path to the wireless node 802-a in accordance with the routing information beaconed by the wireless node 802-c and may begin advertising the wireless node 802-a in one or more beacon frames transmitted by the wireless node 802-d. The wireless node 802-f, which may be in range of the wireless node 802-d, may form a forward path to the wireless node 802-a via the wireless node 802-d (and in accordance with the routing information beaconed by the wireless node 802-d). The wireless node 802-f may begin advertising the wireless node 802-a in one or more beacon frames transmitted by the wireless node 802-f.

[0131] At 812, the wireless node 802-e may come up (such as turn on or become in range). The wireless node 802-e may form a forward path to the wireless node 802-a and begin advertising the wireless node 802-a in one or more beacon frames transmitted by the wireless node 802-e. In some aspects, the wireless node 802-d, which may be in range of the wireless node 802-e, may receive the one or more beacon frames transmitted by the wireless node 802-e. In such aspects, the wireless node 802-d may evaluate a cost metric and may select either the wireless node 802-c or the wireless node 802-e as a via point to reach the wireless node 802-a. In the example illustrated in thebeacon assisted routing 800, the wireless node 802-d may select the wireless node 802-c as the via point to reach the wireless node 802-a.

[0132] Beacon assisted routing may be employed by two or more wireless nodes 802 to facilitate a forward path selection. In other words, a wireless node 802 may select one or more forward paths to one or more other wireless nodes 802 in accordance with beacon assisted routing, including the propagation of one or more beacon frames throughout the wireless mesh network, each beacon frame including up-to-date routing information associated with the wireless mesh network. To select a reverse path, two or more wireless nodes 802 may leverage or employ another frame exchange, such as a transmission of one or more introductory frames via a selected forward path. In some examples, an introductory frame may be understood or referred to as a Hello frame.

[0133] For example, in accordance with an establishment of a forward path, one or more non-edge nodes (such as each non-edge node) may send a Hello frame to one or more edge nodes (such as each edge node) in the network on the chosen (such as selected) forward path. In accordance with receiving a Hello frame, each wireless node 802 may update its routing table to the originator of the Hello frame, update a cost metric, and propagate the Hello frame further across the wireless mesh network. In some implementations, routing information in the Hello frame may include a cumulative metric (such as a cumulative path or cost metric) to reach a target wireless node 802 and a HopCount (or Hop-Count), among other parameters. In some implementations, one or more wireless nodes 802 may select more than one path and send multiple Hello frames for a same edge node.

[0134] In the example of the beacon assisted routing 800, at 812, the wireless node 802-d and via points between the wireless node 802-d and the wireless node 802-a may exchange one or more frames as part of a reverse path selection. For example, the wireless node 802-d may transmit a Hello frame (such may be equivalently referred to as a Hello packet or Hello element, and which may be an example of a unicast frame). The wireless node 802-c may receive the packet. In some implementations, the wireless node 802-c may update a routing table of the wireless node 802-c in accordance with the routing information conveyed by the Hello frame. For example, the wireless node 802-c may add a routing table entry including information indicative of the wireless node 802-d as a destination and information indicative of the wireless node 802-d as anext hop to the destination (as there may not be any involved relay nodes). The wireless node 802-c may transmit a forwarded (such as relayed) version of the Hello frame. In other words, upon receiving the Hello frame, each wireless node 802 may update its routing table to the originator of the Hello frame, update the cost metric, and propagate the Hello frame further.

[0135] The wireless node 802-b may receive the Hello frame from the wireless node 802-c and may update a routing table of the wireless node 802-b in accordance with the routing information conveyed by the Hello frame. For example, the wireless node 802-b may add a routing table entry including information indicative of the wireless node 802-d as a destination and information indicative of the wireless node 802-c as a next hop to the destination (as the wireless node 802-c may be a via point). The wireless node 802-b may transmit a forwarded (such as relayed) version of the Hello frame.

[0136] The wireless node 802-a may receive the Hello frame from the wireless node 802-b and may update a routing table of the wireless node 802-a in accordance with the routing information conveyed by the Hello frame. For example, the wireless node 802-a may add a routing table entry including information indicative of the wireless node 802-d as a destination and information indicative of the wireless node 802-b as a next hop to the destination (as the wireless node 802-b may be a via point). The reverse path selection may be completed in accordance with the wireless node 802-a receiving the Hello frame and updating its routing table. Additionally, in some implementations, the wireless node 802-d may include multiple edge nodes as the target nodes in the Hello frame. Further, in some implementations, the wireless node 802-d may transmit the Hello frame to more than one node (such as to both the wireless node 802-c and the wireless node 802-e) to establish multiple paths to the wireless node 802-a (such as N paths ranked in accordance with each path’s metric).

[0137] Figure 9 shows an example process flow 900 that illustrates a sequence of steps according to which a wireless node may leverage beacon assisted routing to generate a routing table, update a routing table, advertise routing information, establish forward and reverse paths, or any combination thereof. The process flow 900 may implement or be implemented to realize or facilitate aspects of the wireless communication network 100, the wireless mesh network 200, the objective- or use case-based capabilities 300, the conditionally connected network 400, the signaling diagram 500, the wireless mesh network 600, the node type-dependent capability subsets 700, or the beacon assisted routing 800.

[0138] In some implementations, the process flow 900 may be implemented in association with beacon assisted routing, forward path selection, and reverse path selection, with or without PREQ / PREP frame exchanges. The steps of the process flow 900 may be performed by a wireless node as described herein. Alternative examples of the following may be implemented, where some steps are performed in a different order than described or are not performed at all. In some examples, steps may include additional features not mentioned below, or further steps may be added.

[0139] At 902, a wireless node may power on and, at 904, the wireless node may listen to (such as monitor for and parse) one or more neighbor beacons. In some implementations, such neighbor beacons may include routing information, an indication of a node type, information indicative of a node capability, or any combination thereof.

[0140] At 906, in accordance with receiving a beacon frame including neighbor routing information, the wireless node may update a metric to each edge node in the neighbor information. At 908, in some examples, the wireless node may update a routing table of the wireless node, such as if the neighbor routing information is indicative of a new path or a path with a better (such as lower) metric.

[0141] At 910, the wireless node may advertise the updated neighbor routing information in one or more beacons transmitted by the wireless node. At 912, the wireless node may ascertain or determine a node type of the wireless node and may select a next step accordingly. For example, if the wireless node is an edge node, the wireless node may return to monitoring for one or more other neighbor beacons. Alternatively, if the wireless node is a non-edge node, the wireless node may determine whether a new or updated path is present and select a next step accordingly.

[0142] For example, at 914, the wireless node may determine whether a new or updated path is present (such as present in a routing table of the wireless node, and new or updated relative to a previous version of the routing table of the wireless prior to receiving a beacon frame carrying neighbor routing information). If a new or updated path is not present, the wireless node may return to monitoring for one or more otherneighbor beacons. If a new or updated path is present, the wireless node may, at 916, send (such as transmit) a Hello frame to setup a reverse path.

[0143] As such, the wireless node may avoid transmission or reception of path selections frames and, accordingly, may avoid any corresponding flooding of the network. Further, in accordance with such beacon assisted routing, forward path selection, and reverse path selection, nodes may (always) be synchronized with a best path (such as a path with a lowest metric) without using periodic path selection frames, which may further reduce signaling overhead and system complexity and increase flexibility (including with respect to device mobility) and reliability. In accordance with the described beacon assisted routing, bidirectional data transfer may occur in the absence of PREQ and PREP frames (messages). Further, if a topology is changed, routes (such as paths) may change without any broadcast messages such as PREQ and PREP frames. Additionally, if a new wireless node joins an existing network, the new wireless node may be able to establish routes (such as paths) with low latency in accordance with receiving routing information via one or more neighbor node beacons (with or without PREQ / PREP frame exchanges).

[0144] Further, because propagating a breakage or a change of a best path through a wireless mesh network may add delays if a hop count is large (with the benefit of reducing network overhead), wireless nodes (or a wireless mesh network) may select between usage of PREQ and PREP frames, which may be associated with lower latency at the expense of network overhead, and beacon assisted routing in accordance with one or more criteria, such as in accordance with a quantity of wireless nodes in the wireless mesh network, a highest known hop count, or an average hop count. Such a selection between beacon assisted routing and PREQ / PREP frame exchanges may occur at initial setup, may be static, or may be dynamically updated over time. For example, wireless nodes of a wireless mesh network may switch back and forth between capability based beacon assisted routing and capability based PREQ / PREP frame exchanges in accordance with one or more criteria, such as in accordance with whether a parameter satisfies a threshold. Such a parameter may be representative or indicative of a quantity of wireless nodes in the wireless mesh network, a highest known hop count, or an average hop count.

[0145] Additionally, or alternatively, some wireless mesh networks may integrate or otherwise leverage a combination of beacon assisted routing and PREQ / PREP frame exchanges to realize the advantages described herein while balancing network overhead, complexity, latency, and reliability, among other factors over time. In some implementations, for example, wireless nodes of a wireless mesh network may leverage beacon assisted routing (by transmitting one or more beacon frames indicating any one or more of node type, routing information, or capability information) during an early stage of the wireless mesh network (such as in accordance with or during a time period associated with an initial setup) and may leverage PREQ / PREP frame exchanges, with capability information indicated via PREQ frames and conditional PREP frames, during later stages of the wireless mesh network (such as in accordance with or during a time period after an initial setup). As such, wireless nodes may transmit beacon frames as they come up (as they turn or power on or as they are otherwise activated), establish initial logical paths and build initial routing tables in accordance with the propagated beacons, and update the routing tables over time in accordance with PREQ / PREP frame exchanges.

[0146] Alternatively, wireless nodes of a wireless mesh network may leverage PREQ / PREP frame exchanges, with capability information indicated via PREQ frames and conditional PREP frames, during an early stage of the wireless mesh network and may leverage beacon assisted routing during later stages of the wireless mesh network. As such, wireless nodes may participate in PREQ / PREP frame exchanges, establish initial logical paths and build initial routing tables in accordance with the PREQ / PREP frame exchanges, and update the routing tables over time in accordance with propagated beacons. Additionally, or alternatively, wireless nodes of a wireless mesh network may leverage capability based beacon assisted routing simultaneously with capability based PREQ / PREP frame exchanges. Additionally, or alternatively, a wireless node may transmit a PREQ frame (including information indicative of a capability of the wireless node) upon initially coming into contact with a wireless mesh network and, thereafter, may transmit and receive beacon frames carrying routing information, indications of node types, indications of node capabilities, or any combination thereof.

[0147] Additionally, or alternatively, wireless nodes of a wireless mesh network may leverage one or both of capability based PREQ / PREP frame exchanges orcapability based beacon assisted routing during an initial setup and may subsequently perform one or more other (conditional) routing procedures during a path recovery procedure (which may be equivalently referred to as a link recovery procedure). For example, wireless nodes of a wireless mesh network may employ (such as participate in via signaling or otherwise use) a path recovery procedure to re-establish a data path upon detecting and / or identifying a link loss or a change of path, with such a path recovery procedure involving a transmission and propagation of an introductory frame (such as a Hello frame) via a selected forward path, with the introductory frame carrying routing information that is relevant to (such as potentially disrupted by or otherwise associated with) the link loss or the change of path.

[0148] Wireless nodes receiving such an introductory frame may update their respective routing tables in accordance with the routing information conveyed by the introductory frame and, in examples in which the wireless nodes employ beacon assisted routing, may transmit information indicative of such updated routing tables via one or more beacon frames. Additionally, or alternatively, the path recovery procedure may include capability based PREQ / PREP frame exchanges and / or capability based PERR frame transmissions (with such capability based PERR frame transmissions relating to PERR frames including or otherwise conveying capability information).

[0149] Figure 10 shows an example signaling diagram 1000 that illustrates a path recovery procedure according to which various wireless nodes 1002 of a wireless mesh network may re-establish a data path via transmission and propagation of an introductory frame carrying routing information. The signaling diagram 1000 may implement or be implemented to realize or facilitate aspects of the wireless communication network 100, the wireless mesh network 200, the objective- or use casebased capabilities 300, the conditionally connected network 400, the signaling diagram 500, the wireless mesh network 600, the node type-dependent capability subsets 700, or the beacon assisted routing 800.

[0150] As described herein, a reference to a wireless node 1002 may be understood as a reference to any one or more of a wireless node 1002-a, a wireless node 1002-b, a wireless node 1002-c, a wireless node 1002-d, a wireless node 1002-e, a wireless node 1002-f, a wireless node 1002-g, and a wireless node 1002-h. As such, the signaling diagram 1000 may illustrate a wireless mesh network topology with 8 wireless nodes1002. The wireless nodes 1002 may be examples of the wireless nodes 202, the wireless nodes 408, the wireless nodes 502, the wireless nodes 602, or the wireless nodes 802 as illustrated by and described with reference to Figures 2, 4, 5, 6, or 8, respectively.

[0151] In some systems, propagating a breakage or change in a best path through an entire network may introduce or add delays if a hop count is relatively large, as, in such systems, each node may monitor a link quality continuously and, if a link is lost, each node may indicate a path error with a list of destinations that could not be reached. Such a path error may be indicated via a PERR frame (which may be equivalently referred to as a PERR message), which may be propagated to all nodes that are using an originator (such as an originator of the PERR frame) as a via point to reach any of the destinations listed by the PERR frame. In some systems, in accordance with receiving a PERR frame, each node may decide (such as identify, select, or otherwise determine) to perform a path selection procedure in accordance with on-demand routing protocol (such as an RM-AODV routing protocol), a proactive routing protocol, or a link-state routing protocol (such as via an RA-OLSR). Such routing protocols implemented after propagation of PERR frames may be costly. In other words, the propagation of an error message and the subsequent path selection procedures may be costly at least in terms of signaling overhead, power consumption, or latency, among other examples. Further, a quantity of messages or frames exchanged in such systems may grow exponentially with the quantity of nodes and the quantity of parallel paths, which may hinder scalability by exacerbating the aforementioned costs.

[0152] Accordingly, in some implementations, the signaling diagram 1000 may illustrate how wireless nodes 1002 recover a path or link (which may include recovery of routing tables) upon detecting and / or identifying a broken, lost, or failed link with lower signaling overhead. Further, in accordance with the example implementations illustrated by the signaling diagram 1000, the wireless nodes 1002 may employ techniques associated with overhead reduction for routing protocols that include setting up a forward path, a reverse path, and re-routing during broken link conditions or scenarios. For example, each wireless node 1002, in accordance with detecting and / or identifying a link loss or a change of path, may select a forward path to an edge node (such as all the edge nodes) for which the disconnected link was a “via path” (such as arelay path). In some implementations, such a wireless node 1002 may select the forward path in accordance with previously received and / or stored routing information, such as routing information received from one or more beacon frames transmitted by one or more other wireless nodes 1002.

[0153] The wireless node 1002 may send (such as transmit) an introductory frame, such as a Hello frame 1004 (which may be equivalently referred to as a Hello packet), in the selected path to re-establish the reverse path from itself to the edge nodes (such as to all the edge nodes for which a forward path was selected). In some implementations, the wireless node 1002 may append the Hello frame 1004 with information (such as routing information) associated with one or more other wireless nodes 1002 for which the wireless node 1002 is a via point. For example, the wireless node 1002 may include such information via a Hello frame extension field or some other field or set of one or more bits within a Hello frame 1004.

[0154] Another wireless node 1002 may receive the Hello frame 1004 and may update a routing table for the originator (such as the originator of the Hello frame 1004) and the other wireless nodes 1002 indicated in the Hello frame 1004. In other words, the routing table may be updated for the originator and the other wireless nodes 1002 indicated in the Hello frame 1004 at the wireless nodes 1002 in the path of the Hello frame 1004. In some implementations, wireless nodes 1002 may transmit and propagate such a Hello frame 1004 (which may be a unicast frame) instead of broadcast path selection frames (such as PREQ and / or PREP frames). In accordance with routing table updates made in accordance with a Hello frame 1004, contents of (such as routing information carried by) subsequent beacon frames may be updated in accordance with the modified path and any wireless node 1002 may independently decide to change a best (such as selected) path.

[0155] In some aspects, such propagation of the modified (restored) path via one or more beacon frames (as illustrated by and described with reference to Figures 6-9) may assist in limiting a quantity of messages sent out immediately during a link-broken event and may distribute the total amount of messages in the system over time, which may reduce network flooding. Further, such use of beacon frames to convey the modified (restored) path may assist in restricting re-routing overheads to the wireless nodes 1002 for which re-routing is relevant (after the link-broken event).

[0156] In the example of the signaling diagram 1000, a link between the wireless node 1002-c and the wireless node 1002-b may be lost (such as broken or unavailable) such that a data path between the wireless node 1002-c and the wireless node 1002-a (which may be an example of an edge node) also may be lost. The wireless node 1002-c may trigger a path recovery procedure in accordance with the link between the wireless node 1002-c and the wireless node 1002-b being lost. In examples in which the wireless node 1002-c broadcasts path selection frames to recover a data path to the wireless node 1002-a, the wireless nodes 1002 of the wireless mesh network may ultimately transmit relatively large quantities of PREQ frames, PREP frames, and PERR frames, with such quantities potentially growing exponentially if the quantity of wireless nodes 1002 or the quantity of parallel paths increases.

[0157] In accordance with some example implementations of the present disclosure, in association with detecting, measuring, and / or identifying the failure of the link between the wireless node 1002-c and the wireless node 1002-b, the wireless node 1002-c may select a forward path to the wireless node 1002-a in accordance with one or more beacon frames from one or more neighbor wireless nodes 1002. In some aspects, the wireless node 1002-c may select a forward path to the wireless node 1002-a via the wireless node 1002-d in accordance with the one or more beacon frames. The wireless node 1002-c may transmit a Hello frame 1004 to the wireless node 1002-a via the selected forward path. Further, in some implementations, the wireless node 1002-c may include a routing table of the wireless node 1002-c for the wireless node 1002-a in the Hello frame 1004, with such a routing table indicating, for example, routing to the wireless node 1002-e, the wireless node 1002-g, and the wireless node 1002-h.

[0158] The Hello frame 1004 may be propagated in the selected forward path and the wireless nodes 1002 in the forward path may update routing information to the wireless node 1002-c, the wireless node 1002-e, the wireless node 1002-g, and the wireless node 1002-h. For example, the wireless node 1002-d may receive the Hello frame 1004, update its routing table in accordance with the routing information carried by the Hello frame 1004, and transmit (such as relay or propagate) the Hello frame 1004 to the wireless node 1002-b. The wireless node 1002-b may receive the Hello frame 1004, update its routing table in accordance with the routing information carried by the Hello frame 1004, and transmit (such as relay or propagate) the Hello frame 1004 to thewireless node 1002-a. The wireless node 1002-a (the edge node) may receive the Hello frame 1004 and update its routing table in accordance with the routing information carried by the Hello frame 1004. As such, in accordance with the example implementation illustrated by the signaling diagram 1000, 3 Hello frames 1004 may be enough to re-establish routes between the wireless node 1002-c and the wireless node 1002-a. In accordance with using unicast frames (such as unicast packets or messages), the quantity of frames may remain relatively stable or low and may not grow exponentially with more wireless nodes 1002 or more paths.

[0159] In some implementations, the wireless node 1002-c and other wireless nodes 1002 within the wireless mesh network may allow subsequent beacon frames to propagate the updated (post link-broken event) routing information throughout the wireless mesh network. For example, in accordance with the wireless node 1002-d, the wireless node 1002-b, and the wireless node 1002-a updating respective routing tables, each of such wireless nodes 1002 may subsequently transmit information indicating of the respective updated routing tables via beacon frames (as illustrated by and described with reference to Figures 6-9). In some other implementations, the wireless node 1002-c may transmit, in addition to the Hello frame 1004, a path change frame 1006, which may be an example of a broadcast path change / error message or packet, and which may be propagated to the wireless nodes 1002 that are impacted by the link- broken event (by including destination identifiers corresponding to the wireless nodes 1002 that are impacted). In some examples, the wireless node 1002-c or a controller of the wireless mesh network may select between beacon assisted routing and transmission of the path change frame 1006 in accordance with balancing signaling overhead and latency (with beacon assisted routing providing lower signaling overhead and transmission of the path change frame 1006 providing lower latency).

[0160] The path change frame 1006 may be appended with a new cost and hop count to reach the destination(s) for which the path change frame 1006 is sent. Such destination(s) may include one or more edge nodes to which a wireless node 1002 that transmits the path change frame 1006 is a via point. In some aspects, each wireless node 1002 may perform a selection (may select) a best path in accordance with receiving the path change frame 1006. In some aspects, each wireless node 1002 may wait for a pre-defined (such as pre-configured, pre-loaded, or previously indicated) timeperiod before that wireless node 1002 is able to initiate a path selection procedure. For example, such a pre-defined time period may be 1 or more beacon intervals, which may allow for multiple copies of the path change frame 1006 to be received by any given wireless node 1002, which may in turn enable such a wireless node 1002 to make a relatively more informed path selection (as multiple instances of a path change frame 1006 may be received over time in accordance with its propagation via different permutations of wireless nodes 1002 in a wireless mesh network). In accordance with completing the path selection procedure, a wireless node 1002 may transmit a Hello frame 1004 to establish a reverse path if the path between that wireless node 1002 and another wireless node 1002 has changed. In some aspects, loop avoidance associated with the path change frame 1006 may be associated with the HopCount and sequence number fields carried in path change frames 1006.

[0161] In examples of the signaling diagram 1000 in which the wireless node 1002-c selects to transmit a path change frame 1006, the wireless node 1002-c may append the path change frame 1006 with the modified cost and hop count to reach the wireless node 1002-a (the edge node). The wireless node 1002-e, the wireless node 1002-g, and the wireless node 1002-h (which may receive the path change frame 1006) may perform path selection in accordance with the modified metrics (including cost and hop count) and perform actions accordingly. Such actions may include selecting a best, suitable, or preferred path to the wireless node 1002-a in view of both the information conveyed via the path change frame 1006 and other routing information available (such as other routing information received via one or more beacon frames transmitted by neighbor wireless nodes 1002 or one or more PREQ / PREP frame exchanges).

[0162] Figure 11 shows a block diagram of an example wireless communication device 1100 that supports forming a conditionally connected network in a wireless mesh deployment scenario via a capability based PREQ / PREP frame exchange, capability based beacon assisted routing, or any combination thereof. In some examples, the wireless communication device 1100 is configured to perform the processes 1200, 1300, 1400, and 1500 described with reference to Figures 12, 13, 14, and 15, respectively. The wireless communication device 1100 may include one or more chips, SoCs, chipsets, packages, components or devices that individually or collectively constitute or include a processing system. The processing system may interface with othercomponents of the wireless communication device 1100, and may generally process information (such as inputs or signals) received from such other components and output information (such as outputs or signals) to such other components. In some aspects, an example chip may include a processing system, a first interface to output or transmit information and a second interface to receive or obtain information. For example, the first interface may refer to an interface between the processing system of the chip and a transmission component, such that the wireless communication device 1100 may transmit the information output from the chip. In such an example, the second interface may refer to an interface between the processing system of the chip and a reception component, such that the wireless communication device 1100 may receive information that is then passed to the processing system. In some such examples, the first interface also may obtain information, such as from the transmission component, and the second interface also may output information, such as to the reception component.

[0163] The processing system of the wireless communication device 1100 includes processor (or “processing”) circuitry in the form of one or multiple processors, microprocessors, processing units (such as central processing units (CPUs), graphics processing units (GPUs) or digital signal processors (DSPs)), processing blocks, application-specific integrated circuits (ASIC), programmable logic devices (PLDs) (such as field programmable gate arrays (FPGAs)), or other discrete gate or transistor logic or circuitry (all of which may be generally referred to herein individually as “processors” or collectively as “the processor” or “the processor circuitry”). One or more of the processors may be individually or collectively configurable or configured to perform various functions or operations described herein. The processing system may further include memory circuitry in the form of one or more memory devices, memory blocks, memory elements or other discrete gate or transistor logic or circuitry, each of which may include tangible storage media such as random-access memory (RAM) or ROM, or combinations thereof (all of which may be generally referred to herein individually as “memories” or collectively as “the memory” or “the memory circuitry”). One or more of the memories may be coupled with one or more of the processors and may individually or collectively store processor-executable code that, when executed by one or more of the processors, may configure one or more of the processors to perform various functions or operations described herein. In some implementations, one or moreof the multiple memories may be configured to store processor-executable code that, when executed, may configure one or more of the multiple processors to perform various functions described herein (as part of a processing system). In some other implementations, the processing system may be pre-configured to perform various functions described herein.

[0164] Additionally, or alternatively, in some examples, one or more of the processors may be preconfigured to perform various functions or operations described herein without requiring configuration by software. The processing system may further include or be coupled with one or more modems (such as a Wi-Fi (such as IEEE compliant) modem or a cellular (such as 3GPP 4G LTE, 5G or 6G compliant) modem). In some implementations, one or more processors of the processing system include or implement one or more of the modems. The processing system may further include or be coupled with multiple radios (collectively “the radio”), multiple RF chains or multiple transceivers, each of which may in turn be coupled with one or more of multiple antennas. In some implementations, one or more processors of the processing system include or implement one or more of the radios, RF chains or transceivers.

[0165] In some examples, the wireless communication device 1100 can configurable or configured for use in a wireless node, such as any of the wireless nodes 202, 408, 502, 602, or 802 as described with reference to Figures 2, 4, 5, 6, or 8, respectively. In some other examples, the wireless communication device 1100 can be a wireless node that includes such a processing system and other components including multiple antennas. The wireless communication device 1100 is capable of transmitting and receiving wireless communications in the form of, for example, wireless packets. For example, the wireless communication device 1100 can be configurable or configured to transmit and receive packets in the form of physical layer PPDUs and MPDUs conforming to one or more of the IEEE 802.11 family of wireless communication protocol standards. In some other examples, the wireless communication device 1100 can be configurable or configured to transmit and receive signals and communications conforming to one or more 3 GPP specifications including those for 5G NR or 6G. In some examples, the wireless communication device 1100 also includes or can be coupled with one or more application processors which may be further coupled with one or more other memories. In some examples, the wirelesscommunication device 1100 further includes a user interface (UI) (such as a touchscreen or keypad) and a display, which may be integrated with the UI to form a touchscreen display that is coupled with the processing system. In some examples, the wireless communication device 1100 may further include one or more sensors such as, for example, one or more inertial sensors, accelerometers, temperature sensors, pressure sensors, or altitude sensors, that are coupled with the processing system. In some examples, the wireless communication device 1100 further includes at least one external network interface coupled with the processing system that enables communication with a core network or backhaul network that enables the wireless communication device 1100 to gain access to external networks including the Internet.

[0166] The wireless communication device 1100 includes a path discovery component 1125, a routing table component 1130, an application layer component 1135, and a node type component 1140. Portions of one or more of the path discovery component 1125, the routing table component 1130, the application layer component 1135, and the node type component 1140 may be implemented at least in part in hardware or firmware. For example, one or more of the path discovery component 1125, the routing table component 1130, the application layer component 1135, and the node type component 1140 may be implemented at least in part by at least a processor or a modem. In some examples, portions of one or more of the path discovery component 1125, the routing table component 1130, the application layer component 1135, and the node type component 1140 may be implemented at least in part by a processor and software in the form of processor-executable code stored in memory.

[0167] The wireless communication device 1100 may support wireless communication in accordance with examples as disclosed herein. The path discovery component 1125 is configurable or configured to transmit, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a first capability associated with the first wireless node. In some examples, the path discovery component 1125 is configurable or configured to receive a path reply frame associated with the path request frame, the path reply frame including information indicative of a second wireless node within the wireless mesh network and indicating, in accordance with the path reply frame being associated with the path request frame, that a second capability associated with thesecond wireless node is complementary to the first capability. The routing table component 1130 is configurable or configured to generate a routing table to include a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node being complementary to the first capability associated with the first wireless node.

[0168] In some examples, the application layer component 1135 is configurable or configured to obtain, from an application layer associated with the first wireless node, an indication of the first capability, where transmitting the path request frame including the information indicative of the first capability is in association with obtaining the indication of the first capability from the application layer.

[0169] In some examples, in accordance with the application layer provide the indication of the first capability, path routing involving the first wireless node is associated with application layer information.

[0170] In some examples, the path discovery component 1125 is configurable or configured to transmit the information indicative of the first capability via one or more information elements or subfields of the path request frame.

[0171] In some examples, the path discovery component 1125 is configurable or configured to receive a set of multiple path reply frames associated with the path request frame, the set of multiple path reply frames including information indicative of a set of multiple wireless nodes, respectively, within the wireless mesh network and indicating, in accordance with the set of multiple path reply frames being associated with the path request frame, that a respective capability associated with each of the set of multiple wireless nodes is complementary to the first capability. In some examples, the routing table component 1130 is configurable or configured to generate (such as establish or include) a respective logical path between the first wireless node and each of the set of multiple wireless nodes in the routing table in accordance with the respective capability of each of the set of multiple wireless nodes being complementary to the first capability associated with the first wireless node.

[0172] In some examples, the first capability include one or more first capability elements and the second capability includes one or more second capability elements. In some examples, the first capability be complementary to the second capability inaccordance with at least one of the one or more first capability elements having a mapping to at least one of the one or more second capability elements.

[0173] In some examples, the one or more first capability elements and the one or more second capability elements be within a complete capability set associated with the wireless mesh network. In some examples, the complete capability set includes a first set of multiple capability elements of a first capability set, a second set of multiple capability elements of a second capability set, and a cartesian product of the first set of multiple capability elements of the first capability set and the second set of multiple capability elements of the second capability set.

[0174] In some examples, the mapping be between the first set of multiple capability elements of the first capability set and the second set of multiple capability elements of the second capability set, each capability element of the first capability set mapping to at least one capability element of the second capability set, and each capability element of the second capability set mapping to at least one capability element of the first capability set.

[0175] In some examples, the complete capability set includes a first subset of capabilities associated with a first node type and a second subset of capabilities associated with a second node type. In some examples, the first node type be indicative of a non-edge node, the first subset of capabilities excluding elements mappable to each other in accordance with the first subset of capabilities being associated with the nonedge node.

[0176] In some examples, the one or more first capability elements include a video generation capability and the one or more second capability elements include a video rendering or storing capability, the video generation capability being mapped to the video rendering or storing capability in accordance with the mapping.

[0177] In some examples, the one or more first capability elements include a sensing data generation capability and the one or more second capability elements include a device controller capability, the sensing data generation capability being mapped to the device controller capability in accordance with the mapping.

[0178] In some examples, the path discovery component 1125 is configurable or configured to transmit, via a beacon frame, information indicative of the routing table (of the first wireless node), the routing table including a respective identifier of each of one or more target wireless nodes, a respective hop count to each of the one or more target wireless nodes, and a respective cumulative path metric to each of the one or more target wireless nodes, the one or more target wireless nodes including at least the second wireless node.

[0179] In some examples, the path discovery component 1125 is configurable or configured to receive, via a beacon frame, information indicative of a second routing table, the second routing table including a respective identifier of each of one or more target wireless nodes, a respective hop count to each of the one or more target wireless nodes, and a respective cumulative path metric to each of the one or more target wireless nodes. In some examples, the routing table component 1130 is configurable or configured to update the routing table (of the first wireless node), at least in part, in accordance with the second routing table indicating a new logical path associated with a target wireless node.

[0180] In some examples, the node type component 1140 is configurable or configured to transmit, via a beacon frame, an indication of a node type of the first wireless node and the information indicative of the first capability associated with the first wireless node.

[0181] In some examples, the node type component 1140 is configurable or configured to receive, via a beacon frame, an indication of a node type of the second wireless node and information indicative of the second capability associated with the second wireless node.

[0182] In some examples, the path discovery component 1125 is configurable or configured to receive, in accordance with a forward logical path selection being associated with a propagation of one or more beacon frames in the wireless mesh network, an introductory frame via a selected forward logical path between the first wireless node and the second wireless node. In some examples, the routing table component 1130 is configurable or configured to update the routing table (of the first wireless node) in accordance with the introductory frame, the routing table including theselected forward logical path and a selected reverse logical path in accordance with the one or more beacon frames and the introductory frame.

[0183] In some examples, the path request frame include information indicative of a broadcast address.

[0184] Additionally, or alternatively, the wireless communication device 1100 may support wireless communication in accordance with examples as disclosed herein. In some examples, the path discovery component 1125 is configurable or configured to receive, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a second capability associated with a second wireless node. In some examples, the path discovery component 1125 is configurable or configured to transmit, in accordance with a first capability associated with the first wireless node being complementary to the second capability associated with the second wireless node, a path reply frame associated with the path request frame, the path reply frame including information indicative of the first wireless node. In some examples, the routing table component 1130 is configurable or configured to generate a routing table to include a logical path between the first wireless node and the second wireless node in accordance with the first capability associated with the first wireless node being complementary to the second capability associated with the second wireless node.

[0185] In some examples, the application layer component 1135 is configurable or configured to obtain, from an application layer associated with the first wireless node, an indication of the first capability, where transmitting the path reply frame is in association with obtaining the indication of the first capability from the application layer.

[0186] In some examples, in accordance with the application layer providing the indication of the first capability, path routing involving the first wireless node is associated with application layer information.

[0187] In some examples, the path discovery component 1125 is configurable or configured to receive the information indicative of the second capability via one or more information elements or subfields of the path request frame.

[0188] In some examples, the path discovery component 1125 is configurable or configured to transmit a forwarded version of the path request frame to one or more other wireless nodes within the wireless mesh network in association with receiving the path request frame, the forwarded version of the path request frame including the information indicative of the second capability associated with the second wireless node.

[0189] In some examples, the first capability include one or more first capability elements and the second capability includes one or more second capability elements. In some examples, the first capability be complementary to the second capability in accordance with at least one of the one or more first capability elements having a mapping to at least one of the one or more second capability elements.

[0190] In some examples, the one or more first capability elements and the one or more second capability elements be within a complete capability set associated with the wireless mesh network. In some examples, the complete capability set includes a first set of multiple capability elements of a first capability set, a second set of multiple capability elements of a second capability set, and a cartesian product of the first set of multiple capability elements of the first capability set and the second set of multiple capability elements of the second capability set.

[0191] In some examples, the mapping be between the first set of multiple capability elements of the first capability set and the second set of multiple capability elements of the second capability set, each capability element of the first capability set mapping to at least one capability element of the second capability set, and each capability element of the second capability set mapping to at least one capability element of the first capability set.

[0192] In some examples, the complete capability set includes a first subset of capabilities associated with a first node type and a second subset of capabilities associated with a second node type. In some examples, the first node type be indicative of a non-edge node, the first subset of capabilities excluding elements mappable to each other in accordance with the first subset of capabilities being associated with the nonedge node.

[0193] In some examples, the one or more first capability elements include a video generation capability and the one or more second capability elements include a video rendering or storing capability, the video generation capability being mapped to the video rendering or storing capability in accordance with the mapping.

[0194] In some examples, the one or more first capability elements include a sensing data generation capability and the one or more second capability elements include a device controller capability, the sensing data generation capability being mapped to the device controller capability in accordance with the mapping.

[0195] In some examples, the path discovery component 1125 is configurable or configured to transmit, via a beacon frame, information indicative of the routing table (of the first wireless node), the routing table including a respective identifier of each of one or more target wireless nodes, a respective hop count to each of the one or more target wireless nodes, and a respective cumulative path metric to each of the one or more target wireless nodes, the one or more target wireless nodes including at least the second wireless node.

[0196] In some examples, the path discovery component 1125 is configurable or configured to receive, via a beacon frame, information indicative of a second routing table, the second routing table including a respective identifier of each of one or more target wireless nodes, a respective hop count to each of the one or more target wireless nodes, and a respective cumulative path metric to each of the one or more target wireless nodes. In some examples, the routing table component 1130 is configurable or configured to update the routing table (of the first wireless node), at least in part, in accordance with the second routing table indicating a new logical path associated with a target wireless node.

[0197] In some examples, the node type component 1140 is configurable or configured to transmit, via a beacon frame, an indication of a node type of the first wireless node and the information indicative of the first capability associated with the first wireless node.

[0198] In some examples, the node type component 1140 is configurable or configured to receive, via a beacon frame, an indication of a node type of the secondwireless node and information indicative of the second capability associated with the second wireless node.

[0199] In some examples, the routing table component 1130 is configurable or configured to select a forward logical path between the first wireless node and the second wireless node in accordance with a propagation of one or more beacon frames in the wireless mesh network. In some examples, the path discovery component 1125 is configurable or configured to transmit, via the forward logical path, an introductory frame on the forward logical path between the first wireless node and the second wireless node.

[0200] In some examples, the path request frame include information indicative of a broadcast address.

[0201] Additionally, or alternatively, the wireless communication device 1100 may support wireless communication in accordance with examples as disclosed herein. In some examples, the path discovery component 1125 is configurable or configured to receive, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a second capability associated with a second wireless node. In some examples, the path discovery component 1125 is configurable or configured to transmit a forwarded version of the path request frame, without transmitting a path reply frame associated with the path request frame, in accordance with a first capability associated with the first wireless node being non-complementary to the second capability associated with the second wireless node. In some examples, the routing table component 1130 is configurable or configured to generate a routing table to exclude a logical path between the first wireless node and the second wireless node in accordance with the first capability associated with the first wireless node being non-complementary to the second capability associated with the second wireless node.

[0202] In some examples, the application layer component 1135 is configurable or configured to obtain, from an application layer associated with the first wireless node, an indication of the first capability, where transmitting the forwarded version of the path request frame, without transmitting the path reply frame, is in association with obtaining the indication of the first capability from the application layer.

[0203] In some examples, in accordance with the application layer providing the indication of the first capability, path routing involving the first wireless node is associated with application layer information.

[0204] In some examples, the path discovery component 1125 is configurable or configured to receive the information indicative of the second capability via one or more information elements or subfields of the path request frame.

[0205] In some examples, the path discovery component 1125 is configurable or configured to transmit the information indicative of the second capability via one or more information elements or subfields of the forwarded version of the path request frame.

[0206] In some examples, the path discovery component 1125 is configurable or configured to receive a path reply frame associated with the forwarded version of the path request frame, the path reply frame including information indicative of a third wireless node within the wireless mesh network and indicating, in accordance with the path reply frame being associated with the forwarded version of the path request frame, that a third capability associated with the third wireless node is complementary to the second capability. In some examples, the path discovery component 1125 is configurable or configured to transmit a forwarded version of the path reply frame in association with receiving the path reply frame.

[0207] In some examples, the first capability include one or more first capability elements and the second capability includes one or more second capability elements. In some examples, the first capability be non-complementary to the second capability in accordance with none of the one or more first capability elements having a mapping to at least one of the one or more second capability elements.

[0208] In some examples, the one or more first capability elements and the one or more second capability elements be within a complete capability set associated with the wireless mesh network. In some examples, the complete capability set includes a first set of multiple capability elements of a first capability set, a second set of multiple capability elements of a second capability set, and a cartesian product of the first set of multiple capability elements of the first capability set and the second set of multiple capability elements of the second capability set.

[0209] In some examples, the mapping be between the first set of multiple capability elements of the first capability set and the second set of multiple capability elements of the second capability set, each capability element of the first capability set mapping to at least one capability element of the second capability set, and each capability element of the second capability set mapping to at least one capability element of the first capability set.

[0210] In some examples, the complete capability set includes a first subset of capabilities associated with a first node type and a second subset of capabilities associated with a second node type. In some examples, the first node type be indicative of a non-edge node, the first subset of capabilities excluding elements mappable to each other in accordance with the first subset of capabilities being associated with the nonedge node.

[0211] In some examples, the one or more first capability elements include a video generation capability and the one or more second capability elements include the video generation capability, the first capability and the second capability being non- complementary in accordance with both the one or more first capability elements and the one or more second capability elements including the video generation capability.

[0212] In some examples, the one or more first capability elements include a video rendering or storing capability and the one or more second capability elements include the video rendering or storing capability, the first capability and the second capability being non-complementary in accordance with both the one or more first capability elements and the one or more second capability elements including the video rendering or storing capability.

[0213] In some examples, the path discovery component 1125 is configurable or configured to transmit, via a beacon frame, information indicative of the routing table (of the first wireless node), the routing table including a respective identifier of each of one or more target wireless nodes, a respective hop count to each of the one or more target wireless nodes, and a respective cumulative path metric to each of the one or more target wireless nodes.

[0214] In some examples, the path discovery component 1125 is configurable or configured to receive, via a beacon frame, information indicative of a second routingtable, the second routing table including a respective identifier of each of one or more target wireless nodes, a respective hop count to each of the one or more target wireless nodes, and a respective cumulative path metric to each of the one or more target wireless nodes. In some examples, the routing table component 1130 is configurable or configured to update the routing table (of the first wireless node), at least in part, in accordance with the second routing table indicating a new logical path associated with a target wireless node.

[0215] In some examples, the node type component 1140 is configurable or configured to transmit, via a beacon frame, an indication of a node type of the first wireless node and the information indicative of the first capability associated with the first wireless node.

[0216] In some examples, the node type component 1140 is configurable or configured to receive, via a beacon frame, an indication of a node type of the second wireless node and information indicative of the second capability associated with the second wireless node.

[0217] In some examples, the path discovery component 1125 is configurable or configured to receive, in accordance with a forward logical path selection being associated with a propagation of one or more beacon frames in the wireless mesh network, an introductory frame via a selected forward logical path to the second wireless node. In some examples, the routing table component 1130 is configurable or configured to update the routing table (of the first wireless node) in accordance with the introductory frame, the routing table including the selected forward logical path and a selected reverse logical path in accordance with the one or more beacon frames and the introductory frame. In some examples, the path discovery component 1125 is configurable or configured to transmit a forwarded version of the introductory frame in association with receiving the introductory frame.

[0218] In some examples, the path request frame include information indicative of a broadcast address.

[0219] Additionally, or alternatively, the wireless communication device 1100 may support wireless communication in accordance with examples as disclosed herein. In some examples, the routing table component 1130 is configurable or configured togenerate a routing table to include a logical path between the first wireless node and a second wireless node of a wireless mesh network in accordance with a second capability associated with the second wireless node being complementary to a first capability associated with the first wireless node. In some examples, the path discovery component 1125 is configurable or configured to transmit, via a first beacon frame, information indicative of the routing table (of the first wireless node), the routing table including a respective identifier of each of one or more first target wireless nodes, a respective hop count to each of the one or more first target wireless nodes, and a respective cumulative path metric to each of the one or more first target wireless nodes, the one or more first target wireless nodes including at least the second wireless node.

[0220] In some examples, the path discovery component 1125 is configurable or configured to receive, via a second beacon frame, information indicative of a second routing table, the second routing table including a respective identifier of each of one or more second target wireless nodes, a respective hop count to each of the one or more second target wireless nodes, and a respective cumulative path metric to each of the one or more second target wireless nodes. In some examples, the routing table component 1130 is configurable or configured to update the routing table (of the first wireless node), at least in part, in accordance with the second routing table indicating a new logical path associated with a target wireless node.

[0221] In some examples, the path discovery component 1125 is configurable or configured to transmit, via a third beacon frame, information indicative of an updated routing table (of the first wireless node) in accordance with the second routing table indicating the new logical path associated with the target wireless node.

[0222] In some examples, the path discovery component 1125 is configurable or configured to receive, via a second beacon frame, information indicative of a second routing table, the second routing table including the respective identifier of each of the one or more first target wireless nodes, the respective hop count to each of the one or more first target wireless nodes, and the respective cumulative path metric to each of the one or more first target wireless nodes, where generating the routing table to include the logical path between the first wireless node and the second wireless node is in accordance with receiving the information indicative of the second routing table.

[0223] In some examples, the path discovery component 1125 is configurable or configured to receive, in accordance with a forward logical path selection being associated with a propagation of one or more beacon frames in the wireless mesh network, an introductory frame via a selected forward logical path between the first wireless node and the second wireless node. In some examples, the routing table component 1130 is configurable or configured to update the routing table (of the first wireless node) in accordance with the introductory frame, the routing table including the selected forward logical path and a selected reverse logical path in accordance with the one or more beacon frames and the introductory frame.

[0224] In some examples, the node type component 1140 is configurable or configured to transmit, via the first beacon frame, an indication of a node type of the first wireless node and the information indicative of the first capability associated with the first wireless node.

[0225] In some examples, the node type component 1140 is configurable or configured to receive, via a second beacon frame, an indication of a node type of the second wireless node and information indicative of the second capability associated with the second wireless node.

[0226] In some examples, the path discovery component 1125 is configurable or configured to detect and / or identify a link loss between the first wireless node and the second wireless node. In some examples, the path discovery component 1125 is configurable or configured to select, in association with detecting and / or identifying the link loss, a new forward path to an edge node of the wireless mesh network in accordance with the routing table (of the first wireless node). In some examples, the path discovery component 1125 is configurable or configured to transmit, via the new forward path, an introductory frame including routing information associated with one or more other wireless nodes for which the first wireless node is a via point.

[0227] In some examples, the path discovery component 1125 is configurable or configured to transmit, to the one or more other wireless nodes for which the first wireless node is the via point and in association with selecting the new forward path, a path change frame including information indicative of one or both of a new cost or a new hop count to reach the edge node via the first wireless node.

[0228] In some examples, the path discovery component 1125 is configurable or configured to receive, in association with a link loss at a third wireless node of the wireless mesh network, an introductory frame including routing information associated with one or more other wireless nodes for which the third wireless node is a via point. In some examples, the routing table component 1130 is configurable or configured to update the routing table (of the first wireless node) in accordance with the routing information included in the introductory frame. In some examples, the path discovery component 1125 is configurable or configured to transmit a forwarded version of the introductory frame toward an edge node of the wireless mesh network in association with receiving the introductory frame.

[0229] In some examples, the path discovery component 1125 is configurable or configured to receive, from a third wireless node for which the first wireless node is a via point and in association with a selection of a new forward path to an edge node of the wireless mesh network at the third wireless node, a path change frame including information indicative of one or both of a new cost or a new hop count to reach the edge node via the third wireless node.

[0230] In some examples, the application layer component 1135 is configurable or configured to obtain, from an application layer associated with the first wireless node, an indication of the first capability.

[0231] In some examples, the first capability include one or more first capability elements and the second capability includes one or more second capability elements. In some examples, the first capability be complementary to the second capability in accordance with at least one of the one or more first capability elements having a mapping to at least one of the one or more second capability elements.

[0232] In some examples, the one or more first capability elements and the one or more second capability elements be within a complete capability set associated with the wireless mesh network. In some examples, the complete capability set includes a first set of multiple capability elements of a first capability set, a second set of multiple capability elements of a second capability set, and a cartesian product of the first set of multiple capability elements of the first capability set and the second set of multiple capability elements of the second capability set.

[0233] In some examples, the complete capability set includes a first subset of capabilities associated with a first node type and a second subset of capabilities associated with a second node type. In some examples, the first node type be indicative of a non-edge node, the first subset of capabilities excluding elements mappable to each other in accordance with the first subset of capabilities being associated with the nonedge node.

[0234] Figure 12 shows a flowchart illustrating an example process 1200 performable by or at a first wireless node that supports forming a conditionally connected network in a wireless mesh deployment scenario via a capability based PREQ / PREP frame exchange. The operations of the process 1200 may be implemented by a first wireless node or its components as described herein. For example, the process 1200 may be performed by a wireless communication device, such as the wireless communication device 1100 described with reference to Figure 11, operating as or within a wireless node. In some examples, the process 1200 may be performed by a wireless AP or a wireless STA, such as one of the APs 102 or the STAs 104 described with reference to Figure 1.

[0235] In some examples, in block 1205, the first wireless node may transmit, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a first capability associated with the first wireless node. The operations of block 1205 may be performed in accordance with examples as disclosed herein. In some implementations, aspects of the operations of block 1205 may be performed by a path discovery component 1125 as described with reference to Figure 11.

[0236] In some examples, in block 1210, the first wireless node may receive a path reply frame associated with the path request frame, the path reply frame including information indicative of a second wireless node within the wireless mesh network and indicating, in accordance with the path reply frame being associated with the path request frame, that a second capability associated with the second wireless node is complementary to the first capability. The operations of block 1210 may be performed in accordance with examples as disclosed herein. In some implementations, aspects of the operations of block 1210 may be performed by a path discovery component 1125 as described with reference to Figure 11.

[0237] In some examples, in block 1215, the first wireless node may generate a routing table to include a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node. The operations of block 1215 may be performed in accordance with examples as disclosed herein. In some implementations, aspects of the operations of block 1215 may be performed by a routing table component 1130 as described with reference to Figure 11.

[0238] Figure 13 shows a flowchart illustrating an example process 1300 performable by or at a first wireless node that supports forming a conditionally connected network in a wireless mesh deployment scenario via a capability based PREQ / PREP frame exchange. The operations of the process 1300 may be implemented by a first wireless node or its components as described herein. For example, the process 1300 may be performed by a wireless communication device, such as the wireless communication device 1100 described with reference to Figure 11, operating as or within a wireless node. In some examples, the process 1300 may be performed by a wireless AP or a wireless STA, such as one of the APs 102 or the STAs 104 described with reference to Figure 1.

[0239] In some examples, in block 1305, the first wireless node may receive, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a second capability associated with a second wireless node. The operations of block 1305 may be performed in accordance with examples as disclosed herein. In some implementations, aspects of the operations of block 1305 may be performed by a path discovery component 1125 as described with reference to Figure 11.

[0240] In some examples, in block 1310, the first wireless node may transmit, in accordance with a first capability associated with the first wireless node being complementary to the second capability associated with the second wireless node, a path reply frame associated with the path request frame, the path reply frame including information indicative of the first wireless node. The operations of block 1310 may be performed in accordance with examples as disclosed herein. In some implementations, aspects of the operations of block 1310 may be performed by a path discovery component 1125 as described with reference to Figure 11.

[0241] In some examples, in block 1315, the first wireless node may generate a routing table to include a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node. The operations of block 1315 may be performed in accordance with examples as disclosed herein. In some implementations, aspects of the operations of block 1315 may be performed by a routing table component 1130 as described with reference to Figure 11.

[0242] Figure 14 shows a flowchart illustrating an example process 1400 performable by or at a first wireless node that supports forming a conditionally connected network in a wireless mesh deployment scenario via a capability based PREQ / PREP frame exchange. The operations of the process 1400 may be implemented by a first wireless node or its components as described herein. For example, the process 1400 may be performed by a wireless communication device, such as the wireless communication device 1100 described with reference to Figure 11, operating as or within a wireless node. In some examples, the process 1400 may be performed by a wireless AP or a wireless STA, such as one of the APs 102 or the STAs 104 described with reference to Figure 1.

[0243] In some examples, in block 1405, the first wireless node may receive, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a second capability associated with a second wireless node. The operations of block 1405 may be performed in accordance with examples as disclosed herein. In some implementations, aspects of the operations of block 1405 may be performed by a path discovery component 1125 as described with reference to Figure 11.

[0244] In some examples, in block 1410, the first wireless node may transmit a forwarded version of the path request frame, without transmitting a path reply frame associated with the path request frame, in accordance with a first capability associated with the first wireless node being non-compl ementary to the second capability associated with the second wireless node. The operations of block 1410 may be performed in accordance with examples as disclosed herein. In some implementations, aspects of the operations of block 1410 may be performed by a path discovery component 1125 as described with reference to Figure 11.

[0245] In some examples, in block 1415, the first wireless node may generate a routing table to exclude a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node. The operations of block 1415 may be performed in accordance with examples as disclosed herein. In some implementations, aspects of the operations of block 1415 may be performed by a routing table component 1130 as described with reference to Figure 11.

[0246] Figure 15 shows a flowchart illustrating an example process 1500 performable by or at a first wireless node that supports forming a conditionally connected network in a wireless mesh deployment scenario via beacon assisted routing. The operations of the process 1500 may be implemented by a first wireless node or its components as described herein. For example, the process 1500 may be performed by a wireless communication device, such as the wireless communication device 1100 described with reference to Figure 11, operating as or within a wireless node. In some examples, the process 1500 may be performed by a wireless AP or a wireless STA, such as one of the APs 102 or the STAs 104 described with reference to Figure 1.

[0247] In some examples, in block 1505, the first wireless node may generate a routing table to include a logical path between the first wireless node and a second wireless node of a wireless mesh network in accordance with a second capability associated with the second wireless node being complementary to a first capability associated with the first wireless node. The operations of block 1505 may be performed in accordance with examples as disclosed herein. In some implementations, aspects of the operations of block 1505 may be performed by a routing table component 1130 as described with reference to Figure 11.

[0248] In some examples, in block 1510, the first wireless node may transmit, via a first beacon frame, information indicative of the routing table, the routing table including a respective identifier of each of one or more first target wireless nodes, a respective hop count to each of the one or more first target wireless nodes, and a respective cumulative path metric to each of the one or more first target wireless nodes, the one or more first target wireless nodes including at least the second wireless node. The operations of block 1510 may be performed in accordance with examples as disclosed herein. In some implementations, aspects of the operations of block 1510may be performed by a path discovery component 1125 as described with reference to Figure 11.

[0249] Implementation examples are described in the following numbered clauses:

[0250] Clause 1 : A method for wireless communication by a first wireless node, comprising: transmitting, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a first capability associated with the first wireless node; receiving a path reply frame associated with the path request frame, the path reply frame including information indicative of a second wireless node within the wireless mesh network and indicating, in accordance with the path reply frame being associated with the path request frame, that a second capability associated with the second wireless node is complementary to the first capability; and generating a routing table to include a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node.

[0251] Clause 2: The method of clause 1, further comprising: obtaining, from an application layer associated with the first wireless node, an indication of the first capability, wherein transmitting the path request frame including the information indicative of the first capability is in association with obtaining the indication of the first capability from the application layer.

[0252] Clause 3 : The method of clause 2, wherein in accordance with the application layer providing the indication of the first capability, path routing involving the first wireless node is associated with application layer information.

[0253] Clause 4: The method of any of clauses 1-3, further comprising: transmitting the information indicative of the first capability via one or more information elements or subfields of the path request frame.

[0254] Clause 5: The method of any of clauses 1-4, further comprising: receiving a plurality of path reply frames associated with the path request frame, the plurality of path reply frames including information indicative of a plurality of wireless nodes, respectively, within the wireless mesh network and indicating, in accordance with the plurality of path reply frames being associated with the path request frame, that arespective capability associated with each of the plurality of wireless nodes is complementary to the first capability; and generating (such as establishing or including) a respective logical path between the first wireless node and each of the plurality of wireless nodes in the routing table in accordance with the respective capability of each of the plurality of wireless nodes being complementary to the first capability associated with the first wireless node.

[0255] Clause 6: The method of any of clauses 1-5, wherein the first capability includes one or more first capability elements and the second capability includes one or more second capability elements, and the first capability is complementary to the second capability in accordance with at least one of the one or more first capability elements having a mapping to at least one of the one or more second capability elements.

[0256] Clause 7: The method of clause 6, wherein the one or more first capability elements and the one or more second capability elements are within a complete capability set associated with the wireless mesh network, and the complete capability set includes a first plurality of capability elements of a first capability set, a second plurality of capability elements of a second capability set, and a cartesian product of the first plurality of capability elements of the first capability set and the second plurality of capability elements of the second capability set.

[0257] Clause 8: The method of clause 7, wherein the mapping is between the first plurality of capability elements of the first capability set and the second plurality of capability elements of the second capability set, each capability element of the first capability set mapping to at least one capability element of the second capability set, and each capability element of the second capability set mapping to at least one capability element of the first capability set.

[0258] Clause 9: The method of any of clauses 7-8, wherein the complete capability set includes a first subset of capabilities associated with a first node type and a second subset of capabilities associated with a second node type, and the first node type is indicative of a non-edge node, the first subset of capabilities excluding elements mappable to each other in accordance with the first subset of capabilities being associated with the non-edge node.

[0259] Clause 10: The method of any of clauses 6-9, wherein the one or more first capability elements include a video generation capability and the one or more second capability elements include a video rendering or storing capability, the video generation capability being mapped to the video rendering or storing capability in accordance with the mapping.

[0260] Clause 11 : The method of any of clauses 6-10, wherein the one or more first capability elements include a sensing data generation capability and the one or more second capability elements include a device controller capability, the sensing data generation capability being mapped to the device controller capability in accordance with the mapping.

[0261] Clause 12: The method of any of clauses 1-11, further comprising: transmitting, via a beacon frame, information indicative of the routing table, the routing table including a respective identifier of each of one or more target wireless nodes, a respective hop count to each of the one or more target wireless nodes, and a respective cumulative path metric to each of the one or more target wireless nodes, the one or more target wireless nodes including at least the second wireless node.

[0262] Clause 13: The method of any of clauses 1-12, further comprising: receiving, via a beacon frame, information indicative of a second routing table, the second routing table including a respective identifier of each of one or more target wireless nodes, a respective hop count to each of the one or more target wireless nodes, and a respective cumulative path metric to each of the one or more target wireless nodes; and updating the routing table, at least in part, in accordance with the second routing table indicating a new logical path associated with a target wireless node.

[0263] Clause 14: The method of any of clauses 1-13, further comprising: transmitting, via a beacon frame, an indication of a node type of the first wireless node and the information indicative of the first capability associated with the first wireless node.

[0264] Clause 15: The method of any of clauses 1-14, further comprising: receiving, via a beacon frame, an indication of a node type of the second wireless node and information indicative of the second capability associated with the second wireless node.

[0265] Clause 16: The method of any of clauses 1-15, further comprising: receiving, in accordance with a forward logical path selection being associated with a propagation of one or more beacon frames in the wireless mesh network, an introductory frame via a selected forward logical path between the first wireless node and the second wireless node; and updating the routing table in accordance with the introductory frame, the routing table including the selected forward logical path and a selected reverse logical path in accordance with the one or more beacon frames and the introductory frame.

[0266] Clause 17: The method of any of clauses 1-16, wherein the path request frame includes information indicative of a broadcast address.

[0267] Clause 18: A method for wireless communication by a first wireless node, comprising: receiving, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a second capability associated with a second wireless node; transmitting, in accordance with a first capability associated with the first wireless node being complementary to the second capability associated with the second wireless node, a path reply frame associated with the path request frame, the path reply frame including information indicative of the first wireless node; and generating a routing table to include a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node.

[0268] Clause 19: The method of clause 18, further comprising: obtaining, from an application layer associated with the first wireless node, an indication of the first capability, wherein transmitting the path reply frame is in association with obtaining the indication of the first capability from the application layer.

[0269] Clause 20: The method of clause 19, wherein in accordance with the application layer providing the indication of the first capability, path routing involving the first wireless node is associated with application layer information.

[0270] Clause 21 : The method of any of clauses 18-20, further comprising: receiving the information indicative of the second capability via one or more information elements or subfields of the path request frame.

[0271] Clause 22: The method of any of clauses 18-21, further comprising: transmitting a forwarded version of the path request frame to one or more other wireless nodes within the wireless mesh network in association with receiving the path request frame, the forwarded version of the path request frame including the information indicative of the second capability associated with the second wireless node.

[0272] Clause 23: The method of any of clauses 18-22, wherein the first capability includes one or more first capability elements and the second capability includes one or more second capability elements, and the first capability is complementary to the second capability in accordance with at least one of the one or more first capability elements having a mapping to at least one of the one or more second capability elements.

[0273] Clause 24: The method of clause 23, wherein the one or more first capability elements and the one or more second capability elements are within a complete capability set associated with the wireless mesh network, and the complete capability set includes a first plurality of capability elements of a first capability set, a second plurality of capability elements of a second capability set, and a cartesian product of the first plurality of capability elements of the first capability set and the second plurality of capability elements of the second capability set.

[0274] Clause 25: The method of clause 24, wherein the mapping is between the first plurality of capability elements of the first capability set and the second plurality of capability elements of the second capability set, each capability element of the first capability set mapping to at least one capability element of the second capability set, and each capability element of the second capability set mapping to at least one capability element of the first capability set.

[0275] Clause 26: The method of any of clauses 24-25, wherein the complete capability set includes a first subset of capabilities associated with a first node type and a second subset of capabilities associated with a second node type, and the first node type is indicative of a non-edge node, the first subset of capabilities excluding elements mappable to each other in accordance with the first subset of capabilities being associated with the non-edge node.

[0276] Clause 27: The method of any of clauses 23-26, wherein the one or more first capability elements include a video generation capability and the one or more second capability elements include a video rendering or storing capability, the video generation capability being mapped to the video rendering or storing capability in accordance with the mapping.

[0277] Clause 28: The method of any of clauses 23-27, wherein the one or more first capability elements include a sensing data generation capability and the one or more second capability elements include a device controller capability, the sensing data generation capability being mapped to the device controller capability in accordance with the mapping.

[0278] Clause 29: The method of any of clauses 18-28, further comprising: transmitting, via a beacon frame, information indicative of the routing table, the routing table including a respective identifier of each of one or more target wireless nodes, a respective hop count to each of the one or more target wireless nodes, and a respective cumulative path metric to each of the one or more target wireless nodes, the one or more target wireless nodes including at least the second wireless node.

[0279] Clause 30: The method of any of clauses 18-29, further comprising: receiving, via a beacon frame, information indicative of a second routing table, the second routing table including a respective identifier of each of one or more target wireless nodes, a respective hop count to each of the one or more target wireless nodes, and a respective cumulative path metric to each of the one or more target wireless nodes; and updating the routing table, at least in part, in accordance with the second routing table indicating a new logical path associated with a target wireless node.

[0280] Clause 31 : The method of any of clauses 18-30, further comprising: transmitting, via a beacon frame, an indication of a node type of the first wireless node and the information indicative of the first capability associated with the first wireless node.

[0281] Clause 32: The method of any of clauses 18-31, further comprising: receiving, via a beacon frame, an indication of a node type of the second wireless node and information indicative of the second capability associated with the second wireless node.

[0282] Clause 33: The method of any of clauses 18-32, further comprising: selecting a forward logical path between the first wireless node and the second wireless node in accordance with a propagation of one or more beacon frames in the wireless mesh network; and transmitting, via the forward logical path, an introductory frame on the forward logical path between the first wireless node and the second wireless node.

[0283] Clause 34: The method of any of clauses 18-33, wherein the path request frame includes information indicative of a broadcast address.

[0284] Clause 35: A method for wireless communication by a first wireless node, comprising: receiving, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a second capability associated with a second wireless node; transmitting a forwarded version of the path request frame, without transmitting a path reply frame associated with the path request frame, in accordance with a first capability associated with the first wireless node being non-complementary to the second capability associated with the second wireless node; and generating a routing table to exclude a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node.

[0285] Clause 36: The method of clause 35, further comprising: obtaining, from an application layer associated with the first wireless node, an indication of the first capability, wherein transmitting the forwarded version of the path request frame, without transmitting the path reply frame, is in association with obtaining the indication of the first capability from the application layer.

[0286] Clause 37: The method of clause 36, wherein in accordance with the application layer providing the indication of the first capability, path routing involving the first wireless node is associated with application layer information.

[0287] Clause 38: The method of any of clauses 35-37, further comprising: receiving the information indicative of the second capability via one or more information elements or subfields of the path request frame.

[0288] Clause 39: The method of any of clauses 35-38, further comprising: transmitting the information indicative of the second capability via one or more information elements or subfields of the forwarded version of the path request frame.

[0289] Clause 40: The method of any of clauses 35-39, further comprising: receiving a path reply frame associated with the forwarded version of the path request frame, the path reply frame including information indicative of a third wireless node within the wireless mesh network and indicating, in accordance with the path reply frame being associated with the forwarded version of the path request frame, that a third capability associated with the third wireless node is complementary to the second capability; and transmitting a forwarded version of the path reply frame in association with receiving the path reply frame.

[0290] Clause 41 : The method of any of clauses 35-40, wherein the first capability includes one or more first capability elements and the second capability includes one or more second capability elements, and the first capability is non-complementary to the second capability in accordance with none of the one or more first capability elements having a mapping to at least one of the one or more second capability elements.

[0291] Clause 42: The method of clause 41, wherein the one or more first capability elements and the one or more second capability elements are within a complete capability set associated with the wireless mesh network, and the complete capability set includes a first plurality of capability elements of a first capability set, a second plurality of capability elements of a second capability set, and a cartesian product of the first plurality of capability elements of the first capability set and the second plurality of capability elements of the second capability set.

[0292] Clause 43: The method of clause 42, wherein the mapping is between the first plurality of capability elements of the first capability set and the second plurality of capability elements of the second capability set, each capability element of the first capability set mapping to at least one capability element of the second capability set, and each capability element of the second capability set mapping to at least one capability element of the first capability set.

[0293] Clause 44: The method of any of clauses 42-43, wherein the complete capability set includes a first subset of capabilities associated with a first node type anda second subset of capabilities associated with a second node type, and the first node type is indicative of a non-edge node, the first subset of capabilities excluding elements mappable to each other in accordance with the first subset of capabilities being associated with the non-edge node.

[0294] Clause 45: The method of any of clauses 41-44, wherein the one or more first capability elements include a video generation capability and the one or more second capability elements include the video generation capability, the first capability and the second capability being non-complementary in accordance with both the one or more first capability elements and the one or more second capability elements including the video generation capability.

[0295] Clause 46: The method of any of clauses 41-45, wherein the one or more first capability elements include a video rendering or storing capability and the one or more second capability elements include the video rendering or storing capability, the first capability and the second capability being non-complementary in accordance with both the one or more first capability elements and the one or more second capability elements including the video rendering or storing capability.

[0296] Clause 47: The method of any of clauses 35-46, further comprising: transmitting, via a beacon frame, information indicative of the routing table, the routing table including a respective identifier of each of one or more target wireless nodes, a respective hop count to each of the one or more target wireless nodes, and a respective cumulative path metric to each of the one or more target wireless nodes.

[0297] Clause 48: The method of any of clauses 35-47, further comprising: receiving, via a beacon frame, information indicative of a second routing table, the second routing table including a respective identifier of each of one or more target wireless nodes, a respective hop count to each of the one or more target wireless nodes, and a respective cumulative path metric to each of the one or more target wireless nodes; and updating the routing table, at least in part, in accordance with the second routing table indicating a new logical path associated with a target wireless node.

[0298] Clause 49: The method of any of clauses 35-48, further comprising: transmitting, via a beacon frame, an indication of a node type of the first wireless nodeand the information indicative of the first capability associated with the first wireless node.

[0299] Clause 50: The method of any of clauses 35-49, further comprising: receiving, via a beacon frame, an indication of a node type of the second wireless node and information indicative of the second capability associated with the second wireless node.

[0300] Clause 51 : The method of any of clauses 35-50, further comprising: receiving, in accordance with a forward logical path selection being associated with a propagation of one or more beacon frames in the wireless mesh network, an introductory frame via a selected forward logical path to the second wireless node; updating the routing table in accordance with the introductory frame, the routing table including the selected forward logical path and a selected reverse logical path in accordance with the one or more beacon frames and the introductory frame; and transmitting a forwarded version of the introductory frame in association with receiving the introductory frame.

[0301] Clause 52: The method of any of clauses 35-51, wherein the path request frame includes information indicative of a broadcast address.

[0302] Clause 53: A method for wireless communication by a first wireless node, including, in addition, or as an alternative, to any of clauses 1-17, 18-34, or 35-52: generating a routing table to include a logical path between the first wireless node and a second wireless node of a wireless mesh network in accordance with a second capability associated with the second wireless node being complementary to a first capability associated with the first wireless node; and transmitting, via a first beacon frame, information indicative of the routing table, the routing table including a respective identifier of each of one or more first target wireless nodes, a respective hop count to each of the one or more first target wireless nodes, and a respective cumulative path metric to each of the one or more first target wireless nodes, the one or more first target wireless nodes including at least the second wireless node.

[0303] Clause 54: The method of any of clauses 1-17, 18-34, 35-52, or 53, further including: receiving, via a second beacon frame, information indicative of a second routing table, the second routing table including a respective identifier of each of one ormore second target wireless nodes, a respective hop count to each of the one or more second target wireless nodes, and a respective cumulative path metric to each of the one or more second target wireless nodes; and updating the routing table, at least in part, in accordance with the second routing table indicating a new logical path associated with a target wireless node.

[0304] Clause 55: The method of any of clauses 1-17, 18-34, 35-52, or 54, further including: transmitting, via a third beacon frame, information indicative of an updated routing table of the first wireless node in accordance with the second routing table indicating the new logical path associated with the target wireless node.

[0305] Clause 56: The method of any of clauses 1-17, 18-34, 35-52, or 53-55, further including: receiving, via a second beacon frame, information indicative of a second routing table, the second routing table including the respective identifier of each of the one or more first target wireless nodes, the respective hop count to each of the one or more first target wireless nodes, and the respective cumulative path metric to each of the one or more first target wireless nodes, where generating the routing table to include the logical path between the first wireless node and the second wireless node is in accordance with receiving the information indicative of the second routing table.

[0306] Clause 57: The method of any of clauses 1-17, 18-34, 35-52, or 53-56, further including: receiving, in accordance with a forward logical path selection being associated with a propagation of one or more beacon frames in the wireless mesh network, an introductory frame via a selected forward logical path between the first wireless node and the second wireless node; and updating the routing table in accordance with the introductory frame, the routing table including the selected forward logical path and a selected reverse logical path in accordance with the one or more beacon frames and the introductory frame.

[0307] Clause 58: The method of any of clauses 1-17, 18-34, 35-52, or 53-57, further including: selecting a forward logical path between the first wireless node and the second wireless node in accordance with a propagation of one or more beacon frames in the wireless mesh network; and transmitting, via the forward logical path, an introductory frame on the forward logical path between the first wireless node and the second wireless node.

[0308] Clause 59: The method of any of clauses 1-17, 18-34, 35-52, or 53-58, further including: receiving, in accordance with a forward logical path selection being associated with a propagation of one or more beacon frames in the wireless mesh network, an introductory frame via a selected forward logical path to the second wireless node; updating the routing table in accordance with the introductory frame, the routing table including the selected forward logical path and a selected reverse logical path in accordance with the one or more beacon frames and the introductory frame; and transmitting a forwarded version of the introductory frame in association with receiving the introductory frame.

[0309] Clause 60: The method of any of clauses 1-17, 18-34, 35-52, or 53-59, further including: transmitting, via the first beacon frame, an indication of a node type of the first wireless node and the information indicative of the first capability associated with the first wireless node.

[0310] Clause 61 : The method of any of clauses 1-17, 18-34, 35-52, or 53-60, further including: receiving, via a second beacon frame, an indication of a node type of the second wireless node and information indicative of the second capability associated with the second wireless node.

[0311] Clause 62: The method of any of clauses 1-17, 18-34, 35-52, or 53-61, further including: detecting and / or identifying a link loss between the first wireless node and the second wireless node; selecting, in association with detecting and / or identifying the link loss, a new forward path to an edge node of the wireless mesh network in accordance with the routing table; and transmitting, via the new forward path, an introductory frame including routing information associated with one or more other wireless nodes for which the first wireless node is a via point.

[0312] Clause 63: The method of any of clauses 1-17, 18-34, 35-52, or 62, further including: transmitting, to the one or more other wireless nodes for which the first wireless node is the via point and in association with selecting the new forward path, a path change frame including information indicative of one or both of a new cost or a new hop count to reach the edge node via the first wireless node.

[0313] Clause 64: The method of any of clauses 1-17, 18-34, 35-52, or 53-63, further including: receiving, in association with a link loss at a third wireless node of thewireless mesh network, an introductory frame including routing information associated with one or more other wireless nodes for which the third wireless node is a via point; updating the routing table in accordance with the routing information included in the introductory frame; and transmitting a forwarded version of the introductory frame toward an edge node of the wireless mesh network in association with receiving the introductory frame.

[0314] Clause 65: The method of any of clauses 1-17, 18-34, 35-52, or 53-64, further including: receiving, from a third wireless node for which the first wireless node is a via point and in association with a selection of a new forward path to an edge node of the wireless mesh network at the third wireless node, a path change frame including information indicative of one or both of a new cost or a new hop count to reach the edge node via the third wireless node.

[0315] Clause 66: The method of any of clauses 1-17, 18-34, 35-52, or 53-65, further including: obtaining, from an application layer associated with the first wireless node, an indication of the first capability.

[0316] Clause 67: The method of any of clauses 1-17, 18-34, 35-52, or 53-66, where the first capability includes one or more first capability elements and the second capability includes one or more second capability elements, and the first capability is complementary to the second capability in accordance with at least one of the one or more first capability elements having a mapping to at least one of the one or more second capability elements.

[0317] Clause 68: The method of any of clauses 1-17, 18-34, 35-52, or 67, where the one or more first capability elements and the one or more second capability elements are within a complete capability set associated with the wireless mesh network, and the complete capability set includes a first plurality of capability elements of a first capability set, a second plurality of capability elements of a second capability set, and a cartesian product of the first plurality of capability elements of the first capability set and the second plurality of capability elements of the second capability set.

[0318] Clause 69: The method of any of clauses 1-17, 18-34, 35-52, or 68, where the complete capability set includes a first subset of capabilities associated with a first node type and a second subset of capabilities associated with a second node type, andthe first node type is indicative of a non-edge node, the first subset of capabilities excluding elements mappable to each other in accordance with the first subset of capabilities being associated with the non-edge node.

[0319] Clause 70: A first wireless node, comprising a processing system that includes processor circuitry and memory circuitry that stores code, the processing system configured to cause the first wireless node to perform a method of any of clauses 1-17.

[0320] Clause 71 : A first wireless node, comprising at least one means for performing a method of any of clauses 1-17.

[0321] Clause 72: A non-transitory computer-readable medium storing code for wireless communication, the code comprising instructions executable by one or more processors, individually or collectively, to perform a method of any of clauses 1-17.

[0322] Clause 73: A first wireless node, comprising a processing system that includes processor circuitry and memory circuitry that stores code, the processing system configured to cause the first wireless node to perform a method of any of clauses 18-34.

[0323] Clause 74: A first wireless node, comprising at least one means for performing a method of any of clauses 18-34.

[0324] Clause 75: A non-transitory computer-readable medium storing code for wireless communication, the code comprising instructions executable by one or more processors, individually or collectively, to perform a method of any of clauses 18-34.

[0325] Clause 76: A first wireless node, comprising a processing system that includes processor circuitry and memory circuitry that stores code, the processing system configured to cause the first wireless node to perform a method of any of clauses 35-52.

[0326] Clause 77: A first wireless node, comprising at least one means for performing a method of any of clauses 35-52.

[0327] Clause 78: A non-transitory computer-readable medium storing code for wireless communication, the code comprising instructions executable by one or more processors, individually or collectively, to perform a method of any of clauses 35-52.

[0328] Clause 79: A first wireless node, comprising a processing system that includes processor circuitry and memory circuitry that stores code, the processing system configured to cause the first wireless node to perform a method of any of clauses 53-69.

[0329] Clause 80: A first wireless node for wireless communication, including at least one means for performing a method of any of clauses 53-69.

[0330] Clause 81 : A non-transitory computer-readable medium storing code for wireless communication, the code including instructions executable by one or more processors, individually or collectively, to perform a method of any of clauses 53-69.

[0331] As used herein, the term “determine” or “determining” encompasses a wide variety of actions and, therefore, “determining” can include calculating, computing, processing, deriving, estimating, investigating, looking up (such as via looking up in a table, a database, or another data structure), inferring, ascertaining, or measuring, among other possibilities. Also, “determining” can include receiving (such as receiving information), accessing (such as accessing data stored in memory) or transmitting (such as transmitting information), among other possibilities. Additionally, “determining” can include resolving, selecting, obtaining, choosing, establishing and other such similar actions.

[0332] As used herein, a phrase referring to “at least one of’ or “one or more of’ a list of items refers to any combination of those items, including single members. As an example, “at least one of: a, b, or c” is intended to cover: a, b, c, a-b, a-c, b-c, and a-b-c. As used herein, “or” is intended to be interpreted in the inclusive sense, unless otherwise explicitly indicated. For example, “a or b” may include a only, b only, or a combination of a and b. Furthermore, as used herein, a phrase referring to “a” or “an” element refers to one or more of such elements acting individually or collectively to perform the recited function(s). Additionally, a “set” refers to one or more items, and a “subset” refers to less than a whole set, but non-empty. Further, a “subset” may refer to all of a set of multiple or less than a set of multiple, such that a “subset” may beunderstood as being less than or equal to a full set and including at least one member (and, likewise, being non-empty).

[0333] As used herein, “based on” is intended to be interpreted in the inclusive sense, unless otherwise explicitly indicated. For example, “based on” may be used interchangeably with “based at least in part on,” “associated with,” “in association with,” or “in accordance with” unless otherwise explicitly indicated. Specifically, unless a phrase refers to “based on only ‘a,’” or the equivalent in context, whatever it is that is “based on ‘a,’” or “based at least in part on ‘a,’” may be based on “a” alone or based on a combination of “a” and one or more other factors, conditions, or information.

[0334] The various illustrative components, logic, logical blocks, modules, circuits, operations, and algorithm processes described in connection with the examples disclosed herein may be implemented as electronic hardware, firmware, software, or combinations of hardware, firmware, or software, including the structures disclosed in this specification and the structural equivalents thereof. The interchangeability of hardware, firmware and software has been described generally, in terms of functionality, and illustrated in the various illustrative components, blocks, modules, circuits and processes described above. Whether such functionality is implemented in hardware, firmware or software depends upon the particular application and design constraints imposed on the overall system.

[0335] Various modifications to the examples described in this disclosure may be readily apparent to persons having ordinary skill in the art, and the generic principles defined herein may be applied to other examples without departing from the spirit or scope of this disclosure. Thus, the claims are not intended to be limited to the examples shown herein, but are to be accorded the widest scope consistent with this disclosure, the principles and the novel features disclosed herein.

[0336] Additionally, various features that are described in this specification in the context of separate examples also can be implemented in combination in a single implementation. Conversely, various features that are described in the context of a single implementation also can be implemented in multiple examples separately or in any suitable subcombination. As such, although features may be described above as acting in particular combinations, and even initially claimed as such, one or morefeatures from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.

[0337] Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. Further, the drawings may schematically depict one or more example processes in the form of a flowchart or flow diagram. However, other operations that are not depicted can be incorporated in the example processes that are schematically illustrated. For example, one or more additional operations can be performed before, after, simultaneously, or between any of the illustrated operations. In some circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system components in the examples described above should not be understood as requiring such separation in all examples, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.

Claims

CLAIMSWhat is claimed is:

1. A first wireless node, comprising: a processing system that includes processor circuitry and memory circuitry that stores code, the processing system configured to cause the first wireless node to: transmit, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a first capability associated with the first wireless node; receive a path reply frame associated with the path request frame, the path reply frame including information indicative of a second wireless node within the wireless mesh network and indicating, in accordance with the path reply frame being associated with the path request frame, that a second capability associated with the second wireless node is complementary to the first capability; and generate a routing table to include a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node.

2. The first wireless node of claim 1, wherein the processing system is further configured to cause the first wireless node to: obtain, from an application layer associated with the first wireless node, an indication of the first capability, wherein transmitting the path request frame including the information indicative of the first capability is in association with obtaining the indication of the first capability from the application layer.

3. The first wireless node of claim 2, wherein in accordance with the application layer providing the indication of the first capability, path routing involving the first wireless node is associated with application layer information.

4. The first wireless node of claim 1, wherein the processing system is further configured to cause the first wireless node to:transmit the information indicative of the first capability via one or more information elements or subfields of the path request frame.

5. The first wireless node of claim 1, wherein the processing system is further configured to cause the first wireless node to: receive a plurality of path reply frames associated with the path request frame, the plurality of path reply frames including information indicative of a plurality of wireless nodes, respectively, within the wireless mesh network and indicating, in accordance with the plurality of path reply frames being associated with the path request frame, that a respective capability associated with each of the plurality of wireless nodes is complementary to the first capability; and generate a respective logical path between the first wireless node and each of the plurality of wireless nodes in the routing table in accordance with the respective capability of each of the plurality of wireless nodes being complementary to the first capability associated with the first wireless node.

6. The first wireless node of claim 1, wherein: the first capability includes one or more first capability elements and the second capability includes one or more second capability elements; and the first capability is complementary to the second capability in accordance with at least one of the one or more first capability elements having a mapping to at least one of the one or more second capability elements.

7. The first wireless node of claim 6, wherein: the one or more first capability elements and the one or more second capability elements are within a complete capability set associated with the wireless mesh network; and the complete capability set includes a first plurality of capability elements of a first capability set, a second plurality of capability elements of a second capability set, and a cartesian product of the first plurality of capability elements of the first capability set and the second plurality of capability elements of the second capability set.

8. The first wireless node of claim 7, wherein the mapping is between the first plurality of capability elements of the first capability set and the second plurality of capability elements of the second capability set, each capability element of the first capability set mapping to at least one capability element of the second capability set, and each capability element of the second capability set mapping to at least one capability element of the first capability set.

9. The first wireless node of claim 7, wherein: the complete capability set includes a first subset of capabilities associated with a first node type and a second subset of capabilities associated with a second node type; and the first node type is indicative of a non-edge node, the first subset of capabilities excluding elements mappable to each other in accordance with the first subset of capabilities being associated with the non-edge node.

10. The first wireless node of claim 1, wherein the processing system is further configured to cause the first wireless node to: transmit, via a beacon frame, information indicative of the routing table, the routing table including a respective identifier of each of one or more target wireless nodes, a respective hop count to each of the one or more target wireless nodes, and a respective cumulative path metric to each of the one or more target wireless nodes, the one or more target wireless nodes including at least the second wireless node.

11. The first wireless node of claim 1, wherein the processing system is further configured to cause the first wireless node to: receive, via a beacon frame, information indicative of a second routing table, the second routing table including a respective identifier of each of one or more target wireless nodes, a respective hop count to each of the one or more target wireless nodes, and a respective cumulative path metric to each of the one or more target wireless nodes; and update the routing table, at least in part, in accordance with the second routing table indicating a new logical path associated with a target wireless node.

12. The first wireless node of claim 1, wherein the processing system is further configured to cause the first wireless node to: receive, in accordance with a forward logical path selection being associated with a propagation of one or more beacon frames in the wireless mesh network, an introductory frame via a selected forward logical path between the first wireless node and the second wireless node; and update the routing table in accordance with the introductory frame, the routing table including the selected forward logical path and a selected reverse logical path in accordance with the one or more beacon frames and the introductory frame.

13. A first wireless node, comprising: a processing system that includes processor circuitry and memory circuitry that stores code, the processing system configured to cause the first wireless node to: receive, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a second capability associated with a second wireless node; transmit, in accordance with a first capability associated with the first wireless node being complementary to the second capability associated with the second wireless node, a path reply frame associated with the path request frame, the path reply frame including information indicative of the first wireless node; and generate a routing table to include a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node.

14. The first wireless node of claim 13, wherein the processing system is further configured to cause the first wireless node to: obtain, from an application layer associated with the first wireless node, an indication of the first capability, wherein transmitting the path reply frame is in association with obtaining the indication of the first capability from the application layer.

15. The first wireless node of claim 14, wherein in accordance with the application layer providing the indication of the first capability, path routing involving the first wireless node is associated with application layer information.

16. The first wireless node of claim 13, wherein the processing system is further configured to cause the first wireless node to: transmit a forwarded version of the path request frame to one or more other wireless nodes within the wireless mesh network in association with receiving the path request frame, the forwarded version of the path request frame including the information indicative of the second capability associated with the second wireless node.

17. The first wireless node of claim 13, wherein: the first capability includes one or more first capability elements and the second capability includes one or more second capability elements; and the first capability is complementary to the second capability in accordance with at least one of the one or more first capability elements having a mapping to at least one of the one or more second capability elements.

18. The first wireless node of claim 17, wherein: the one or more first capability elements and the one or more second capability elements are within a complete capability set associated with the wireless mesh network; and the complete capability set includes a first plurality of capability elements of a first capability set, a second plurality of capability elements of a second capability set, and a cartesian product of the first plurality of capability elements of the first capability set and the second plurality of capability elements of the second capability set.

19. The first wireless node of claim 18, wherein the mapping is between the first plurality of capability elements of the first capability set and the second plurality of capability elements of the second capability set, each capability element of the first capability set mapping to at least one capability element of thesecond capability set, and each capability element of the second capability set mapping to at least one capability element of the first capability set.

20. The first wireless node of claim 13, wherein the processing system is further configured to cause the first wireless node to: transmit, via a beacon frame, an indication of a node type of the first wireless node and the information indicative of the first capability associated with the first wireless node.

21. The first wireless node of claim 13, wherein the processing system is further configured to cause the first wireless node to: receive, via a beacon frame, an indication of a node type of the second wireless node and information indicative of the second capability associated with the second wireless node.

22. The first wireless node of claim 13, wherein the processing system is further configured to cause the first wireless node to: select a forward logical path between the first wireless node and the second wireless node in accordance with a propagation of one or more beacon frames in the wireless mesh network; and transmit, via the forward logical path, an introductory frame on the forward logical path between the first wireless node and the second wireless node.

23. A first wireless node, comprising: a processing system that includes processor circuitry and memory circuitry that stores code, the processing system configured to cause the first wireless node to: receive, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a second capability associated with a second wireless node; transmit a forwarded version of the path request frame, without transmitting a path reply frame associated with the path request frame, in accordance with a first capability associated with the first wireless node beingnon-complementary to the second capability associated with the second wireless node; and generate a routing table to exclude a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node.

24. The first wireless node of claim 23, wherein the processing system is further configured to cause the first wireless node to: obtain, from an application layer associated with the first wireless node, an indication of the first capability, wherein transmitting the forwarded version of the path request frame, without transmitting the path reply frame, is in association with obtaining the indication of the first capability from the application layer.

25. The first wireless node of claim 23, wherein the processing system is further configured to cause the first wireless node to: receive a path reply frame associated with the forwarded version of the path request frame, the path reply frame including information indicative of a third wireless node within the wireless mesh network and indicating, in accordance with the path reply frame being associated with the forwarded version of the path request frame, that a third capability associated with the third wireless node is complementary to the second capability; and transmit a forwarded version of the path reply frame in association with receiving the path reply frame.

26. The first wireless node of claim 23, wherein: the first capability includes one or more first capability elements and the second capability includes one or more second capability elements; and the first capability is non-complementary to the second capability in accordance with none of the one or more first capability elements having a mapping to at least one of the one or more second capability elements.

27. The first wireless node of claim 23, wherein the processing system is further configured to cause the first wireless node to:receive, via a beacon frame, information indicative of a second routing table, the second routing table including a respective identifier of each of one or more target wireless nodes, a respective hop count to each of the one or more target wireless nodes, and a respective cumulative path metric to each of the one or more target wireless nodes; and update the routing table, at least in part, in accordance with the second routing table indicating a new logical path associated with a target wireless node.

28. The first wireless node of claim 23, wherein the processing system is further configured to cause the first wireless node to: receive, in accordance with a forward logical path selection being associated with a propagation of one or more beacon frames in the wireless mesh network, an introductory frame via a selected forward logical path to the second wireless node; update the routing table in accordance with the introductory frame, the routing table including the selected forward logical path and a selected reverse logical path in accordance with the one or more beacon frames and the introductory frame; and transmit a forwarded version of the introductory frame in association with receiving the introductory frame.

29. A method for wireless communication by a first wireless node, comprising: transmitting, in accordance with a path discovery procedure associated with a wireless mesh network, a path request frame including information indicative of a first capability associated with the first wireless node; receiving a path reply frame associated with the path request frame, the path reply frame including information indicative of a second wireless node within the wireless mesh network and indicating, in accordance with the path reply frame being associated with the path request frame, that a second capability associated with the second wireless node is complementary to the first capability; and generating a routing table to include a logical path between the first wireless node and the second wireless node in accordance with the second capability associated with the second wireless node.

30. The method of claim 29, further comprising: obtaining, from an application layer associated with the first wireless node, an indication of the first capability, wherein transmitting the path request frame including the information indicative of the first capability is in association with obtaining the indication of the first capability from the application layer.

31. A first wireless node, comprising: a processing system that includes processor circuitry and memory circuitry that stores code, the processing system configured to cause the first wireless node to: generate a routing table to include a logical path between the first wireless node and a second wireless node of a wireless mesh network in accordance with a second capability associated with the second wireless node being complementary to a first capability associated with the first wireless node; and transmit, via a first beacon frame, information indicative of the routing table, the routing table including a respective identifier of each of one or more first target wireless nodes, a respective hop count to each of the one or more first target wireless nodes, and a respective cumulative path metric to each of the one or more first target wireless nodes, the one or more first target wireless nodes including at least the second wireless node.

32. The first wireless node of claim 31, wherein the processing system is further configured to cause the first wireless node to: receive, via a second beacon frame, information indicative of a second routing table, the second routing table including a respective identifier of each of one or more second target wireless nodes, a respective hop count to each of the one or more second target wireless nodes, and a respective cumulative path metric to each of the one or more second target wireless nodes; and update the routing table, at least in part, in accordance with the second routing table indicating a new logical path associated with a target wireless node.

33. The first wireless node of claim 32, wherein the processing system is further configured to cause the first wireless node to:transmit, via a third beacon frame, information indicative of an updated routing table of the first wireless node in accordance with the second routing table indicating the new logical path associated with the target wireless node.

34. The first wireless node of claim 31, wherein the processing system is further configured to cause the first wireless node to: receive, via a second beacon frame, information indicative of a second routing table, the second routing table including the respective identifier of each of the one or more first target wireless nodes, the respective hop count to each of the one or more first target wireless nodes, and the respective cumulative path metric to each of the one or more first target wireless nodes, wherein generating the routing table to include the logical path between the first wireless node and the second wireless node is in accordance with receiving the information indicative of the second routing table.

35. The first wireless node of claim 31, wherein the processing system is further configured to cause the first wireless node to: receive, in accordance with a forward logical path selection being associated with a propagation of one or more beacon frames in the wireless mesh network, an introductory frame via a selected forward logical path between the first wireless node and the second wireless node; and update the routing table in accordance with the introductory frame, the routing table including the selected forward logical path and a selected reverse logical path in accordance with the one or more beacon frames and the introductory frame.

36. The first wireless node of claim 31, wherein the processing system is further configured to cause the first wireless node to: select a forward logical path between the first wireless node and the second wireless node in accordance with a propagation of one or more beacon frames in the wireless mesh network; and transmit, via the forward logical path, an introductory frame on the forward logical path between the first wireless node and the second wireless node.

37. The first wireless node of claim 31, wherein the processing system is further configured to cause the first wireless node to: receive, in accordance with a forward logical path selection being associated with a propagation of one or more beacon frames in the wireless mesh network, an introductory frame via a selected forward logical path to the second wireless node; update the routing table in accordance with the introductory frame, the routing table including the selected forward logical path and a selected reverse logical path in accordance with the one or more beacon frames and the introductory frame; and transmit a forwarded version of the introductory frame in association with receiving the introductory frame.

38. The first wireless node of claim 31, wherein the processing system is further configured to cause the first wireless node to: transmit, via the first beacon frame, an indication of a node type of the first wireless node and the information indicative of the first capability associated with the first wireless node.

39. The first wireless node of claim 31, wherein the processing system is further configured to cause the first wireless node to: receive, via a second beacon frame, an indication of a node type of the second wireless node and information indicative of the second capability associated with the second wireless node.

40. The first wireless node of claim 31, wherein the processing system is further configured to cause the first wireless node to: identify a link loss between the first wireless node and the second wireless node; select, in association with identifying the link loss, a new forward path to an edge node of the wireless mesh network in accordance with the routing table; and transmit, via the new forward path, an introductory frame including routing information associated with one or more other wireless nodes for which the first wireless node is a via point.

41. The first wireless node of claim 40, wherein the processing system is further configured to cause the first wireless node to: transmit, to the one or more other wireless nodes for which the first wireless node is the via point and in association with selecting the new forward path, a path change frame including information indicative of one or both of a new cost or a new hop count to reach the edge node via the first wireless node.

42. The first wireless node of claim 31, wherein the processing system is further configured to cause the first wireless node to: receive, in association with a link loss at a third wireless node of the wireless mesh network, an introductory frame including routing information associated with one or more other wireless nodes for which the third wireless node is a via point; update the routing table in accordance with the routing information included in the introductory frame; and transmit a forwarded version of the introductory frame toward an edge node of the wireless mesh network in association with receiving the introductory frame.

43. The first wireless node of claim 31, wherein the processing system is further configured to cause the first wireless node to: receive, from a third wireless node for which the first wireless node is a via point and in association with a selection of a new forward path to an edge node of the wireless mesh network at the third wireless node, a path change frame including information indicative of one or both of a new cost or a new hop count to reach the edge node via the third wireless node.

44. The first wireless node of claim 31, wherein the processing system is further configured to cause the first wireless node to: obtain, from an application layer associated with the first wireless node, an indication of the first capability.

45. The first wireless node of claim 31, wherein: the first capability includes one or more first capability elements and the second capability includes one or more second capability elements; andthe first capability is complementary to the second capability in accordance with at least one of the one or more first capability elements having a mapping to at least one of the one or more second capability elements.

46. The first wireless node of claim 45, wherein: the one or more first capability elements and the one or more second capability elements are within a complete capability set associated with the wireless mesh network; and the complete capability set includes a first plurality of capability elements of a first capability set, a second plurality of capability elements of a second capability set, and a cartesian product of the first plurality of capability elements of the first capability set and the second plurality of capability elements of the second capability set.

47. The first wireless node of claim 46, wherein: the complete capability set includes a first subset of capabilities associated with a first node type and a second subset of capabilities associated with a second node type; and the first node type is indicative of a non-edge node, the first subset of capabilities excluding elements mappable to each other in accordance with the first subset of capabilities being associated with the non-edge node.

48. A method for wireless communication performable by a first wireless node, comprising: generating a routing table to include a logical path between the first wireless node and a second wireless node of a wireless mesh network in accordance with a second capability associated with the second wireless node being complementary to a first capability associated with the first wireless node; and transmitting, via a first beacon frame, information indicative of the routing table, the routing table including a respective identifier of each of one or more first target wireless nodes, a respective hop count to each of the one or more first target wireless nodes, and a respective cumulative path metric to each of the one or more first target wireless nodes, the one or more first target wireless nodes including at least the second wireless node.

49. The method of claim 48, further comprising: receiving, via a second beacon frame, information indicative of a second routing table, the second routing table including a respective identifier of each of one or more second target wireless nodes, a respective hop count to each of the one or more second target wireless nodes, and a respective cumulative path metric to each of the one or more second target wireless nodes; and updating the routing table, at least in part, in accordance with the second routing table indicating a new logical path associated with a target wireless node.

50. The method of claim 48, further comprising: receiving, via a second beacon frame, information indicative of a second routing table, the second routing table including the respective identifier of each of the one or more first target wireless nodes, the respective hop count to each of the one or more first target wireless nodes, and the respective cumulative path metric to each of the one or more first target wireless nodes, wherein generating the routing table to include the logical path between the first wireless node and the second wireless node is in accordance with receiving the information indicative of the second routing table.

Images