System and method for implementing mesh network communications using a mesh network protocol

• US 9,621,457 B2
• Filed: 02/17/2014
• Issued: 04/11/2017
• Est. Priority Date: 09/04/2008
• Status: Active Grant

• Current Assignee: Trilliant Networks Incorporated
• Original Assignee: Trilliant Networks Incorporated
• Inventors: Veillette, Michel
• Primary Examiner(s): Pezzlo, John
• Application Number:
  US14/182,047
• Publication Number:
  US 20140226667A1
• Time in Patent Office: 1,149 Days
• Field of Search: 370389, 3703952, 370252, 370282, 370406
• CPC Class Codes: H04L 45/20 Hop count for routing purposes, e.g. TTL
• CPC Class Codes: H04L 45/34 Source routing
• CPC Class Codes: H04L 45/42 Centralised routing
• CPC Class Codes: H04L 45/44 Distributed routing
• CPC Class Codes: H04L 45/48 Routing tree calculation
• CPC Class Codes: H04L 45/52 Multiprotocol routers
• CPC Class Codes: H04L 45/72 Routing based on the source address
• CPC Class Codes: H04L 63/123 received data contents, e.g. message integrity
• CPC Class Codes: H04W 40/005 Routing actions in the presence of nodes in sleep or doze mode
• CPC Class Codes: H04W 40/02 Communication route or path selection, e.g. power-based or shortest path routing
• CPC Class Codes: H04W 40/12 based on transmission quality or channel quality
• CPC Class Codes: H04W 40/22 using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
• CPC Class Codes: H04W 40/246 Connectivity information discovery
• CPC Class Codes: H04W 40/28 for reactive routing
• CPC Class Codes: H04W 48/18 Selecting a network or a communication service
• CPC Class Codes: H04W 8/02 Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

The following describes data structures, communication protocol formats and process flows for controlling and facilitating secure communications between the nodes of a mesh network, such as utility meters and gateway nodes comprising a utility network. The enabled processes include association, information exchange, route discovery and maintenance and the like for instituting and maintaining a secure mesh network.

Claims

1. A process for discovering a route from a first node to a second node in a mesh network comprising:

broadcasting by the first node a route request message that is propagated across multiple nodes within the mesh network in accordance with the following process implemented within processors at the multiple nodes;

accepting a route request at a receiving node if;

(i) no previous received route request message had the same request ID; and

(ii) the route request message is received through a link with a minimum LQI class at least equal to the requested one;

identifying the receiving node as a route candidate and

(iii) if the route request message is accepted by an intermediate node, re-broadcasting the route request;

(iv) if the route request message is accepted by the second node,

sending a route reply message from the second node through the identified route candidate back to the first node to establish a static bidirectional route within the mesh network between the first node and the second node.

2. A process for upgrading a route from a first node to a second node in a mesh network further comprising:

accepting a route request at a receiving node for upgrading the route if;

a route candidate already exists for the request ID;

the request was received through a link with a minimum LQI class at least equal to the requested one; and

the request was received through a better link than the prior received one, as determined by one of the following sets of conditions;

(i) the receiving node is a neighbor, the route request is received from a neighbor and a resulting route length is shorter;

(ii) the receiving node is not a neighbor, the route request is received from a neighbor and a resulting route length is shorter or equal to existing route length;

(iii) the receiving node is not a neighbor, the route request is received from a non-neighbor and a resulting route length is shorter;

otherwise rejecting the route request.

3. A process for requesting a route from a first node to a second node within a mesh network comprising:

transmitting a route request message to a pre-determined coordinator node, wherein the route request message includes a long address for the second node;

constructing at the coordinator node a route through one or more routing nodes from the first node to the second node;

transmitting a response to the route request message to the first node including the route to the second node, wherein the route includes an assigned short address for the second node.

4. The process according to claim 3, wherein the long address is 8 octets and the short address is 2 octets.