# US 12,003,403 B2 · Link management and routing in hybrid mesh networks > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,003,403 B2 - Document ID: US12003403B2 - Status: Granted - Kind: B2 - Application number: 17/558,138 - Filed: 2021-12-21 - Published: 2022-04-14 - Granted: 2024-06-04 - Earliest claimed: 2017-01-25 - Assignees: Airties S.A.S. - Applicants: Airties S.A.S. - Inventors: Alper Akcan; Irfan Acar; Bilal Hatipoglu; Mustafa Karaca; Mujdat Pakkan; Devin Mungan - Web page: https://patentgrep.com/patent/US12003403B2 ## CPC - H04W 40/246: {Connectivity information discovery} - H04L 45/026: {Details of "hello" or keep-alive messages} - H04L 45/04: {Interdomain routing, e.g. hierarchical routing} - H04W 84/18: Self-organising networks, e.g. ad-hoc networks or sensor networks - H04W 88/08: Access point devices - H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72) - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) ## Abstract A wireless network device may receive a broadcasted hello message. The wireless network device may determine, based on the broadcasted hello message, interfaces to communicate with neighbor devices. The wireless network device may determine costs for links of the interfaces. A highest cost link of the interfaces may be blocked and a lowest cost link of the interfaces may be unblocked. The wireless network device may transmit, in the network, an announce message that indicates the highest cost link as blocked and the lowest cost link as unblocked. ## Claims ### Claim 1 A wireless network device comprising: a memory configured to store a routing table, each entry of the routing table associated with a peer node; a processor configured to determine the existence of a peer node, and to add an entry associated with the peer node into the routing table stored in the memory; the processor and a transceiver configured to validate each peer node having an entry stored in the routing table, wherein validating each peer node includes confirming that the peer node is still a peer node of the wireless network device, wherein on a condition that a peer node is no longer a peer node of the wireless network device, deleting the peer node from the routing table; and the processor and transceiver further configured to receive traffic, to determine whether a destination of the traffic is a peer node having an entry stored in the routing table, and when the determination is positive, to accelerate the traffic to an interface associated with the peer node associated with the destination of the traffic, and to transmit the traffic via the interface; wherein validating each peer node includes: the transceiver configured to receive a broadcasted hello message from a peer node; the processor configured to determine, based on the broadcasted hello message, one or more interfaces to communicate with the peer node; the processor is further configured to determine costs for links of the one or more interfaces, wherein a highest cost link of the one or more interfaces is blocked and a lowest cost link of the one or more interfaces is unblocked; the transceiver is further configured to transmit an announce message that indicates the highest cost link as blocked and the lowest cost link as unblocked; and the transceiver is further configured to receive another announce message, wherein the another announce message includes information about unblocked and blocked links to update the routing table. ### Claim 2 (depends on 1) The wireless network device of claim 1, wherein the highest cost link is a wireless interface and the lowest cost link is a wired interface. ### Claim 3 (depends on 1) The wireless network device of claim 1, wherein a direct peer node is determined based on a predetermined number of hello messages. ### Claim 4 (depends on 1) The wireless network device of claim 1, wherein the announce message is transmitted to unblocked peer devices periodically or continuously. ### Claim 5 (depends on 1) The wireless network device of claim 1, wherein the broadcasted hello message is transmitted periodically or continuously. ### Claim 6 (depends on 1) The wireless network device of claim 1, wherein the broadcasted hello message is not forwarded. ### Claim 7 (depends on 1) The wireless network device of claim 1, wherein the processor is further configured to determine, based on the broadcasted hello message, existence of a peer node of an island, wherein the peer node is blocked from wireless communication with the network device. ### Claim 8 (depends on 1) The wireless network device of claim 1, wherein the routing table is utilized to build a mesh island. ### Claim 9 A method performed by a wireless network device, the method comprising: storing a routing table, each entry of the routing table associated with a peer node; determining the existence of a peer node, and adding an entry associated with the peer node into the stored routing table; validating each peer node having an entry stored in the routing table, wherein validating each peer node includes confirming that the peer node is still a peer node of the wireless network device, wherein on a condition that a peer node is no longer a peer node of the wireless network device, deleting the peer node from the routing table, wherein validating each peer node comprises: receiving a broadcasted hello message from a peer node; determining, based on the broadcasted hello message, one or more interfaces to communicate with the peer node; determining costs for links of the one or more interfaces, wherein a highest cost link of the one or more interfaces is blocked and a lowest cost link of the one or more interfaces is unblocked; transmitting an announce message that indicates the highest cost link as blocked and the lowest cost link as unblocked; and receiving another announce message, wherein the another announce message includes information about unblocked and blocked links to update the routing table; determining whether a destination of received traffic is a peer node having an entry stored in the routing table; when the determination is positive, determining to accelerate the traffic to an interface associated with the peer node associated with the destination of the traffic; and transmitting the traffic via the interface. ### Claim 10 (depends on 9) The method of claim 9, wherein the highest cost link is a wireless interface and the lowest cost link is a wired interface. ### Claim 11 (depends on 9) The method of claim 9, wherein a direct peer node is determined based on a predetermined number of hello messages. ### Claim 12 (depends on 9) The method of claim 9, wherein the announce message is transmitted to unblocked hello neighbors periodically or continuously. ### Claim 13 (depends on 9) The method of claim 9, wherein the broadcasted hello message is transmitted periodically or continuously. ### Claim 14 (depends on 9) The method of claim 9, wherein the broadcasted hello message is not forwarded. ### Claim 15 (depends on 9) The method of claim 9 further comprising: determining, based on the broadcasted hello message, existence of a peer node of an island, wherein the peer node is blocked from wireless communication with the wireless network device. ### Claim 16 (depends on 9) The method of claim 9, wherein the announce message is utilized to build any one of a mesh island. ### Claim 17 (depends on 1) The wireless network device of claim 1, wherein accelerating the traffic includes routing the received traffic to the interface associated with the peer node associated with the destination of the traffic without passing the traffic up a networking stack of the wireless network device. ### Claim 18 (depends on 9) The method performed by a wireless network device of claim 9, wherein accelerating the traffic includes routing the received traffic to the interface associated with the peer node associated with the destination of the traffic without passing the traffic up a networking stack of the wireless network device.