Formation of network with conditional connections in wireless mesh deployment scenario

Abstract

Methods, components, devices, and systems for forming conditionally connected networks in a wireless mesh deployment scenario are provided. Some aspects more particularly relate to how two wireless nodes may conditionally establish logical paths to each other according to comparing respective capabilities and determining whether a first capability of a first one of the two wireless nodes is complementary to a second capability of a second one 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 a first capability having a mapping to at least one element of a second capability. Two wireless nodes may support conditional logical path setup via a capability-based path request (PREQ) and path reply (PREP) frame exchange or via capability-based beacon assisted routing.

Description

[0001] Cross-references

[0002] This patent application claims priority to Indian Patent Application No. 202341062119, filed on September 15, 2023, entitled “FORMINGA CONDITIONALLY CONNECTED NETWORK IN A WIRELESS MESH DEPLOYMENT SCENARIO”, which is assigned to the assignee of this application and is expressly incorporated herein by reference in its entirety. Technical Field

[0003] This disclosure relates to wireless communication, and more specifically, to networks forming conditional connections in wireless mesh deployment scenarios. Background Technology

[0004] A Wireless Local Area Network (WLAN) can be formed by one or more wireless access points (APs) that provide a shared wireless communication medium for use by multiple client devices (also known as wireless stations (STAs)). The basic building block of a WLAN conforming to the IEEE 802.11 standard family is the Basic Service Set (BSS) managed by the AP. Each BSS is identified by a Basic Service Set Identifier (BSSID) advertised by the AP. The AP periodically broadcasts beacon frames to enable any STA within the AP's wireless range to establish or maintain a communication link with the WLAN.

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

[0006] The systems, methods, and apparatus disclosed herein each have several innovative aspects, and no single aspect is solely responsible for the desired properties disclosed herein.

[0007] 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 comprising processor circuitry and memory circuitry storing code. The processing system may be configured to cause the first wireless node to: transmit a path request frame according to a path discovery process associated with a wireless mesh network, the path request frame including information indicating a first capability associated with the first wireless node; receive a path response frame associated with the path request frame, the path response frame including information indicating a second wireless node within the wireless mesh network, and the path response frame indicating, based on its association 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 based on the second capability associated with the second wireless node to include logical paths between the first wireless node and the second wireless node.

[0008] Another innovative aspect of the subject matter described in this disclosure can be implemented in a method for wireless communication that can be performed by a first wireless node. The method may include: transmitting a path request frame according to a path discovery process associated with a wireless mesh network, the path request frame including information indicating a first capability associated with the first wireless node; receiving a path response frame associated with the path request frame, the path response frame including information indicating a second wireless node within the wireless mesh network, and the path response frame indicating, based on its association 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 based on the second capability associated with the second wireless node to include logical paths between the first and second wireless nodes.

[0009] 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 a path request frame according to a path discovery process associated with a wireless mesh network, the path request frame including information indicating a first capability associated with the first wireless node; means for receiving a path response frame associated with the path request frame, the path response frame including information indicating a second wireless node within the wireless mesh network, and the path response frame indicating, based on its association 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 based on the second capability associated with the second wireless node to include logical paths between the first wireless node and the second wireless node.

[0010] 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 individually or jointly by one or more processors to: transmit a path request frame according to a path discovery process associated with a wireless mesh network, the path request frame including information indicating a first capability associated with the first wireless node; receive a path response frame associated with the path request frame, the path response frame including information indicating a second wireless node within the wireless mesh network, and the path response frame indicating, based on its association 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 based on the second capability associated with the second wireless node to include a logical path between the first wireless node and the second wireless node.

[0011] The methods described herein, examples of the first wireless node, and some examples of nontransitory computer-readable media may also include operations, features, components, or instructions for obtaining an indication of the first capability from an application layer associated with the first wireless node, wherein sending a path request frame including the information indicating the first capability may be associated with obtaining the indication of the first capability from the application layer.

[0012] The methods described herein, examples of first wireless nodes, and nontransitory computer-readable media may also include operations, features, components, or instructions for transmitting information indicating the first capability via one or more information elements or subfields of a request frame through the path.

[0013] In some examples of the methods described herein, the first wireless node, and the nontransitory computer-readable medium, 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 depending on 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.

[0014] In some examples of the methods described herein, the first wireless node, and the nontransitory computer-readable medium, the one or more first capability elements and the one or more second capability elements may be within a complete set of capabilities associated with the wireless mesh network, and the complete set of capabilities includes a first set of multiple capability elements in the first capability set, a second set of multiple capability elements in the second capability set, and a Cartesian product of the first set of multiple capability elements in the first capability set and the second set of multiple capability elements in the second capability set.

[0015] In some examples of the methods described herein, the first wireless node, and the nontransitory computer-readable medium, the mapping may be between the first set of multiple capability elements in the first capability set and the second set of multiple capability elements in the second capability set, wherein each capability element in the first capability set maps to at least one capability element in the second capability set, and each capability element in the second capability set maps to at least one capability element in the first capability set.

[0016] 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 comprising processor circuitry and memory circuitry storing code. The processing system may be configured to cause the first wireless node to: receive a path request frame according to a path discovery process associated with a wireless mesh network, the path request frame including information indicating a second capability associated with a second wireless node; transmit a path reply frame associated with the path request frame, the path reply frame including information indicating the first wireless node, based on the complementarity of a first capability associated with the first wireless node and the second capability associated with the second wireless node; and generate a routing table based on the second capability associated with the second wireless node to include logical paths between the first wireless node and the second wireless node.

[0017] Another innovative aspect of the subject matter described in this disclosure can be implemented in a method for wireless communication that can be performed by a first wireless node. The method may include: receiving a path request frame according to a path discovery process associated with a wireless mesh network, the path request frame including information indicating a second capability associated with a second wireless node; transmitting a path reply frame associated with the path request frame, the path reply frame including information indicating the first wireless node, based on the complementarity of a first capability associated with the first wireless node and the second capability associated with the second wireless node; and generating a routing table based on the second capability associated with the second wireless node to include logical paths between the first and second wireless nodes.

[0018] 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 a path request frame according to a path discovery process associated with a wireless mesh network, the path request frame including information indicating a second capability associated with a second wireless node; means for transmitting a path response frame associated with the path request frame based on the complementarity of a first capability associated with the first wireless node and the second capability associated with the second wireless node, the path response frame including information indicating the first wireless node; and means for generating a routing table based on the second capability associated with the second wireless node to include a logical path between the first wireless node and the second wireless node.

[0019] 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 individually or jointly by one or more processors to: receive a path request frame according to a path discovery process associated with a wireless mesh network, the path request frame including information indicating a second capability associated with a second wireless node; transmit a path response frame associated with the path request frame, the path response frame including information indicating the first wireless node, based on the complementarity of a first capability associated with the first wireless node and the second capability associated with the second wireless node; and generate a routing table according to the second capability associated with the second wireless node to include a logical path between the first wireless node and the second wireless node.

[0020] The methods described herein, examples of the first wireless node, and some examples of nontransitory computer-readable media may also include operations, features, components, or instructions for obtaining an indication of the first capability from an application layer associated with the first wireless node, wherein sending the path reply frame may be associated with obtaining the indication of the first capability from the application layer.

[0021] The methods described herein, examples of first wireless nodes, and nontransitory computer-readable media may also include operations, features, components, 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 information indicating the second capability associated with the second wireless node.

[0022] In some examples of the methods described herein, the first wireless node, and the nontransitory computer-readable medium, 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 depending on 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.

[0023] 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 comprising processor circuitry and memory circuitry storing code. The processing system may be configured to cause the first wireless node to: receive a path request frame according to a path discovery process associated with a wireless mesh network, the path request frame including information indicating a second capability associated with a second wireless node; transmit a forwarded version of the path request frame based on the non-complementarity of the first capability associated with the first wireless node and the second capability associated with the second wireless node, without transmitting a path reply frame associated with the path request frame; and generate a routing table based on the second capability associated with the second wireless node to exclude logical paths between the first wireless node and the second wireless node.

[0024] Another innovative aspect of the subject matter described in this disclosure can be implemented in a method for wireless communication that can be performed by a first wireless node. The method may include: receiving a path request frame according to a path discovery process associated with a wireless mesh network, the path request frame including information indicating a second capability associated with a second wireless node; transmitting a forwarded version of the path request frame based on the non-complementarity of a first capability associated with the first wireless node and the second capability associated with the second wireless node, without transmitting a path reply frame associated with the path request frame; and generating a routing table based on the second capability associated with the second wireless node to exclude logical paths between the first and second wireless nodes.

[0025] 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 a path request frame according to a path discovery process associated with a wireless mesh network, the path request frame including information indicating 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, based on the non-complementarity of the first capability associated with the first wireless node and the second capability associated with the second wireless node; and means for generating a routing table based on the second capability associated with the second wireless node to exclude logical paths between the first wireless node and the second wireless node.

[0026] 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 individually or jointly by one or more processors to: receive a path request frame according to a path discovery process associated with a wireless mesh network, the path request frame including information indicating a second capability associated with a second wireless node; transmit a forwarded version of the path request frame based on the non-complementarity of a first capability associated with the first wireless node and the second capability associated with the second wireless node, without transmitting a path reply frame associated with the path request frame; and generate a routing table based on the second capability associated with the second wireless node to exclude logical paths between the first and second wireless nodes.

[0027] The methods described herein, examples of the first wireless node, and some examples of nontransitory computer-readable media may also include operations, features, components, or instructions for obtaining an indication of the first capability from an application layer associated with the first wireless node, wherein sending the forwarded version of the path request frame without sending the path reply frame may be associated with obtaining the indication of the first capability from the application layer.

[0028] The methods described herein, examples of first wireless nodes, and nontransitory computer-readable media may also include operations, features, components, or instructions for transmitting information indicating the second capability via one or more information elements or subfields of the forwarding version of the request frame through the path.

[0029] The methods described herein, examples of first wireless nodes, and nontransitory computer-readable media may also include operations, features, components, or instructions for: receiving a path response frame associated with the forwarded version of the path request frame, the path response frame including information indicating a third wireless node within the wireless mesh network, and the path response frame indicating, based on its association 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 the forwarded version of the path response frame in connection with receiving the path response frame.

[0030] In some examples of the methods described herein, the first wireless node, and the nontransitory computer-readable medium, 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 depending on the fact that none of the one or more first capability elements has a mapping to at least one of the one or more second capability elements.

[0031] 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 comprising processor circuitry and memory circuitry storing code. The processing system may be configured to cause the first wireless node to: generate a routing table to include logical paths between the first wireless node and the second wireless node based on a second capability associated with a second wireless node in a wireless mesh network and a first capability associated with the first wireless node; and transmit information indicating the routing table via a first beacon frame, the routing table including a corresponding identifier for each of one or more first target wireless nodes, a corresponding hop count to each of the one or more first target wireless nodes, and a corresponding 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 method for wireless communication that can be performed by a first wireless node. The method may include: generating a routing table to include logical paths between the first and second wireless nodes based on a second capability associated with a second wireless node in a wireless mesh network and a first capability associated with the first wireless node; and transmitting information indicating the routing table via a first beacon frame, the routing table including a corresponding identifier for each of one or more first target wireless nodes, a corresponding hop count to each of the one or more first target wireless nodes, and a corresponding 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 first wireless node. The first wireless node may include: components for generating a routing table to include logical paths between the first wireless node and the second wireless node based on a second capability associated with a second wireless node in a wireless mesh network and a first capability complement associated with the first wireless node; and components for transmitting information indicating the routing table via a first beacon frame, the routing table including a corresponding identifier for each of one or more first target wireless nodes, a corresponding hop count to each of the one or more first target wireless nodes, and a corresponding 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] 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 individually or jointly by one or more processors to: generate a routing table to include logical paths between the first and second wireless nodes based on a second capability associated with a second wireless node in the wireless mesh network and a first capability associated with the first wireless node; and transmit information indicating the routing table via a first beacon frame, the routing table including a corresponding identifier for each of one or more first target wireless nodes, a corresponding hop count to each of the one or more first target wireless nodes, and a corresponding 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.

[0035] The methods described herein, examples of first wireless nodes, and nontransitory computer-readable media may also include operations, features, components, or instructions for: receiving information indicating a second routing table via a second beacon frame, the second routing table including a corresponding identifier for each of one or more second target wireless nodes, a corresponding hop count to each of the one or more second target wireless nodes, and a corresponding cumulative path metric to each of the one or more second target wireless nodes; and updating the routing table, at least in part, based on new logical paths associated with target wireless nodes indicated by the second routing table.

[0036] The methods described herein, examples of the first wireless node, and some examples of nontransitory computer-readable media may also include operations, features, components, or instructions for transmitting information indicating an updated routing table of the first wireless node via a third beacon frame, based on the second routing table indicating the new logical path associated with the target wireless node.

[0037] The methods described herein, examples of first wireless nodes, and nontransitory computer-readable media may also include operations, features, components, or instructions for receiving information indicating a second routing table via a second beacon frame, the second routing table including the corresponding identifier of each of the one or more first target wireless nodes, the corresponding hop count to each of the one or more first target wireless nodes, and the corresponding 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 may be performed based on receiving the information indicating the second routing table.

[0038] Details of one or more specific embodiments 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, drawings, and claims. Note that the relative dimensions in the following drawings may not be drawn to scale. Attached Figure Description

[0039] Figure 1 A schematic diagram of an example wireless communication network is shown.

[0040] Figure 2 An example wireless mesh network is shown illustrating communication between wireless nodes within a wireless mesh network, including path request (PREQ) frames and associated path reply (PREP) frames.

[0041] Figure 3 Examples of target or use case-based capabilities are shown, illustrating how node capabilities can be complementary based on capability mappings between elements in a first capability set and elements in a second capability set, and how node capabilities are related to elements in the first and second capability sets.

[0042] Figure 4 An example of a conditionally connected network is shown, illustrating how some connections between wireless nodes can be permitted and other connections between wireless nodes can be disallowed based on a capability mapping between elements in a first capability set and elements in a second capability set.

[0043] Figure 5 An example signaling diagram is shown illustrating the propagation of PREQ frames from the original wireless node through the wireless mesh network and the conditional transmission of associated PREQ frames by other wireless nodes in the wireless mesh network.

[0044] Figure 6 An example wireless mesh network is shown, illustrating beacon-assisted routing via the transmission of one or more beacon frames by each of the wireless nodes within the wireless mesh network.

[0045] Figure 7 Examples of node type-related capability subsets are shown to illustrate how different node types can have different subsets of capabilities from the full set of capabilities.

[0046] Figure 8 An example beacon-assisted routing diagram illustrates the sequence of steps by which various wireless nodes in a wireless mesh network can establish logical paths toward edge nodes.

[0047] Figure 9An example process flow is shown illustrating the sequence of steps a wireless node can take to generate a routing table, update the routing table, advertise routing information, establish forward and reverse paths, or any combination thereof, using beacon-assisted routing.

[0048] Figure 10 An example signaling diagram illustrates the path recovery process by which various wireless nodes in a wireless mesh network can re-establish data paths based on the transmission and propagation of a pilot frame carrying routing information.

[0049] Figure 11 A block diagram of an example wireless communication device is shown that supports the formation of a conditionally connected network in a wireless mesh deployment scenario via capability-based PREQ / PREP frame switching, capability-based beacon-assisted routing, or any combination thereof.

[0050] Figures 12 to 14 A flowchart illustrating an example process that can be performed by or at the first wireless node to support the formation of a conditionally connected network in a wireless mesh deployment scenario via capability-based PREQ / PREP frame switching is shown.

[0051] Figure 15 A flowchart illustrating a process that can be performed by or at the first wireless node to support the formation of a conditionally connected network in a wireless mesh deployment scenario via beacon-assisted routing is shown.

[0052] The same reference numerals and names in the various figures indicate the same elements. Detailed Implementation

[0053] The following description refers to certain specific examples in order to illustrate the innovative aspects of this disclosure. However, those skilled in the art will readily recognize that the teachings herein can be applied in a variety of different ways. Some or all of the examples described can be applied in Bluetooth systems that meet the requirements of the Institute of Electrical and Electronics Engineers (IEEE) 802.11, IEEE 802.15, or Bluetooth as defined by the Bluetooth Special Interest Group (SIG). ®This can be implemented in any device, system, or network that transmits and receives radio frequency (RF) signals according to one or more of the following standards, or those published by the 3rd Generation Partnership Project (3GPP): Long Term Evolution (LTE), 3G, 4G, or 5G (New Radio (NR)). The described examples can be implemented in any device, system, or network 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), Single Carrier FDMA (SC-FDMA), Space Division Multiple Access (SDMA), Rate Split Multiple Access (RSMA), Multi-User Shared Access (MUSA), Single-User (SU) Multiple-Input Multiple-Output (MIMO), and Multi-User (MU)-MIMO (MU-MIMO). The described examples can also be implemented using other wireless communication protocols or RF signals suitable for use in one or more of the following networks: Wireless Personal Area Network (WPAN), Wireless Local Area Network (WLAN), Wireless Wide Area Network (WWAN), Wireless Metropolitan Area Network (WMAN), or Internet of Things (IoT).

[0054] Various aspects generally relate to wireless communication in wireless mesh networks, including wireless mesh networks in which logical paths between wireless nodes are conditionally (e.g., optionally or selectively) established based on the corresponding capabilities of each wireless node. Some aspects more specifically relate to how two wireless nodes can conditionally establish logical paths to each other by comparing corresponding capabilities and determining whether a first capability of a first wireless node is complementary to a second capability of a second wireless node. In some specific implementations, based on classifying node capabilities into two capability sets S1 and S2, a first capability can be complementary to a second capability, where each capability element of S1 has a mapping to at least one capability element of S2, and vice versa. Therefore, if a first capability includes at least one capability element having a mapping to capability elements included in the second capability, then the first capability can be complementary to the second capability. A complete capability set C (which can be defined such that C = {S1, S2, S1 × S2}, where “×” is a Cartesian product) can be pre-configured or preloaded at the two wireless nodes, and in some specific implementations, the corresponding capabilities of the two wireless nodes (which can be understood as C) i and C j Both (and are elements of C) can be provided by the application layer associated with each wireless node. Therefore, the application layer functionality and application layer information associated with two wireless nodes can affect whether the two wireless nodes can establish a logical path to each other. In other words, application layer information can influence or contribute to routing algorithms or components within routing algorithms.

[0055] In some examples, two wireless nodes may support this conditional logical path establishment during the discovery process associated with a wireless mesh network by exchanging Path Request (PREQ) and Path Response (PREP) frames. For example, the first wireless node may be the originating node sending the PREQ frame, and the first wireless node may include information indicating its first capability in the Information Element (IE) or subfield of the PREQ frame. In such examples, the second wireless node may receive the PREQ frame, parse (e.g., decode) the PREQ frame to identify the first wireless node's first capability, and compare the first capability with the second wireless node's second capability. If the second wireless node determines that the first capability and the second capability are complementary (according to the mapping between the capability elements of S1 and S2), the second wireless node may send a PREEP frame associated with the PREQ frame (e.g., in response to the PREQ frame). In such examples, the first and second wireless nodes may establish a logical path to each other. Alternatively, if the second wireless node determines that the first capability and the second capability are not complementary (according to the mapping between the capability elements of S1 and S2), the second wireless node may avoid sending a PREEP frame associated with the PREQ frame (e.g., in response to the PREQ frame). In such examples, the first and second wireless nodes can avoid establishing logical paths to each other. Regardless of whether the first and second capabilities are complementary, the second wireless node can forward the first wireless node's PREQ frames and, in some scenarios, can act as a relay (such as a "via point") between the first wireless node and a third wireless node with a third capability that is complementary to the first capability.

