IP Library Granted Patent US 12,627,584
Granted Patent B2
US 12,627,584 · App. 18/793,158 · Granted May 12, 2026

Determining network reliability using message success rates

Inventors: Thomas F. Uhling (Spokane Valley, WA); Keith Wayne Barnes (Waseca, MN)
Assignee: ITRON, INC.
H04L43/0811H04L43/16H04L45/123H04L67/12
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,627,584
App. No.
18/793,158
Granted
May 12, 2026
Kind
B2
Abstract

Techniques for determining network reliability using message success rates include receiving, by a first node and for a plurality of respective potential parent nodes, respective accumulated uplink message success rates, wherein a respective accumulated uplink message success rate for a respective potential parent node indicates a probability of successfully transmitting messages from that respective potential parent node to a target destination; determining, by the first node, respective local uplink message success rates for the plurality of respective potential parent nodes, wherein a respective local uplink message success rate indicates a probability of successfully transmitting messages from the first node to that respective potential parent node; and selecting, by the first node based on the respective accumulated uplink message success rates and the respective local uplink message success rates, a first respective potential parent node from the plurality of respective potential parent nodes as a parent node.

Claims (44)

1 . A method comprising:

receiving, by a first node and for a plurality of respective potential parent nodes, respective accumulated uplink message success rates, wherein a respective accumulated uplink message success rate for a respective potential parent node indicates a probability of successfully transmitting messages from that respective potential parent node to a target destination;

determining, by the first node, respective local uplink message success rates for the plurality of respective potential parent nodes, wherein a respective local uplink message success rate indicates a probability of successfully transmitting messages from the first node to that respective potential parent node; and

selecting, by the first node based on the respective accumulated uplink message success rates and the respective local uplink message success rates, a first respective potential parent node from the plurality of respective potential parent nodes as a parent node.

2 . The method of claim 1 , further comprising computing, by the first node, respective second accumulated uplink message success rates based on the respective local uplink message success rates and the respective accumulated uplink message success rates, wherein a respective second accumulated uplink message success rate indicates a probability of successfully transmitting messages from the first node to the target destination through the respective potential parent node.

3 . The method of claim 2 , wherein selecting the first respective potential parent node as the parent node comprises determining that a respective second accumulated message success rate associated with the first respective potential parent node is higher than respective second accumulated uplink message success rates associated with other respective potential parent nodes from the plurality of respective potential parent nodes.

4 . The method of claim 2 , further comprising transmitting, by the first node, a respective second accumulated message success rate associated with the first respective potential parent node to a third node.

5 . The method of claim 1 , wherein selecting the first respective potential parent node as the parent node comprises:

determining that a first respective local uplink message success rate associated with the first respective potential parent node is greater than a second respective local uplink message success rate associated with a second respective potential parent node included in the plurality of respective potential parent nodes; and

determining that a first respective accumulated uplink message success rate associated with the first respective potential parent node is less than a second respective accumulated uplink message success rate associated with the second respective potential parent node.

6 . The method of claim 1 , further comprising storing a respective accumulated uplink message success rate and a respective local uplink message success rate associated with the first respective potential parent node as an entry in a table, wherein the entry is associated with the first respective potential parent node.

7 . The method of claim 1 , further comprising:

receiving, by the first node and for respective potential parent nodes from the plurality of respective potential parent nodes, respective accumulated downlink message success rates, wherein a respective accumulated downlink message success rate for the respective potential parent node indicates a probability of successfully receiving, at that respective potential parent node, a message from the target destination; and

determining, by the first node, respective local downlink message success rates for the plurality of respective potential parent nodes, wherein a respective local downlink message success rate indicates a probability of successfully receiving, at the first node, messages transmitted by that respective potential parent node.

8 . The method of claim 7 , further comprising:

computing, by the first node, respective combined accumulated message success rates for the respective potential parent nodes based on the respective accumulated downlink message success rates and the respective accumulated uplink message success rates.

9 . The method of claim 1 , wherein selecting the first respective potential parent node as the parent node comprises filtering the plurality of respective potential parent nodes based on one or more message success rate criteria.

