# US 11,451,469 B2 · On-demand table and route update after a node failure in a wireless network > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 11,451,469 B2 - Document ID: US11451469B2 - Status: Granted - Kind: B2 - Application number: 17/076,179 - Filed: 2020-10-21 - Published: 2021-04-22 - Granted: 2022-09-20 - Earliest claimed: 2019-10-21 - Assignees: Carrier Corporation - Applicants: Carrier Corporation - Inventors: Adam Kuenzi; Michael Lang; Chih-Kuang Lin; Davide Villa - Web page: https://patentgrep.com/patent/US11451469B2 ## CPC - H04L 45/28: using route fault recovery - H04L 45/20: {Hop count for routing purposes, e.g. TTL} - H04L 45/22: {Alternate routing} - H04W 40/248: {Connectivity information update} - H04W 40/28: for reactive routing - H04W 40/34: Modification of an existing route - H04L 45/48: Routing tree calculation - Y02D 30/70: in wireless communication networks - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) - H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72) - Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE ## Abstract A method for a network 300 including a plurality of nodes, the method including: detecting, at a first node (N2), that a second node (N1) is a failed node; recording, at the first node, that the second node is a failed node and that a first path is unavailable; switching, at the first node, to a second path, the second path including a third node (N6); checking, at the first node, the hop count of the third node, wherein the third node is the next hop on the second path; generating an information packet at the first node, wherein the information packet comprises a unique ID of the failed node and the hop count of the first node; broadcasting the information packet from the first node (N2) to one or more one-hop neighbouring nodes (N1, N3, N6) of the first node. ## Claims ### Claim 1 A method for a network (300) comprising a plurality of nodes, comprising: detecting, at a first node (N2), that a second node (N1) is a failed node; recording, at the first node, that the second node is a failed node and that a first path is unavailable; switching, at the first node, to a second path, the second path comprising a third node (N6); checking, at the first node, a hop count of the third node, wherein the third node is a next hop on the second path from the first node; generating an information packet at the first node, wherein the information packet comprises a unique ID of the failed node and a hop count of the first node; broadcasting the information packet from the first node (N2) to one or more one-hop neighbouring nodes (N1, N3, N6) of the first node; storing, at each of the one-hop neighbouring nodes that receives the information packet, the unique ID of the failed node (N1) and the hop count of the first node; recalculating, at each of the one-hop neighbouring nodes that receives the information packet, a new hop count, wherein, if the new hop count at one of the one-hop neighbouring nodes is different from a hop count of the one-hop neighbouring node prior to receiving the information packet, the one-hop neighbouring node generates a second information packet comprising the new hop count of the one-hop neighbouring node and broadcasts the second information packet to one or more of its own one-hop neighbouring nodes. ### Claim 2 (depends on 1) The method of claim 1, wherein the first node sends a data packet from the first node to the second node along the first path, wherein the second node is a failed node and the data packet is not successfully sent to the second node. ### Claim 3 (depends on 1) The method of claim 1, wherein if the third node has a hop count different from a hop count of the second node, updating the hop count of the first node. ### Claim 4 (depends on 1) The method of claim 1, wherein the first node broadcasts the information packet to all of its one-hop neighbouring nodes. ### Claim 5 (depends on 1) The method of claim 1, wherein the first node is configured to rank each of its one-hop neighbours according to parameters which include: a hop count; whether they are members of a subnetwork within the network (300); and a received signal strength indicator (RSSI). ### Claim 6 (depends on 5) The method of claim 5, wherein the first node sends the information packet to a subset of the total number of one-hop neighbouring nodes starting from the top-ranking one-hop neighbouring node. ### Claim 7 (depends on 1) The method of claim 1, wherein the first node utilises an on-demand route update, comprising: sending, from the first node, a third information packet to a source of a path comprising a failed link if that link is part of an uplink route, or to a head node (HN) if that link is part of a downlink path, wherein when a destination node of the third information packet receives the third information packet, the destination node invalidates the path comprising the failed link so that the path containing the failed link is not used in a future data delivery. ### Claim 8 (depends on 7) The method of claim 7, wherein any intermediary nodes between the first node and the destination node records paths containing the failed link as being invalid. ### Claim 9 (depends on 7) The method of claim 7, wherein the third information packet has a lower priority than that of other data packets. ### Claim 10 (depends on 1) The method of claim 1, wherein the first path is a path along which a data packet travels from a source node to a destination node. ### Claim 11 (depends on 10) The method of claim 10, wherein the first path comprises one or more intermediate nodes. ### Claim 12 A Bluetooth Low Energy (BLE) network (300) comprising multiple nodes comprising: a first node (N2); a second node (N1); and one or more one-hop neighbouring nodes (N1, N3, N6), wherein the one-hop neighbouring nodes are a one-hop distance from the first node; wherein the first node is configured to detect that the second node is a failed node (N1), record that the second node is a failed node and that a first path is unavailable, switch to a second path, the second path comprising a third node, check a hop count of the third node, wherein the third node is a next hop on the second path from the first node, generate an information packet, wherein the information packet comprises a unique ID of the failed node and a hop count of the first node, and broadcast the information packet to one or more of the one-hop neighbouring nodes; and wherein each of the one-hop neighbouring nodes (N1, N3, N6) that receives the information packet is configured to store the unique ID of the failed node and the hop count of the first node, and recalculate a new hop count, wherein, if the new hop count at one of the one-hop neighbouring nodes is different from a hop count of the one-hop neighbouring node prior to receiving the information packet, the one-hop neighbouring node generates a second information packet comprising the new hop count of the one-hop neighbouring node and broadcasts the second information packet to one or more of its own one-hop neighbouring nodes. ### Claim 13 (depends on 1, 12) A Bluetooth Low Energy (BLE) network (300) as claimed in claim 12, wherein the network (300) is configured to operate in accordance with the method of claim 1. ### Claim 14 (depends on 1) A non-transitory computer program product containing instructions that, when executed within a Bluetooth Low Energy (BLE) network (300) comprising multiple nodes, will configure the network (300) to operate in accordance with the method of claim 1.