[0056] Specific aspects of the subject matter described in this disclosure can be implemented to achieve one or more of the following potential advantages. In some examples, by allowing logical paths between wireless nodes with complementary capabilities and disallowing logical paths between wireless nodes with non-complementary capabilities, some embodiments can support mechanisms for building routing tables that reduce a fully connected network to a conditionally connected network for a generally definable set of objectives or use cases. For example, such embodiments can reduce (or eliminate) redundant connections for a given objective or use case. Furthermore, based on such conditionally connected networks implemented (e.g., facilitated) via PREQ / PREP frame switching, some example embodiments of this disclosure can reduce the amount of path selection frames (and particularly PREP frames) in a mesh network comprising nodes with different capabilities. Such embodiments can reduce flooding in the network by limiting the number of connections in the network.

[0057] By reducing the size of the routing table (e.g., by reducing the number of redundant connections) and the number of path selection frames sent, the described aspects also reduce network and device complexity, power consumption, and signaling overhead, which can further lead to higher spectral efficiency, higher data rates, and greater system capacity, among other benefits. Furthermore, the described capability-based conditional connectivity network formation can be applied to any routing protocol associated with wireless mesh networks, providing compatibility and potentially leading to wider adoption of wireless mesh technology. For example, the described routing algorithm may be particularly effective for UAV mesh use cases, but it can also be extended to a variety of other use cases due to the reduced complexity and the ability of the application layer to be configured to function in any wireless protocol.

[0058] Additionally or alternatively, two wireless nodes may support the establishment of conditional logical paths via beacon-assisted routing. For example, one or more wireless nodes may send one or more beacon frames, each containing routing information to other wireless nodes in the wireless mesh network. In such examples, each wireless node receiving a beacon frame may update its routing table if the optimal path has changed or if a new path needs to be added for a given target wireless node. Based on each wireless node in the wireless mesh network sending routing information via one or more beacon frames and each wireless node updating its corresponding routing table according to the routing information provided by the beacons, the wireless nodes in the wireless mesh network can propagate the latest routing information throughout the wireless mesh network. In some implementations, wireless nodes may employ beacon-assisted routing based on whether their respective capabilities are complementary (e.g., based on a mapping between two capability sets S1 and S2). In such implementations, different subsets of capabilities may be defined for various types of nodes (e.g., edge nodes and non-edge nodes), such that a non-edge node may have capabilities complementary to those of an edge node, but may not have capabilities complementary to any other non-edge node. Non-edge nodes can avoid establishing logical paths to each other and can route information accordingly via beacon frame broadcasts.

[0059] Furthermore, in some implementations, wireless nodes may support the transmission of unicast guide frames based on the detection and / or identification of link loss or path change. For example, a wireless node detecting and / or identifying link loss or path change may select a new forward path to an edge node and may transmit a guide frame along the selected forward path. In some aspects, the guide frame may include routing information associated with other wireless nodes through which the wireless node (initiating node) is a "via point". Each wireless node in the selected forward path may receive the guide frame, update its routing table based on the routing information delivered by the guide frame, and further transmit a forwarded (e.g., relayed or propagated) version of the guide frame along the selected forward path. Wireless nodes in 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.

[0060] Specific aspects of the subject matter described in this disclosure can be implemented to achieve one or more of the following potential advantages. In some examples, by employing beacon-assisted routing, wireless nodes in a wireless mesh network can reduce or eliminate their reliance on broadcast path selection frames to establish (conditionally) connections, which reduces signaling overhead and mitigates 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. Furthermore, by implementing the path recovery process via unicast guide frames transmitted in the selected forward path (which may be aided by routing information provided by beacons), wireless nodes can dynamically adapt to changing link conditions without relying on broadcast frame transmission, which also reduces signaling overhead and mitigates network flooding, and enables bidirectional data transmission in the absence of PREQ / PREP frames. Thus, the described techniques can be implemented to achieve the ability to convert cascaded broadcast signaling into unicast messages for route discovery and for handling various routing situations and beacon-assisted information that may occur. By reducing signaling overhead and mitigating network flooding, the described aspects can also reduce network and device complexity, lower power consumption, and reduce signaling overhead, which can further lead to higher spectral efficiency, higher data rates, and greater system capacity, among other benefits.

[0061] Figure 1A schematic diagram of an example wireless communication network 100 is shown. Depending on some aspects, the wireless communication network 100 may be an example of a wireless local area network (WLAN) (such as a Wi-Fi network). For example, the wireless communication network 100 may be a network implementing at least one of the IEEE 802.11 family of wireless communication protocol standards (such as standards defined by the IEEE 802.11-2020 specification or its revisions, including but not limited to 802.11ay, 802.11ax, 802.11az, 802.11ba, 802.11bd, 802.11be, 802.11bf, and 802.11bn). In some other examples, the wireless communication network 100 may be an example of a cellular radio access network (RAN), such as a 5G or 6G RAN implementing one or more cellular protocols (such as those specified in one or more 3GPP standards). In some other examples, wireless communication network 100 may include a WLAN that operates in a manner interoperable with or converged with one or more cellular RANs to provide greater or enhanced network coverage to wireless communication devices within wireless communication network 100, or to enable such devices to connect to the core of the cellular network, such as to access network management capabilities and functionality provided by the cellular network core.

[0062] 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 (STA) 104. Although Figure 1 Only one AP 102 is shown, but the wireless communication network 100 may include multiple APs 102. AP 102 may be or represent various different types of network entities, including but not limited to home networking APs, enterprise APs, single-band APs, dual-band simultaneous (DBS) APs, tri-band simultaneous (TBS) APs, standalone APs, non-standalone APs, software-enabled APs (software APs), and multi-link APs (also known as AP multi-link devices (MLDs)), as well as cellular (such as 3GPP, 4G LTE, 5G, or 6G) base stations or other cellular network nodes, such as Node Bs, evolved Node Bs (eNBs), gNBs, Transmitter Receiver Points (TRPs), or another type of equipment or apparatus included in a radio access network (RAN), including open RAN (O-RAN) network entities, such as central units (CUs), distributed units (DUs), or radio units (RUs).

[0063] Each STA in STA 104 may also be referred to as a mobile station (MS), mobile device, mobile phone, wireless phone, access terminal (AT), user equipment (UE), subscriber station (SS), or subscriber unit, etc. STA 104 can represent a variety of devices such as mobile phones, other handheld or wearable communication devices, netbooks, laptops, tablets, laptops, Chromebooks, augmented reality (AR), virtual reality (VR), mixed reality (MR), or extended reality (XR) wireless headsets or other peripherals, wireless earbuds, other wearable devices, display devices (such as TVs, computer monitors, or video game consoles), video game controllers, navigation systems, music or other audio or stereo devices, remote control devices, printers, kitchen appliances (including smart refrigerators) or other home appliances, remote keys (such as those for passive keyless entry and start (PKES) systems), Internet of Things (IoT) devices, and vehicles, etc.

[0064] A single AP 102 and its associated set of STA 104s may be referred to as a Basic Service Set (BSS), which is managed by the respective AP 102. Figure 1 An example coverage area 108 of AP 102 is also shown, which may represent the Basic Service Area (BSA) of wireless communication network 100. The BSA can be identified by STA 104 and other devices through a Service Set Identifier (SSID) and a Basic Service Set Identifier (BSSID), which may be the Media Access Control (MAC) address of AP 102. AP 102 may periodically broadcast a beacon frame (“beacon”) including the BSSID to enable any STA 104 within the wireless range of AP 102 to “associate” or reassociate with AP 102 to establish or maintain a corresponding communication link 106 (also referred to hereinafter as a “Wi-Fi link”) with AP 102. For example, the beacon may include an identifier or indication of the primary channel used by the corresponding AP 102 and a Timing Synchronization Function (TSF) for establishing or maintaining timing synchronization with AP 102. AP 102 can provide access to external networks to various STAs 104 in the wireless communication network 100 via the corresponding communication link 106.

[0065] To establish a communication link 106 with AP 102, each STA 104 is configured to perform passive or active scanning operations (“scans”) on frequency channels in one or more frequency bands (such as 2.4 GHz, 5 GHz, 6 GHz, 45 GHz, or 60 GHz bands). To perform a passive scan, STA 104 listens for beacons transmitted by the corresponding AP 102 at periodic time intervals called Target Beacon Transmission Time (TBTT). To perform an active scan, STA 104 generates probe requests and transmits these probe requests sequentially on each channel to be scanned, and listens for probe responses from AP 102. Each STA 104 can identify, determine, detect, or select an AP 102 to associate with based on the scanning information obtained through passive or active scanning, and perform authentication and association operations to establish a communication link 106 with the selected AP 102. When the association operation is completed, the selected AP 102 assigns an association identifier (AID) to STA 104, and AP 102 uses the association identifier (AID) to track STA 104.

[0066] As wireless networks become increasingly prevalent, STA 104 may have the opportunity to choose from one of many BSSs within its range or from multiple APs 102 that together form an Extended Service Set (ESS) (comprising multiple connected BSSs). For example, wireless communication network 100 may connect to a wired or wireless distribution system that enables multiple APs 102 to connect within such an ESS. Therefore, STA 104 may be covered by more than one AP 102 and may be associated with different APs 102 at different times for different transmissions. Additionally, after associating with an AP 102, STA 104 may periodically scan its surroundings to find a more suitable AP 102 to associate with. For example, STA 104 moving relative to its associated AP 102 may perform a "roaming" scan to find another AP 102 with more desirable network characteristics, such as a larger Received Signal Strength Indicator (RSSI) or reduced traffic load.

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

[0068] In some networks, AP 102 or STA 104, or both, can support applications associated with high throughput or low latency requirements, or can provide lossless audio to one or more other devices. For example, AP 102 or STA 104 can 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 peripherals) or AR / VR / MR / XR headsets. In scenarios where users use two or more peripherals, AP 102 or STA 104 can support extended personal audio networks that enable communication with two or more peripherals. Additionally, AP 102 and STA 104 can support additional ULL applications, such as cloud-based applications with both ULL and high throughput requirements (such as VR cloud gaming).

[0069] As indicated above, in some implementations, AP 102 and STA 104 may operate and communicate according to one or more of the IEEE 802.11 wireless communication protocol family of standards (via the corresponding communication link 106). These standards define WLAN radio and baseband protocols for the physical (PHY) layer and MAC layer. AP 102 and STA 104 transmit and receive wireless communications to and from each other in the form of PHY Protocol Data Units (PPDUs) (also referred to below as "Wi-Fi communication" or "wireless packets").

[0070] Each PPDU is a composite structure comprising a PHY preamble and a payload in the form of a PHY Service Data Unit (PSDU). The information provided in the preamble can be used by the receiving device to decode subsequent data in the PSDU. In instances where PPDUs are transmitted via bonded or wideband channels, the preamble field can be copied and transmitted in each of the 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 can be used for other purposes such as packet detection, automatic gain control, and channel estimation. The legacy preamble is also typically used to maintain compatibility with legacy equipment. The format, decoding, and information provided in the non-legacy portion of the preamble are associated with the specific IEEE 802.11 wireless communication protocol to be used to transmit the payload.

[0071] AP 102 and STA 104 in wireless communication network 100 can transmit PPDUs on unlicensed spectrum, which may be a portion of the spectrum including frequency bands traditionally used by Wi-Fi technologies, such as the 2.4 GHz, 5 GHz, 6 GHz, 45 GHz, and 60 GHz bands. Some examples of AP 102 and STA 104 described herein may also communicate in other frequency bands that can support licensed or unlicensed communication. For example, AP 102 or STA 104, or both, may also be able to communicate in unlicensed operating frequency bands, where multiple operators may have corresponding licenses to operate within the same or overlapping frequency ranges. Such licensed operating bands may be mapped to or associated with the frequency ranges specified for FR1 (410MHz-7.125GHz), FR2 (24.25GHz-52.6GHz), FR3 (7.125GHz-24.25GHz), FR4a or FR4-1 (52.6GHz-71GHz), FR4 (52.6GHz-114.25GHz), and FR5 (114.25GHz-300GHz).

[0072] Each frequency band can include multiple sub-bands and frequency channels (also referred to as sub-channels). For example, PPDUs conforming to revisions of the IEEE 802.11n, 802.11ac, 802.11ax, 802.11be, and 802.11bn standards can be transmitted on one or more frequency bands in the 2.4 GHz, 5 GHz, or 6 GHz bands, each of which is divided into multiple 20 MHz channels. Therefore, these PPDUs are transmitted on physical channels with a minimum bandwidth of 20 MHz, but larger channels can be formed through channel bonding. For example, by bonding multiple 20 MHz channels together, PPDUs can be transmitted on physical channels with bandwidths of 40 MHz, 80 MHz, 160 MHz, 240 MHz, 320 MHz, 480 MHz, or 640 MHz.

[0073] In some respects, 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, 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 a wireless node within any general wireless mesh network. A wireless node may refer to or be understood as any wireless communication device capable of wireless communication other than wired communication or as an alternative to wired communication. Thus, a wireless node is not strictly a device without a wired connection, but rather a device capable of at least wireless communication. A wireless node may be an edge node (which may be equivalently referred to as a destination device) or a non-edge node (which may be equivalently referred to as a terminal device or a source device), although a wireless node may operate as an edge node or a non-edge node at different times. For example, a wireless node may sometimes operate as an edge node and sometimes as a non-edge node.

[0074] Wireless mesh networks may include various wireless nodes (such as communication devices) capable of acquiring, exchanging, and processing data. In some specific implementations, these wireless nodes may be referred to as non-edge nodes, terminal devices, edge nodes, cloud edges, cloud entities, storage nodes, processing nodes, controller nodes, etc. The terms "non-edge node" and "edge node" may be relative terms, defined or associated with one or more of the following relationships between two wireless nodes: device or node capabilities, task execution, or proximity to the 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 few processing resources or reduced processing capabilities, while an edge node may refer to a wireless node with relatively many processing resources or greater processing capabilities. Additionally or alternatively, a non-edge node may refer to a wireless node that solicits or requests processing tasks, while an edge node may refer to a wireless node that performs processing tasks. Wireless nodes (such as AP 102, STA 104, user equipment (UE), drones (including ground drones, air drones, underwater drones, or any combination thereof), routers, mobile devices (smartphones), cars, laptops, game consoles, extended reality (XR) glasses or headsets, augmented reality (AR) devices, virtual reality (VR) headsets, thermostats, sensors, IoT devices, and other consumer devices) may be used as edge nodes, non-edge nodes, or both at different times.

[0075] In some specific implementations, various wireless nodes of the wireless communication network 100 can support conditionally connected networks based on whether the wireless nodes have complementary capabilities. For example, different wireless nodes may have different capabilities, and in order to reduce the size of the routing table at each wireless node and reduce signaling overhead, the wireless nodes of the wireless communication network may selectively or conditionally establish logical paths based on (such as according to) node capabilities. For example, if two wireless nodes have complementary capabilities, the two wireless nodes may establish logical paths to each other (and include entries to each other in their respective routing tables). Alternatively, if two wireless nodes have non-complementary capabilities, the two wireless nodes may avoid establishing logical paths to each other (and exclude entries to each other in their respective routing tables).

[0076] The application layer can provide the host of a wireless node with indications of the wireless node's capabilities. In other words, the capabilities of a wireless node can be defined or otherwise indicated by the application layer of the wireless node. The application layer can support communication with another application on the network. For example, the application layer can specify shared communication protocols and interface technologies used by two or more hosts in the wireless communication network 100. The application layer enables users to transmit data, access data, and use the network. In some aspects, the host of the wireless node can obtain indications of the wireless node's capabilities, and the capabilities of the wireless node can be related to such functionality of the application layer or information that the application layer can access, or both. For example, the application layer of the wireless node can have information about the generally definable goals or use cases of the wireless node (based on, for example, user input or selection). For example, the capabilities of the wireless node can be selected based on the type of application running at the wireless node (and provided to the host via the application layer). Depending on the application layer providing these capabilities, the application layer of the wireless node can influence, impact, control, define, notify, restrict, regulate, or enable how connections involving the wireless node are made.

[0077] In some examples, a first wireless node may notify other wireless communication devices of its capabilities via a PREQ frame. In such examples, a second wireless node receiving the PREQ frame may parse the PREQ frame against the capabilities of the first wireless node, compare the first capability with the second capability of the second wireless node, and selectively reply with a PREQ frame based on whether the first and second capabilities are complementary. For example, if the first and second capabilities are complementary, the second wireless node may send a PREP frame associated with the PREQ frame, and if the first and second capabilities are not complementary, the second wireless node may avoid sending a PREP frame associated with the PREQ frame.

[0078] Figure 2 An example wireless mesh network 200 is shown illustrating communication between wireless nodes 202 within a wireless mesh network 200, the communication including a PREQ frame 206 and an associated PREP frame 208. The wireless mesh network 200 can be implemented or is implemented to achieve various aspects of the wireless communication network 100. For example, the wireless mesh network 200 illustrates communication between wireless nodes 202, which can be, for example... Figure 1 Examples of the corresponding devices or nodes illustrated and described herein. For example, wireless node 202 may be an example of AP 102, STA 104, UE, drone (including ground drones, aerial drones, underwater drones, or any combination thereof), router, mobile device, automobile, laptop computer, game console, XR glasses or headset, AR device, VR headset, thermostat, sensor, IoT device, other consumer or industrial equipment, or any combination thereof.

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

[0080] Certain device types, such as drones, are gaining increasing market attention, driving demand for greater connectivity and mesh networks with low latency delivery in multi-hop mesh networks, rapid adaptation to changing topologies, low (including zero) downtime path changes, and the ability to multicast or broadcast data (such as data generated by drones or other non-edge nodes) to multiple destination devices (such as multiple edge nodes). Wi-Fi mesh networks are common in some deployment scenarios and applications due to their ease of availability, low cost, and the convenience of having an independent network (as opposed to relying on infrastructure such as cellular networks). In some other deployment scenarios, cellular mesh networks are relatively more common. Some mesh deployments can be used for homes, carriers, enterprises, or any combination thereof, including services associated with wireless distribution or upstream meshes associated with mesh protocols such as 802.11s.

[0081] Drone and IoT use cases often operate in low bandwidth, which can amplify the overhead costs of network management compared to some traditional networks. For example, a route discovery packet with a length of 100 microseconds operating in 20MHz (in a standard mesh network) can become 400 microseconds in a 5MHz half-rate system. Therefore, a PREQ packet + PREP packet signaling across two hops, which would occupy 100 microseconds × 2 × 2 = 400 microseconds in 20MHz, becomes 400 microseconds × 2 × 2 = 1.6 milliseconds (for each potential path). This can introduce relatively high latency, which can be further complicated by aspects of some routing protocols that can lead to high overhead or suboptimal path selection, or both.

[0082] 802.11s-based mesh networks allow nodes within the mesh (such as all nodes) to establish peer-to-peer connections and communicate directly if the link strength is sufficient. Hybrid Wireless Mesh Protocol (HWMP) can be the default routing protocol in 802.11s-based networks, offering or supporting two operating modes: on-demand and active. On-demand mode can be associated with the Radio Metrics Adaptive On-Demand Distance Vector (RM-AODV) routing protocol. On-demand mode supports low-latency routing but can flood the system (e.g., overload) with numerous management frames based on the forwarding and propagation of path selection frames (such as PREQ and PREP frames). Furthermore, collisions and hidden nodes in the system can hinder on-demand path selection, as lost PREQ broadcasts may lead to suboptimal path selection. Additionally, in fully connected networks, routing table size and associated overhead can be relatively high, potentially increasing complexity and power consumption. Some 802.11s networks can use on-demand routing with PREQ broadcast frames, and this is possible for fully connected networks. This further leads to high overhead, especially in scenarios associated with rapidly changing topologies.

[0083] Active mode can be associated with tree-based routing with a root node, where the tree-based topology is created using broadcast PREQ or Root Advertisement (RNN) frames. In active mode, there may be only one root node, and the tree may be the only topology produced by active mode. Therefore, active mode is suitable for topologies that do not change, as rebuilding the tree when nodes move can be expensive. Furthermore, active nodes may lead to suboptimal path selection because nodes may not be aware of other nodes in the tree, and routing may occur via the root node.