10 . The method of claim 2 , wherein selecting the first respective potential parent node as the parent node further comprises filtering the plurality of respective potential parent nodes based on one or more hierarchical secondary selection criteria.

11 . One or more non-transitory computer-readable media storing instructions that, when executed by one or more processors at a first node device in a mesh network, cause the one or more processors to perform operations comprising:

receiving respective path transmit success rates for a plurality of candidate parent node devices, wherein a respective path transmit success rate for a respective candidate parent node device indicates a likelihood that a data packet transmitted by the respective candidate parent node device to a destination device via a respective path will successfully be received at the destination device;

determining respective local transmit success rates for the plurality of candidate parent node devices, wherein a respective local transmit success rate indicates for the respective candidate parent node device indicates a likelihood that a data packet transmitted by the first node device will successfully be received at the respective candidate parent node device; and

choosing a second node device as a parent node device for the first node device based on the respective local transmit success rates and the respective path transmit success rates.

12 . The one or more non-transitory computer-readable media of claim 11 , wherein the operations further comprise determining, based on the respective local transmit success rates and the respective path transmit success rates, respective second path transmit success rates, wherein a respective second path transmit success rate for the respective candidate parent node device indicates a likelihood that a packet transmitted by the first node device to the destination device via the respective candidate parent node device and the respective path will be successfully received at the destination device.

13 . The one or more non-transitory computer-readable media of claim 12 , wherein choosing the second node device as the parent node device for the first node device comprises determining that a respective second path transmit success rate associated with the second node device is higher than respective second path transmit success rates associated with other node devices from the plurality of candidate parent node devices.

14 . The one or more non-transitory computer-readable media of claim 11 , wherein the operations further comprise:

determining respective path receive success rates for the plurality of candidate parent node devices, wherein a respective path receive success rate for the respective candidate parent node device indicates a likelihood that a packet transmitted by the destination device via a reverse of the respective path and the respective candidate parent node device will be successfully received at the first node device;

wherein choosing the second node device as the parent node device for the first node device is further based on the respective path receive success rates.

15 . The one or more non-transitory computer-readable media of claim 14 , wherein the operations further comprise:

calculating respective combined path success rates for the plurality of candidate parent node devices based on the respective path transmit success rates and the respective path receive success rates;

wherein the second node device has a highest respective combined path success rate from the respective combined path receive success rates.

16 . The one or more non-transitory computer-readable media of claim 11 , wherein choosing the second node device as the parent node device to the first node device comprises filtering the plurality of respective candidate parent node devices based on one or more hierarchical secondary selection criteria.

17 . A network device comprising:

one or more processors; and

a memory storing instructions that when executed by the one or more processors causes the network device to perform operations comprising:

receiving respective accumulated transmit reliability rates for a plurality of neighbor devices to the network device in a mesh network, wherein a respective transmit reliability rate for a respective neighbor device indicates a probability that network traffic transmitted by the respective neighbor device will reach a destination network device;

determining respective local transmit reliability rates for the plurality of neighbor devices, wherein a respective local transmit reliability rate for the respective neighbor device indicates a probability that network traffic transmitted by the network device will reach the respective neighbor device; and

selecting one of the plurality of neighbor devices to be a parent device to the network device based on the respective local transmit reliability rates and the respective accumulated transmit reliability rates.

18 . The network device of claim 17 , wherein the operations further comprise:

determining, based on the respective local transmit reliability rates and the respective accumulated transmit success rates, respective second accumulated transmit reliability rates, wherein a respective second accumulated transmit reliability rate for the respective neighbor device indicates a probability that network traffic transmitted via the respective neighbor device will reach the destination network device;

wherein the selected neighbor device has a greatest respective second accumulated transmit reliability rate.

19 . The network device of claim 17 , wherein the operations further comprise:

determining respective accumulated receive reliability rates for the plurality of neighbor devices, wherein a respective accumulated receive reliability rate for the respective neighbor device indicates a probability that network traffic transmitted by the destination network device via the respective neighbor device will reach the network device;