[0084] Additionally or alternatively, some networks may employ Radio-Aware Optimized Link-State Routing (RA-OLSR), which can be associated with link-state routing protocols. RA-OLSR can support on-demand routing and may have reduced overhead compared to some 802.11s-based networks. For example, RA-OLSR can be designed to create fully connected networks with multipoint relays (MPRs), which can be a limited set of peers used to achieve connectivity. According to RA-OLSR, only MPRs can transmit (such as send) topology or routing information, thereby reducing signaling overhead. However, in systems with dynamically changing topologies, the selection of a limited set of MPRs can become complex. Furthermore, suboptimal selection of MPRs can lead to suboptimal path selection.

[0085] Therefore, in some embodiments of this disclosure, various wireless nodes 202 of the wireless mesh network 200 may support one or more signaling-based or configuration-based mechanisms associated with building routing tables to reduce a fully connected network to a conditionally connected network. In some embodiments, such mechanisms may also be associated with reducing a fully connected network to a conditionally connected network based on a set of objectives or use cases, such as user- or application-defined objectives or use cases. Additionally or alternatively, wireless nodes 202 may support one or more signaling-based or configuration-based mechanisms associated with broadcast announcements of routes to specific (such as complementary) nodes to reduce routing overhead in the wireless mesh network 200, which may reduce the overhead from message flooding that occurs when performing link rerouting.

[0086] Based on the network establishing conditional connections associated with the wireless mesh network 200, the wireless node 202 can support a mechanism for classifying the wireless node 202 and forming a conditionally connected network based on the classification of the wireless node 202. In some aspects, the classification of the wireless node 202 may involve or be associated with node capabilities 204. For example, the capabilities 204 of the wireless node 202 in the wireless mesh network 200 can be classified into two sets S1 and S2, where elements of S1 have mappings to elements of S2. In other words, each element of S1 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 S1. Sets S1 and S2 may be understood or referred to as a first capability set and a second capability set, respectively, and each set may include one or more elements (which may be referred to as capability elements).

[0087] For example, S1 can be defined such that S1 = {A, B, C, … N}, where A, B, C, … N are capabilities (such as capability elements). Similarly, S2 can be defined such that S2 = {A', B', C', … N'}, where A', B', C', … N' are capabilities (such as capability elements). The elements of S1 and S2 may be associated with the target, application, or use case associated with the wireless mesh network 200. Additionally or alternatively, the elements of S1 and S2 may be associated with the functionality or characteristics of the wireless node 202 (such as whether the wireless node 202 is a designated relay node), the geographical location associated with one or more wireless nodes 202, the geographical location associated with the wireless mesh network 200, or any other factor or characteristic associated with the wireless mesh network 200 or any particular wireless node 202 that may be related to interoperability between two or more wireless nodes 202. In some respects, the elements of S1 and S2 can be pre-configured or pre-loaded at wireless node 202 (so that the elements of S1 and S2 can be statically configured for a given target, application, or use case). Each wireless node 202 in the wireless mesh network 200 can be associated with capability 204 (such as having a capability or being defined by a capability). Capability 204 can be defined by C. i Define, where C i It is an element in the complete set of abilities C, which is defined as C = {S1, S2, S1× S2}, where "×" is the Cartesian product.

[0088] Based on some specific examples of this disclosure, if C i There exists a C j If at least one element of the mapping of elements in the matrix is ​​present, then a mapping with capability C can be established. i and C j A path is established between any two wireless nodes 202, or otherwise the path may not be established. In some respects, any two capabilities 204, including the mapping element, can be understood or referred to as complementary capabilities 204. By restricting allowed connections to wireless nodes 202 with complementary capabilities 204, the described techniques can be implemented to reduce the number of path selection frames in the wireless mesh network 200 (or any other mesh network with nodes having different capabilities 204).

[0089] In some implementations, each wireless node 202 may transmit its capabilities 204 along with a PREQ frame 206 (which may be equivalently referred to as a PREQ element, PREQ message, or PREQ packet, and may include information indicating a broadcast address). In such implementations, one or more information elements (IEs) or subfields (such as capability IE 210) of the PREQ frame 206 may include or carry information indicating the capabilities 204 of the wireless node 202 (such as by capability C). i (Defined). Capability IE 210 can be an example of one or more vendor-specific IEs. In some implementations, wireless node 202 can indicate its capabilities 204 via capability IE 210 in various ways. For example, information indicating capability 204 may include explicit indications of each capability element included in capability 204, index values ​​corresponding to capability 204, enumeration values ​​corresponding to capability 204, or any combination thereof. Furthermore, the number of available capabilities 204 may increase over time, and such explicit indications, index values, and enumeration values ​​may be updated accordingly (e.g., via signaling or via new or updated configurations). In some aspects, wireless node 202 may send PREQ frames 206 as the originating node according to a discovery process associated with wireless mesh network 200. This discovery process may be referred to as or associated with a path selection process and may include any signaling mechanism or process by which wireless node 202 discovers or selects a path to at least one other wireless node 202 in wireless mesh network 200.

[0090] If the capabilities 204 of the wireless node 202 sending PREQ frame 206 and the wireless node 202 receiving PREQ frame 206 have a mapping element (according to the mapping between S1 and S2), then each wireless node 202 in the wireless mesh network 200 can respond to PREQ frame 206 using PREP frame 208 (which may be equivalently referred to as PREP element, PREP message, or PREP packet). Otherwise, the wireless node 202 receiving PREQ frame 206 may avoid sending PREP frame 208 associated with PREQ frame 206 (such as in response to PREQ frame).

[0091] For example, wireless node 202-a may have capability 204-a (such as C iAnd can send PREQ frame 206 (making it possible for wireless node 202-a to be the original node). According to some specific implementations, wireless node 202-a may include information indicating capability 204-a in the capability IE 210 of PREQ frame 206. In an example where wireless node 202-a sends PREQ frame 206 as a broadcast PREQ frame, each wireless node 202 within range of wireless node 202-a can receive and parse PREQ frame 206. In some examples, wireless nodes 202-b and 202-c are within range of wireless node 202-a and therefore can receive PREQ frame 206, and determine whether to send the associated PREQ frame 208 based on a capability comparison.

[0092] For example, wireless node 202-b may have capability 204-b (such as C j The PREQ frame 206 can be parsed to identify the capability 204-a of the wireless node 202-a, and the PREP frame 208 can be selectively transmitted based on whether capability 204-b is complementary to capability 204-a. In the example illustrated by the wireless mesh network 200, capabilities 204-a and 204-b can be complementary, and the wireless node 202-b can correspondingly transmit the PREP frame 208 associated with the PREQ frame 206. For example, the PREQ frame 206 can indicate that the capability 204-a of the wireless node 202-a includes element A (such as video rendering), and the capability 204-b of the wireless node 202-b can include element A' (such as video generation) mapped to element A. In some specific implementations, the wireless node 202-b can include information indicating capability 204-b in one or more IEs or subfields of the PREP frame 208 transmitted by the wireless node 202-b. In such a specific implementation, both wireless node 202-a and wireless node 202-b may have a mutual understanding regarding which specific elements are mapped between capability 204-a and capability 204-b. In addition to transmitting PREP frame 208 associated with PREQ frame 206, wireless node 202-b may also transmit a forwarded (such as relayed or propagated) version of PREQ frame 206 (so that other wireless nodes 202 within range of wireless node 202-b can receive and be informed of the presence of wireless node 202-a and capability 204-a).

[0093] For another example, wireless node 202-c may have capability 204-c (such as C...). kThe PREQ frame 206 can be parsed to identify the capability 204-a of wireless node 202-a, and PREP frames 208 can be selectively transmitted based on whether capability 204-c is complementary to capability 204-a. In the example illustrated by the wireless mesh network 200, capabilities 204-a and 204-c can be non-complementary, and wireless node 202-c can accordingly avoid transmitting the PREP frame 208 associated with PREQ frame 206. Instead of transmitting the associated PREP frame 208, wireless node 202-c can transmit a forwarded (such as relayed or propagated) version of PREQ frame 206 (so that other wireless nodes 202 within range of wireless node 202-c can receive and be aware of the presence and capability 204-a of wireless node 202-a). In other words, a radio node 202 (including radio node 202-c) that cannot have element A' mapped to element A included in capability 204-a can still forward PREQ frame 206 and can act as (e.g., operate or serve as) a relay (e.g., a via point) for other radio nodes 202 that have capability 204 including element A'. For example, radio node 202-c can act as a via point for radio node 202-e, which may have capability 204 complementary to capability 204-a.

[0094] This selective transmission of PREP frames 208 associated with PREQ frames 206, based on node capabilities, reduces the number of PREP frames 208 in the wireless mesh network 200, thereby reducing overhead. For example, in the example illustrated by the wireless mesh network 200, wireless nodes 202-b and 202-e can transmit PREP frames 208 (and one or more other wireless nodes can forward those PREP frames 208), while each of wireless nodes 202-c, 202-d, 202-f, 202-g, and 202-h can avoid transmitting its own PREP frames 208 (although one or more of these wireless nodes 202 can forward PREP frames 208 transmitted by wireless nodes 202-b and 202-e). This reduction in the number of PREP frames 208 in the wireless mesh network 200 provides more airtime for other transmissions, thereby improving spectral efficiency and system capacity, and potentially reducing complexity and latency.

[0095] Figure 3Examples of goal- or use-case-based capabilities 300 are illustrated, demonstrating how node capabilities can be complementary based on a capability mapping 302 between elements 306 in a first capability set 304-a and elements 306 in a second capability set 304-b, and how node capabilities relate to elements 306 in the first capability set 304-a and the second capability set 304-b. Goal- or use-case-based capabilities 300 can be implemented to achieve or facilitate various aspects of the wireless communication network 100 and the wireless mesh network 200.

[0096] For example, capability 300 based on a target or use case exemplifies an example capability mapping 302 between capability set 304-a and capability set 304-b, each capability set in capability set 304-a and capability set 304-b including one or more elements 306 (which can be understood or referred to as capability elements). Capability set 304-a can be an example of capability set S1, and capability set 304-b can be an example of capability set S2, and capability mapping 302 can define or indicate how element 306 in capability set 304-a (S1) maps to element 306 in capability set 304-b (S2).

[0097] Capabilities 300 based on a target or use case can also exemplify a complete capability set 308, which can be an example defined as a complete capability set C such that C = {S1, S2, S1 × S2}, where "×" is a Cartesian product. Therefore, if capability set 304-a includes elements A and B, and capability set 304-b includes elements A' and B', then the complete capability set 308 can include a limited 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, a wireless node in a wireless mesh network (such as wireless node 202 of wireless mesh network 200) can select capabilities (such as according to instructions from the application layer) from the limited list of options available in the complete capability set 308.

[0098] In an example of a wireless mesh network 200 where the capabilities 204-a of wireless node 202-a and 204-b of wireless node 202-b are complementary, capability 204-a may include element B (such that C...). i = {B}), and capability 204-b may include element B' (such that C ...). j= {B'}). Therefore, based on the fact that capability 204-a includes element 306 (element B) mapped to element 306 (element B') included in capability 204-b, capability 204-a and capability 204-b can be understood as complementary to each other. In another example of a wireless mesh network 200 where capability 204-a of wireless node 202-a and capability 204-c of wireless node 202-c are not complementary, capability 204-a may include element B (such that C = {B'}). i = {B}), and capability 204-c may include elements A and B (such that C ...). k = {A, B}). Therefore, since capability 204-a does not include element 306 that maps to at least one element 306 included in capability 204-c, capability 204-a and capability 204-c can be understood as non-complementary to each other.

[0099] Table 1 below illustrates the capabilities C i And ability C j Some example combinations and whether connectivity is allowed between devices with such capabilities.

[0100]

[0101] Table 1: Two abilities C i and C j Example combinations

[0102] Furthermore, users, applications, targets, or use cases can influence or determine capabilities 300 based on those targets or use cases. For example, the complete capability set 308 reflects which specific capabilities may depend on the target or use case associated with the wireless node. In some implementations, the wireless node's host may obtain indications of the wireless node's capabilities (from a limited list of options available in the complete capability set 308) from the application layer associated with the wireless node. In such implementations, the wireless node's host may store information about the capabilities associated with the wireless node, the complete capability set 308, and the capability mapping 302. In some implementations, the wireless node's application or the application layer associated with the wireless node may expose an application programming interface (API) through which the application can view the configuration of the complete capability set 308 and identify which other wireless nodes the wireless node may connect to.

[0103] Figure 4An example of a conditionally connected network 400 is illustrated, demonstrating how a capability mapping 402, based on elements 406 in a first capability set 404-a and elements 406 in a second capability set 404-b, may allow some connections between wireless nodes 408 and how other connections between wireless nodes 408 may not be allowed. The conditionally connected network 400 may be implemented or is implemented to achieve or facilitate aspects of the capabilities 300 of the wireless communication network 100, the wireless mesh network 200, or based on objectives or use cases.

[0104] For example, a conditionally connected network 400 illustrates an example topology and the reduced number of paths for each conditionally connected routing algorithm. The conditionally connected network 400 may be associated with an example capability mapping 402 between capability sets 404-a and 404-b, where each capability set in capability sets 404-a and 404-b includes one or more elements 406 (which can be understood or referred to as capability elements). Capability set 404-a may be an example of capability set S1, and capability set 404-b may be an example of capability set S2. Capability mapping 402 may define or indicate how element 406 in capability set 404-a (S1) maps to element 406 in capability set 404-b (S2).

[0105] According to capability mapping 402, element A can be mapped to element A', element B can be mapped to element B', element C can be mapped to element C', and element N can be mapped to elements B', C', and N'. In some specific implementations, wireless node 408 (which may be collectively referred to as any one or more wireless nodes among wireless node 408-a, wireless node 408-b, wireless node 408-c, and wireless node 408-d, and which may be as follows) Figure 2 The example of wireless node 202 illustrated and described herein can conditionally establish connections (such as logical paths) between each other based on the respective capabilities 410 of each wireless node in wireless node 408 and capability mapping 402. For example, wireless node 408-a may be associated with capability 410-a including elements A and B', wireless node 408-b may be associated with capability 410-b including element B, wireless node 408-c may be associated with capability 410-c including elements A' and C, and wireless node 408-d may be associated with capability 410-d including element C'.

[0106] In such an example, wireless node 408-a may have an allowed connection 412 with wireless node 408-b based on the mapping between elements B and B' (which may be an example of a logical path, including 0, 1, 2, 3, or any other hop number between the two wireless nodes 408). Furthermore, wireless node 408-a may have an allowed connection 412 with wireless node 408-c based on the mapping between elements A and A', and wireless node 408-c may have an allowed connection 412 with wireless node 408-d based on the mapping between elements C and C'. Therefore, within the conditionally connected network 400, PREQ and PREP message transactions may occur (e.g., appear) between defined subsets of wireless nodes 408 (such as between wireless nodes 408-a and 408-b, between wireless nodes 408-a and 408-c, and between wireless nodes 408-c and 408-d).

[0107] Based on such nodes with non-complementary capabilities 410, other potential pairings of nodes can be associated with disallowed connections 414 (which can be an example of a logical path, including 0, 1, 2, 3, or any other hop count between two wireless nodes 408). For example, wireless nodes 408-a and 408-d can be associated with disallowed connections 414 because there is no mapping between element 406 of capability 410-a and element 406 of capability 410-d. Similarly, wireless nodes 408-b and 408-c can be associated with disallowed connections 414 because there is no mapping between element 406 of capability 410-b and element 406 of capability 410-c. Furthermore, wireless nodes 408-b and 408-d can be associated with disallowed connections 414 because there is no mapping between element 406 of capability 410-b and element 406 of capability 410-d. Based on capability mapping 402, redundant connections for use cases can be avoided. For example, two wireless nodes 408 that are both video generation devices can avoid establishing logical paths to each other (such as avoiding the formation of routing entries) because neither of these wireless nodes 408 has the capability to process the generated video. Instead, such wireless nodes 408 can seek to establish logical paths with video storage or streaming devices, which can be understood as being associated with capabilities more complementary to video generation.

[0108] If wireless node 408 forms a fully connected network, six connections will be established, whereas, according to the example of conditionally connected network 400, three connections will be established. Based on this reduction in the number of connections (such as by limiting connections to nodes with complementary capabilities 410 and avoiding redundant connections for specific use cases), the described techniques can be further implemented to reduce network overhead due to path selection frame switching, among other benefits. For example, according to conditionally connected network 400, if the topology changes or wireless node 408 otherwise goes offline or becomes unreachable, the propagation of path error (PERR) frames can be reduced or limited to between wireless nodes with allowed connections 412 and may not be sent by wireless devices associated with disallowed connections 414.

[0109] Figure 5 An example signaling diagram 500 is shown illustrating the propagation of a PREQ frame 504 from the original wireless node 502 through a wireless mesh network and the conditional transmission of an associated PREP frame 506 by other wireless nodes 502 in the wireless mesh network. The signaling diagram 500 may be implemented or can be implemented to achieve or facilitate aspects of wireless communication network 100, wireless mesh network 200, target or use case-based capability 300, or conditionally connected network 400.

[0110] For example, signaling diagram 500 may illustrate signaling (such as path selection frame switching) between various wireless nodes 502 within a wireless mesh network. Wireless nodes 502 (which may be collectively referred to as any one or more of wireless nodes 502-a, 502-b, 502-c, 502-d, 502-e, and 502-f) can be respectively as follows: Figure 2 and Figure 4 Examples of wireless node 202 or wireless node 408 illustrated and described herein.

[0111] Based on the selective transmission of PREP frame 506 and in the context of examples in which wireless nodes 502-b, 502-d, and 502-e have capabilities complementary to those of wireless node 502-a (which may be the original node) and in which wireless nodes 502-c and 502-f have capabilities non-complementary to those of wireless node 502-a, signaling diagram 500 illustrates the exchange of PREQ frame 504 and associated PREP frame 506.

[0112] Wireless node 502-a can be an example of the originating node and can send PREQ frame 504, which can be forwarded or propagated throughout the wireless mesh network by each of wireless nodes 502-b, 502-c, 502-d, 502-e, and 502-f. As illustrated in the example of signaling diagram 500, each iteration of PREQ frame 504 can be associated with a hop count to the originator field. This field can be incremented by each wireless node 502 that forwards PREQ frame 504, allowing each wireless node 502 to determine its hop count to the originator. This field can also be used by wireless node 502 to prevent PREQ frame 504 from looping. For example, PREQ frame 504 forwarded by wireless node 502-b can be associated with the number of hops to the initiator field value 1, PREQ frame 504 forwarded by wireless node 502-c can be associated with the number of hops to the initiator field value 2, and PREQ frame 504 forwarded by wireless node 502-d can be associated with the number of hops to the initiator field value 3.

[0113] Depending on their complementary capabilities, wireless nodes 502-b, 502-d, and 502-e may each transmit a PREP frame 506 associated with a PREQ frame 504 originating from wireless node 502-a. In some aspects, wireless node 502-b may transmit a PREP frame 506 indicating wireless node 502-b as a target (e.g., via “target B”), wireless node 502-d may transmit a PREP frame 506 indicating wireless node 502-d as a target (e.g., via “target D”), and wireless node 502-e may transmit a PREP frame 506 indicating wireless node 502-e as a target (e.g., via “target E”). Intermediate nodes between wireless node 502-a (the originating node) and each target node can forward PREP frames 506, allowing wireless node 502-a to receive (directly or indirectly via one or more transit points) PREP frames 506 from each of wireless nodes 502-b, 502-d, and 502-e. Depending on their non-complementary capabilities, wireless nodes 502-c and 502-f can avoid responding to PREQ frames 504 originating from wireless node 502-a. Wireless nodes 502-c and 502-f can transmit (such as broadcast) forwarded versions of PREQ frames 504 without transmitting the PREP frames 506 associated with PREQ frames 504, and can forward any received PREP frames 506 originating from other target nodes in the wireless mesh network.

[0114] In systems implementing mechanisms other than this conditional transmission of PREP frame 506, the PREP frame 506 instructing all radio nodes 502 can exist in the wireless mesh network, which can flood the network and lead to high signaling overhead and large, complex routing tables. For example, such a system could result in at least twelve PREP frames 506, while signaling diagram 500 could include at least six PREP frames 506 (such that the described mechanism associated with the conditional transmission of PREP frame 506 can reduce the number of PREP frames 506 in the network by approximately half in the example of signaling diagram 500).

[0115] Figure 6 An example wireless mesh network 600 is shown illustrating beacon-assisted routing via the transmission of one or more beacon frames by each wireless node 602 within the wireless mesh network 600. The wireless mesh network 600 may be implemented or be implemented to achieve or facilitate aspects of wireless communication network 100, wireless mesh network 200, target- or use-case-based capability 300, conditionally connected network 400, or signaling diagram 500. For example, the wireless mesh network 600 includes wireless nodes 602, which may generally refer to any one or more wireless nodes 602-a, 602-b, 602-c, 602-d, 602-e, and 602-n, and may be respectively as follows: Figure 2 , Figure 4 or Figure 5 Examples of wireless node 202, wireless node 408, or wireless node 502 illustrated and described herein.

[0116] Based on beacon-assisted routing, each wireless node 602 in the wireless mesh network 600 can send beacons containing routing information to other nodes in the wireless mesh network 600. For example, each wireless node 602 can send beacon frames with vendor-specific IEs containing 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 the distance from itself to each of the advertised edge nodes. Additionally or alternatively, the routing information may include the Media Access Control (MAC) identifier (ID) of the target wireless node 602 (which may be equivalently referred to as the destination node), the number of hops to the target wireless node 602, the cumulative metric to the target wireless node 602, and other parameters. When each wireless node 602 receives a beacon frame carrying such routing information, it may update its routing table 604 if the optimal path has changed or a new path needs to be added for the target wireless node 602. Upon receiving such a beacon frame, the wireless node 602 can update the routing information carried in future beacon frames sent by the wireless node 602 according to its updated routing table 604. Therefore, the wireless node 602 in the wireless mesh network 600 can propagate neighbor routing information throughout the entire wireless mesh network 600. In some aspects, each wireless node 602 can maintain more than one path for reliability and faster path switching, which can meet one or more performance metrics in some ultra-reliable deployment scenarios.

[0117] In the example illustrated by the wireless mesh network 600, wireless node 602-n may join the wireless mesh network 600 (e.g., after other wireless nodes 602), and wireless node 602-n may learn about other wireless nodes 602 (e.g., receiving routing information associated with each of the other wireless nodes 602, such as to each of the other wireless nodes) via one or more beacon frames sent by wireless node 602-b. For example, based on the received one or more beacon frames sent by wireless node 602-b, wireless node 602-n may generate or update routing table 604-n based on the routing information conveyed by the one or more beacon frames. Wireless node 602-n may send one or more beacon frames, which may include routing information to wireless node 602-n.

[0118] Wireless node 602-b can listen for (e.g., monitor and parse) one or more beacon frames transmitted by wireless node 602-n and add wireless node 602-n to its routing table 604-b. Similarly, future or subsequent beacon frames transmitted by wireless node 602-b may include routing information to wireless node 602-n. Other wireless nodes 602 in the wireless mesh network can similarly update their respective routing tables 604 and the routing information delivered by their beacon frames. For example, wireless nodes 602-a and 602-d can update their routing tables 604-a and 604-d respectively based on one or more beacon frames received from wireless node 602-b that include routing information to wireless node 602-n. Therefore, information associated with wireless node 602-n (such as routing information) can be propagated throughout the wireless mesh network 600, and wireless node 602-n can be added to routing table 604 (or entries in routing table 604).

[0119] In some implementations, instead of sending path selection frames, wireless node 602 may send and receive one or more beacon frames carrying routing information. In such implementations, wireless node 602 avoids any flooding of path selection frames and corresponding wireless mesh network 600. Furthermore, each wireless node 602 can maintain more than one path to any destination, which can contribute to faster path switching and higher reliability, which in turn supports greater connectivity, higher data rates, and fewer communication errors. In some implementations, wireless node 602 may also employ conditional routing mechanisms to limit the size of such routing-aided beacons and the size of the routing table at each wireless node in wireless node 602, as such sizes may increase if the number of wireless nodes 602 in wireless mesh network 600 increases. Such conditional routing mechanisms may include techniques associated with networks forming conditional connections, where different node types with capabilities from different subsets of the full capability set C are classified or not classified.

[0120] Figure 7 An example node-type related capability subset 700 is shown, illustrating how different node types can have capabilities from different subsets of the full capability set. The node-type related capability subset 700 can be implemented or is implemented to achieve or facilitate aspects of wireless communication network 100, wireless mesh network 200, target- or use-case-based capabilities 300, conditionally connected network 400, signaling graph 500, or wireless mesh network 600.

[0121] In some specific implementations, a node type-related capability subset 700 may be associated with a capability mapping 702 between capability set 704-a and capability set 704-b, wherein each capability set in capability set 704-a and capability set 704-b includes one or more elements 706 (which may be referred to as capability elements). Capability set 704-a may be an example of capability set S1, and capability set 704-b may be an example of capability set S2. Additional details relating to this capability mapping between different capability sets are provided by [the relevant authority / organization]. Figures 2 to 4 Examples are provided and descriptions are made with reference to them.

[0122] For example, capabilities can be assigned to each wireless node in a wireless mesh network based on a limited list of options provided by the complete capability set C. In some specific implementations, such as those involving drone mesh networks, two types of nodes can be defined or classified based on their respective capabilities. Such types of nodes can include edge nodes and non-edge nodes. In some examples, an edge node can be a node with capabilities within a second capability subset 708-b. The second capability subset 708-b can be referred to as or understood as C. e The ability within makes C e ∈ C. A non-edge node can be a node that has capabilities within the first capability subset 708-a. The first capability subset 708-a can be referred to as or understood as C. ne The ability within makes C ne ∈ C, in C ne There is no mapping between any two elements 706, and C ne ∩ C e = {} (where “{}” indicates the empty set). For example, according to the example of capability mapping 702, the first non-edge node with capability {A, B', C} may imply that there is no other non-edge node with capability including elements A', B, or C'. In other words, if {A, B', C} ∈ C ne Then A', B, or C' may not be C. ne Any element within a drone mesh network. In the example of a drone mesh network, potential use cases could include surveillance, swarming, lifting, processing, or delivery.

[0123] In the context of a drone mesh with edge nodes and non-edge nodes, edge nodes and non-edge nodes can be associated with different capabilities (such as having different capabilities) or serve different functions. For example, an edge node can be any active node in the network that has one or more control plane functions and can have any one or more of a variety of different capabilities. Such different capabilities can be associated with different types of nodes or devices, including drone controllers (such as devices that generate instructions for drone movement), video streaming screens (which can be associated with rendering capabilities and are equivalently referred to as rendering devices), video storage devices, or gateways to the cloud (which can be controllers, storage devices, or video rendering devices). A non-edge node can be any node in the network that is not configured or operated as an edge node and can have any one or more of a variety of different capabilities. Such different capabilities can include video generation, telemetry data generation, or sense data generation, etc. Furthermore, as described herein, a forward path (such as a forward logical path) can refer to a path from a non-edge node to an edge node, and a reverse path (such as a reverse logical path) can refer to a path from an edge node to a non-edge node.

[0124] In some implementations, each wireless node may advertise its type and associated capabilities (such as capability element 706) via one or more beacon frames. Therefore, non-edge nodes (such as each non-edge node) may have routes to one or more edge nodes (such as each edge node) in the network that have matching capabilities (according to capability mapping 702 and the formation of a conditionally connected network). In some aspects, a non-edge node may not have an entry in its routing table for another non-edge node (unless that other non-edge node is a via point in the reverse path of another non-edge node). Furthermore, edge nodes (such as each edge node) may have routes to one or more nodes in the network (such as each other node, including edge nodes and non-edge nodes) (according to capability mapping 702 and C). ne and C e (Definition). Such connection or path establishment processes can significantly reduce the size of routing tables, including allowing multiple root nodes to exist in the network, at least at non-edge nodes, and allowing the creation of forward paths (non-edge to edge) without flooding the network with cascading broadcast messages (such as PREQ and / or PREP frames).

[0125] In some implementations, a wireless node may advertise routing information to all other wireless nodes via one or more beacon frames. In other implementations, such as those based on node type information included in the beacon frame, a wireless node may advertise routing information to a limited set of relevant nodes (e.g., only edge nodes). In other words, the beacon frame may include routing information to wireless nodes with complementary capabilities (relative to the broadcast node's capabilities) and may exclude routing information to wireless nodes with non-complementary capabilities (relative to the broadcast node's capabilities). In such implementations, the number of nodes advertised in the beacon frame can be significantly reduced, thereby reducing signaling overhead and leaving more space in the beacon frame for other information. In some implementations, and according to such beacon transmission mechanisms, non-edge nodes may avoid maintaining routing table entries to other non-edge nodes in the network.

[0126] Figure 8 An example beacon-assisted route 800 is illustrated, illustrating the sequence of steps by which various wireless nodes 802 in a wireless mesh network can establish logical paths to edge nodes. The beacon-assisted route 800 can be implemented or is implemented to achieve or facilitate aspects of wireless communication network 100, wireless mesh network 200, target- or use-case-based capabilities 300, conditionally connected network 400, signaling graph 500, wireless mesh network 600, or a subset of node-type-related capabilities 700. In some implementations, the beacon-assisted route 800 may illustrate how a wireless node can obtain routing information to one or more other wireless nodes in the wireless mesh network via one or more beacon frames. Furthermore, in some implementations, the beacon-assisted route 800 may illustrate examples of forward path selection processes.

[0127] In the example of beacon-assisted route 800, wireless node 802-a can be an example of an edge node (“A” edge = Ae), and wireless nodes 802-b, 802-c, 802-d, 802-e, and 802-f can be examples of non-edge nodes. Wireless node 802 can be, respectively, as shown by... Figure 2 , Figure 4 , Figure 5 or Figure 6 Examples of wireless node 202, wireless node 408, wireless node 502 or wireless node 602 illustrated and described.

[0128] In the example of beacon-assisted routing 800, the hop count (which may be referred to as HopCount) can be indicated in each arrow, and each non-edge node can select a path to an edge node (such as wireless node 802-a) based on routing information advertised in one or more beacons sent by at least a subset (if not all) of wireless nodes 802. In some aspects, wireless nodes 802-b, 802-c, and 802-d can act as transit points to wireless node 802-a. In some implementations, routing information to wireless node 802-a (the edge node) is advertised only in the beacon frames of each node. Furthermore, at the end of forward path selection, all wireless nodes 802 may have routes capable of having entries only to edge nodes (such as only to wireless node 802-a). In some deployments, non-edge nodes may maintain more than one path to the edge node in sorted cost order. According to the beacon-assisted routing 800, one or more wireless nodes 802 can generate a routing table based on power-on, establishing an initial connection and / or receiving one or more beacon frames from neighboring wireless nodes 802.

[0129] As described herein, “generating” a routing table may include building or generating a routing table from scratch (making the generated routing table entirely new) or updating a routing table (making the routing table include new or updated routing information relative to a previous version of the routing table). Updating a routing table may include adding routing information to the routing table (such as adding a new entry) or editing or modifying previously included routing information in the routing table (such as editing or modifying an existing entry).

[0130] At 804, according to the forward path selection process shown by beacon-assisted routing 800, wireless nodes 802-a and 802-b may appear (e.g., become active or come into range). Wireless node 802-b may form a forward path to wireless node 802-a, and may begin advertising wireless node 802-a in one or more beacon frames sent by wireless node 802-b.

[0131] At 806, wireless node 802-c may appear (e.g., become active or come into range). Wireless node 802-c may form a forward path to wireless node 802-a based on routing information beaconized by wireless node 802-b, and may begin advertising wireless node 802-a in one or more beacon frames sent by wireless node 802-c.

[0132] At 808, wireless node 802-f may be present (e.g., connected). Wireless node 802-f may not be in the neighborhood (e.g., within range) of any other wireless node 802 connected to wireless node 802-a. Therefore, no route needs to be added at 808.

[0133] At 810, wireless node 802-d may appear (e.g., become active or come into range). Wireless node 802-d may form a forward path to wireless node 802-a based on routing information beaconed by wireless node 802-c, and may begin advertising wireless node 802-a in one or more beacon frames sent by wireless node 802-d. Wireless node 802-f, which is within range of wireless node 802-d, may form a forward path to wireless node 802-a via wireless node 802-d (and based on routing information beaconed by wireless node 802-d). Wireless node 802-f may begin advertising wireless node 802-a in one or more beacon frames sent by wireless node 802-f.

[0134] At 812, wireless node 802-e may appear (e.g., become active or come into range). Wireless node 802-e may form a forward path to wireless node 802-a and begin advertising wireless node 802-a in one or more beacon frames transmitted by wireless node 802-e. In some aspects, wireless node 802-d, which may be within range of wireless node 802-e, may receive one or more beacon frames transmitted by wireless node 802-e. In such aspects, wireless node 802-d may evaluate cost metrics and may select wireless node 802-c or wireless node 802-e as a waypoint to reach wireless node 802-a. In the example shown in beacon-assisted routing 800, wireless node 802-d may select wireless node 802-c as a waypoint to reach wireless node 802-a.

[0135] Beacon-assisted routing can be employed by two or more wireless nodes 802 to facilitate forward path selection. In other words, wireless node 802 can select one or more forward paths to one or more other wireless nodes 802 based on beacon-assisted routing, including the propagation of one or more beacon frames throughout the wireless mesh network, each beacon frame containing the latest routing information associated with the wireless mesh network. To select a reverse path, two or more wireless nodes 802 can utilize or employ another frame exchange, such as the transmission of one or more pilot frames via the selected forward path. In some examples, the pilot frame may be understood or referred to as a Hello frame.

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

[0137] In the example of beacon-assisted routing 800, at 812, wireless node 802-d and the via point between wireless node 802-d and wireless node 802-a may exchange one or more frames as part of reverse path selection. For example, wireless node 802-d may send a Hello frame (such as a Hello packet or Hello element, and which may be an example of a unicast frame). Wireless node 802-c may receive the packet. In some specific implementations, wireless node 802-c may update its routing table based on the routing information conveyed by the Hello frame. For example, wireless node 802-c may add a routing table entry that includes information indicating wireless node 802-d as the destination and information indicating wireless node 802-d as the next hop to the destination (since there may not be any relay nodes involved). Wireless node 802-c may send a forwarded (such as a relayed) version of the Hello frame. In other words, upon receiving a Hello frame, each wireless node 802 can update its routing table to the originator of the Hello frame, update the cost metric, and further propagate the Hello frame.

[0138] Wireless node 802-b can receive Hello frames from wireless node 802-c and can update its routing table based on the routing information conveyed in the Hello frames. For example, wireless node 802-b can add routing table entries that include information indicating wireless node 802-d as the destination and information indicating wireless node 802-c as the next hop to the destination (since wireless node 802-c can be a transit point). Wireless node 802-b can also send forwarded (e.g., relayed) versions of the Hello frames.

[0139] Wireless node 802-a can receive Hello frames from wireless node 802-b and can update its routing table based on the routing information conveyed in the Hello frames. For example, wireless node 802-a can add routing table entries that include information indicating wireless node 802-d as the destination and information indicating wireless node 802-b as the next hop to the destination (since wireless node 802-b can be a via point). Reverse path selection can be performed based on wireless node 802-a receiving Hello frames and updating its routing table. Additionally, in some implementations, wireless node 802-d may include multiple edge nodes as target nodes in the Hello frames. Furthermore, in some implementations, wireless node 802-d may send Hello frames to more than one node (such as both wireless nodes 802-c and 802-e) to establish multiple paths to wireless node 802-a (such as sorted according to the metric of each path). Path.

[0140] Figure 9 An example process flow 900 is shown illustrating a sequence of steps by which a wireless node can generate a routing table, update a routing table, advertise routing information, establish forward and reverse paths, or any combination thereof, using beacon-assisted routing. Process flow 900 can be implemented or is implemented to achieve or facilitate aspects of wireless communication network 100, wireless mesh network 200, target- or use-case-based capabilities 300, conditionally connected network 400, signaling graph 500, wireless mesh network 600, node-type-related subset of capabilities 700, or beacon-assisted routing 800.

[0141] In some implementations, 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 switching. The steps of process flow 900 may be performed by a wireless node as described herein. The following alternative examples may be implemented, some of which may be performed in a different order than described or not at all. In some examples, the steps may include additional features not mentioned below, or additional steps may be added.

[0142] At position 902, the wireless node can be powered on, and at position 904, the wireless node can listen to (such as monitor and resolve) one or more neighbor beacons. In some implementations, such neighbor beacons may include routing information, indications of node type, information indicating node capabilities, or any combination thereof.

[0143] At 906, based on the received beacon frame including neighbor routing information, the wireless node can update the metric of each edge node in the neighbor information. At 908, in some examples, the wireless node can update its routing table, such as when the neighbor routing information indicates a new path or a path with a better (e.g., lower) metric.

[0144] At 910, the wireless node can advertise updated neighbor routing information in one or more beacons sent by the wireless node. At 912, the wireless node can detect or determine its node type and select the next step accordingly. For example, if the wireless node is an edge node, it can return to monitoring one or more other neighbor beacons. Alternatively, if the wireless node is a non-edge node, it can determine whether a new or updated path exists and select the next step accordingly.

[0145] For example, at 914, the wireless node can determine whether a new or newer path exists (such as one that exists in the wireless node's routing table, and whether it is newer or newer than a previous version of the wireless's routing table before receiving a beacon frame carrying neighbor routing information). If no new or newer path exists, the wireless node can return to monitoring one or more other neighbor beacons. If a new or newer path exists, the wireless node can transmit (such as send) a Hello frame at 916 to establish a reverse path.

[0146] Therefore, wireless nodes can avoid sending or receiving path selection frames, and consequently avoid any corresponding flooding of the network. Furthermore, according to this beacon-assisted routing, forward path selection, and reverse path selection, nodes can (always) synchronize with the optimal path (such as the path with the lowest metric) without using periodic path selection frames, which further reduces signaling overhead and system complexity, and increases flexibility (including regarding device mobility) and reliability. According to the described beacon-assisted routing, bidirectional data transmission can occur in the absence of PREQ and PREP frames (messages). Furthermore, if the topology changes, routes (such as paths) can 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 can be able to establish routes (such as paths) with low latency based on receiving routing information via one or more neighboring node beacons (with or without PREQ / PREP frame exchange).

[0147] Furthermore, because interruptions or alterations to the optimal path propagation through a wireless mesh network can increase latency if the hop count is high (with the benefit of reduced network overhead), wireless nodes (or the wireless mesh network) can choose between the use of PREQ and PREP frames (which can be associated with lower latency at the cost of network overhead) and beacon-assisted routing based on one or more criteria, such as the number of wireless nodes in the wireless mesh network, the highest known hop count, or the average hop count. This selection between beacon-assisted routing and PREQ / PREP frame switching can occur at initial setup, can be static, or can be dynamically updated over time. For example, wireless nodes in a wireless mesh network can switch back and forth between capability-based beacon-assisted routing and capability-based PREQ / PREP frame switching based on one or more criteria, such as whether a parameter meets a threshold. This parameter can represent or indicate the number of wireless nodes in the wireless mesh network, the highest known hop count, or the average hop count.