wherein selecting the one of the plurality of neighbor devices to be the parent device is further based on the respective accumulated receive reliability rates.

20 . The network device of claim 17 , wherein selecting the one of the plurality of neighbor devices to be the parent device comprises determining that the accumulated transmit reliability rate for the selected neighbor device exceeds a minimum threshold value.

Assignments (2)
SECURITY INTEREST Recorded Sep 15, 2025
From: ITRON, INC.
To: WELLS FARGO BANK, NATIONAL ASSOCIATION
Reel/Frame 072870/0873 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 12, 2024
From: UHLING, THOMAS F.; BARNES, KEITH WAYNE
To: ITRON, INC.
Reel/Frame 068252/0664 →
Continuity (2)
Continuation 17402231 · Aug 13, 2021
Related Publication 20240396816A1 · Nov 28, 2024
References Cited (82)
US 8274910B2 · Chen et al. · 2012 [cited by applicant]
US 9565625B1 · MacNeille et al. · 2017 [cited by applicant]
US 9893971B1 · Singh et al. · 2018 [cited by applicant]
US 10341935B2 · Khalife et al. · 2019 [cited by applicant]
US 10477591B2 · Jung · 2019 [cited by examiner]
US 10536861B2 · Doherty et al. · 2020 [cited by applicant]
US 11483224B1 · Uhling et al. · 2022 [cited by applicant]
US 11646956B2 · Gupta · 2023 [cited by examiner]
US 20020049561A1 · Garcia-Luna-Aceves et al. · 2002 [cited by applicant]
US 20030191841A1 · DeFerranti et al. · 2003 [cited by applicant]
US 20070047499A1 · Montojo et al. · 2007 [cited by applicant]
US 20070223451A1 · Ren et al. · 2007 [cited by applicant]
US 20070291689A1 · Kapur et al. · 2007 [cited by applicant]
US 20080037431A1 · Nerb et al. · 2008 [cited by applicant]
US 20080068217A1 · Van Wyk et al. · 2008 [cited by applicant]
US 20080069013A1 · Monier et al. · 2008 [cited by applicant]
US 20080069118A1 · Monier · 2008 [cited by applicant]
US 20080084330A1 · Picard · 2008 [cited by applicant]
US 20080205420A1 · Srikrishna et al. · 2008 [cited by applicant]
US 20090135738A1 · Mhatre et al. · 2009 [cited by applicant]
US 20100061272A1 · Veillette · 2010 [cited by examiner]
US 20100195574A1 · Richeson et al. · 2010 [cited by applicant]
US 20100254364A1 · Yi et al. · 2010 [cited by applicant]
US 20100278187A1 · Hart et al. · 2010 [cited by applicant]
US 20110164527A1 · Mishra et al. · 2011 [cited by applicant]
US 20110188452A1 · Borleske et al. · 2011 [cited by applicant]
US 20120327789A1 · Grenier et al. · 2012 [cited by applicant]
US 20130159550A1 · Vasseur · 2013 [cited by applicant]
US 20130198305A1 · Veillette · 2013 [cited by applicant]
US 20130227022A1 · Trivedi et al. · 2013 [cited by applicant]
US 20130290530A1 · Pohlmann · 2013 [cited by examiner]
US 20140016544A1 · Chan · 2014 [cited by applicant]
US 20140036702A1 · Van Wyk et al. · 2014 [cited by applicant]
US 20140313909A1 · Doherty et al. · 2014 [cited by applicant]
US 20140369212A1 · Raravi et al. · 2014 [cited by applicant]
US 20150208316A1 · Mosko et al. · 2015 [cited by applicant]
US 20150319629A1 · Dabirmoghaddam et al. · 2015 [cited by applicant]
US 20160021613A1 · Mani et al. · 2016 [cited by applicant]
US 20160269260A1 · Kazmi et al. · 2016 [cited by applicant]
US 20160269975A1 · Watanabe et al. · 2016 [cited by applicant]
US 20160295355A1 · Yuan et al. · 2016 [cited by applicant]
US 20170053258A1 · Carney et al. · 2017 [cited by applicant]
US 20170070941A1 · Veillette · 2017 [cited by applicant]
US 20170099218A1 · Holcombe et al. · 2017 [cited by applicant]
US 20170105178A1 · Chirikov et al. · 2017 [cited by applicant]
US 20170289919A1 · Kurihara et al. · 2017 [cited by applicant]
US 20180091989A1 · Baroudi et al. · 2018 [cited by applicant]
US 20180139679A1 · Astrom et al. · 2018 [cited by applicant]
US 20180324609A1 · Diancin · 2018 [cited by applicant]
US 20190058532A1 · Nagaraja et al. · 2019 [cited by applicant]
US 20190069306A1 · Fukuta · 2019 [cited by examiner]
US 20190097754A1 · Yu et al. · 2019 [cited by applicant]
US 20190098606A1 · Sharma et al. · 2019 [cited by applicant]
US 20190174389A1 · Kamp et al. · 2019 [cited by applicant]
US 20190363965A1 · Tewari et al. · 2019 [cited by applicant]
US 20190394737A1 · Luo · 2019 [cited by applicant]
US 20200068656A1 · Yang et al. · 2020 [cited by applicant]
US 20200084690A1 · Sakata et al. · 2020 [cited by applicant]
US 20200092791A1 · Arvidson et al. · 2020 [cited by applicant]
US 20200099616A1 · Nguyen et al. · 2020 [cited by applicant]
US 20200187282A1 · Yu et al. · 2020 [cited by applicant]
US 20200204487A1 · Woodland · 2020 [cited by applicant]
US 20200205199A1 · Newman et al. · 2020 [cited by applicant]
US 20200404513A1 · Hayes et al. · 2020 [cited by applicant]
US 20210007180A1 · Hou et al. · 2021 [cited by applicant]
US 20210029653A1 · Zhang et al. · 2021 [cited by applicant]
US 20210099941A1 · Catalli · 2021 [cited by examiner]
US 20210120082A1 · Harris · 2021 [cited by applicant]
US 20210160758A1 · Huang et al. · 2021 [cited by applicant]
US 20210274449A1 · Choi et al. · 2021 [cited by applicant]
US 20210336879A1 · Nguyen · 2021 [cited by applicant]
US 20220007235A1 · Liu et al. · 2022 [cited by applicant]
US 20220014986A1 · Weizman et al. · 2022 [cited by applicant]
US 20220369160A1 · Jamil et al. · 2022 [cited by applicant]
WO 2020067982A1 · 2020 [cited by applicant]
Notice of Allowance received for U.S. Appl. No. 18/430,435 dated Mar. 17, 2025, 12 pages. [cited by applicant]
Vasseur et al., “Routing Metrics Used for Path Calculation in Low-Power and Lossy Networks”, Internet Engineering Task Force (IETF), Mar. 2012, 30 pages. [cited by applicant]
Deleon et al., “An Experimental Performance Evaluation of Bluetooth Mesh Technology for Monitoring Applications”, IEEE Wireless Communications and Networking Conference {WCNC), DOI: 10.1109/WCNC45663.2020.9120762, 2020,… [cited by applicant]
Ali et al., “Performance Evaluation of Heterogeneous IoT Nodes With Differentiated QoS in IEEE 802.11 ah RAW Mechanism”, IEEE Transactions on Vehicular Technology, DOI: 10.1109/TVT.2019.2897127, vol. 68, No. 4, Apr. 201… [cited by applicant]
Non Final Office Action received for U.S. Appl. No. 18/430,435 dated Nov. 7, 2024, 37 pages. [cited by applicant]
Non Final Office Action received for U.S. Appl. No. 18/768,332 dated Jan. 8, 2026, 94 pages. [cited by applicant]
Non Final Office Action received for U.S. Appl. No. 18/923,174 dated Mar. 27, 2026, 57 pages. [cited by applicant]