[0148] Additionally or alternatively, some wireless mesh networks may integrate or otherwise utilize a combination of beacon-assisted routing and PREQ / PREP frame switching to achieve the advantages described herein, while balancing network overhead, complexity, latency, reliability, and other factors over time. In some specific implementations, for example, wireless nodes in a wireless mesh network may utilize beacon-assisted routing (by sending one or more beacon frames indicating any or more of node type, routing information, or capability information) during the early stages of the wireless mesh network (such as according to or during a period associated with initial setup), and may utilize PREQ / PREP frame switching during later stages of the wireless mesh network (such as according to or during a period after initial setup), where capability information is indicated via PREQ frames and conditional PREP frames. Thus, wireless nodes may send beacon frames when they arrive (when they are connected or powered on, or when they are otherwise activated), establish an initial logical path and build an initial routing table based on the propagated beacons, and update the routing table over time based on PREQ / PREP frame switching.

[0149] Alternatively, wireless nodes in a wireless mesh network may utilize PREQ / PREP frame exchange during the early stages of the wireless mesh network, where capability information is indicated via PREQ and conditional PREEP frames, and may utilize beacon-assisted routing during the later stages of the wireless mesh network. Thus, wireless nodes can participate in PREQ / PREP frame exchange, establish initial logical paths and construct initial routing tables based on this exchange, and update the routing tables over time based on propagated beacons. Additionally or alternatively, wireless nodes in a wireless mesh network may utilize capability-based beacon-assisted routing simultaneously with capability-based PREQ / PREP frame exchange. Additionally or alternatively, wireless nodes may send PREQ frames (including information indicating the wireless node's capabilities) upon initial contact with the wireless mesh network, and thereafter may send and receive beacon frames carrying routing information, indications of node types, indications of node capabilities, or any combination thereof.

[0150] Additionally or alternatively, wireless nodes in a wireless mesh network may utilize one or both of capability-based PREQ / PREP frame switching or capability-based beacon-assisted routing during initial setup, and may subsequently perform one or more other (conditional) routing procedures during a path recovery process (which may be equivalently referred to as a link recovery process). For example, wireless nodes in a wireless mesh network may employ a path recovery process (such as via signaling notification or otherwise) to re-establish a data path upon detecting and / or identifying a link loss or path change, wherein such a path recovery process involves sending and propagating a pilot frame (such as a Hello frame) via a selected forward path, wherein the pilot frame carries routing information related to the link loss or path change (such as being potentially interrupted by or otherwise associated with the link loss or path change).

[0151] A wireless node receiving such a pilot frame can update its corresponding routing table based on the routing information conveyed by the pilot frame. In an example where the wireless node employs beacon-assisted routing, information indicating such routing table updates can be transmitted via one or more beacon frames. Additionally or alternatively, the path recovery process may include capability-based PREQ / PREP frame switching and / or capability-based PERR frame transmission (wherein such capability-based PERR frame transmission is associated with PERR frames that include or otherwise convey capability information).

[0152] Figure 10An example signaling diagram 1000 illustrates a path recovery process in which various wireless nodes 1002 in an exemplary wireless mesh network can re-establish data paths based on the transmission and propagation of a guide frame carrying routing information. The signaling diagram 1000 can be implemented or facilitated in various aspects of wireless communication network 100, wireless mesh network 200, target- or use-case-based capabilities 300, conditionally connected network 400, signaling diagram 500, wireless mesh network 600, node-type-related capability subset 700, or beacon-assisted routing 800.

[0153] As described herein, a reference to wireless node 1002 can be understood as a reference to any one or more of wireless nodes 1002-a, 1002-b, 1002-c, 1002-d, 1002-e, 1002-f, 1002-g, and 1002-h. Therefore, signaling diagram 1000 can illustrate a wireless mesh network topology with eight wireless nodes 1002. Wireless nodes 1002 can be respectively as follows: Figure 2 , Figure 4 , Figure 5 , Figure 6 or Figure 8 Examples of wireless node 202, wireless node 408, wireless node 502, wireless node 602 or wireless node 802 illustrated and described herein.

[0154] In some systems, where the hop count is relatively high, disruptions or changes in the optimal path propagated throughout the network can introduce or increase latency because each node continuously monitors link quality and, if a link is lost, each node can indicate a path error with a list of potentially unreachable destinations. Such path errors can be indicated via a PERR frame (which can be equivalently referred to as a PERR message), which can be propagated to all nodes using the initiator (such as the originator of the PERR frame) as a transit point to any destination listed in the PERR frame. In some systems, upon receiving a PERR frame, each node can decide (e.g., identify, select, or otherwise determine) to perform a path selection process according to an on-demand routing protocol (such as the RM-AODV routing protocol), an active routing protocol, or a link-state routing protocol (such as via RA-OLSR). Such routing protocols implemented after the propagation of the PERR frame can be expensive. In other words, the propagation of error messages and subsequent path selection processes can be costly, at least in terms of signaling overhead, power consumption, or latency. Furthermore, the number of messages or frames exchanged in such systems can grow exponentially with the number of nodes and parallel paths, which can hinder scalability by exacerbating the aforementioned costs.

[0155] Therefore, in some implementations, signaling diagram 1000 may illustrate how wireless node 1002 recovers a path or link (which may include the recovery of a routing table) upon detecting and / or identifying a disconnected, lost, or failed link with lower signaling overhead. Furthermore, according to the example implementation illustrated in signaling diagram 1000, wireless node 1002 may employ techniques associated with reducing the overhead of a routing protocol that includes establishing forward paths, reverse paths, and rerouting during a disconnected link condition or scenario. For example, upon detecting and / or identifying a link loss or path change, each wireless node 1002 may select a forward path to an edge node (such as all edge nodes) where the disconnected link is "via a path" (such as a relay path). In some implementations, such wireless node 1002 may select a forward path based on 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).

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

[0157] Another wireless node 1002 can receive Hello frame 1004 and update its routing table for the initiator (such as the initiator of Hello frame 1004) and other wireless nodes 1002 indicated in Hello frame 1004. In other words, the routing table can be updated at wireless nodes 1002 along the path of Hello frame 1004, for the initiator and other wireless nodes 1002 indicated in Hello frame 1004. In some implementations, wireless node 1002 may send and propagate this Hello frame 1004 (which may be a unicast frame) instead of broadcasting path selection frames (such as PREQ and / or PREP frames). Based on the routing table update performed according to Hello frame 1004, the content of subsequent beacon frames (such as the routing information they carry) can be updated according to the modified path, and any wireless node 1002 can independently decide to change the optimal (such as the selected) path.

[0158] In some respects, this propagation via a modified (recovery) path through one or more beacon frames (such as...) Figures 6 to 9(As illustrated and with reference to its description) can help limit the number of messages transmitted immediately during a link-down event and can distribute the total number of messages in the system over time, which can reduce network flooding. In addition, this use of beacon frames to deliver the modified (restored) path can help limit the rerouting overhead to the wireless node 1002 associated with the rerouting (after the link-down event).

[0159] In the example of signaling diagram 1000, the link between wireless node 1002-c and wireless node 1002-b may be lost (e.g., disconnected or unavailable), potentially causing the data path between wireless node 1002-c and wireless node 1002-a (which could be an example of an edge node) to be lost as well. Wireless node 1002-c may trigger a path recovery process based on the loss of the link between wireless node 1002-c and wireless node 1002-b. In the example where wireless node 1002-c broadcasts a path selection frame to restore the data path to wireless node 1002-a, the wireless nodes 1002 in the wireless mesh network may ultimately send a relatively large number of PREQ, PREP, and PERR frames, which could potentially grow exponentially if the number of wireless nodes 1002 or the number of parallel paths increases.

[0160] According to some example implementations of this disclosure, in connection with detecting, measuring, and / or identifying a failure in the link between wireless node 1002-c and wireless node 1002-b, wireless node 1002-c may select a forward path to wireless node 1002-a based on one or more beacon frames from one or more neighboring wireless nodes 1002. In some aspects, wireless node 1002-c may select a forward path to wireless node 1002-a via wireless node 1002-d based on one or more beacon frames. Wireless node 1002-c may send a Hello frame 1004 to wireless node 1002-a via the selected forward path. Furthermore, in some implementations, wireless node 1002-c may include a routing table for wireless node 1002-a in the Hello frame 1004, wherein such a routing table indicates routes to, for example, wireless nodes 1002-e, 1002-g, and 1002-h.

[0161] Hello frame 1004 can be propagated in the selected forward path, and wireless node 1002 in the forward path can update the routing information of wireless nodes 1002-c, 1002-e, 1002-g, and 1002-h. For example, wireless node 1002-d can receive Hello frame 1004, update its routing table according to the routing information carried by Hello frame 1004, and send (such as relaying or propagating) Hello frame 1004 to wireless node 1002-b. Wireless node 1002-b can receive Hello frame 1004, update its routing table according to the routing information carried by Hello frame 1004, and send (such as relaying or propagating) Hello frame 1004 to wireless node 1002-a. Wireless node 1002-a (edge ​​node) can receive Hello frame 1004 and update its routing table according to the routing information carried by Hello frame 1004. Therefore, according to the example implementation illustrated in signaling diagram 1000, three Hello frames 1004 may be sufficient to re-establish the route between wireless node 1002-c and wireless node 1002-a. Depending on the use of unicast frames (such as unicast packets or messages), the number of frames can remain relatively stable or low and does not increase exponentially with more wireless nodes 1002 or more paths.

[0162] In some implementations, wireless node 1002-c and other wireless nodes 1002 within the wireless mesh network may allow subsequent beacon frames to propagate updated (post-link disconnection event) routing information throughout the wireless mesh network. For example, based on updates to the corresponding routing tables by wireless nodes 1002-d, 1002-b, and 1002-a, each of these wireless nodes 1002 may subsequently transmit information indicating the corresponding updated routing table via beacon frames (e.g., by...). Figures 6 to 9 (As illustrated and described herein). In some other specific implementations, in addition to the Hello frame 1004, the wireless node 1002-c may also send a path change frame 1006, which may be an example of broadcasting a path change / error message or packet and may be propagated to the wireless node 1002 affected by the link disconnection event (by including a destination identifier corresponding to the affected wireless node 1002). In some examples, the controller of the wireless node 1002-c or the wireless mesh network may select between beacon-assisted routing and the transmission of the path change frame 1006 to balance signaling overhead and latency (where beacon-assisted routing provides lower signaling overhead, while the transmission of the path change frame 1006 provides lower latency).

[0163] The path change frame 1006 may be accompanied by new costs and hop counts to reach the destination to which it was transmitted. Such a destination may include one or more edge nodes, with the wireless node 1002 that sent the path change frame 1006 being a transit point to those edge nodes. In some aspects, each wireless node 1002 may perform a selection of the optimal path based on the received path change frame 1006. In some aspects, each wireless node 1002 may wait for a predefined (such as pre-configured, pre-loaded, or previously indicated) time period before it can initiate a path selection process. For example, such a predefined time period may be one or more beacon intervals, which allows multiple copies of the path change frame 1006 to be received by any given wireless node 1002, which in turn allows such a wireless node 1002 to make relatively more informed path selections (because multiple instances of the path change frame 1006 may be received over time according to their propagation through different arrangements of wireless nodes 1002 in the wireless mesh network). According to the completed path selection process, if the path between wireless node 1002 and another wireless node 1002 has changed, then wireless node 1002 can send a Hello frame 1004 to establish a reverse path. In some aspects, loop avoidance associated with the path change frame 1006 can be associated with the HopCount and sequence number fields carried in the path change frame 1006.

[0164] In the example of signaling diagram 1000 in which wireless node 1002-c selects to send path change frame 1006, wireless node 1002-c may attach modified cost and hop count to path change frame 1006 to reach wireless node 1002-a (edge ​​node). Wireless nodes 1002-e, 1002-g, and 1002-h (which can receive path change frame 1006) may perform path selection based on the modified metrics (including cost and hop count) and perform actions accordingly. Such actions may include selecting the best, suitable, or preferred path to wireless node 1002-a, taking into account both the information transmitted via path change frame 1006 and other available routing information (such as other routing information received via one or more beacon frames sent by neighboring wireless nodes 1002 or exchanged via one or more PREQ / PREP frames).

[0165] Figure 11 A block diagram of an example wireless communication device 1100 is shown, supporting the formation of conditionally connected networks in a wireless mesh deployment scenario via capability-based PREQ / PREP frame switching, capability-based beacon-assisted routing, or any combination thereof. In some examples, the wireless communication device 1100 is configured to perform respective references Figure 12 , Figure 13 , Figure 14 and Figure 15 The processes described are 1200, 1300, 1400, and 1500. 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 other components of wireless communication device 1100 and typically processes information (such as inputs or signals) received from and outputs information (such as outputs or signals) to such other components. In some aspects, an example chip may include a processing system, a first interface for outputting or transmitting information, and a second interface for receiving or acquiring information. For example, the first interface may refer to an interface between the chip's processing system and a transmitting component, enabling wireless communication device 1100 to transmit information output from the chip. In such examples, the second interface may refer to an interface between the chip's processing system and a receiving component, enabling wireless communication device 1100 to receive information, which is then passed to the processing system. In some such examples, the first interface may also, for example, acquire information from the transmitting component, and the second interface may also, for example, output information to the receiving component.

[0166] The processing system of the wireless communication device 1100 includes processor (or “processing”) circuitry in the form of one or more processors, microprocessors, processing units (such as a central processing unit (CPU), graphics processing unit (GPU), or digital signal processor (DSP)), processing blocks, application-specific integrated circuits (ASICs), programmable logic devices (PLDs) (such as field-programmable gate arrays (FPGAs)), or other discrete gate or transistor logic components or circuits (all of which are generally referred to herein individually as “processors” or collectively as “processors” or “processor circuitry”). One or more of these processors may be individually or collectively configured to perform the various functions or operations described herein. The processing system may also include memory circuitry in the form of one or more memory devices, memory blocks, memory elements, or other discrete gate or transistor logic components or circuitry, each of which may include tangible storage media such as random access memory (RAM) or ROM or combinations thereof (all of which are generally referred to herein individually as “memory” or collectively as “memory” or “memory circuitry”). One or more of these memories may be coupled to one or more processors and may store processor-executable code, individually or collectively, which, when executed by the one or more processors, configures the one or more processors to perform the various functions or operations described herein. In some embodiments, one or more memories may be configured to store processor-executable code, which, when executed, configures the one or more processors to perform the various functions described herein (as part of a processing system). In some other embodiments, the processing system may be pre-configured to perform the various functions described herein.

[0167] Additionally or alternatively, in some examples, one or more processors in the processing system may be pre-configured to perform the various functions or operations described herein without requiring software configuration. The processing system may also include, or be coupled to, one or more modems (such as Wi-Fi (e.g., IEEE compliant) modems or cellular (e.g., 3GPP 4G LTE, 5G, or 6G compliant) modems). In some embodiments, one or more processors in the processing system include or implement one or more modems in the modems. The processing system may also include, or be coupled to, multiple radio components (collectively, “radio components”), multiple RF chains, or multiple transceivers, each of which may in turn be coupled to one or more antennas in a plurality of antennas. In some embodiments, one or more processors in the processing system include or implement one or more of the radio components, RF chains, or transceivers.

[0168] In some examples, the wireless communication device 1100 may be configured or be configured for use in a wireless node, such as referring to [references to other methods]. Figure 2 , Figure 4 , Figure 5 , Figure 6 or Figure 8 The described wireless node is any of the wireless nodes 202, 408, 502, 602, or 802. In some other examples, the wireless communication device 1100 may be a wireless node including such a processing system and other components including multiple antennas. The wireless communication device 1100 is capable of transmitting and receiving wireless communications, for example, in the form of wireless packets. For example, the wireless communication device 1100 may be configured 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 wireless communication protocol standard family. In some other examples, the wireless communication device 1100 may be configured or configured to transmit and receive signals and communications conforming to one or more 3GPP specifications, including specifications for 5G NR or 6G. In some examples, the wireless communication device 1100 also includes one or more application processors or is coupled to one or more application processors, which may be further coupled to one or more other memories. In some examples, the wireless communication device 1100 also includes a user interface (UI) (such as a touchscreen or keypad) and a display that may be integrated with the UI to form a touchscreen display coupled to the processing system. In some examples, the wireless communication device 1100 may also include one or more sensors, such as one or more inertial sensors, accelerometers, temperature sensors, pressure sensors, or altitude sensors coupled to the processing system. In some examples, the wireless communication device 1100 also includes at least one external network interface coupled to the processing system, which enables communication with the core network or backhaul network implementing the wireless communication device 1100 to obtain access to external networks, including the Internet.

[0169] 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. A portion of one or more of the path discovery component 1125, routing table component 1130, application layer component 1135, and node type component 1140 may be implemented at least partially in hardware or firmware. For example, one or more of the path discovery component 1125, routing table component 1130, application layer component 1135, and node type component 1140 may be implemented at least partially by at least one processor or modem. In some examples, a portion of one or more of the path discovery component 1125, routing table component 1130, application layer component 1135, and node type component 1140 may be implemented at least partially by a processor and software in the form of processor-executable code stored in memory.

[0170] According to examples disclosed herein, wireless communication device 1100 may support wireless communication. Path discovery component 1125 can be configured or configured to send a path request frame according to a path discovery process associated with a wireless mesh network, the path request frame including information indicating a first capability associated with a first wireless node. In some examples, path discovery component 1125 can be configured or configured to receive a path response frame associated with the path request frame, the path response frame including information indicating a second wireless node within the wireless mesh network, and the path response frame indicating, based on its association with the path request frame, that a second capability associated with the second wireless node is complementary to the first capability. Routing table component 1130 can be configured or configured to generate a routing table to include logical paths between the first and second wireless nodes based on the complementarity of the second capability associated with the second wireless node and the first capability associated with the first wireless node.

[0171] In some examples, application layer component 1135 can be configured or configured to obtain an indication of the first capability from an application layer associated with the first wireless node, wherein sending a path request frame including the information indicating the first capability is associated with obtaining the indication of the first capability from the application layer.

[0172] In some examples, path routing involving the first wireless node is associated with application layer information, based on indications of the first capability provided by the application layer.

[0173] In some examples, the path discovery component 1125 can be configured or configured to send information indicating the first capability via one or more information elements or subfields of the path request frame.

[0174] In some examples, path discovery component 1125 can be configured or configured to receive a set of multiple path response frames associated with a path request frame. The set of path response frames includes information indicating a set of multiple wireless nodes within a wireless mesh network, and the path response frames, based on the association of the set of multiple path response frames with the path request frame, indicate a corresponding capability associated with each wireless node in the set of multiple wireless nodes that is complementary to a first capability. In some examples, routing table component 1130 can be configured or configured to generate (such as establish or include) corresponding logical paths between a first wireless node and each wireless node in the set of multiple wireless nodes in a routing table based on the corresponding capabilities of each wireless node in the set of multiple wireless nodes and the first capability complementarity associated with the first wireless node.

[0175] In some examples, a first capability includes one or more first capability elements, and a second capability includes one or more second capability elements. In some examples, the first capability is complementary to the second capability, provided that at least one of the one or more first capability elements has a mapping to at least one of the one or more second capability elements.

[0176] In some examples, the one or more first capability elements and the one or more second capability elements are within a complete set of capabilities associated with the wireless mesh network. In some examples, the complete set of capabilities includes a first set of multiple capability elements in the first capability set, a second set of multiple capability elements in the second capability set, and a Cartesian product of the first set of multiple capability elements in the first capability set and the second set of multiple capability elements in the second capability set.

[0177] In some examples, the first set of multiple capability elements in the first capability set is mapped to the second set of multiple capability elements in the second capability set, and each capability element in the first capability set is mapped to at least one capability element in the second capability set, and each capability element in the second capability set is mapped to at least one capability element in the first capability set.

[0178] 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 indicates a non-edge node, and the first subset of capabilities excludes elements that can be mapped to each other based on the first subset of capabilities associated with non-edge nodes.

[0179] In some examples, the one or more first capability elements include video generation capabilities, and the one or more second capability elements include video rendering or storage capabilities, wherein the video generation capability is mapped to the video rendering or storage capability according to the mapping.

[0180] In some examples, the one or more first capability elements include a sense data generation capability, and the one or more second capability elements include a device controller capability, the sense data generation capability being mapped to the device controller capability according to the mapping.

[0181] In some examples, the path discovery component 1125 can be configured or configured to send information indicating (of the first wireless node) the routing table via a beacon frame. The routing table includes a corresponding identifier for each of one or more target wireless nodes, a corresponding hop count to each of the one or more target wireless nodes, and a corresponding cumulative path metric to each of the one or more target wireless nodes, which includes at least the second wireless node.

[0182] In some examples, path discovery component 1125 can be configured or configured to receive information indicating a second routing table via beacon frames. This second routing table includes a corresponding identifier for each of one or more target wireless nodes, a corresponding hop count to each of the one or more target wireless nodes, and a corresponding cumulative path metric to each of the one or more target wireless nodes. In some examples, routing table component 1130 can be configured or configured to update the routing table (of the first wireless node) at least in part based on the new logical path associated with the target wireless node indicated by the second routing table.

[0183] In some examples, the node type component 1140 can be configured or configured to transmit via a beacon frame an indication of the node type of the first wireless node and information indicating the first capability associated with the first wireless node.

[0184] In some examples, the node type component 1140 can be configured or configured to receive, via a beacon frame, an indication of the node type of the second wireless node and information indicating the second capability associated with the second wireless node.

[0185] In some examples, the path discovery component 1125 can be configured or configured to receive a guide frame via a selected forward logical path between the first wireless node and the second wireless node, associated with the propagation of one or more beacon frames in the wireless mesh network. In some examples, the routing table component 1130 can be configured or configured to update the routing table (of the first wireless node) based on the guide frame, the routing table including the selected forward logical path and the selected reverse logical path based on the one or more beacon frames and the guide frame.

[0186] In some examples, the path request frame includes information indicating the broadcast address.

[0187] Additionally or alternatively, according to the examples disclosed herein, the wireless communication device 1100 may support wireless communication. In some examples, the path discovery component 1125 can be configured or configured to receive a path request frame according to a path discovery process associated with a wireless mesh network, the path request frame including information indicating a second capability associated with a second wireless node. In some examples, the path discovery component 1125 can be configured or configured to send a path reply frame associated with the path request frame based on a first capability associated with the first wireless node and a complementarity of the second capability associated with the second wireless node, the path reply frame including information indicating the first wireless node. In some examples, the routing table component 1130 can be configured or configured to generate a routing table to include a logical path between the first wireless node and the second wireless node based on the complementarity of the first capability associated with the first wireless node and the second capability associated with the second wireless node.

[0188] In some examples, application layer component 1135 can be configured or configured to obtain an indication of the first capability from the application layer associated with the first wireless node, wherein sending the path reply frame is associated with obtaining the indication of the first capability from the application layer.

[0189] In some examples, path routing involving the first wireless node is associated with application layer information, based on indications of the first capability provided by the application layer.

[0190] In some examples, the path discovery component 1125 can be configured or configured to receive information indicating the second capability via one or more information elements or subfields of the path request frame.

[0191] In some examples, the path discovery component 1125 can be configured or configured to send 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 includes information indicating the second capability associated with the second wireless node.

[0192] In some examples, a first capability includes one or more first capability elements, and a second capability includes one or more second capability elements. In some examples, the first capability is complementary to the second capability, provided that at least one of the one or more first capability elements has a mapping to at least one of the one or more second capability elements.

[0193] In some examples, the one or more first capability elements and the one or more second capability elements are within a complete set of capabilities associated with the wireless mesh network. In some examples, the complete set of capabilities includes a first set of multiple capability elements in the first capability set, a second set of multiple capability elements in the second capability set, and a Cartesian product of the first set of multiple capability elements in the first capability set and the second set of multiple capability elements in the second capability set.

[0194] In some examples, the first set of multiple capability elements in the first capability set is mapped to the second set of multiple capability elements in the second capability set, and each capability element in the first capability set is mapped to at least one capability element in the second capability set, and each capability element in the second capability set is mapped to at least one capability element in the first capability set.

[0195] 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 indicates a non-edge node, and the first subset of capabilities excludes elements that can be mapped to each other based on the first subset of capabilities associated with non-edge nodes.

[0196] In some examples, the one or more first capability elements include video generation capabilities, and the one or more second capability elements include video rendering or storage capabilities, wherein the video generation capability is mapped to the video rendering or storage capability according to the mapping.

[0197] In some examples, the one or more first capability elements include a sense data generation capability, and the one or more second capability elements include a device controller capability, the sense data generation capability being mapped to the device controller capability according to the mapping.

[0198] In some examples, the path discovery component 1125 can be configured or configured to send information indicating (of the first wireless node) the routing table via a beacon frame. The routing table includes a corresponding identifier for each of one or more target wireless nodes, a corresponding hop count to each of the one or more target wireless nodes, and a corresponding cumulative path metric to each of the one or more target wireless nodes, which includes at least the second wireless node.

[0199] In some examples, path discovery component 1125 can be configured or configured to receive information indicating a second routing table via beacon frames. This second routing table includes a corresponding identifier for each of one or more target wireless nodes, a corresponding hop count to each of the one or more target wireless nodes, and a corresponding cumulative path metric to each of the one or more target wireless nodes. In some examples, routing table component 1130 can be configured or configured to update the routing table (of the first wireless node) at least in part based on the new logical path associated with the target wireless node indicated by the second routing table.

[0200] In some examples, the node type component 1140 can be configured or configured to transmit via a beacon frame an indication of the node type of the first wireless node and information indicating the first capability associated with the first wireless node.

[0201] In some examples, the node type component 1140 can be configured or configured to receive, via a beacon frame, an indication of the node type of the second wireless node and information indicating the second capability associated with the second wireless node.

[0202] In some examples, routing table component 1130 can be configured or configured to select a forward logical path between the first wireless node and the second wireless node based on the propagation of one or more beacon frames in the wireless mesh network. In some examples, path discovery component 1125 can be configured or configured to send a guide frame on the forward logical path between the first wireless node and the second wireless node via the forward logical path.

[0203] In some examples, the path request frame includes information indicating the broadcast address.

[0204] Additionally or alternatively, according to the examples disclosed herein, wireless communication device 1100 may support wireless communication. In some examples, path discovery component 1125 can be configured or configured to receive a path request frame according to a path discovery process associated with a wireless mesh network, the path request frame including information indicating a second capability associated with a second wireless node. In some examples, path discovery component 1125 can be configured or configured to send a forwarded version of the path request frame based on the non-complementarity of the first capability associated with the first wireless node and the second capability associated with the second wireless node, without sending a path reply frame associated with the path request frame. In some examples, routing table component 1130 can be configured or configured to generate a routing table based on the non-complementarity of the first capability associated with the first wireless node and the second capability associated with the second wireless node to exclude logical paths between the first wireless node and the second wireless node.

[0205] In some examples, application layer component 1135 can be configured or configured to obtain an indication of the first capability from the application layer associated with the first wireless node, wherein sending the forwarded version of the path request frame without sending the path reply frame is associated with obtaining the indication of the first capability from the application layer.

[0206] In some examples, path routing involving the first wireless node is associated with application layer information, based on indications of the first capability provided by the application layer.

[0207] In some examples, the path discovery component 1125 can be configured or configured to receive information indicating the second capability via one or more information elements or subfields of the path request frame.

[0208] In some examples, the path discovery component 1125 can be configured or configured to send information indicating the second capability via one or more information elements or subfields of the forwarding version of the path request frame.

[0209] In some examples, the path discovery component 1125 can be configured or configured to receive a path response frame associated with the forwarded version of the path request frame. The path response frame includes information indicating a third wireless node within the wireless mesh network, and the path response frame indicates a third capability associated with the third wireless node that is complementary to the second capability, based on the association between the path response frame and the forwarded version of the path request frame. In some examples, the path discovery component 1125 can be configured or configured to transmit a forwarded version of the path response frame in association with receiving the path response frame.

[0210] In some examples, a first capability includes one or more first capability elements, and a second capability includes one or more second capability elements. In some examples, the first capability is not complementary to the second capability if none of the one or more first capability elements has a mapping to at least one of the one or more second capability elements.

[0211] In some examples, the one or more first capability elements and the one or more second capability elements are within a complete set of capabilities associated with the wireless mesh network. In some examples, the complete set of capabilities includes a first set of multiple capability elements in the first capability set, a second set of multiple capability elements in the second capability set, and a Cartesian product of the first set of multiple capability elements in the first capability set and the second set of multiple capability elements in the second capability set.

[0212] In some examples, the first set of multiple capability elements in the first capability set is mapped to the second set of multiple capability elements in the second capability set, and each capability element in the first capability set is mapped to at least one capability element in the second capability set, and each capability element in the second capability set is mapped to at least one capability element in the first capability set.

[0213] 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 indicates a non-edge node, and the first subset of capabilities excludes elements that can be mapped to each other based on the first subset of capabilities associated with non-edge nodes.

[0214] In some examples, the one or more first capability elements include video generation capability, and the one or more second capability elements include the video generation capability, wherein the first capability and the second capability are not complementary.

[0215] In some examples, the one or more first capability elements include video rendering or storage capabilities, and the one or more second capability elements include the video rendering or storage capabilities, provided that both the one or more first capability elements and the one or more second capability elements include the video rendering or storage capabilities, and the first capability and the second capability are not complementary.

[0216] In some examples, the path discovery component 1125 can be configured or configured to send information indicating (of the first wireless node) the routing table via beacon frames. The routing table includes a corresponding identifier for each of the one or more target wireless nodes, a corresponding hop count to each of the one or more target wireless nodes, and a corresponding cumulative path metric to each of the one or more target wireless nodes.

[0217] In some examples, path discovery component 1125 can be configured or configured to receive information indicating a second routing table via beacon frames. This second routing table includes a corresponding identifier for each of one or more target wireless nodes, a corresponding hop count to each of the one or more target wireless nodes, and a corresponding cumulative path metric to each of the one or more target wireless nodes. In some examples, routing table component 1130 can be configured or configured to update the routing table (of the first wireless node) at least in part based on the new logical path associated with the target wireless node indicated by the second routing table.

[0218] In some examples, the node type component 1140 can be configured or configured to transmit via a beacon frame an indication of the node type of the first wireless node and information indicating the first capability associated with the first wireless node.

[0219] In some examples, the node type component 1140 can be configured or configured to receive, via a beacon frame, an indication of the node type of the second wireless node and information indicating the second capability associated with the second wireless node.

[0220] In some examples, path discovery component 1125 can be configured or configured to receive a pilot frame via a selected forward logical path to the second wireless node, associated with the propagation of one or more beacon frames in the wireless mesh network, based on a forward logical path selection. In some examples, routing table component 1130 can be configured or configured to update the routing table (of the first wireless node) based on the pilot frame, the routing table including a selected forward logical path and a selected reverse logical path based on the one or more beacon frames and the pilot frame. In some examples, path discovery component 1125 can be configured or configured to send a forwarded version of the pilot frame in association with receiving the pilot frame.

[0221] In some examples, the path request frame includes information indicating the broadcast address.

[0222] Additionally or alternatively, according to the examples disclosed herein, the wireless communication device 1100 may support wireless communication. In some examples, the routing table component 1130 can be configured or configured to generate a routing table to include a logical path between the first and second wireless nodes based on a second capability associated with a second wireless node in the wireless mesh network and a first capability associated with a first wireless node. In some examples, the path discovery component 1125 can be configured or configured to transmit information indicating (of the first wireless node) the routing table via a first beacon frame, the routing table including a corresponding identifier for each of one or more first target wireless nodes, a corresponding hop count to each of the one or more first target wireless nodes, and a corresponding cumulative path metric to each of the one or more first target wireless nodes, which includes at least the second wireless node.

[0223] In some examples, path discovery component 1125 can be configured or configured to receive information indicating a second routing table via a second beacon frame. This second routing table includes a corresponding identifier for each of one or more second target wireless nodes, a corresponding hop count to each of the one or more second target wireless nodes, and a corresponding cumulative path metric to each of the one or more second target wireless nodes. In some examples, routing table component 1130 can be configured or configured to update the routing table (of the first wireless node) at least in part based on the new logical path associated with the target wireless node indicated by the second routing table.

[0224] In some examples, the path discovery component 1125 can be configured or configured to send information indicating the updated routing table of the first wireless node via a third beacon frame, based on the new logical path associated with the target wireless node indicated by the second routing table.

[0225] In some examples, the path discovery component 1125 can be configured or configured to receive information indicating a second routing table via a second beacon frame. The second routing table includes the corresponding identifier of each of the one or more first target wireless nodes, the corresponding hop count to each of the one or more first target wireless nodes, and the corresponding cumulative path metric to each of the one or more first target wireless nodes, wherein the routing table is generated to include the logical path between the first wireless node and the second wireless node based on the information indicating the second routing table received.

[0226] In some examples, the path discovery component 1125 can be configured or configured to receive a guide frame via a selected forward logical path between the first wireless node and the second wireless node, associated with the propagation of one or more beacon frames in the wireless mesh network. In some examples, the routing table component 1130 can be configured or configured to update the routing table (of the first wireless node) based on the guide frame, the routing table including the selected forward logical path and the selected reverse logical path based on the one or more beacon frames and the guide frame.

[0227] In some examples, the node type component 1140 can be configured or configured to transmit, via the first beacon frame, an indication of the node type of the first wireless node and information indicating the first capability associated with the first wireless node.

[0228] In some examples, the node type component 1140 can be configured or configured to receive, via a second beacon frame, an indication of the node type of the second wireless node and information indicating the second capability associated with the second wireless node.

[0229] In some examples, the path discovery component 1125 can be configured 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 can be configured or configured to select a new forward path to an edge node of the wireless mesh network based on the routing table (of the first wireless node) in association with detecting and / or identifying the link loss. In some examples, the path discovery component 1125 can be configured or configured to send a guide frame including routing information associated with one or more other wireless nodes via the new forward path, the first wireless node being a via point for the one or more other wireless nodes.

[0230] In some examples, the path discovery component 1125 can be configured or configured to send a path change frame to one or more other wireless nodes that are the transit point and in connection with selecting the new forward path. The path change frame includes information indicating one or both of a new cost or a new hop count to reach the edge node via the first wireless node.

[0231] In some examples, the path discovery component 1125 can be configured or configured to receive a bootstrap frame containing routing information associated with one or more other wireless nodes, which are via points of communication for the third wireless node in the wireless mesh network, in association with a link loss at a third wireless node in the wireless mesh network. In some examples, the routing table component 1130 can be configured or configured to update the routing table (of the first wireless node) based on the routing information included in the bootstrap frame. In some examples, the path discovery component 1125 can be configured or configured to send a forwarded version of the bootstrap frame toward the edge nodes of the wireless mesh network in association with receiving the bootstrap frame.

[0232] In some examples, the path discovery component 1125 can be configured or configured to receive path change frames from a third wireless node that is its transit point and in association with the selection of a new forward path to an edge node of the wireless mesh network at that third wireless node. The path change frames include information indicating one or both of a new cost or a new hop count to reach the edge node via the third wireless node.

[0233] In some examples, application layer component 1135 can be configured or configured to obtain instructions on the first capability from the application layer associated with the first wireless node.

[0234] In some examples, a first capability includes one or more first capability elements, and a second capability includes one or more second capability elements. In some examples, the first capability is complementary to the second capability, provided that at least one of the one or more first capability elements has a mapping to at least one of the one or more second capability elements.

[0235] In some examples, the one or more first capability elements and the one or more second capability elements are within a complete set of capabilities associated with the wireless mesh network. In some examples, the complete set of capabilities includes a first set of multiple capability elements in the first capability set, a second set of multiple capability elements in the second capability set, and a Cartesian product of the first set of multiple capability elements in the first capability set and the second set of multiple capability elements in the second capability set.

[0236] 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 indicates a non-edge node, and the first subset of capabilities excludes elements that can be mapped to each other based on the first subset of capabilities associated with non-edge nodes.

[0237] Figure 12 A flowchart illustrating an example process 1200, which can be performed by or at a first wireless node, to support the formation of a conditional network in a wireless mesh deployment scenario via capability-based PREQ / PREP frame switching. Operation of process 1200 can be implemented by a first wireless node or its components as described herein. For example, process 1200 can be implemented by a wireless communication device (such as a reference cipher) operating as a wireless node or within a wireless node. Figure 11 The described wireless communication device 1100 performs this process. In some examples, process 1200 may be performed by a wireless AP or a wireless STA (such as reference 1100). Figure 1 (either AP 102 or STA 104 as described) to perform.

[0238] In some examples, in block 1205, the first wireless node may send a path request frame according to a path discovery process associated with the wireless mesh network, the path request frame including information indicating a first capability associated with the first wireless node. Operation of block 1205 may be performed according to examples as disclosed herein. In some specific implementations, aspects of the operation of block 1205 may be as described in references... Figure 11 The described path is discovered by component 1125.

[0239] In some examples, in block 1210, a first wireless node may receive a path response frame associated with a path request frame, the path response frame including information indicating a second wireless node within the wireless mesh network, and the path response frame indicating, based on its association with the path request frame, that a second capability associated with the second wireless node is complementary to the first capability. Operation of block 1210 may be performed according to the examples disclosed herein. In some specific implementations, aspects of the operation of block 1210 may be as described in references... Figure 11 The described path is discovered by component 1125.

[0240] In some examples, in block 1215, the first wireless node may generate a routing table based on the second capability associated with the second wireless node to include a logical path between the first wireless node and the second wireless node. The operation of block 1215 may be performed according to the examples disclosed herein. In some specific implementations, aspects of the operation of block 1215 may be provided by reference to [reference needed]. Figure 11 The described routing table component 1130 is used for execution.

[0241] Figure 13 A flowchart illustrating an example process 1300, which can be performed by or at a first wireless node, to support the formation of a conditionally connected network in a wireless mesh deployment scenario via capability-based PREQ / PREP frame switching, is shown. Operation of process 1300 may be implemented by a first wireless node or its components as described herein. For example, process 1300 may be implemented by a wireless communication device (such as a reference cipher) operating as a wireless node or within a wireless node. Figure 11 The described wireless communication device 1100 performs this process. In some examples, process 1300 may be performed by a wireless AP or a wireless STA (such as reference 1100). Figure 1 (either AP 102 or STA 104 as described) to perform.

[0242] In some examples, in block 1305, the first wireless node may receive a path request frame according to a path discovery process associated with the wireless mesh network, the path request frame including information indicating a second capability associated with the second wireless node. Operation of block 1305 may be performed according to the examples disclosed herein. In some specific implementations, aspects of the operation of block 1305 may be as described in references... Figure 11 The described path is discovered by component 1125.

[0243] In some examples, in block 1310, a first wireless node may transmit a path response frame associated with the path request frame, complementary to a first capability associated with the first wireless node and a second capability associated with the second wireless node, the path response frame including information indicating the first wireless node. Operation of block 1310 may be performed according to the examples disclosed herein. In some specific implementations, aspects of the operation of block 1310 may be as described in references... Figure 11 The described path is discovered by component 1125.

[0244] In some examples, in block 1315, the first wireless node may generate a routing table based on the second capability associated with the second wireless node to include a logical path between the first wireless node and the second wireless node. The operation of block 1315 may be performed according to the examples disclosed herein. In some specific implementations, aspects of the operation of block 1315 may be provided by reference to [reference needed]. Figure 11 The described routing table component 1130 is used for execution.

[0245] Figure 14 A flowchart illustrating an example process 1400, which can be performed by or at a first wireless node, to support the formation of a conditionally connected network in a wireless mesh deployment scenario via capability-based PREQ / PREP frame switching, is shown. Operation of process 1400 can be implemented by a first wireless node or its components as described herein. For example, process 1400 can be implemented by a wireless communication device (such as a reference cipher) operating as a wireless node or within a wireless node. Figure 11 The described wireless communication device 1100 performs this process. In some examples, process 1400 may be performed by a wireless AP or a wireless STA (such as reference 1100). Figure 1 (either AP 102 or STA 104 as described) to perform.

[0246] In some examples, in block 1405, the first wireless node may receive a path request frame according to a path discovery process associated with the wireless mesh network, the path request frame including information indicating a second capability associated with the second wireless node. Operation of block 1405 may be performed according to examples as disclosed herein. In some specific implementations, aspects of the operation of block 1405 may be as described in references... Figure 11 The described path is discovered by component 1125.

[0247] In some examples, in block 1410, a first wireless node may transmit a forwarded version of the path request frame based on a non-complementary first capability associated with the first wireless node and a second capability associated with the second wireless node, without transmitting a path reply frame associated with the path request frame. Operation of block 1410 may be performed according to examples as disclosed herein. In some specific implementations, aspects of operation of block 1410 may be provided as referenced... Figure 11 The described path is discovered by component 1125.

[0248] In some examples, in block 1415, the first wireless node may generate a routing table based on the second capability associated with the second wireless node to exclude logical paths between the first wireless node and the second wireless node. The operation of block 1415 may be performed according to the examples disclosed herein. In some specific implementations, aspects of the operation of block 1415 may be provided by reference to [reference needed]. Figure 11 The described routing table component 1130 is used for execution.

[0249] Figure 15 A flowchart illustrating an example process 1500, which can be performed by or at a first wireless node, to support the formation of a conditionally connected network via beacon-assisted routing in a wireless mesh deployment scenario. Operation of process 1500 can be implemented by a first wireless node or its components as described herein. For example, process 1500 can be implemented by a wireless communication device (such as a reference cipher) operating as a wireless node or within a wireless node. Figure 11 The described wireless communication device 1100 performs this process. In some examples, process 1500 may be performed by a wireless AP or a wireless STA (such as reference 1100). Figure 1 (either AP 102 or STA 104 as described) to perform.

[0250] In some examples, in block 1505, the first wireless node may generate a routing table to include a logical path between the first and second wireless nodes based on a second capability associated with a second wireless node in the wireless mesh network and a first capability associated with the first wireless node. Operation of block 1505 may be performed according to examples as disclosed herein. In some specific implementations, aspects of operation of block 1505 may be provided by reference to [reference needed]. Figure 11 The described routing table component 1130 is used for execution.

[0251] In some examples, in block 1510, a first wireless node may transmit information indicating the routing table via a first beacon frame. The routing table includes a corresponding identifier for each of one or more first target wireless nodes, a corresponding hop count to each of the one or more first target wireless nodes, and a corresponding cumulative path metric to each of the one or more first target wireless nodes, which includes at least the second wireless node. Operation of block 1510 may be performed according to the examples disclosed herein. In some specific implementations, aspects of the operation of block 1510 may be provided by reference to [reference needed]. Figure 11 The described path is discovered by component 1125.

[0252] Specific implementation examples are described in the following numbered clauses:

[0253] Clause 1: A method for wireless communication by a first wireless node, the method comprising: transmitting a path request frame according to a path discovery process associated with a wireless mesh network, the path request frame including information indicating a first capability associated with the first wireless node; receiving a path response frame associated with the path request frame, the path response frame including information indicating a second wireless node within the wireless mesh network, and the path response frame indicating, based on the association of the path response frame with the path request frame, a second capability associated with the second wireless node being complementary to the first capability; and generating a routing table based on the second capability associated with the second wireless node to include a logical path between the first wireless node and the second wireless node.

[0254] Clause 2: The method according to Clause 1 further includes: obtaining an indication of the first capability from an application layer associated with the first wireless node, wherein sending the path request frame including the information indicating the first capability is associated with obtaining the indication of the first capability from the application layer.

[0255] Clause 3: The method according to Clause 2, wherein the path routing of the first wireless node is associated with application layer information based on the indication of the first capability provided by the application layer.

[0256] Clause 4: The method according to any one of Clauses 1 to 3 further comprises: sending the information indicating the first capability via one or more information elements or subfields of the path request frame.

[0257] Clause 5: The method according to any one of Clauses 1 to 4, the method further comprising: receiving a plurality of path response frames associated with the path request frame, the plurality of path response frames including information respectively indicating a plurality of wireless nodes within the wireless mesh network, and the path response frames indicating, based on the association of the plurality of path response frames with the path request frame, a corresponding capability associated with each of the plurality of wireless nodes is complementary to the first capability; and generating (such as establishing or including) a corresponding logical path between the first wireless node and each of the plurality of wireless nodes in the routing table based on the corresponding capability of each of the plurality of wireless nodes and the complementarity of the first capability associated with the first wireless node.

[0258] Clause 6: The method according to any one of Clauses 1 to 5, wherein the first capability comprises one or more first capability elements, and the second capability comprises one or more second capability elements; and wherein at least one of the one or more first capability elements has a mapping to at least one of the one or more second capability elements, the first capability and the second capability are complementary.

[0259] Clause 7: The method according to Clause 6, wherein the one or more first capability elements and the one or more second capability elements are within a complete set of capabilities associated with the wireless mesh network; and the complete set of capabilities includes a first plurality of capability elements in the first capability set, a second plurality of capability elements in the second capability set, and a Cartesian product of the first plurality of capability elements in the first capability set and the second plurality of capability elements in the second capability set.

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

[0261] Clause 9: The method according to any one of Clauses 7 to 8, wherein the complete set of capabilities 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 indicates a non-edge node, and the first subset of capabilities excludes elements that can be mapped to each other according to the first subset of capabilities associated with the non-edge node.

[0262] Clause 10: The method according to any one of Clauses 6 to 9, wherein the one or more first capability elements include video generation capability, and the one or more second capability elements include video rendering or storage capability, wherein the video generation capability is mapped to the video rendering or storage capability according to the mapping.

[0263] Clause 11: The method according to any one of Clauses 6 to 10, wherein the one or more first capability elements include a sense data generation capability, and the one or more second capability elements include a device controller capability, wherein the sense data generation capability is mapped to the device controller capability according to the mapping.

[0264] Clause 12: The method according to any one of Clauses 1 to 11, further comprising: transmitting information indicating the routing table via a beacon frame, the routing table including a corresponding identifier for each of one or more target wireless nodes, a corresponding hop count to each of the one or more target wireless nodes, and a corresponding 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.

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

[0266] Clause 14: The method according to any one of Clauses 1 to 13, the method further comprising: transmitting via a beacon frame an indication of the node type of the first wireless node and the information indicating the first capability associated with the first wireless node.

[0267] Clause 15: The method according to any one of Clauses 1 to 14, the method further comprising: receiving via a beacon frame an indication of the node type of the second wireless node and information indicating the second capability associated with the second wireless node.

[0268] Clause 16: The method according to any one of Clauses 1 to 15, the method further comprising: receiving a pilot frame via a selected forward logical path between the first wireless node and the second wireless node, in association with the propagation of one or more beacon frames in the wireless mesh network, based on a forward logical path selection; and updating the routing table based on the pilot frame, the routing table including the selected forward logical path and the selected reverse logical path based on the one or more beacon frames and the pilot frame.

[0269] Clause 17: The method according to any one of Clauses 1 to 16, wherein the path request frame includes information indicating a broadcast address.

[0270] Clause 18: A method for wireless communication by a first wireless node, the method comprising: receiving a path request frame according to a path discovery process associated with a wireless mesh network, the path request frame including information indicating a second capability associated with a second wireless node; transmitting a path reply frame associated with the path request frame, the path reply frame including information indicating the first wireless node, based on a first capability associated with the first wireless node and a second capability associated with the second wireless node being complementary; and generating a routing table based on the second capability associated with the second wireless node to include a logical path between the first wireless node and the second wireless node.

[0271] Clause 19: The method according to Clause 18 further includes: obtaining an indication of the first capability from an application layer associated with the first wireless node, wherein sending the path reply frame is associated with obtaining the indication of the first capability from the application layer.

[0272] Clause 20: The method according to Clause 19, wherein the path routing of the first wireless node is associated with application layer information based on the indication of the first capability provided by the application layer.

[0273] Clause 21: The method according to any one of Clauses 18 to 20, the method further comprising: receiving the information indicating the second capability via one or more information elements or subfields of the path request frame.

[0274] Clause 22: The method according to any one of Clauses 18 to 21, the method 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 indicating the second capability associated with the second wireless node.

[0275] Clause 23: The method according to any one of Clauses 18 to 22, wherein the first capability comprises one or more first capability elements, and the second capability comprises one or more second capability elements; and wherein at least one of the one or more first capability elements has a mapping to at least one of the one or more second capability elements, the first capability and the second capability are complementary.

[0276] Clause 24: The method according to Clause 23, wherein the one or more first capability elements and the one or more second capability elements are within a complete set of capabilities associated with the wireless mesh network; and the complete set of capabilities includes a first plurality of capability elements in the first set of capabilities, a second plurality of capability elements in the second set of capabilities, and a Cartesian product of the first plurality of capability elements in the first set of capabilities and the second plurality of capability elements in the second set of capabilities.

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

[0278] Clause 26: The method according to any one of Clauses 24 to 25, wherein the complete set of capabilities 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 indicates a non-edge node, and the first subset of capabilities excludes elements that can be mapped to each other according to the first subset of capabilities associated with the non-edge node.

[0279] Clause 27: The method according to any one of Clauses 23 to 26, wherein the one or more first capability elements include video generation capability, and the one or more second capability elements include video rendering or storage capability, wherein the video generation capability is mapped to the video rendering or storage capability according to the mapping.

[0280] Clause 28: The method according to any one of Clauses 23 to 27, wherein the one or more first capability elements include a sense data generation capability, and the one or more second capability elements include a device controller capability, the sense data generation capability being mapped to the device controller capability according to the mapping.

[0281] Clause 29: The method according to any one of Clauses 18 to 28, the method further comprising: transmitting information indicating the routing table via a beacon frame, the routing table including a corresponding identifier for each of one or more target wireless nodes, a corresponding hop count to each of the one or more target wireless nodes, and a corresponding 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.

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

[0283] Clause 31: The method according to any one of Clauses 18 to 30, the method further comprising: transmitting via a beacon frame an indication of the node type of the first wireless node and the information indicating the first capability associated with the first wireless node.

[0284] Clause 32: The method according to any one of Clauses 18 to 31, the method further comprising: receiving via a beacon frame an indication of the node type of the second wireless node and information indicating the second capability associated with the second wireless node.

[0285] Clause 33: The method according to any one of Clauses 18 to 32, the method further comprising: selecting a forward logical path between the first wireless node and the second wireless node based on the propagation of one or more beacon frames in the wireless mesh network; and transmitting a pilot frame on the forward logical path between the first wireless node and the second wireless node via the forward logical path.

[0286] Clause 34: The method according to any one of Clauses 18 to 33, wherein the path request frame includes information indicating a broadcast address.

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

[0288] Clause 36: The method according to Clause 35 further includes: obtaining an indication of the first capability from an application layer associated with the first wireless node, wherein sending the forwarded version of the path request frame without sending the path reply frame is associated with obtaining the indication of the first capability from the application layer.

[0289] Clause 37: The method according to Clause 36, wherein the path routing of the first wireless node is associated with application layer information based on the indication of the first capability provided by the application layer.

[0290] Clause 38: The method according to any one of Clauses 35 to 37, the method further comprising: receiving the information indicating the second capability via one or more information elements or subfields of the path request frame.

[0291] Clause 39: The method according to any one of Clauses 35 to 38, the method further comprising: sending the information indicating the second capability via one or more information elements or subfields of the forwarding version of the path request frame.

[0292] Clause 40: The method according to any one of Clauses 35 to 39, the method further comprising: receiving a path response frame associated with the forwarded version of the path request frame, the path response frame including information indicating a third wireless node within the wireless mesh network, and the path response frame indicating a third capability associated with the third wireless node that is complementary to the second capability based on the association of the path response frame with the forwarded version of the path request frame; and transmitting the forwarded version of the path response frame in connection with receiving the path response frame.

[0293] Clause 41: The method according to any one of Clauses 35 to 40, wherein the first capability comprises one or more first capability elements, and the second capability comprises one or more second capability elements; and wherein the first capability and the second capability are not complementary, provided that none of the one or more first capability elements has a mapping to at least one of the one or more second capability elements.

[0294] Clause 42: The method according to Clause 41, wherein the one or more first capability elements and the one or more second capability elements are within a complete set of capabilities associated with the wireless mesh network; and the complete set of capabilities includes a first plurality of capability elements in the first set of capabilities, a second plurality of capability elements in the second set of capabilities, and a Cartesian product of the first plurality of capability elements in the first set of capabilities and the second plurality of capability elements in the second set of capabilities.

[0295] Clause 43: The method according to Clause 42, wherein the first plurality of capability elements mapped in the first capability set and the second plurality of capability elements in the second capability set, each capability element in the first capability set is mapped to at least one capability element in the second capability set, and each capability element in the second capability set is mapped to at least one capability element in the first capability set.

[0296] Clause 44: The method according to any one of Clauses 42 to 43, wherein the complete set of capabilities 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 indicates a non-edge node, and the first subset of capabilities excludes elements that can be mapped to each other according to the first subset of capabilities associated with the non-edge node.

[0297] Clause 45: The method according to any one of Clauses 41 to 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, wherein both the one or more first capability elements and the one or more second capability elements include the video generation capability, and the first capability and the second capability are not complementary.

[0298] Clause 46: The method according to any one of Clauses 41 to 45, wherein the one or more first capability elements include video rendering or storage capabilities, and the one or more second capability elements include the video rendering or storage capabilities, wherein both the one or more first capability elements and the one or more second capability elements include the video rendering or storage capabilities, and the first capability and the second capability are not complementary.

[0299] Clause 47: The method according to any one of Clauses 35 to 46, the method further comprising: transmitting information indicating the routing table via a beacon frame, the routing table including a corresponding identifier for each of one or more target wireless nodes, a corresponding hop count to each of the one or more target wireless nodes, and a corresponding cumulative path metric to each of the one or more target wireless nodes.

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

[0301] Clause 49: The method according to any one of Clauses 35 to 48, the method further comprising: transmitting via a beacon frame an indication of the node type of the first wireless node and the information indicating the first capability associated with the first wireless node.

[0302] Clause 50: The method according to any one of Clauses 35 to 49, the method further comprising: receiving via a beacon frame an indication of a node type of the second wireless node and information indicating the second capability associated with the second wireless node.

[0303] Clause 51: The method according to any one of Clauses 35 to 50, the method further comprising: receiving a pilot frame via a selected forward logical path to the second wireless node, in association with the propagation of one or more beacon frames in the wireless mesh network, based on a forward logical path selection; updating the routing table based on the pilot frame, the routing table including the selected forward logical path and the selected reverse logical path based on the one or more beacon frames and the pilot frame; and transmitting a forwarded version of the pilot frame in association with receiving the pilot frame.

[0304] Clause 52: The method according to any one of Clauses 35 to 51, wherein the path request frame includes information indicating a broadcast address.

[0305] Clause 53: A method for wireless communication by a first wireless node, the method comprising any one of Clauses 1 to 17, 18 to 34, or 35 to 52, alternatives to or as an alternative thereof: generating a routing table to include logical paths between the first wireless node and the second wireless node based on a second capability associated with a second wireless node in a wireless mesh network and a first capability associated with the first wireless node; and transmitting information indicating the routing table via a first beacon frame, the routing table including a corresponding identifier for each of one or more first target wireless nodes, a corresponding hop count to each of the one or more first target wireless nodes, and a corresponding 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.

[0306] Clause 54: The method according to any one of Clauses 1 to 17, 18 to 34, 35 to 52 or 53, the method further comprising: receiving information indicating a second routing table via a second beacon frame, the second routing table including a corresponding identifier for each of one or more second target radio nodes, a corresponding hop count to each of the one or more second target radio nodes, and a corresponding cumulative path metric to each of the one or more second target radio nodes; and updating the routing table at least in part according to the new logical path associated with the target radio node indicated by the second routing table.

[0307] Clause 55: The method according to any one of Clauses 1 to 17, 18 to 34, 35 to 52 or 54, the method further comprising: transmitting information indicating an updated routing table of the first wireless node via a third beacon frame, based on the second routing table indicating the new logical path associated with the target wireless node.

[0308] Clause 56: The method according to any one of Clauses 1 to 17, 18 to 34, 35 to 52, or 53 to 55, further comprising: receiving information indicating a second routing table via a second beacon frame, the second routing table including the corresponding identifier of each of the one or more first target wireless nodes, the corresponding hop count to each of the one or more first target wireless nodes, and the corresponding 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 performed based on receiving the information indicating the second routing table.

[0309] Clause 57: The method according to any one of Clauses 1 to 17, 18 to 34, 35 to 52, or 53 to 56, further comprising: receiving a pilot frame via a selected forward logical path between the first wireless node and the second wireless node, in association with the propagation of one or more beacon frames in the wireless mesh network, based on a forward logical path selection; and updating the routing table based on the pilot frame, the routing table including the selected forward logical path and the selected reverse logical path based on the one or more beacon frames and the pilot frame.

[0310] Clause 58: The method according to any one of Clauses 1 to 17, 18 to 34, 35 to 52 or 53 to 57, the method further comprising: selecting a forward logical path between the first wireless node and the second wireless node based on the propagation of one or more beacon frames in the wireless mesh network; and transmitting a pilot frame on the forward logical path between the first wireless node and the second wireless node via the forward logical path.

[0311] Clause 59: The method according to any one of Clauses 1 to 17, 18 to 34, 35 to 52, or 53 to 58, the method further comprising: receiving a pilot frame via a selected forward logical path to the second wireless node, in association with the propagation of one or more beacon frames in the wireless mesh network, based on a forward logical path selection; updating the routing table based on the pilot frame, the routing table including the selected forward logical path and the selected reverse logical path based on the one or more beacon frames and the pilot frame; and transmitting a forwarded version of the pilot frame in association with receiving the pilot frame.

[0312] Clause 60: The method according to any one of Clauses 1 to 17, 18 to 34, 35 to 52 or 53 to 59, the method further comprising: transmitting via the first beacon frame an indication of the node type of the first wireless node and the information indicating the first capability associated with the first wireless node.

[0313] Clause 61: The method according to any one of Clauses 1 to 17, 18 to 34, 35 to 52 or 53 to 60, the method further comprising: receiving via a second beacon frame an indication of a node type of the second wireless node and information indicating the second capability associated with the second wireless node.

[0314] Clause 62: The method according to any one of Clauses 1 to 17, 18 to 34, 35 to 52, or 53 to 61, further comprising: detecting and / or identifying a link loss between the first wireless node and the second wireless node; selecting a new forward path to an edge node of the wireless mesh network in association with the detection and / or identification of the link loss according to the routing table; and transmitting a pilot frame including routing information associated with one or more other wireless nodes, the first wireless node being a transit point of the one or more other wireless nodes, via the new forward path.

[0315] Clause 63: The method according to any one of Clauses 1 to 17, 18 to 34, 35 to 52 or 62, the method further comprising: sending a path change frame to the one or more other wireless nodes that are the transit points and in association with the selection of the new forward path, the path change frame including information indicating one or both of a new cost or a new hop count for reaching the edge node via the first wireless node.

[0316] Clause 64: The method according to any one of Clauses 1 to 17, 18 to 34, 35 to 52, or 53 to 63, further comprising: receiving a pilot frame including routing information associated with one or more other wireless nodes, the third wireless node being a via point of the one or more other wireless nodes, in association with a link loss at a third wireless node of the wireless mesh network; updating the routing table based on the routing information included in the pilot frame; and transmitting a forwarded version of the pilot frame toward an edge node of the wireless mesh network in association with receiving the pilot frame.

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

[0318] Clause 66: The method according to any one of Clauses 1 to 17, 18 to 34, 35 to 52 or 53 to 65, the method further comprising: obtaining an indication of the first capability from an application layer associated with the first wireless node.

[0319] Clause 67: The method according to any one of Clauses 1 to 17, 18 to 34, 35 to 52 or 53 to 66, wherein the first capability comprises one or more first capability elements, and the second capability comprises one or more second capability elements; and wherein at least one of the one or more first capability elements has a mapping to at least one of the one or more second capability elements, the first capability being complementary to the second capability.

[0320] Clause 68: The method according to any one of Clauses 1 to 17, 18 to 34, 35 to 52 or 67, wherein the one or more first capability elements and the one or more second capability elements are within a complete set of capabilities associated with the wireless mesh network; and the complete set of capabilities includes a first plurality of capability elements in the first capability set, a second plurality of capability elements in the second capability set, and a Cartesian product of the first plurality of capability elements in the first capability set and the second plurality of capability elements in the second capability set.

[0321] Clause 69: The method according to any one of Clauses 1 to 17, 18 to 34, 35 to 52 or 68, wherein the complete set of capabilities 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 indicates a non-edge node, and the first subset of capabilities excludes elements that can be mapped to each other according to the first subset of capabilities associated with the non-edge node.

[0322] Clause 70: A first wireless node, the first wireless node including a processing system, the processing system including processor circuitry and memory circuitry storing code, the processing system being configured to cause the first wireless node to perform a method according to any one of Clauses 1 to 17.

[0323] Clause 71: A first wireless node, the first wireless node comprising at least one component for performing the method according to any one of Clauses 1 to 17.

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

[0325] Clause 73: A first wireless node, the first wireless node including a processing system, the processing system including processor circuitry and memory circuitry storing code, the processing system being configured to cause the first wireless node to perform a method according to any one of Clauses 18 to 34.

[0326] Clause 74: A first wireless node comprising at least one component for performing the method according to any one of Clauses 18 to 34.

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

[0328] Clause 76: A first wireless node, the first wireless node including a processing system, the processing system including processor circuitry and memory circuitry storing code, the processing system being configured to cause the first wireless node to perform a method according to any one of Clauses 35 to 52.

[0329] Clause 77: A first wireless node comprising at least one component for performing the method according to any one of Clauses 35 to 52.

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

[0331] Clause 79: A first wireless node, the first wireless node including a processing system, the processing system including processor circuitry and memory circuitry storing code, the processing system being configured to cause the first wireless node to perform a method according to any one of Clauses 53 to 69.

[0332] Clause 80: A first wireless node for wireless communication, the first wireless node comprising at least one component for performing the method according to any one of Clauses 53 to 69.

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

[0334] As used herein, the term "determine" encompasses a wide variety of actions, and therefore, "determine" can include calculation, computation, processing, derivation, estimation, investigation, searching (such as by searching in a table, database, or other data structure), reasoning, probing, or measurement, etc. Additionally, "determine" can include receiving (such as receiving information), accessing (such as accessing data stored in memory), or sending (such as sending information), etc. Furthermore, "determine" can include parsing, selecting, obtaining, choosing, building, and other similar actions.

[0335] As used herein, the phrase “at least one of” or “one or more of” a list of items refers to any combination of those items, including a single member. For example, “at least one of a, b, or c” is intended to cover: a, b, c, ab, ac, bc, and abc. As used herein, “or” is intended to be interpreted as inclusive unless otherwise explicitly stated. For example, “a or b” could include only a, only b, or a combination of a and b. Furthermore, as used herein, the phrase referring to “one” or “a” element means one or more such elements that act individually or collectively to perform the described function. Additionally, “set” refers to one or more items, and “subset” refers to less than the entire set but not empty. Furthermore, “subset” can refer to the entire set of multiple sets or less than the entire set of multiple sets, such that “subset” can be understood as less than or equal to the complete set and including at least one member (and, likewise, not empty).

[0336] As used herein, unless otherwise expressly indicated, “based on” is intended to be interpreted in an inclusive sense. For example, unless otherwise explicitly indicated, “based on” may be used interchangeably with “at least partially based on,” “associated with,” “associated with,” or “according to.” Specifically, unless the phrase in the context means “based on only one” or an equivalent, whether it is “based on one” or “at least partially based on one”, it may be based solely on “one” or based on a combination of “one” and one or more other factors, conditions, or information.

[0337] The various exemplary components, logic units, logic blocks, modules, circuits, operations, and algorithmic processes described in conjunction with the examples disclosed herein can be implemented as electronic hardware, firmware, software, or a combination of hardware, firmware, or software, including the structures disclosed in this specification and their structural equivalents. This interchangeability of hardware, firmware, and software has been generally described in terms of its functionality and exemplified in the various exemplary components, blocks, modules, circuits, and processes described above. Whether this functionality is implemented in hardware, firmware, or software depends on the specific application and the design constraints imposed on the overall system.

[0338] Various modifications to the examples described in this disclosure will be apparent to those skilled in the art, and the general principles defined herein may be applied to other examples without departing from the spirit or scope of this disclosure. Therefore, the claims are not intended to be limited to the examples shown herein, but are to be granted the widest scope consistent with this disclosure, the principles disclosed herein, and the novel features.

[0339] Additionally, the various features described in this specification in the context of individual examples may also be implemented in combination in a single specific embodiment. Conversely, the various features described in the context of a single specific embodiment may also be implemented individually or in any suitable sub-combination in multiple examples. Thus, although features may be described above as functioning in a particular combination, and even initially claimed in this way, one or more features from the claimed combination may be removed from the combination in some cases, and the claimed combination may involve sub-combinations or variations of sub-combinations.

[0340] Similarly, although operations are depicted in a specific order in the diagrams, this should not be construed as requiring such operations to be performed in the specific order shown or in sequential order, or to perform all illustrated operations to achieve the desired result. Furthermore, the accompanying figures may schematically depict one or more example processes in the form of flowcharts or flow diagrams. However, other operations not depicted may be incorporated into the schematically illustrated example processes. For example, one or more additional operations may be performed before, after, simultaneously with, or between any of the illustrated operations. In some environments, multitasking and parallel processing may be advantageous. Moreover, the separation of various system components in the examples described above should not be construed as requiring such separation in all examples, but rather should be understood as meaning that the described program components and systems can generally be integrated together in a single software product or encapsulated in multiple software products.

Claims

1. A first wireless node, the first wireless node comprising: The processing system, comprising processor circuitry and memory circuitry for storing code, is configured to cause the first wireless node to: A path request frame is sent according to a path discovery process associated with a wireless mesh network, the path request frame including information indicating a first capability associated with the first wireless node; Receive a path response frame associated with the path request frame, the path response frame including information indicating a second wireless node within the wireless mesh network, and the path response frame indicating, based on the association of the path response frame with the path request frame, that a second capability associated with the second wireless node is complementary to the first capability; as well as A routing table is generated based on the second capability associated with the second wireless node to include the logical path between the first wireless node and the second wireless node.

2. The first wireless node according to claim 1, wherein the processing system is further configured to cause the first wireless node to: An indication of the first capability is obtained from the application layer associated with the first wireless node, wherein sending the path request frame including the information indicating the first capability is associated with obtaining the indication of the first capability from the application layer.

3. The first wireless node of claim 2, wherein the path routing involving the first wireless node is associated with application layer information based on the indication of the first capability provided by the application layer.

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

5. The first wireless node according to claim 1, wherein the processing system is further configured to cause the first wireless node to: Receive a plurality of path response frames associated with the path request frame, the plurality of path response frames including information respectively indicating a plurality of wireless nodes within the wireless mesh network, and the path response frames indicating, based on their association with the path request frame, that a corresponding capability associated with each of the plurality of wireless nodes is complementary to the first capability; and Based on the corresponding capabilities of each of the plurality of wireless nodes and the complementarity of the first capability associated with the first wireless node, a corresponding logical path between the first wireless node and each of the plurality of wireless nodes is generated in the routing table.

6. The first wireless node according to 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, provided that at least one of the one or more first capability elements has a mapping to at least one of the one or more second capability elements.

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

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

9. The first wireless node according to claim 7, wherein: The complete capability set includes a first subset of capabilities associated with the first node type and a second subset of capabilities associated with the second node type; and The first node type indicates a non-edge node, and the first capability subset excludes elements that can be mapped to each other based on their association with the non-edge node according to the first capability subset.

10. The first wireless node of claim 1, wherein the processing system is further configured to cause the first wireless node to: Information indicating the routing table is transmitted via beacon frames. The routing table includes a corresponding identifier for each of one or more target wireless nodes, a corresponding hop count to each of the one or more target wireless nodes, and a corresponding cumulative path metric to each of the one or more target wireless nodes, wherein the one or more target wireless nodes include 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: Information indicating a second routing table is received via a beacon frame. The second routing table includes a corresponding identifier for each of one or more target wireless nodes, a corresponding hop count to each of the one or more target wireless nodes, and a corresponding cumulative path metric to each of the one or more target wireless nodes; and The routing table is updated at least in part based on the new logical path associated with the target wireless node indicated by the second routing table.

12. The first wireless node of claim 1, wherein the processing system is further configured to cause the first wireless node to: Based on the forward logical path selection associated with the propagation of one or more beacon frames in the wireless mesh network, a pilot frame is received via a selected forward logical path between the first wireless node and the second wireless node; and The routing table is updated based on the pilot frame, the routing table including the selected forward logical path and the selected reverse logical path based on the one or more beacon frames and the pilot frame.

13. A first wireless node, the first wireless node comprising: The processing system, comprising processor circuitry and memory circuitry for storing code, is configured to cause the first wireless node to: A path request frame is received according to a path discovery process associated with a wireless mesh network, the path request frame including information indicating a second capability associated with a second wireless node; A path response frame associated with the path request frame is transmitted based on a first capability associated with the first wireless node and a second capability associated with the second wireless node, the path response frame including information indicating the first wireless node; as well as A routing table is generated based on the second capability associated with the second wireless node to include the logical path between the first wireless node and 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: An indication of the first capability is obtained from the application layer associated with the first wireless node, wherein sending the path reply frame is associated with obtaining the indication of the first capability from the application layer.

15. The first wireless node of claim 14, wherein the path routing involving the first wireless node is associated with application layer information based on the indication of the first capability provided by the application layer.

16. The first wireless node of claim 13, wherein the processing system is further configured to cause the first wireless node to: A forwarded version of the path request frame is transmitted 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 includes the information indicating the second capability associated with the second wireless node.

17. The first wireless node according to 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, provided that at least one of the one or more first capability elements has a mapping to at least one of the one or more second capability elements.

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

19. The first wireless node of claim 18, wherein the first plurality of capability elements mapped in the first capability set and the second plurality of capability elements in the second capability set, each capability element in the first capability set is mapped to at least one capability element in the second capability set, and each capability element in the second capability set is mapped to at least one capability element in 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: The information indicating the node type of the first wireless node and the first capability associated with the first wireless node is transmitted via a beacon frame.

21. The first wireless node of claim 13, wherein the processing system is further configured to cause the first wireless node to: The node type of the second wireless node and the second capability associated with the second wireless node are received via beacon frames.

22. The first wireless node of claim 13, wherein the processing system is further configured to cause the first wireless node to: The forward logical path between the first wireless node and the second wireless node is selected based on the propagation of one or more beacon frames in the wireless mesh network; and A pilot frame is transmitted via the forward logical path between the first wireless node and the second wireless node.

23. A first wireless node, the first wireless node comprising: The processing system, comprising processor circuitry and memory circuitry for storing code, is configured to cause the first wireless node to: A path request frame is received according to a path discovery process associated with a wireless mesh network, the path request frame including information indicating a second capability associated with a second wireless node; A forwarded version of the path request frame is sent based on a non-complementary first capability associated with the first wireless node and a second capability associated with the second wireless node, without sending a path response frame associated with the path request frame. as well as A routing table is generated based on the second capability associated with the second wireless node to exclude logical paths between the first wireless node and 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: Obtaining an indication of the first capability from the application layer associated with the first wireless node, wherein sending the forwarded version of the path request frame without sending the path reply frame is associated 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 response frame associated with the forwarding version of the path request frame, the path response frame including information indicating a third wireless node within the wireless mesh network, and the path response frame indicating, based on the association of the path response frame with the forwarding version of the path request frame, that a third capability associated with the third wireless node is complementary to the second capability; and A forwarded version of the path response frame is sent in association with receiving the path response frame.

26. The first wireless node according to 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 and the second capability are not complementary if none of the one or more first capability elements has 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: Information indicating a second routing table is received via a beacon frame. The second routing table includes a corresponding identifier for each of one or more target wireless nodes, a corresponding hop count to each of the one or more target wireless nodes, and a corresponding cumulative path metric to each of the one or more target wireless nodes; and The routing table is updated at least in part based on the new logical path associated with the target wireless node indicated by the second routing table.

28. The first wireless node of claim 23, wherein the processing system is further configured to cause the first wireless node to: Based on the forward logical path selection associated with the propagation of one or more beacon frames in the wireless mesh network, a pilot frame is received via the selected forward logical path to the second wireless node. The routing table is updated based on the pilot frame, the routing table including the selected forward logical path and the selected reverse logical path based on the one or more beacon frames and the pilot frame; as well as A forwarded version of the bootstrap frame is sent in association with receiving the bootstrap frame.

29. A method for wireless communication by a first wireless node, the method comprising: A path request frame is sent according to a path discovery process associated with a wireless mesh network, the path request frame including information indicating a first capability associated with the first wireless node; Receive a path response frame associated with the path request frame, the path response frame including information indicating a second wireless node within the wireless mesh network, and the path response frame indicating, based on the association of the path response frame with the path request frame, that a second capability associated with the second wireless node is complementary to the first capability; as well as A routing table is generated based on the second capability associated with the second wireless node to include the logical path between the first wireless node and the second wireless node.

30. The method according to claim 29, further comprising: An indication of the first capability is obtained from the application layer associated with the first wireless node, wherein sending the path request frame including the information indicating the first capability is associated with obtaining the indication of the first capability from the application layer.

31. A first wireless node, the first wireless node comprising: The processing system, comprising processor circuitry and memory circuitry for storing code, is configured to cause the first wireless node to: A routing table is generated to include logical paths between the first wireless node and the second wireless node, based on the complementarity of the second capability associated with the second wireless node in the wireless mesh network and the first capability associated with the first wireless node. as well as Information indicating the routing table is transmitted via a first beacon frame. The routing table includes a corresponding identifier for each of one or more first target wireless nodes, a corresponding hop count to each of the one or more first target wireless nodes, and a corresponding cumulative path metric to each of the one or more first target wireless nodes, wherein the one or more first target wireless nodes include 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: Information indicating a second routing table is received via a second beacon frame. The second routing table includes a corresponding identifier for each of one or more second target wireless nodes, a corresponding hop count to each of the one or more second target wireless nodes, and a corresponding cumulative path metric to each of the one or more second target wireless nodes; and The routing table is updated at least in part based on the new logical path associated with the target wireless node indicated by the second routing table.

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

34. The first wireless node of claim 31, wherein the processing system is further configured to cause the first wireless node to: Information indicating a second routing table is received via a second beacon frame. The second routing table includes the corresponding identifier of each of the one or more first target wireless nodes, the corresponding hop count to each of the one or more first target wireless nodes, and the corresponding cumulative path metric to each of the one or more first target wireless nodes. The generation of the routing table to include the logical path between the first wireless node and the second wireless node is performed based on the information received instructing 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: Based on the forward logical path selection associated with the propagation of one or more beacon frames in the wireless mesh network, a pilot frame is received via a selected forward logical path between the first wireless node and the second wireless node; and The routing table is updated based on the pilot frame, the routing table including the selected forward logical path and the selected reverse logical path based on the one or more beacon frames and the pilot frame.

36. The first wireless node of claim 31, wherein the processing system is further configured to cause the first wireless node to: The forward logical path between the first wireless node and the second wireless node is selected based on the propagation of one or more beacon frames in the wireless mesh network; and A pilot frame is transmitted via 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: Based on the forward logical path selection associated with the propagation of one or more beacon frames in the wireless mesh network, a pilot frame is received via the selected forward logical path to the second wireless node. The routing table is updated based on the pilot frame, the routing table including the selected forward logical path and the selected reverse logical path based on the one or more beacon frames and the pilot frame; as well as A forwarded version of the bootstrap frame is sent in association with receiving the bootstrap frame.

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

39. The first wireless node of claim 31, wherein the processing system is further configured to cause the first wireless node to: The second beacon frame is used to receive an indication of the node type of the second wireless node and information indicating 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: The link between the first wireless node and the second wireless node is lost. A new forward path to the edge node of the wireless mesh network is selected based on the routing table and associated with the identifier of the link loss; as well as A pilot frame, including routing information associated with one or more other wireless nodes, is sent via the new forward path, the first wireless node being a transit point for the one or more other wireless nodes.

41. The first wireless node of claim 40, wherein the processing system is further configured to cause the first wireless node to: A path change frame is sent to the first wireless node, which is one or more other wireless nodes that are its via points, and in association with the selection of the new forward path. The path change frame includes information indicating 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: A pilot frame including routing information associated with one or more other wireless nodes is received in connection with a link loss at a third wireless node in the wireless mesh network, the third wireless node being a via point of the one or more other wireless nodes; The routing table is updated based on the routing information included in the pilot frame; and A forwarded version of the pilot frame is sent toward the edge nodes of the wireless mesh network in association with receiving the pilot frame.

43. The first wireless node of claim 31, wherein the processing system is further configured to cause the first wireless node to: A path change frame is received from the first wireless node as a third wireless node via which it passes and in association with the selection of a new forward path to an edge node of the wireless mesh network at the third wireless node. The path change frame includes information indicating 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: Instructions for the first capability are obtained from the application layer associated with the first wireless node.

45. The first wireless node according to claim 31, 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, provided that at least one of the one or more first capability elements has a mapping to at least one of the one or more second capability elements.

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

47. The first wireless node according to claim 46, wherein: The complete capability set includes a first subset of capabilities associated with the first node type and a second subset of capabilities associated with the second node type; and The first node type indicates a non-edge node, and the first capability subset excludes elements that can be mapped to each other according to the first capability subset and the non-edge node.

48. A method for wireless communication capable of being performed by a first wireless node, the method comprising: A routing table is generated to include logical paths between the first wireless node and the second wireless node, based on the complementarity of the second capability associated with the second wireless node in the wireless mesh network and the first capability associated with the first wireless node. as well as Information indicating the routing table is transmitted via a first beacon frame. The routing table includes a corresponding identifier for each of one or more first target wireless nodes, a corresponding hop count to each of the one or more first target wireless nodes, and a corresponding cumulative path metric to each of the one or more first target wireless nodes, wherein the one or more first target wireless nodes include at least the second wireless node.

49. The method according to claim 48, further comprising: Information indicating a second routing table is received via a second beacon frame. The second routing table includes a corresponding identifier for each of one or more second target wireless nodes, a corresponding hop count to each of the one or more second target wireless nodes, and a corresponding cumulative path metric to each of the one or more second target wireless nodes. as well as The routing table is updated at least in part based on the new logical path associated with the target wireless node indicated by the second routing table.

50. The method of claim 48, further comprising: Information indicating a second routing table is received via a second beacon frame. The second routing table includes the corresponding identifier of each of the one or more first target wireless nodes, the corresponding hop count to each of the one or more first target wireless nodes, and the corresponding cumulative path metric to each of the one or more first target wireless nodes. The generation of the routing table to include the logical path between the first wireless node and the second wireless node is performed based on the information received instructing the second routing table.

Images