CA2734953A1 - A system and method for implementing mesh network communications using a mesh network protocol - Google Patents

A system and method for implementing mesh network communications using a mesh network protocol Download PDF

Info

Publication number
CA2734953A1
CA2734953A1 CA2734953A CA2734953A CA2734953A1 CA 2734953 A1 CA2734953 A1 CA 2734953A1 CA 2734953 A CA2734953 A CA 2734953A CA 2734953 A CA2734953 A CA 2734953A CA 2734953 A1 CA2734953 A1 CA 2734953A1
Authority
CA
Canada
Prior art keywords
node
route
network
request
key
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
CA2734953A
Other languages
French (fr)
Inventor
Michel Veillette
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Trilliant Networks Inc
Original Assignee
Trilliant Networks Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Trilliant Networks Inc filed Critical Trilliant Networks Inc
Publication of CA2734953A1 publication Critical patent/CA2734953A1/en
Abandoned legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/34—Source routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/20—Hop count for routing purposes, e.g. TTL
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/42—Centralised routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/44—Distributed routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/48—Routing tree calculation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/52—Multiprotocol routers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/72—Routing based on the source address
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/12—Applying verification of the received information
    • H04L63/123—Applying verification of the received information received data contents, e.g. message integrity
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/005—Routing actions in the presence of nodes in sleep or doze mode
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/246—Connectivity information discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/28—Connectivity information management, e.g. connectivity discovery or connectivity update for reactive routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W48/00—Access restriction; Network selection; Access point selection
    • H04W48/18—Selecting a network or a communication service
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • 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
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks 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.

Description

A SYSTEM AND METHOD FOR IMPLEMENTING MESH NETWORK
COMMUNICATIONS USING A MESH NETWORK PROTOCOL

CROSS-REFERENCE TO RELATED APPLICATIONS

[00011 The present application claims the benefit of United States provisional patent application serial number 61/094,116 entitled "Message Formats and Processes for Communication Across a Mesh Network," filed September 4, 2008 (TR0049-PRO) which is incorporated herein by reference in its entirety.

[00021 The present application hereby references and incorporates by reference each of the following United States patent applications:

= Serial number 12/275,236 entitled "Point-to-Point Communication Within a Mesh Network", filed November 21, 2008 (TR0004-US);

= Serial number 12/275,305 entitled "Transport Layer and Model For an Advanced Metering Infrastructure (AMI) Network," filed November 21, 2008 (TR0003-US);

= Serial number 12/275,237 entitled "System and Method For Application Layer Time Synchronization Without Creating a Time Discrepancy or Gap in Time", filed November 21, 2008 (TR0006-US);

= Serial number 12/275,238 entitled "Communication and Message Route Optimization and Messaging in a Mesh Network," filed November 21, 2008 (TR0007-US);

= Serial number 12/275,242 entitled "Collector Device and System Utilizing Standardized Utility Metering Protocol," filed November 21, 2008 (TR0009-US);

= Serial number 12/275,251 entitled "Power-Conserving Network Device For Advanced Metering Infrastructure", filed November 21, 2008 (TR0018-US);

= Serial number 12/275,252 entitled "Method and System For Creating and Managing Association and Balancing of a Mesh Device in a Mesh Network", filed November 21, 2008 (TR0020);

= Serial number 12/275,257 entitled "System and Method for Operating Mesh Devices in Multi-Tree Overlapping Mesh Networks," filed November 21, 2008 (TR0038-US);
and 1 of 107 = Serial number 61/094,144 entitled "Framework For Implementing Mesh Network Layers", filed September 4, 2008 (TR0052-PRO).

BACKGROUND OF THE INVENTION
FIELD OF THE INVENTION

100031 This invention pertains generally to a protocol layer for facilitating the creation and maintenance of a secure mesh network. More particularly, preferred embodiments of the invention describe 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 devices comprising a utility network.

SUMMARY OF THE BACKGROUND ART

100041 A mesh network is a wireless network configured to route data between nodes within a network. It allows for continuous connections and reconfigurations around broken or blocked paths by retransmitting messages from node to node until a destination is reached. Mesh networks differ from other networks in that the component parts can all connect to each other via multiple hops. Thus, mesh networks are self-healing: the network remains operational when a node or a connection fails.

[00051 Advanced Metering Infrastructure (AMI) or Advanced Metering Management (AMM) are systems that measure, collect and analyze utility usage, from advanced devices such as electricity meters, gas meters, and water meters, through a network on request or a pre-defined schedule. This infrastructure includes hardware, software, communications, customer associated systems and meter data management software. The infrastructure collects and distributes information to customers, suppliers, utility companies and service providers.
This enables these businesses to either participate in, or provide, demand response solutions, products and services.
Customers may alter energy usage patterns from normal consumption patterns in response to demand pricing. This improves system load and reliability.

(00061 A meter may be installed on a power line, gas line, or water line and wired into a power grid for power. Newly installed meters may associate with a specified network identifier 2of107 entered by a user during installation. Alternatively, the user may initiate an association window during which a meter may associate with a nearby mesh network.

SUMMARY OF THE INVENTION

100071 In accordance with an embodiment of the present invention, a method of associating a device to a mesh network is described. The method includes selecting a network for association including: requesting, by the device, neighbor information from neighboring devices which may belong to one or more networks, receiving, at the device from one or more neighboring devices, neighbor information for each of the one or more neighboring devices, applying an association ratio algorithm to the received neighbor information to determine which of the one or more networks to select for association. The method further includes selecting a router within the selected network through which to proxy messages by applying a preferred route ratio algorithm; sending a network association request from the device through the router to a network coordinator; and at the network coordinator, performing one of the following in response to the network association request: validating the association request with an association response message which includes the short address for this device, or not responding to the network association request. The method further includes constructing, at the device, an initial neighborhood table.

100081 In accordance with another embodiment of the present invention, a process for routing data frames from a first node to a second node within a network is described. The process includes: a tree routing sub-process, a source routing sub-process, a temporary routing sub-process and a mesh routing sub-process. The particular sub-process for routing a data frame from the first node the second nodes is selected in accordance with the following logic executed on a processor: if the data frame has a source route header the source routing sub-process is selected; if there is an entry for the target address in a temporary routing table, the temporary routing sub-process is selected; if the second node is a coordinator node, the tree routing sub-process is selected; and if the second node is not a coordinator node, the mesh routing sub-process is selected.

3of107 100091 In accordance with another embodiment of the present invention, a process for discovering a route from a first node to a second node in a mesh network is described. The process includes broadcasting by the first node a route request message that is propagated across multiple nodes within the mesh network. The propagation follows a processor implemented process at the multiple nodes, including 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 If the route request message is accepted by an intermediate node; the route request is re-broadcasted. If the route request message is accepted 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.

[00101 In accordance with a further embodiment of the present invention, a process for upgrading a route from a first node to a second node in a mesh network is described. The process includes: 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. These determinations are made according to 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. If the conditions are not met, the route request is rejected.

[00111 In accordance with a further embodiment of the present invention, a process for requesting a route from a first node to a second node within a mesh network is described. The process includes: 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; and transmitting a response to the route request message to the first node including the 4 of 107 route to the second node, wherein the route includes an assigned short address for the second node.

100121 In accordance with a further embodiment of the present invention, a data structure for securing data frames transmitted in a single hop within a mesh network from a first node to a second node is described. The data structure includes a data link layer (DLL) security header located after a service-type octet when a predetermined security header flag is selected within the service-type octet. The DLL security header including: a first set of bits containing a portion of a transmitted nonce count; a bit following the first set of bits containing a key identifier (ID), wherein the key ID selects a current version of a key used for calculating a message integrity check (MIC); and a second set of bits containing the MIC.

[00131 In accordance with a further embodiment of the present invention, a process for validating integrity of message data transmitted in a single hop from a first node to a second node within a mesh network is described. The process including: checking at a processor of the second node the 23 least significant bits (0-22) of a count transmitted from the first node against a last authenticated count; if the transmitted count value is greater than the last authenticated count, combining at a processor of the second node, the 23 least significant bits (0-22) with the 17 most significant bits (23 - 39) of the last authenticated count to form a revised count; if the transmitted count value is lower than the last authenticated count, incrementing the value of bits 23 through 29 by one before combining at a processor of the second node, the 23 least significant bits (0-22) with the 17 most significant bits (23 - 39) of the last authenticated count to form a revised count; calculating at the processor of the second node a message integrity check (MIC) value using the revised count and pre-selected key; if the calculated MIC
value equals a received MIC value, then the message data integrity is validated.

[00141 In accordance with a further embodiment of the present invention, a data structure for securing data frames transmitted in multiple hops using multiple nodes across a mesh network. The data structure including a network security header located after a data link layer (DLL) security layer within a mesh header. The network security header including: a first set of bits containing a network count; a bit following the first set of bits containing a network key identifier (ID); and a second set of bits containing a network message integrity check (MIC).

5of107 [0015] In accordance with a further embodiment of the present invention, a process for validating integrity of a data frame transmitted in multiple hops using multiple nodes across a mesh network. The process including: receiving a data frame at a receiver node, wherein the data frame includes a network security header including a network count, a network key identifier (ID) and a message integrity check (MIC); processing an identifier (ID) for an originating node that originated the data frame and a source field address to determine if the data frame was received from a coordinator node or a non-coordinator node; if the data frame was received from a coordinator node, the network key ID selects a node key for determining verification; if the data frame was received from a non-coordinator node, the network key ID
selects a mesh key for determining verification. Further, when the received data frame is a request, a nonce is a combination of at least the network count, the originating node ID and an originating node address and the receiving node verifies the integrity of the frame by: adding a 0 to the network field to make a 40 bit field; calculating the received MIC
using either the node key or the mesh key as identified by the network key ID; comparing the transmitted MIC with the received MIC, wherein the data frame is verified if the transmitted MIC is equal to the received MIC. And when the received data frame is a response, the network count is combined with the identifier and address for the target of the data frame and the originating node ID and an originating node address and the receiving node compares a network count in the response with a network count in the request, wherein the data frame is verified if the response network count is equal to the request network count.

BRIEF DESCRIPTION OF THE FIGURES

The following figures are intended to be read in conjunction with the specification set forth herein.

[0016] Figure 1 shows a SecureMesh (SM) Architecture in accordance with an embodiment of the present invention.

[0017] Figure 2 shows an SM Example Topology in accordance with an embodiment of the present invention.

[0018] Figure 3 shows a Neighbor Information Request Process in accordance with an embodiment of the present invention.

6 of 107 100191 Figure 4 shows an Association Process in accordance with an embodiment of the present invention.

100201 Figure 5 shows an Association Confirmation Process in accordance with an embodiment of the present invention.

100211 Figure 6 shows Route Selection Processing in accordance with an embodiment of the present invention.

100221 Figure 7 shows Tree Routing Processing in accordance with an embodiment of the present invention.

[00231 Figure 8 shows Source Routing Processing in accordance with an embodiment of the present invention.

[00241 Figure 9 shows Mesh Routing Processing in accordance with an embodiment of the present invention.

100251 Figure 10 shows Temporary Routing Processing in accordance with an embodiment of the present invention.

[00261 Figure 11 shows Temporary Routing in accordance with an embodiment of the present invention.

[00271 Figure 12 shows Route Discovery, a complete process with no Route Candidate upgrade, in accordance with an embodiment of the present invention.

(00281 Figure 13 shows Route Discovery, a complete process with Route Candidate upgrade, in accordance with an embodiment of the present invention.

100291 Figure 14 shows Route Establishment in accordance with an embodiment of the present invention.

100301 Figure 15 shows a Neighbor Information Exchange in accordance with an embodiment of the present invention.

100311 Figure 16 shows a Checkpoint in accordance with an embodiment of the present invention.

7of107 [0032] Figure 17 shows a DLL Security Header in accordance with an embodiment of the present invention.

[0033] Figure 18 shows an SM DLL Nonce in accordance with an embodiment of the present invention.

[0034] Figure 19 shows a DLL Security MIC Coverage in accordance with an embodiment of the present invention.

[0035] Figure 20 shows a Network Security Header in accordance with an embodiment of the present invention.

[0036] Figure 21 shows a Network Security Nonce in accordance with an embodiment of the present invention.

[0037] Figure 22 shows Network Security MIC Coverage in accordance with an embodiment of the present invention.

[0038] Figure 23 shows a Network Security Process in accordance with an embodiment of the present invention.

[0039] Figure 24 shows Association Request Security in accordance with an embodiment of the present invention.

[0040] Figure 25 shows Association Response Security in accordance with an embodiment of the present invention.

[0041] Figure 26 shows Security Key Updates in accordance with an embodiment of the present invention.

[0042] Figure 27 shows Key Switching and Key Deactivation in accordance with an embodiment of the present invention.

[0043] Figure 28 shows End Device Association in accordance with an embodiment of the present invention.

[0044] Figure 29 shows End Device Parent Lost in accordance with an embodiment of the present invention.

8of107 [00451 Figure 30 shows Communication with a Sleeping End Device in accordance with an embodiment of the present invention.

100461 Figure 31 shows Sleeping End Device Message Forwarding in accordance with an embodiment of the present invention.

[00471 Figure 32 shows Sleeping End Device Checkpoint Frame Reception in accordance with an embodiment of the present invention.

[00481 Figure 33 shows Sleeping End Device Checkpoint - No Frame in accordance with an embodiment of the present invention.

100491 Figure 34 shows Sleeping End Device Local Communications in accordance with an embodiment of the present invention.

[00501 Figure 35 shows a Forwarding Service in accordance with an embodiment of the present invention.

100511 Figure 36 shows Power Event Notifications from Nodes in accordance with an embodiment of the present invention.

[00521 Figure 37 shows a Multi-Hop Non-Leaf Node Report in accordance with an embodiment of the present invention.

[00531 Figure 38 shows a Retry Power Event Report in accordance with an embodiment of the present invention.

[00541 Figure 39 shows a One Hop Non-Leaf Node Report in accordance with an embodiment of the present invention.

[00551 Figure 40 shows a Leaf Node Power Event Report in accordance with an embodiment of the present invention.

100561 Figure 41 shows a Mesh Multicast in accordance with an embodiment of the present invention.

100571 Figure 42 shows a Local Communication in accordance with an embodiment of the present invention.

9of107 [00581 Figure 43 shows a Range Test in accordance with an embodiment of the present invention.

[00591 Figure 44 shows a Frame Reception Rate Test in accordance with an embodiment of the present invention.

100601 Figure 45 shows a Ping in accordance with an embodiment of the present invention.

100611 Figure 46 shows a Frame format: Data transfer in accordance with an embodiment of the present invention.

[00621 Figure 47 shows a Frame format: Mesh Multicast in accordance with an embodiment of the present invention.

[00631 Figure 48 shows a Frame format: Route Request in accordance with an embodiment of the present invention.

[00641 Figure 49 shows a Frame format: Route Reply in accordance with an embodiment of the present invention.

100651 Figure 50 shows a Frame format: Route Error in accordance with an embodiment of the present invention.

100661 Figure 51 shows a Frame format: Common routed message format in accordance with an embodiment of the present invention.

[00671 Figure 52 shows a Frame format: Association Confirmation Request in accordance with an embodiment of the present invention.

[00681 Figure 53 shows a Frame format: Association Confirmation Response in accordance with an embodiment of the present invention.

[00691 Figure 54 shows a Frame format: Keep Alive Initiate in accordance with an embodiment of the present invention.

[00701 Figure 55 shows a Frame format: Keep Alive Request in accordance with an embodiment of the present invention.

of 107 [0071] Figure 56 shows a Frame format: Keep Alive Request: Optional extension:
Trace Route in accordance with an embodiment of the present invention.

[0072] Figure 57 shows a Frame format: Keep Alive Request: Optional extension:
Multicast Group Addresses in accordance with an embodiment of the present invention.
[0073] Figure 58 shows a Frame format: Keep Alive Request: Optional extension:
Neighbors information in accordance with an embodiment of the present invention.

[0074] Figure 59 shows a Frame format: Keep Alive Request: Optional extension:
Statistics in accordance with an embodiment of the present invention.

[0075] Figure 60 shows a Frame format: Keep Alive Response in accordance with an embodiment of the present invention.

[0076] Figure 61 shows a Frame format: Keep Alive Response: Parameter list member:
Current time in accordance with an embodiment of the present invention.

[0077] Figure 62 shows a Frame format: Keep Alive Response: Parameter list member:
Statistics in accordance with an embodiment of the present invention.

[0078] Figure 63 shows a Frame format: Keep Alive Response: Parameter list member:
SMIB parameter update in accordance with an embodiment of the present invention.

[0079] Figure 64 shows a Frame format: Keep Alive Response: Parameter list member:
Write-Switch-Deactivate Key in accordance with an embodiment of the present invention.
[0080] Figure 65 shows a Frame format: Route Establishment Request in accordance with an embodiment of the present invention.

[0081] Figure 66 shows a Frame format: Route Establishment Response in accordance with an embodiment of the present invention.

[0082] Figure 67 shows a Frame format: Power Event Report in accordance with an embodiment of the present invention.

[0083] Figure 68 shows a Frame format: Ping in accordance with an embodiment of the present invention.

11 of 107 [0084] Figure 69 shows a Frame format: Service Forwarding in accordance with an embodiment of the present invention.

[0085] Figure 70 shows a Frame format: Association Request in accordance with an embodiment of the present invention.

[0086] Figure 71 shows a Frame format: Association Response in accordance with an embodiment of the present invention.

[0087] Figure 72 shows a Frame format: Neighbor Info Request, originator is not a network member, in accordance with an embodiment of the present invention.

(0088] Figure 73 shows a Frame format: Neighbor Info Request, originator is a network member, in accordance with an embodiment of the present invention.

[0089] Figure 74 shows a Frame format: Neighbor Info Response, originator is not a network member, in accordance with an embodiment of the present invention.

[0090] Figure 75 shows a Frame format: Neighbor Info Response, originator is a network member, in accordance with an embodiment of the present invention.

[0091] Figure 76 shows a Frame format: Neighbors Exchange in accordance with an embodiment of the present invention.

[0092] Figure 77 shows a Frame format: End Device Data Request in accordance with an embodiment of the present invention.

[0093] Figure 78 shows a Frame format: End Device Data Request in accordance with an embodiment of the present invention.

[0094] Figure 79 shows a Frame format: Service Request Request in accordance with an embodiment of the present invention.

[0095] Figure 80 shows a Frame format: Service Request Response in accordance with an embodiment of the present invention.

[0096] Figure 81 shows a Frame format: Common point-to-point messaging in accordance with an embodiment of the present invention.

12 of 107 [0097] Figure 82 shows a Frame format: Local Data Transfer in accordance with an embodiment of the present invention.

[0098] Figure 83 shows a Frame format: Frame Reception Rate Test Init in accordance with an embodiment of the present invention.

[0099] Figure 84 shows a Frame format: Frame Reception Rate Test Data in accordance with an embodiment of the present invention.

[0100] Figure 85 shows a Frame format: Frame Reception Rate Test End in accordance with an embodiment of the present invention.

[0101] Figure 86 shows a Frame format: Frame Reception Rate Test Result in accordance with an embodiment of the present invention.

[0102] Figure 87 shows a Frame format: Local Broadcast Request in accordance with an embodiment of the present invention.

[0103] Figure 88 shows a Frame format: Local Broadcast Response in accordance with an embodiment of the present invention.

[0104] Figure 89 shows a Frame format: Local Broadcast: Payload Content ID 1 in accordance with an embodiment of the present invention.

[0105] Figure 90 shows a Frame format: Local Broadcast: Payload Content ID 2 in accordance with an embodiment of the present invention.

[0106] Figure 91 shows a Frame format: End Device Node Present in accordance with an embodiment of the present invention.

[0107] Figure 92 shows a Frame format: Range Test Request in accordance with an embodiment of the present invention.

[0108] Figure 93 shows a Frame format: Range Test Response in accordance with an embodiment of the present invention.

[0109] Figure 94 shows a Frame format: Range Test Initiate in accordance with an embodiment of the present invention.

13 of 107 [0110] Figure 95 shows a Frame format: Range Test Result in accordance with an embodiment of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

101111 The following charts of terms and acronyms are intended to define the frequently used terms in the context of the preferred embodiments of the present invention. The definitions provided are not intended to define the entire scope of the term. One skilled in the art appreciates the various alternatives and variations that are clearly within the scope of the invention as described.

GLOSSARY OF TERMS:

[01121 Association Router - Router selected by a Node which is not yet a member of the network, to act as a proxy to send the Node's association request.

101131 Child - In the context of tree routing, all Routers in single-hop radio frequency (RF) contact with a reference Router, with a hop count greater than the hop count of that reference. In the context of End Devices, a Child refers to an End Device of a specific Router through which it sends and receives messages.

101141 Dedicated Router - A router manually configured to associate to a specific network to guarantee that the network covers a specific geographical region.

[01151 Device Key - A key unique to the device. The initial device key is assigned by its manufacturer and is unchangeable. A database for device IDs and initial Device Keys is made available to the system owner and is installed in the network's Configuration Host. A Device Key generated by a Configuration Host should be known only to the Configuration Host and the device. Device Keys are used only for securing Application Layer communication between the Configuration Host and the device. As such, they are not directly part of the SM protocol, which encompasses only the data link layers.

101161 Frame - A data-link layer message.

101171 Key ID - Keys are updated from time to time; the specific generation of key is identified within this specification with a single bit Key ID, which is the low-order (even/odd) bit of the actual key generation count.

14 of 107 101181 Key Type - Each key type has a specific usage, scope and is associated to a specific management process. This specification supports three Key types: the Maintenance Key, the Mesh Key and the Node Key.

101191 Maintenance Key - This key is shared by all the devices in all PANs that are administered by a single Configuration Host. The Maintenance Key is used for Association Request/Response messages and maintenance device point-to-point-secured communication messages. The Maintenance Key can be factory-assigned or is assigned by the Configuration Host; it can be updated by a Coordinator.

101201 Mesh Key - This key is used for all DLL MIC calculations, except those secured by the Maintenance Key. It is also used for the Network MIC when the message is broadcast through the mesh or when the Network Security is used for device-to-device communication.
The Mesh Key is common throughout a PAN, and to all interconnected PANs that are configured to support inter-PAN communications. The Mesh Key is assigned and updated by the Coordinator.

[01211 Network Name - Name assigned to a mesh network. Network names are typically assigned using a dot separated hierarchy with the first level representing all mesh networks forming a single AMI network. The typical format of a network name is "utility. area.coordinatorID".

101221 Node Key - A unique key assigned to a device and used for secure communication between the Coordinator(s) and the device. It is primarily used for the Network MIC header calculation and for encrypting keys distributed by the Coordinator.
The Node Key is initially assigned by the Configuration Host but it can be updated by either the Configuration Host or the Coordinator.

[01231 Node Type - Refers to the class of SM Node: Coordinator (=11b), Router (=10b), or End Device (=010-101241 Originator Count - The Originator Count, Orig. Count, is used as the nonce in the Network Security Header. Its value is the same as the Source Count value at the time the message is originated.

15 of 107 [0125] Parent - In the context of tree routing, all Routers that have a direct RF link with a reference Router and that have a hop count less than the hop count of that reference Router. In the context of an End Device, the Router used to send and receive messages on behalf of this End Device.

[0126] Frame - A network layer message that can traverse one or many hops.

[0127] SM Coordinator - Referenced within this document as Coordinator; this Node responsible for initializing the network, accepting association requests and assigning unique short addresses.

[0128] SM End Device - Referenced within this document as End Device; this Node is not capable of routing messages and can communicate only through its Parent.
An End Device can be either always be listening or wake up periodically to synchronize with its Parent in order to minimize energy.

[0129] SM Node - Refers to a Node independently of its Node Type.

[0130] SM Router - Referenced within this document as Router; this Node is capable of managing routes and routing messages.

[01311 Sibling - In the context of tree routing, all Routers that have a direct RF link with a reference Router with a hop count equal to the hop count of that reference Router.

[01321 Sleeping End Device - A Sleeping End Device reduces it average power consumption by turning itself off for periods of time. It requires a Parent to store frames for it while it is sleeping. A Sleeping End Device cannot be used for routing.

[0133] Source Count - The Source Count, also referenced as Src. Count, is used as the nonce in the DLL Security Header. The Source Count is incremented with every message transmitted by the device.

ACRONYMS:
101341 DLL - Data Link Layer; the data link layer provides device-to-device networking services in conjunction with the IEEE 802.15.4 MAC. For the SM system the DLL
provides hop-by-hop security.

16 of 107 [01351 LQI - Link Quality Indicator; a value based on the signal strength and other quality aspects of the received signal.

[01361 LQI class - Link quality between two Nodes expressed as four different classes:
Good (=11b), Normal (=IOb), Poor (=01b) and No Connectivity (=00b).

[01371 PAN - Personal Area Network, the IEEE 802.15.4 name for one of its networks, whether for personal use or not.

101381 RSSI - Received Signal Strength Indication in dBm.

[01391 The following describes the message formats and the processes implemented by the SecureMesh protocol (hereafter "SM protocol") within a SecureMesh network (hereafter "SM network"). Referring to Figure 1, the SM protocol in conjunction with the IEEE 802.15.4 MAC layer implement the Open Systems Interconnection ("OSI") Data-link. An exemplary SM
network topology is shown in Figure 2 and is composed of a coordinator 15, routers 20 and end devices 25 (generically referred to as "nodes"). The preferred routes 30 between routers 20 create a tree for which the root is the coordinator 15. Each node can be a member of trees of different adjacent networks, though any single network has only a single coordinator. A SM
network may include non routing nodes called end devices which are associated to a preferred parent through which messages are sent and received. The SM protocol also supports routing of messages using alternate routes 35 when a preferred parent fails; this process is called local repair. In the preferred embodiments of the present invention, the nodes typically include utility meters and related devices, but the invention is not limited as such.

101401 The transmission of messages between nodes defined by the SM protocol is governed by the following rules: (1) Fields are transmitted in their order of definition, from left to right when represented in a frame format diagram (see, for example, Figures 3-5), or from top (first) to bottom (last) when listed in a table; (2) All multi-octet fields are transmitted least significant octet first (little Endean); (3) Binary or string fields are transmitted serially starting at index zero. For backward compatibility reasons, short and long addresses can be configured as multi-octet fields transmitted least significant octet first, as specified by IEEE 802.15.4, or as binary fields transmitted serially. The transmission order of the addresses is controlled by the configuration parameter ADDRESS_TX_ORDER.

17 of 107 [01411 A critical process to SM network formation is the association process.
The association process is used by nodes to become a member of an SM network or to evaluate their current association state. The association process incorporates the following primary functions:
selection of a PAN; selection of an association router to proxy messages;
association with the coordinator and the reception of a short address assignment; and construction of the initial neighborhood table.

101421 As a first step in the association process, each device (referred to as a node once associated) must be commissioned with the network's node key and the network's maintenance key prior to associating with a network. The key commissioning process for a particular device is determined by the device's application. For example, the device may be configured at manufacturing, or by a maintenance tool, or through the Service Request and Service Response messages described in below. A quick summary of the association process is described, with a follow-on detailed description. A Neighbor Info Request is transmitted on each channel to locate and get information about neighbor nodes and neighbor SM networks. All nodes receiving the Neighbor Info Request respond with a Neighbor Info Response. A particular SM
network is selected based on an Association Ratio algorithm, discussed further below. An Association Router, which is a member of the selected SM network, is selected based on the Preferred Route Ratio algorithm, also discussed below. An Association Request is transmitted to the selected Association Router by the requesting device. When the Association Router is not the Coordinator, the Association Request is repackaged and forwarded in the form of an Association Confirmation Request message to the Coordinator, using tree routing. If the Association Confirmation Request is received and validated, the Coordinator sends back the assigned short address in an Association Confirmation Response message, which is then repackaged and sent to the device as an Association Response message. Similarly, when the Coordinator receives the Association Request directly, it returns its response directly in an Association Response.

[01431 In the specific case of a successful association (i.e. the Association Status within the Association Response is set to successful), the Node sends a Neighbor Exchange message with the Immediate Broadcast Requested option set (discussed below) on the just associated SM
network. As a result, this causes surrounding neighbors to broadcast a Neighbor Exchange message using a pseudo-random period within NEIGHBOR_EX_RND_PERIOD, thus allowing the Node to populate its Neighborhood Table right away.

18 of 107 [01441 Device association is started with the neighbor information request process shown in Figure 3. Node-A initiates the process with a Neighbor Info Request that is broadcasted on a channel and received by other Nodes in the neighborhood that are listening to that channel. Each Node receiving the message responds at a pseudo-random time in the interval given by the parameter NEIGHBOR_INFO_RESP_TIME. The IEEE 802.15.4 MAC, known to those skilled in the art and described in numerous publicly available documents, resolves most collisions that occur due to Nodes selecting the same response time. Node-A waits for the interval NEIGHBOR_INFO_RESP_TIME to receive all Neighbor Info Response messages from its neighbors. Once the Node has received neighbor(s) information, it can start the association process.

[01451 In Figure 4, Node-A is in the neighborhood of the Coordinator for PAN
1. As it receives Neighbor Info Response messages, it uses the Association Ratio algorithm and the Preferred Route Ratio algorithm to select PAN I and the Coordinator for PAN 1 as its Parent. In this case it sends its Association Request directly to the Coordinator and gets the Association Response back. Node-A expects to get a response back within a time period established by the ASSOCIATION_RESP_TIME parameter. This process is repeated on each available channel.
[01461 If the associating Node is not in the neighborhood of the Coordinator, it uses a neighbor to proxy the Association Request. Figure 5 shows this proxy process.
Node-A
receives a number of Neighbor Info Response messages. It uses the Association Ratio algorithm and the Preferred Route Ratio algorithm to select the Coordinator for PAN 1 and Node-B as its best neighbor for the PAN. Node-A then sends Node-B the Association Request message and starts its response timer set with the value defined by ASSOCIATION_RESP_TIME.
Node-B
takes Node-A's request and generates an Association Confirmation Request message to the Coordinator. The Coordinator responds with the Association Confirmation Response message to Node-B and Node-B sends the Association Response message to Node-A.

[01471 As mentioned previously, the association process described in this section is also used by a network member to re-evaluate its association status. This action is performed every ASSOCIATION EVAL PERIOD and is intended to determine if the network member should remain on the same SM network or if it should migrate to another one. The Node will change its network membership (i.e. complete its association process on another network) only if the 19 of 107 resulting Association Ratio represents an improvement compared to its current Association Ratio. The required improvement must be equal or better than the ASSOCIATION EVAL MIN IMPROVEMENT. If it is not the case, the Node maintains its membership on the current network and the whole process stops immediately.

101481 The mesh layer (see Figure 1) routes frames to the target addresses by one of four processes: Tree Routing, Source Routing, Temporary Routing or Mesh Routing using combinations of the Neighborhood Table, Routing Table, and Temporary Route Table. The route selection processing facilitated by the mesh layer is shown in Figure 6.
The frame either arrives as a frame initiated by the Node (device) or as a received frame to be routed by the Node.
Routed frames have an entry created in the Temporary Routing Table to allow subsequent traffic in the reverse direction using the reverse route. The routing process used for the frame is selected based on the following logic:

If the frame has a source route header it is sent to the Source Routing process.
If there is an entry for the target address in the Temporary Routing Table, the Temporary Routing process is used.
If the frame's target address is the Coordinator, the Tree Routing process is used.
If the frame's target address is not the Coordinator, the Mesh Routing Table process is used.

[01491 Tree routing is the preferred routing method when a Node initiates communications that target the Coordinator. Tree routing uses the Neighborhood Table to find a route to the Coordinator as shown in Figure 7. The device selects the neighbor entry with the Preferred Parent Flag set in the Neighborhood Table. If transmission to the preferred parent does not succeed, the device attempts to select another Parent in the Neighborhood Table (e.g., an entry that has a hop-count value less than the device's hop-count value), preferably ordering the selection on the device's Preferred Route Ratio value. If there are no Parent entries left to try, the device looks for a Sibling entry (e.g., an entry that has the same number of hops to the Coordinator), preferably ordered based on the device's Preferred Route Ratio value. The device will try entries in the Neighborhood Table until it has reached the MAX_TREE_REPAIR limit or until the Neighborhood Table is exhausted. To avoid multiple lateral transmissions through Siblings, a flag in the mesh header called Sibling flag is set when transmitting to a Sibling.
Frames received with the Sibling flag set can be routed only through a Parent.

20 of 107 101501 Referring to Figure 8, source routing is the preferred routing method when communications initiated from the Coordinator targets a specific Node. The Coordinator can also use the broadcast address as the target address at the end of the source route list to send a message to all the Nodes that are the neighbors of the last explicitly-addressed device. Source addressing is also used for communication between any two Nodes if the originator knows the entire route between them. This node-to-node source route is determined by a Route Request to the target Node with the Trace Route Flag set, or by a Route Establishment Request sent to the Coordinator asking for a route to the target Node. The source routing process sends a frame with the complete route embedded in the frame header. The Node receiving a source-routed frame finds its address in the route list and uses the next address in the list as the next destination hop for the frame. A temporary return route is created when a source-routed frame is received by each Node on the path, so that upstream frames can be routed using the Temporary Routing Table.

101511 Unlike tree routing, which can only be used to reach the Coordinator, mesh routing can reach any Node on the network. Routes are established using the Route Discovery process which is described later. The routes are stored in a Route Table, whose entries contain the next hop for the target address. A route remains valid until a Node tries unsuccessfully to use it or a Route Error message is received deleting the Route Table entry. A Node that cannot send a frame to the Node listed in the Route Table generates a Route Error message and deletes the entry from its Route Table. The oldest Route Table entry may also be deleted when a Node needs space in its Route Table for a new entry. The use of mesh routing should be limited because of the overhead it imposes on the network. This method is used only when more preferred methods such as tree and source routing fail. Referring to Figure 9, the mesh routing process looks up the target address in the Route Table. If the target address is found, the frame is sent to the designated Node. An error is generated when the MAC layer ACK is not received after repeated attempts or a Route Error message is received. In either case the route entry is removed from the Route Table and a Route Error message is broadcast to all neighbors. A Route Error message is also generated if the target address is not found in the Route Table.

[01521 Every time a mesh frame is forwarded, no matter the routing method used with the exception of the Temporary routing itself, the forwarding Node creates a temporary route entry to the originator in the Temporary Routing Table. This allows the destination Node to 21 of 107 quickly send a reply, even if it didn't previously know the route to the originator Node. This route expires after a period of time determined by TEMP_ROUTE_TO parameter.
The Temporary Route Table takes precedence over the Neighborhood Table and the Route Table.
Referring to Figure 10, the Temporary Route Table is accessed and the MAC
destination address associated with the mesh layer target address is selected. The frame is then transmitted.
If the MAC fails to transmit a frame, the Error Received condition is true and the Node tries to send the frame by an alternative route using Tree Routing or Mesh Routing.

[01531 In Figure 11, a mesh message from Node A sets the temporary return route in the table of Node B. A mesh message from Node C to Node A is routed to Node B.
Node B's temporary return route to Node A has not expired and so it uses the route to send the message to Node A. Sometime later another mesh message from Node A restarts the temporary route expiration timer. After the time, TEMP_ROUTE_TO, no new messages from Node A
arrive and Node B deletes the temporary return route to Node A. The number of temporary return routes that can be stored is limited. If the limit is reached, the oldest temporary return route is deleted when a new temporary return route is created.

[01541 A route discovery process is performed when a Node needs to create or trace a new route within the mesh network. It consists of a mesh broadcast of a Route Request message which is propagated through the network based on Route Request Acceptance Conditions. Once received by the target Node, a Route Reply message is returned to the originator leading to the creation of a new static route in both directions.

[01551 Initially, Route Request acceptance conditions are verified by each Node receiving a Route Request message. This verification algorithm allows a Router to forward or stop the propagation of a Route Request. When acceptance conditions are satisfied, the Router from which the Route Request message was received is keep as a Route Candidate. A Route Candidate can be replaced based on Route Request acceptance conditions during the route discovery process to improve routing. Route Candidates are used at the end of the route discovery process when the Route Reply message is sent back to the originator.
A Route Request is accepted as the first Route Candidate if it meets all of the following conditions:

No previous received request had the same Request ID; and 22 of 107 The request is received through a link with a minimum LQI class (defined later) at least equal to the requested one. For compatibility reasons, Route Requests received from non-neighbor Nodes are accepted if the requested minimum LQI class is "Unreliable link."
[01561 A Route Request is accepted for Route Candidate upgrade if it meets all of the following conditions:

A Route Candidate already exists for this request ID; and The request was received through a link with a minimum LQI class at least equal to the requested one. For compatibility reasons, Route Requests received from non-neighbor Nodes are accepted if the requested minimum LQI class is one (Unreliable link); and The request was received through a better link than the prior received one, as determined by one of the three cases summarized below:

Table 1 - Route Candidate upgrades conditions Conditions Case #1 Case #2 Case #3 Current Route Candidate is a... Neighbor Non-Neighbor Non-Neighbor Route Request received from a... Neighbor Neighbor Non-Neighbor The new Route Candidate length is... Shorter Shorter or Equal Shorter 101571 The overall route discovery process is summarized in Figure 12 which illustrates the simplest case, i.e., without any Route Candidate upgrade. The effect of a Route Candidate upgrade is shown in Figure 13, in which the return path is updated during the route discovery process. The originator broadcasts a Route Request with a minimum LQI class of "Reliable link."

101581 Every Router receiving the Route Request accepts or rejects the request based on conditions discussed above. If the Route Request is accepted as a first route candidate and the Router is not the target destination, it creates a route candidate to the originator and rebroadcasts the Route Request. If the Router is the target destination, it starts a timer of RREQ_RX_TIME
milliseconds and creates a route candidate to the originator.

23 of 107 101591 If the Route Request is accepted for a route candidate upgrade, the Node upgrades its route candidate without re-broadcasting the Route Request. At the expiration of the timer that was initialized to RREQ_RX_TIME, the destination Node converts its route candidate into a static route and sends a Route Reply to the Next Hop of the route just created. Each Node receiving a Route Reply converts its route candidate into a static route to the originator. It also creates a static route entry to the destination. The Route Reply is then forwarded to the originator. If the originator does not receive a Route Reply after the RREQ_TO
timeout period (700 ms by default), it broadcasts a second Route Request with a minimum LQI
class set to "Average link." If this second attempt fails, the originator tries a third and last attempt with a minimum LQI class set to "Unreliable link." If the three attempts of broadcasting a Route Request fail, an error is returned to the upper layer. Figure 12 illustrates the Route Discovery process with no Route Candidate upgrade. Figure 13 illustrates the Route Discovery process with Route Candidate upgrade. If the trace route option is set in the Route Request message, the target Node will set the trace route option in the Route Reply message. In this case, intermediary Routes create a temporary route instead of a static route and the route is recorded in the Route Reply message. The originator of the request can subsequently use the temporary route or source routing to reach the destination. Each Route Request is identified by a unique combination formed by the originator's short address and the Request ID. It is then possible to identify a Route Request already received from another Node.

101601 Referring to Figure 14, Route Establishment is a process in which a Node asks the Coordinator for a source route to another Node. The originator Node uses the target's 8-octet long address in its request. The Coordinator constructs a route using its current knowledge of the SM network. The Neighbor information contained in the periodic Keep Alive Request messages sent by Nodes is a prime source of information used by the Coordinator to construct routes. The Route Establishment response contains the source route to the target and the target's assigned short address. A route established from Node-A to Node-B is used for one-way communication.
When Node-A sends a message to Node-B that requires a reply, Node-B uses the temporary route set up along the route by Node-A's message.

[01611 The neighbor exchange process is performed by all Nodes on a periodic basis.
The Neighbors Exchange process is used to update neighbor information and routing tables.
Each Node in the network generates a periodic Neighbors Exchange message. All Nodes 24 of 107 receiving the request update their Neighborhood Table. Figure 15 shows one Neighbor Information Exchange broadcast message transmitted by Node-A, which is received by Nodes B, C and X.

[0162] An LQI measure is taken each time a Neighbors Exchange is received. The value "LQI rx" in the Neighborhood Table is updated according to Table 2.

Table 2 - Calculation of "LQI rx"
Measured LQI > "LQI rx" in the table LQI_HIGH_FACTOR of the "LQI rx" present in the table plus (I -LQI_HIGH_ FACTOR) of the measured LQI of received message Measured LQI <" LQI rx" in the table LQI_LOW _FACTOR of the "LQI rx" present in the table plus (l-LQI_LOW _FACTOR) of the measured LQI of received message Neighbors Exchanged missed for the first and Keep the LQI present in the table second time Neighbors Exchanged missed for the third or Keep LQI_MISSED_EX_FACTOR of the LQI present in the further time table Neighbors Exchanged missed for the 5th time Entry disable in the table [01631 These rules tend to keep the "LQI rx" in the Neighborhood Table high even if a particular LQI measurement is lower or if a single Neighbors Exchange is missed. This is intentional.

[0164] Tree optimization is a recurrent process performed by all Nodes to ensure the network's optimal performance. The preferred route toward the Coordinator is re-evaluated after each Neighbors' Exchange message is received. To avoid tree instability, the "Avg LQI" factor is omitted for tree optimization; it is used only at association when a Node selects its initial preferred route. Only one route change is allowed per 6 cycles of NEIGHBORS_EXCHANGE_PERIOD to provide enough time for the information to propagate in the network. This delay limits the rate at which Child Nodes change their route when the route quality improves.

[0165] Each Node on the network shall report its presence to the Coordinator from time to time using Keep Alive Request messages to maintain its association status.
The reporting period is determined by the CHECKPOINT-PERIOD and is typically set to be one hour. The period between Keep Alive messages should be constant as specified by the Keep Alive Period field within the Keep Alive Request message. The Coordinator flags a Node as Non Responding 25 of 107 if this Node fails to communication with it within the Keep Alive Period. If the Coordinator has not received a Keep Alive Request or a Power Event message in a specified time, it removes the device from is registration table. The Coordinator's timeout period for Keep Alive Request/Power Event messages can be as long as 90 days. The Checkpoint process is also used to: trace the latest tree route for subsequent requests using source routing;
send network management information such as network statistics and neighborhood information; allow configuration of mesh layer parameters controlled centrally; and provide a window of opportunity for the upper layer batch traffic.

[01661 The Checkpoint is initiated autonomously by each Node. Checkpoint reporting by each Node is distributed pseudo-randomly within the CHECKPOINT_PERIOD. If the Coordinator needs to have better control over timing of the traffic generated on the network, it can send a Keep Alive Initiate request prior to the autonomous transmission of the Keep Alive Request. The Keep Alive Initiate request relies on the routing information of the previous Keep Alive Request. If this information is out of date, the subsequent autonomous Keep Alive Request sent by the Node will reestablish a valid route. It is important to note that a Keep Alive Initiate request does not create an entry in the Temporary Route table, thereby allowing the subsequent Keep Alive Request to trace the currently optimized tree route. In Figure 16, Node A sends a Keep Alive Request frame to the Coordinator as triggered by expiration of its CHECKPOINT-PERIOD timer. The Coordinator receives the request and sends a Keep Alive Response frame. The originator Node does not retry the request if it does not receive a reply.
After a successful reception of the Keep Alive Response, or timeout of a watchdog timer preset to the value of the parameter COORD_RESPONSE_TIMEOUT, upper layers are notified so they can start exchanging information if needed.

[01671 There are three security services provided by the SM network and protocol:
privacy, authentication and authorization. Initially, though not all data transmitted throughout the SM network has to be kept private, there are instances where the data sent should be encrypted to protect it from discovery. For example, security key configuration information needs to be kept private. Additionally, data is authenticated in two ways.
First the data's integrity is checked to make sure that it has not been changed when transmitted through the network. Data integrity is verified from the source to the destination through one or more hops in the mesh network. Like the data, the address is protected from being changed undetectably. If 26 of 107 the key used to protect that address is unique to the source, then the authentication verifies the integrity of the source address and that the stated sender originated the message frame. Further, the operations in messages have permission requirements associated with them.
Devices originating messages have authorizations configured in the SM network that give the devices the permission to perform operations that match the permission requirements.

[01681 The SM network protocol provides security for management frames routed through the mesh. These routed frames may span more than one hop and therefore need end-to-end security. The security features used by the SM network protocol are authentication and authorization. The mesh layer operations do not require privacy, other than for the transmission of security keys, where the privacy is provided by encrypting the transported keys. The SM
protocol provides data link security services for hop-by-hop message transmissions. The SM
data-link protocol provides data and source authentication for each hop taken by the message. It also provides operation authorization for local communication with maintenance devices. This security level also provides replay protection for all local and routed communication. Table 3 summarizes the implemented security mechanisms in accordance with a preferred embodiment of the present invention, the behavior of data link and network level counters and the key type used for each message type. For each message type in Table 3, the security method and key specified must be used or the receiver rejects the entire message.

27 of 107 Table 3 - Security Counter and Key a Summary Data link layer security Network layer security Security Counter When Key Security Counter sent When Key sent received type received type Route discovery Route Request MIC-32 Src. count > last (n) S None Route Reply MIC-32 Src. count > last (n) S None Route Error MIC-32 Src. count > last (n) S None Routed services Data transfer MIC-32 Src. count > last (n) S None Power Event MIC-32 Src. count > last (n) S None Ping Request MIC-32 Src. count > last (n) S None Ping Response MIC-32 Src. count > last (n) S None Keep Alive Initiate MIC-32 Src. count > last (n) S MIC-32 Orig. count [ > last I N
Keep Alive Request MIC-32 Src. count > last (n) S MIC-32 Orig. count [ > last ] N
Keep Alive Response MIC-32 Src. count > last (n) S MIC-32 Orig. count [ > last ] N
Service Forwarding request MIC-32 Src. count > last (n) S MIC-32 Orig. count [
> last ] N
Service Forwarding response MIC-32 Src. count > last (n) S MIC-32 Reflection =
sent N
Association Confirmation Request MIC-32 Src. count > last (n) S MIC-32 Orig.
count [ > last ] N
Association Confirmation Response MIC-32 Src. count > last (n) S MIC-32 Reflection = sent N
Route Establishment Request MIC-32 Src. count > last (n) S MIC-32 Orig. count [ > last ] N
Route Establishment Response MIC-32 Src. count > last (n) S MIC-32 Reflection = sent N
Non routed services Neighbor Info Request None None Neighbor Info Response (Src count, None None Ticket ) Service Request None None Service Response None None Association Request MIC-32 Ticket > last (rc) M MIC-32 Orig. count any N
Association Response MIC-32 Src. count > last (rc) M MIC-32 Reflection = sent N
Neighbors Exchange MIC-32 Src. count > last (n) S None End Device Data Request MIC-32 Src. count > last (ed) S None End Device Data Response MIC-32 Src. count >Iast(n) S None Multicast data transfer Mesh Multicast MIC-32 Src. count > last (rc) S None Point to point communication Local Broadcast Request None None Local Broadcast Response (Src count, None None Ticket) End Device Node Present (Src count, None None Ticket) Local Data Transfer None None Range Test Request MIC-32 Ticket > last (rc) M None Range Test Response MIC-32 Src. count > last (rc) M None Range Test Initiate MIC-32 Ticket > last (rc) M None Range Test Result MIC-32 Src. count > last (rc) M None Frame Reception Rate Test Init MIC-32 Ticket > last (rc) M None Frame Reception Rate Test Data MIC-32 Ticket > last (rc) M None Frame Reception Rate Test End MIC-32 Ticket > last (rc) M None Frame Reception Rate Test Result MIC-32 Src. count > last (rc) M None 28 of 107 101691 In Table 3, the following define the behavior of the counters sent:
"Src. count" is the value of the current counter of the sender of the frame (Single Hop);
"Orig. count" is the value of the current counter of the originator of the frame within the mesh network; "Reflection"
is the response use of the value of the counter received in the request;
"Ticket" is the Counter provided by a Router for use by Nodes before they are associated and for maintenance devices that communicate with the device using point-to-point messages. The nonce is created by concatenating full five octet ticket with the long address of the Router providing this ticket. Also in Table 3, the following define the behavior of the counters received. The "[
> last ]" means the recipient of the frame, may accepts any counter value, playback rejection is not required since playback is already verified by the DLL security at each hop. Optionally, if the recipient has the memory to store the previously received counts it may reject frames where the count is not greater than the stored count. The "= sent" means the counter received must be equal to the counter sent in the request. The "> last (n)" means the counter received must be greater than the RX Source DLL Nonce Count value maintained in the Neighborhood Table. The Neighbor Info Response frame initializes the RX Source DLL Nonce Count in the Neighborhood Table. The periodic Neighbor Exchange message maintains its currency in the absence of regular traffic between the two devices. The "> last (ed)" means the counter received must be greater than the last RX Source DLL Nonce Count value maintained in the End Device Table. The periodic End Device Data Request message maintains its currency. And the "> last (rc)"
means the counter received must be greater than the last RX Source DLL Nonce Count value temporary maintained for a selected Node and acquired in the Neighbor Info Response or Local Broadcast Response.
The "last" counts are initialized to zero in the tables and then updated with the first authenticated reception. The following letters are used in Table 3 to define the key type used by each message type. "N" is (private) Node Key; "S" is Shared Mesh Key; and "M" is (shared) Maintenance key.
[01701 The SM protocol provides a DLL Security service with data and source authentication using a message integrity check mechanism (MIC-32) as described in Annex B of IEEE 802.15.4:2006 which is incorporated herein by reference in its entirety.
DLL security uses the SM DLL Security header to select the security key and set the nonce used in the crypto calculation. The DLL Security header is an optional field, following the Service Type octet, that is present when the DLL Security Header Flag in the Service Type octet is set (=1 b), as defined herein. The format of the DLL Security header is shown in Figure 17. The first fifteen bits (0 -29 of 107 14) of the DLL Security header contains a portion of the transmitted nonce count. Bit 15 is the DLL Key ID that selects the current version of the key used to calculate the DLL MIC. This Key ID is used to coordinate the key used during a key change process by explicitly identifying which key was used in generating the DLL MIC.

[01711 The MIC-32 data authentication calculation uses the calculation process described in the IEEE 802.15.4:2006 standard. The SM DLL nonce used for the MIC
calculation is shown in Figure 18. The DLL nonce used in the MIC calculation is thirteen octets.
The DLL Security nonce combines the full DLL nonce count and the MAC layer source address used by the transmitting device. The Full DLL Nonce Count is five octets long, which ensures that its value does not repeat, within the lifetime of a key, at the frame transmission rates of SM devices. The address used in the MAC nonce is either the 8-octet long EUI address, or the 2-octet source PAN
ID plus the 2-octet short address prefixed by four octets of all ones. The Full DLL Nonce Count can be based on either the Source counter or the Ticket counter.

Table 4 - DLL Nonce Counters DLL Source counter Ticket counter Counter Type Count Range 0000000000 to EFFFFFFFFF E000000000 to FFFFFFFFFF
Use Used as the transmitted count by devices Used as the transmitted count by devices not associated with a network associated with a network, devices associating with the network or handheld devices communicating using the point-to-point messages Message Count incremented with each transmission Count incremented with each transmission Transmitter Stored in non-volatile memory and never reset For the associated devices, the Ticket is acquired in the Neighbor Info Response. For the associating devices, Ticket is acquired in the Local Broadcast Response or End Device Node Present messages The last authenticated value is stored only while communicating with a selected device Message For the associated devices, the count value is Accepts received counts > stored ticket Stores last Receiver acquired in the Neighbor Info Response or authenticated count in the Maintenance Table Neighbors Exchange messages. The last authenticated count is stored in the Neighborhood Table For the non associated devices, the count value is acquired in the Local Broadcast Response or End Device Node Present messages. The last authenticated value is stored only while communicating with a selected device Accepts received counts >
stored count Nonce MAC source long address, or OxFFFFFFFF MAC long address of the device that provided the Address padding and MAC source PAN ID and short ticket address 30 of 107 [01721 This process is used for all message types using the Source Counter as listed in the summary table in Table 3. The five octets (bits 0 - 39) of the Full DLL
Nonce Count are constructed using the following algorithm: The least significant octet (bits 0 - 7) of the transmitted nonce count is the IEEE 802.15.4 MAC header sequence number. The next 15 bits come from bits 0 through 14 of the DLL Security header's SM DLL Count.
Together the 23 bits of the transmitted count forms the least significant bits of the counter portion of the SM DLL
nonce. The receiver checks the least significant 23 bits of the transmitted count against the last authenticated RX Source DLL Nonce Count. In the case of an End Device, the last authenticated RX Source DLL Nonce Count represent the Source Count acquired using a Neighbor Info Request and maintained in the End Device Table. In the case of mesh messages excluding the Association Request, the last authenticated RX Source DLL Nonce Count represents the Source Count acquired using a Neighbor Info Request and maintained in the Neighborhood Table. The Neighborhood Table entry is selected using the source PAN ID and MAC address of the received message. In the case of an Association Request or of point to point messages, the last authenticated RX Source DLL Nonce Count represents the Source Count acquired using a Neighbor Info Response, a Local Broadcast Response or an End Device Node Present received and maintained temporarily for a selected Node. If the transmitted count value is greater than the last authenticated RX Source DLL Nonce Count, then the transmitted counter bits (0 -22) are combined with the most significant bits (23 - 39) of the last authenticated RX
Source DLL
Nonce Count to form the Full DLL Nonce Count. However, the transmitted count is assumed to have rolled over if the transmitted count value is less than the value of the corresponding bits in the last authenticated RX Source DLL Nonce Count. When this is the case the value in bits 23 through 39 of the last authenticated RX Source DLL Nonce Count is incremented by one before it is combined with the transmitted bits to form the Full DLL Nonce Count. The MIC-32 is calculated using the Mesh key generation specified by the DLL Key ID. The selected key and the Secure Full Mesh DLL Nonce are used to calculate the DLL MIC-32 value. If the calculated MIC-32 equals the transmitted MIC-32, then the message data integrity is validated and the message has not been received previously. In this case the last authenticated RX Source DLL
Nonce Count is updated to the value of the Full DLL Nonce Count used in the MIC calculation.
101731 The SM DLL security nonce ticket counter process is used for all message types using the Ticket Counter as listed in the summary table in Table 3. This process is used for the 31 of 107 secured non-routed DLL communications employed by Association Request/Response messages and by point-to-point messages. For these messages at least one of the MAC
addresses has a long 8-octet format, the Maintenance Key is used, and the process is modified.
The DLL Key ID
selects the appropriate Maintenance Key and nonce count. The following algorithm is used to calculate the MIC. The five octets (bits 0 - 39) of the Full DLL Nonce Count are constructed using the following algorithm: the least significant octet (bits 0 - 7) of the IEEE 802.15.4 MAC
header sequence number is combined with bits 0 through 14 of the DLL Security header.
Together they form the 23 bits of the transmitted count bits of the DLL nonce count.

101741 The Ticket field in the Maintenance Key Table contains the last authenticated count received. The receiver checks the least significant 23 bits from the table and compares them to the transmitted count. If the transmitted count value is greater than the value in the corresponding bits of Ticket then the transmitted counter bits (0 -22) are combined with the most significant bits (23 - 39) of the Ticket to form the Full DLL Nonce Count.
However, if the transmitted count value is less than the value of the corresponding bits in the Ticket, rollover of the transmitted count value is inferred. When this is the case the value in bits 23 through 39 of the Ticket is incremented by one before it is combined with the transmitted bits to form the Full DLL Nonce Count. The MIC-32 is calculated using the key specified by the Maintenance Key selected by the DLL Key ID and the Full DLL Nonce Count. If the calculated MIC-32 equals the transmitted MIC-32, then the data integrity is validated and the message has not been received previously. In that case only, the Full DLL Nonce Count is stored in the Ticket Count of the Maintenance Key Table.

101751 The DLL Security header MIC covers the SM message starting with the IEEE
802.15.4 Frame Control octet and continuing on through to the end of the payload. As shown in Figure 19, the IEEE 802.15.4 physical layer preamble and the Frame Check Sequence are not part of the DLL Security calculation.

[01761 The DLL Security header provides security for data authentication and operation authorization of SM messages that can travel one hop. The SM network security header provides end-to-end security for frames, which can travel multiple hops. When present, the network security header provides authentication of data that is not dependent on trusting the intermediate routing devices. The network security header controls security for that portion of the SM frame 32 of 107 that does not change as it is routed through the network. The network security header is present when the Originator Network Security Header flag is set as defined in the common mesh header described below 101771 The network security header is shown in Figure 20 . It is located in the SM
header after the DLL Security header. The network security NET MIC-32 field is located at the end of the frame, before the DLL MIC-32 field and the IEEE 802.15.4 FCS field (see Figure 22). When the Network Security header is present, the receiver's SM
application layer security process uses the Originator PAN ID and source address field of the received frame to determine if the frame is from the Coordinator or some other device. The Node Keys stored in the Node Key Table are used for communicating with the Coordinator. The Mesh Keys in the Neighborhood Table are used to communicate with other devices. For frames received from the Coordinator, bit 39 of the Network Security Header specifies the network Key ID, selecting Node Key-0 or Node Key-1. For frames received from other devices, the bit selects Mesh Key-0 or Mesh Key-1.

101781 Routed messages are typically request/response messages. The response messages reflect the value of the Network Count in the request. Messages that require reflected counts are listed in Table 3.

[01791 The SM network layer nonce is 13 octets long. Its structure is shown in Figure 21. When the message is a request, the combination of the Network Count, the Originator PAN
ID and Address padded with zeros ensures the uniqueness of the nonce. When the message is a response the Network Count is reflected and it is combined with the Target PAN
ID and address and the Originator PAN ID and address. Devices receiving request messages use the Network Count to verify the integrity of the payload data and optionally check for repeated count values to reject already received responses. Devices receiving responses to request messages check that the Network Count equals that in the request message. If it does not, the message is rejected.
Response frames with repeated Network Count values also are rejected.

[01801 The SM Network MIC-32 is authenticated using the following algorithm.
First, the 39 bits of the Network Count is taken from the Network Security Header and padded with a zero to make a 40 bit field. This forms the counter portion of the network nonce. Next, the.
MIC-32 is calculated using the key specified by the Network Security header Key ID, using the 33 of 107 Node Key for communications with the Coordinator and the Mesh Key for communications with other devices.

[01811 If the calculated MIC-32 equals the transmitted MIC-32, then the data integrity of the received frame is validated. The coverage of the Network Security header MIC is shown in Figure 22. The Network MIC-32 provides authentication for almost all the SM
frame's header field and payload. The portion of the SM frame's header field that is not covered by the Network MIC is the Max Remaining Hops field, which is decremented for each hop. Keep Alive Request messages have a second exception to the Network MIC-32 coverage: their Hop Addresses and Number of Hops fields. As with the DLL, having two key in each of the Mesh Key Table and Node Key Table entries allows the Coordinator to set up new keys for devices without causing Network Security header MIC errors.

101821 The SM network security process used for transmitting a message with a Network Security header is shown in Figure 23. Node-A prepares a request message for transmission by incrementing its source transmission counter and calculating the Network MIC.
It then formats the request frame with the full five octet source transmission count in the Network Security header and transmits the message through Node-B to Node-C. Node-A stores the count used and starts a message response timer with a timeout set to MESSAGE_RESPONSE_TO.
Node-C
receives the request message and authenticates the Network Security header.
Node-C prepares a response to Node-A using the same count value it received in the request. Node-A receives the response and checks that the count value is the same as what it transmitted.
Node-A releases the stored count and stops the message response timer if the stored count is the same as the response count and the Network Security header is authenticated. If the tests fail and no other valid response frame is received in the timeout period, Node-A fails the request/response process and releases the stored count value. Messages transmitted between the Coordinator and a device that employ the Network Security header use the Node Key assigned to the device.
Messages transmitted between devices that have a Network Security header use the Mesh Key.

101831 New devices associating with a network must be configured with the Node Key and Maintenance Key. This configuration may be done by the manufacture as a custom process for a purchaser, by a maintenance tool prior to association or over the network using the Service messages described further herein. Keys transported over the network must be encrypted for 34 of 107 confidentiality. When sent in Service Response and Service Forwarding messages, the keys are generated by the Configuration Host and encrypted using the device's Device Key before being placed in the message payload. The Coordinator and the routing devices forward the encrypted keys without knowing the Device Key, so they are unable to eavesdrop on the value of the new key. This configuration process is between the device's application and the Configuration Host application. It is not part of the overall mesh protocol. An outline of the device application to configuration host application configuration process is presented here for informational purposes. The new device uses a Service Request message to talk to the Configuration Host.
The outgoing Service Request message contains a Service MIC in the payload that is calculated using the manufacturer-supplied Device Key. (This Service MIC is not the DLL
or Network MIC.) The routing device forwards the payload in a Service Forwarding message and the Coordinator sends the message to the Configuration Host. The routing device and the Coordinator do not have the Device Key and so they do not decode the MIC. The Configuration Host uses a well known Server ID (=0) in the Service Request message. The Configuration Host looks up the 8-octet device MAC address and finds the Device Key in its database. If the MIC is OK it authenticates the new device. The Configuration Host sends a message to all Coordinators in the network that sets up a unique Node Key associated with the 8-octet device MAC address.
This is a symmetric secret key that will be used for all secure communications between the Coordinators and the new device. In preferred embodiments, Node Key-0 and Node Key-1 are set to the same value to avoid key synchronization problems as the system starts. This same value practice holds for the Maintenance Key-0 and Maintenance Key-I values as well. After sending the Node key to the Coordinators, the Configuration Host sends a response to the new device using a Service Forwarding Response or Service Response message, where the message payload contains the unique Node Key and the shared Maintenance Key, both encrypted by the new Node's Device Key. This response is sent back to the new device. The new device decrypts the Node Key and the shared Maintenance Key and stores them under the appropriate Key ID.
(01841 A device that is newly introduced to a SM network has only a single cryptographic key: its factory-assigned permanent Device key, which is unique to the device.
Before the device can participate in the SM network, the device must be commissioned with the network's Maintenance and Mesh keys, together with a device-unique Node key and a second system-assigned device-unique Device key. This commissioning may be made over the network 35 of 107 itself, by direct wireless messaging to the device from a proximate commissioning device, or through some extra-protocol means, such as a direct connection to the device.

[01851 The Maintenance, Mesh and Node keys are used to authenticate messaging within the SM. Node keys are used to authenticate and encrypt end-to-end network management messaging within the SM. The permanent Device key is used only to authenticate the newly introduced device to the SM network and to protect the system-assigned Device key when it is sent in response to the newly introduced Node. The system-assigned Device key is then used to protect the device's Node key and the shared Maintenance key when they are distributed to the Node. In subsequent messages, the device's Node key is used to protect the Mesh key whenever it is distributed to the Node. Receipt of a message that authenticates under the permanent Device key zeroizes all other keys, setting them to a "keyNotDefined" status, which restores a device's key state to that when it left the factory. This action protects the network against an attacker that has compromised the device's permanent Device key, perhaps by gaining access to the database of all permanent Device keys that exist at key repository, or to the subset database of Device keys of purchased devices that was delivered to the system owner.

101861 A secure association between a device and a Coordinator uses the Association Request and Association Response messages that employ the DLL MIC and Network MIC. The associating device uses the Maintenance Key Ticket count value for the DLL MIC
and the Node Key and Originator count value for the Network MIC. The routing forwards the Association Request payload to the Coordinator in the Association Confirmation Request message. The payload also includes the 8-octet MAC address of the new device. This forwarding process is shown in Figure 24. The Coordinator validates the Association Confirmation Request message DLL Security header and Network Security header. It then validates the embedded Network Security header constructed by the new device using the new device's Node ID
and the Originator count in the Network Security header. The Coordinator looks up the Node ID using the 8-octet address in the Association Confirmation Request message in a data base that has been configured by a process outside the scope of the mesh protocol. For valid association requests the Coordinator constructs an Association Confirmation Response message. The message payload has the assigned short address of the new device, the Mesh Key Security Header, the Encrypted Mesh Key and the Mesh Key MIC32. The Mesh Key is encrypted using the new device's Node Key version as specified in the Mesh Key Security Header. The Coordinator 36 of 107 constructs a Network Security header and that calculates the Network MIC using the Coordinator's reflected count in the new device's Network Security header and the new device's Node Key. This Network Header is carried as the payload of the Association Confirmation Response message shown in Figure 25.

[01871 The Mesh Key Security Header follows the same format as the 40-bit Network Security control word shown in Figure 20 with the Reflected Count Flag set to 0. The routing device that forwards the association response to the new device takes the payload of the Association Confirmation Response message and generates the Association Response message using the Maintenance Key and the router's Source count value to calculate the DLL MIC. The new device decrypts the Mesh Key using the Node Key with the Key ID specified in the Encrypted Key Security Header, it then verifies the Mesh Key MIC32 and stores the Mesh Key.
Devices that change the primary Coordinator with which they are associated follow the same procedure as new devices. They use the same Association and Association Confirmation messages and the same Node Key and Maintenance Key.

[01881 Preferred embodiments of the present invention institute key rotation practices;
changing the security keys periodically or when a security event has occurred.
The mesh keys used by a device are the Node Key, the Maintenance Key and the Mesh Key. The Coordinator changes these keys using the Keep Alive process and messages.

[01891 Each device maintains two versions of each of these keys: Node Key-0, Node Key-1, Maintenance Key-0, Maintenance Key-1, Mesh Key-0 and Mesh Key-1. Each message sent has Key IDs in the DLL Security header and Network Security header that indicate which key is being used. In between key changes all the devices use only one version of each key for transmission and reception. The Coordinator writes the new key to the appropriate key and key version of each device. When the update process is finished and verified at most or all relevant devices, the Coordinator signals the devices to start using the new key for transmission. After all the devices are using the new key for transmission, the Coordinator deactivates the old key for reception.

101901 The Coordinator starts an update of a key by getting the current state of the current Write Key Toggle Bit associated with the key. It does this by waiting for a Keep Alive Request message from a device with the key as shown in Figure 26. The Keep Alive Request 37 of 107 message from the device contains the Write Key Toggle State field that tells it current status of the toggle bits for each key. The Coordinator then sends the key update using the Write Key parameter option in the Keep Alive Response message. The Coordinator verifies that the key has been updated by reading the change in state of the selected key's Write Key Toggle Bit in the next Keep Alive Request. The process is repeated if the key has not been changed.

[0191] Eventually, all (or almost all) the devices have both the new key and the old key.
Only the old key is used for transmission, but either the new key or the old key can be used for reception. The reception key selection is controlled by the DLL Security Header and the Network Security Header.

[0192] After all devices using the key have been updated and verified, the Coordinator tells the devices to start using the new key for transmission. The Coordinator waits for a Keep Alive Request message from a node using the new key as shown is Figure 27. In the Keep Alive Response message, the Coordinator commands the node to switch to the new key for transmission. The switch is confirmed in the next Keep Alive Request message received from the device. After all the devices using the new key have switched, the Coordinator deactivates the old key by waiting for a Keep Alive Request and then sending a Keep Alive Response containing the appropriate key deactivate command. The Coordinator verifies the deactivation in the next Keep Alive Request received from the device. This process is used to update Node Keys, Maintenance Keys, and Mesh Keys. The Process for changing a generic Key x, version 0, is depicted in Figure 26. Note that only the Coordinator is allowed to originate a Keep Alive Response message with key control commands in it.

[0193] An End Device's association to the network is similar to that of a regular Node (see Association). The only difference is that after the End Device has selected a Coordinator, it usually also needs to choose a Router to help with message forwarding. Figure 28 shows a new End Device, Node-A, requesting neighbor information and receiving. In this example there are two PANs and three neighbors. Based on the Association Ratio algorithm, Node-A
selects the Coordinator on PAN 1. It also selects Node-B as its Parent using the Parent Selection algorithm.
Node-A then sends Node-B an Association Request message, which Node-B converts to an Association Confirmation Request message addressed to the Coordinator. The Coordinator sends the Association Confirmation Response message back to Node-B. Node-B
then sends the 38 of 107 Association Response message to Node-A. Node-B adds Node-A to its End Device Table after receiving a Keep-Alive Request message from Node-A with the "Device Type" set to End Device type and the Receiver On When Idle bit reset (to off). This first Keep-Alive Request message also carries the Multicast Group Addresses list which is captured by Node-B for future filtering and forwarding of Multicast messages. The Coordinator receives the Keep Alive Request message. A Parent can remove a Node form its End Device Table if it has not received any Keep Alive Request messages from this Node for a period exceeding 24 hours.

101941 When an End Device loses connectivity with its Parent (i.e. after a number of unsuccessful attempts to communicate determined by the ROUTE-LOST-ATTEMPTS
parameter), it tries to find another Router on the same network. The End Device sends a Neighbor Info Request on the current channel and uses the Parent Selection algorithm to choose its new Parent. Then it sends a Keep Alive Request to inform both the Parent and the Coordinator of this change. The processes of re-associating with the Coordinator and a new neighbor are shown in Figure 29. The End Device, Node-A, fails to communicate through Node-B and, after a number (ROUTE_LOST_ATTEMPTS) of attempts it broadcasts a Neighbor Info Request to Nodes on the same channel and PAN. It then selects the best neighbor with which to associate. In this case Node-E is selected. It then sends a Keep Alive Request message to the Coordinator though Node-E. The Coordinator returns a Keep Alive Response message.

101951 Message forwarding with a non-sleeping End Device is done as soon as received.
Referring to Figure 30, a Non-sleeping End Device advertises its presence to its Parent and to the Coordinator in both the Association Request and the Keep Alive Request messages. In both of these messages, the Device Type field is set to End Device type and the Receiver On When Idle is set.

101961 In the case of transmission by the Sleeping End Device, the Parent allows the End Device to return to sleep as soon as the transmission acknowledgment (802.15.4 ACK MAC-PDU) for the message is received. All frames sent to a Sleeping End Device (unicast, multicast and broadcast) are buffered by its Parent and transmitted to it when it is awake. If a response is expected, a Sleeping End Device wakes up every RESP_SLEEP_PERIOD until the expected response is received. If no response is expected the Sleeping End Device sleeps for the interval SLEEP_CHECK_PERIOD. The Sleeping End Device wakes up periodically at each 39 of 107 SLEEP_CHECK_PERIOD to check for buffered frames. It also wakes up when it has a message to transmit. When it wakes up with a message to transmit it first checks for buffered frames before it transmits its own message.

[01971 The Sleeping End Device frame forwarding process is illustrated in Figure 31.
The sleeping Node-A wake ups and checks for any frames buffered in Node-B by sending an End Device Data Request message. Node B replies with an End Device Response message with the "no Frame Pending" status that tells Node-A there are no frames buffered.
Node-A then transmits a frame that does not require a response to a target application through its Parent, Node-B. Node-A waits for an ACK MAC-PDU from Node-B and then goes to sleep for SLEEP_CHECK_PERIOD. This sleep is interrupted when Node-A wakes up to transmit another frame. The new frame is a request that requires a response from the target.
The request frame is routed to the target by Node-B. When Node-A receives the MAC level ACK from Node-B, it restarts its sleep timer with a duration set to the value of RESP_SLEEP_PERIOD. Node-B
forwards the request frame to the target application that then generates a response frame. Node-B
receives and buffers the response frame for Node-A which is sleeping. Node-A
wakes at the end of the time period and sends Node-B an End Device Data Request message and receives an End Device Response message with the Frame Pending bit set. Node-A waits for the stored frame for a maximum duration of MAX_MF_WAIT: If it does not receive a frame during this time interval, it resends the End Device Data Request message. In Figure 31, Node-B
sends the response frame in its buffer to Node-A before the MAX-MF_WAIT_PERIOD. Node-A
sends Node-B an ACK MAC-PDU and goes back to sleep with the timer duration set to the value of SLEEP-CHECK-PERIOD. Node-B releases the buffer when it receives the ACK MAC-PDU
from Node-A.

[01981 Sleeping End Device wakeups periodically to verify a message is pending. Each SLEEP_CHECK_PERIOD the Sleeping End Device sends an End Device Data Request frame to its Parent and waits a predefined time, DATA_REQUEST_TIMEOUT, listening for pending frames before returning to sleep. Figures 32 and 33 show the Sleeping End Device Checkpoint process. In Figure 32 a message is received for Sleeping End Device, Node-A, and buffered by the Parent Node-B. Node-A wakes when its Checkpoint timer expires. It sends an End Device Data Request message to Node-B and receives an End Device Data Response message with the frame-pending bit set. Node-A then starts its listen timer with a duration of 40 of 107 DATA_REQUEST_TIMEOUT and listens for a frame from Node-B. Node-B sends the buffered frame to Node-A, which stops the listen timer. The frame does not have the frame-pending bit set, which tells Node A that there are no more frames to receive. Node-A sets the Checkpoint timer with the duration CHECKPOINT-PERIOD and goes back to sleep. Node-B
releases the buffer when it receives the ACK MAC-PDU frame from Node-A.

[01991 In Figure 33, Node-A wakes up when its Checkpoint timer expires. In this case Node-B has no frame stored for Node-A, so when Node-A sends the End Device Data Request message Node-B's replying End Device Data Response message does not have the frame-pending bit set. Node-A sets its Checkpoint timer with the CHECKPOINT-PERIOD
and goes back to sleep.

102001 This process exemplified in Figure 34 is used to initiate a point-to-point communication with a Sleeping End Device. Typical applications for this type of communication are between a handheld device and a sleeping End Device and occur during installation, operation, and maintenance processes. A physical trigger (button, reed switch + magnet) initiates Local Communication. This sets the Sleeping End Device in local communication mode. The Sleeping End Device then sends an End Device Node Present message with a periodicity of END_DEVICE_PERIOD and listens for the interval END_DEVICE_WAIT for any command sent in response. This process stops and the Sleeping End Device goes to sleep if it has not communicated with a local device in the interval determined by the END_DEVICE_INACTIVITY_TO parameter. Once a communication is initiated with a local device, the Sleeping End Device stays in the local communication mode for the time interval determined by the END_DEVICE_INACTIVE_TO parameter after each frame is received or transmitted.

102011, In Figure 34, a Sleeping End Device, Node-A, receives an external trigger that puts it in a mode where it looks for a local device with which to communicate.
It transmits an End Device Node Present frame and starts two timers. The first timer is the end device notification timer, END-DEVICE-PERIOD, which determines how long the Sleeping End Device listens for a response to the notification message. The second timer is the end device notification process timer. It determines how long the Sleeping End Device remains in the state where it is looking for a local device. In Figure 34, Node-A sends one End Device Node Present 41 of 107 message that is not heard by the local device. After the end device notification timer expires, it sends a second End Device Node Present message that triggers a second response by the local device. The ACK MAC-PDU from the local device terminates the two timers and puts Node-A
in the local communication mode. In this mode Node-A starts the end device communication timer that is set with a duration specified by the LOCAL_COM_TO parameter.
During the first timer period the local device sends Node-A a frame that resets the timer.
During the second timer period Node-A initiates a frame of its own to the local device. This transmitted frame also resets the timer. There is no communication during the third period other than the ACK MAC-PDU
from the local device. The ACK MAC-PDU does not reset the timer, which then expires, causing Node-A to exit from the local communication mode.

102021 The concept of Dedicated Routers allows the deployment of multiple Coordinators at the same physical location. This approach consists of deploying multiple Routers, possibly with directional antennae, where each Router is dedicated to a specific mesh network / Coordinator. A Dedicated Router has the following specific behavior:
a Dedicated Router is associated to a specific Network Name and is manually configured with this name and a Dedicated Router can associate only to the Coordinator or another Dedicated Router; it is not allowed to associate with a normal (non-dedicated) Router. This restriction is imposed to avoid the situation where a Dedicated Router works for some time until its environment changes in such a way that it is no longer capable of establishing a route to its Coordinator. For the computation of the association ratio, a Dedicated Router is seen as a no-hop-distant device similar to a Coordinator. This guarantees that surrounding devices will prefer the Dedicated Router over other Routers for their association. Dedicated Router sets the Dedicated Router Flag in the Neighbor Info Response message. Nodes receiving Neighbor Info Response message with the Dedicated Router Flag set shall consider it to be as a no-hop-distant device when computing its Association Ratio.

102031 The following mechanisms are provided to control the flow of messages on the network and to provide some control on message latency. Most traffic is either sent from or to the Coordinator. Message latency is directly affected by the way the Coordinator manages this traffic. Internally, the Coordinator orders messages based on the importance of the associated task and the notion of priority implemented by the application layer. In the case of the ANSI
C12.22 application layer, this notion of priority takes the form of the URGENT
flag carried in 42 of 107 the Calling AE Qualifier element. To control traffic flow in the reverse direction, the protocol allows the Coordinator to control the timing of the Checkpoint process at each Node. To do this, the Coordinator sends a Keep Alive Initiate message to each Node before the end of that node's CHECKPOINT-PERIOD. Frames routed within the mesh network have an Urgent flag, which when set permits the Router to reorder outbound frames when there are other frames of lesser priority in the transmit queue. Nodes are not permitted to use the entire network capacity for any extended period of time. In the network protocol, this throttling is provided by a single-frame transmission window with an end-to-end acknowledgment.

[02041 A mesh forwarding process is required for support services that are used before a Node has associated with a network. This forwarding process allows the unassociated Node to communicate with service hosts such as commissioning or location tracking hosts on a LAN or WAN segment. The commissioning process is implemented by the application. The secure mesh protocol does not determine how commissioning is done, but it does support over-the-network commissioning using the Service and Service Forwarding messages. When used, these messages convey the Node Key and Maintenance Key that will be used by the device so that it is able to run the Association processes. Alternatively, the device could be commissioned with these keys during manufacturing.

[02051 The forwarding process is illustrated in Figure 35. The requesting device issues a Neighbor Info Request frame and listens for Neighbor Info Response frames.
This is the same process used when the device associates with the network. The neighbor information process is shown in Figure 3. The device uses the Association Algorithm to pick the neighbor to use as a proxy for service message forwarding. The requesting device, Node-A, places the service message in a Service Request frame addressed to the selected neighbor, Node-B.
The Service Request frame identifies the service the message is to go to in the mesh header in the "Server"
field. The Service Request frame is then transmitted to Node-B. Node-A starts a "halt service request timer" when the MAC ACK is received from Node-B. This timer is set with the parameter SERVICE_PERIOD that prevents Node-A from sending more service frames until the timer has expired.

102061 Node-B recognizes the Service Request frame from its "service type" and "service code" fields. It processes the frame by assigning the forwarding process for Node-A a 43 of 107 "Requestor id" value and sending the contained information to the Coordinator in a Service Forwarding frame. Node-B starts a "halt service request RX timer" when it successfully transmits the Service Forwarding frame. The timer is set with the SERVICE-PERIOD
parameter. While the timer is active, Node-B does not accept additional Service Request frames from any Node, including from Node-A.

102071 The SERVICE_PERIOD timeout set by both Node-A and Node-B is cancelled as soon the service host accepts servicing the request as indicated by an appropriate service reply.
The SERVICE_PERIOD timeout is reestablished for each new Service Request frame that is sent.

[02081 The Coordinator receives the Service Forwarding frame from Node-B. It registers the "Requestor ID" value and Node-B's address. The Coordinator sends the service message contained in the Service Forwarding frame to the service host identified in the "Server Requested" field. When the service host responds, the Coordinator puts the service message in a Service Forwarding Reply frame and addresses it to Node-B. The Coordinator also fills in the "Requestor id" value for Node-A. The Coordinator sets a "Service keep-alive timer" that will release the forwarding process if it is inactive for the duration SERVICE_TO.
Releasing the forwarding process for Node-A removes the Node-A's "Requestor id" from memory.

[02091 Node-B receives the Service Forwarding frame from the Coordinator and looks up the "Requestor id" to identify Node-A as the destination. The receipt of the Service Forwarding frame sets Node-B's "Service keep-alive timer" for the duration SERVICE-TO. If the timer expires before another Service Forwarding frame is received for Node-A, the Node-A
"Requestor id" is released. Node-B constructs the Service Requestor response frame and sends it to Node-A.

102101 Node-A receives the Service Requestor response frame and extracts the host's service message. The receipt of the Service Requestor response frame sets Node-A's "Service keep alive timer" for the duration SERVICE_TO. If Node-A does not receive another host message in this time, it times out the service-request process. If later there is another message generated to a host, the service-request process is restarted from the beginning with a new Neighbor Info Request frame.

44 of 107 [02111 Every Node in the mesh network can notify the Coordinator rapidly after it loses power or when the power is restored. The performance goal for the process is to have most Nodes notify the Coordinator within one minute after their status changes.
Those Nodes that take longer should not exceed the three minutes of backup power provided by the Nodes implementing the Power Outage Routing option as advertised by the Neighbors Exchange service. The system load induced by this process is a critical consideration because every Node may need to communicate in a very short time. Power event report aggregation and low overhead tree routing are employed to reduce the amount of system communication capacity used for this reporting.

102121 Figure 36 shows the overall process used by a Node to report a power event. The process starts with a Node detecting a power event and waiting to make sure it is not a transient.
For an event to be reported, it has to last more than the time defined by the PO_RECOGNITION_PERIOD parameter.

[02131 Any Node that has a power event that passes this transient-suppression test goes into the PO_AGGREGATE_PERIOD round. The leaf Nodes - Nodes without any Children in their Neighborhood Table - and first hop Nodes report their event in this round. To distribute these transmissions more uniformly, each reporting Node transmits at a pseudo-randomly-chosen time within the interval whose duration is PO_AGGREGATE_PERIOD. Nodes receiving events during this interval aggregate these events for later transmission. At the end of the PO-AGGREGATE-PERIOD round, Nodes enter the PO_RND_PERIOD round. Event Nodes that have event reports to send schedule transmission at a pseudo-randomly chosen time within this interval. During this interval, non-aggregating Nodes are free to piggyback their event report to any of the Power Event Report frames that they may route; however, aggregating Nodes must initiate their own Power Event Report frame since the eventual acknowledgment they receive for the forwarded aggregated event reports needs to be broadcast to the aggregator's neighbor Nodes.

[02141 The Coordinator receives power event reports and sends acknowledgements.
These event acknowledgements follow a source route constructed from the entries in the Power Event Report. Because of this, the acknowledgement message follows the reverse route of the report and confirms the reception to each Node reporting an event. When the target Node is not 45 of 107 the last Nodes in the reporting list within the Power Event Report, the target address is set to the broadcast address (=OxFFFF). The broadcast address allows leaf Nodes to be acknowledged using a broadcast at the end of the source route path. Reporting Nodes that do not receive an acknowledgement from the Coordinator at the end of the PO_RND_PERIOD round enter into a PO_RETRY_RND_PERIOD round.

[02151 Each such Node schedules a transmission time pseudo-randomly within the following interval of duration PO_RETRY_RND_PERIOD. This round is repeated until the event report is acknowledged or the backup power is exhausted. Nodes acknowledged prior to a scheduled power event reporting transmission do not initiate that transmission, even if they had entered into the retry round. Nodes reporting a power event do not initiate any Data Transfer messaging of their own while they are in any of the power event reporting rounds. All event Nodes continue to route the messages they receive.

102161 Figure 37 shows an example of the power outage reporting for a non-leaf Node that is multiple hops away from the Coordinator. Node-A detects a power outage and waits for the time given by PO_RECOGNITION_PERIOD to confirm that the outage is not a transient.
Node-A stops initiating Data Transfer messages and does not resume until power is restored.
After the recognition interval, Node-A waits for an interval given by the parameter PO-AGGREGATION-PERIOD to collect events from neighboring Nodes. While in the aggregation state, Node-A does not forward Power Event Report frames to the Coordinator unless the message contains event reports from multiple Nodes. At the end of the aggregation state, Node-A enters into the PO_RND_PERIOD round. Node-A delays for a pseudo-randomly chosen time within the interval of duration PO_RND_PERIOD before sending a Power Event Report frame. If Node-A needs to route a Power Event Report frame during this delay and has no events aggregated, it piggybacks its own report and sends the resulting frame to the next hop.
102171 At the end of the delay, if Node-A was not able to piggyback its event, it initiates its own Power Event Report frame including any additional aggregated events.

102181 After sending or piggybacking its event report, Node-A expects an acknowledgment from the Coordinator. In Figure 37, Node-A receives this acknowledgement and so it does not enter into a retry state at the end of the current round.
Even though Node-A
does not go into a retry round, it continues to route messages until its backup power is exhausted.

46 of 107 [0219] Figure 38 depicts the process in which Node-A fails to get an acknowledgement for a power event report and has to retransmit the report. The actions taken by Node-A are the same as those in the failure-free case shown in Figure 37 until the acknowledgement from the Coordinator is lost in the PO RND PERIOD round.

[0220] At the end of the round, Node-A goes into a retry round. The retry round lasts for the time determined by the PO_RETRY_RND_PERIOD parameter. Node-A selects its retry transmit time pseudo-randomly within the period and resends a power event report containing its address. Node-A does not have to originate a retry frame if it has an opportunity to add its event report to a routed Power Event Report frame while in the retry round.

[0221] An example of power event reporting for a Node that is one hop from the Coordinator is shown in Figure 39. Node-B is a neighbor of the Coordinator.
One-hop Nodes can transmit their reports to the Coordinator in the PO_AGGREGATE_PERIOD
round. Node-B
transmits the power event report after a pseudo-randomly-chosen delay and receives an acknowledgement. If the acknowledgement were not received, the Node would retransmit the event report in the following PO_RND_PERIOD round.

[0222] Leaf Nodes transmit their reports during the PO_AGGREGATE_PERIOD round.
Figure 40 shows a typical leaf Node power event reporting process. A Leaf Node, Node-C, chooses a pseudo-random time within the interval of duration PO_AGGRETATE_PERIOD to transmit its power event report. The acknowledgement for this report may not be received until near the end of the interval of duration PO RND PERIOD. In this case Node-C
receives the acknowledgement and its power event reporting process is completed. If an acknowledgement is not received, Node-C enters an interval of duration PO_RETRY_RND_PERIOD and retransmits the event report. This continues until Node-C runs out of backup power or an acknowledgement is received.

[0223] Tree routing is normally used to send power outage/restoration event notification frames. Mesh routing may also be used as an alternate method if the Node has been waiting to send its event for more than the time set by the parameter POWER_REPORT_WAIT.

[0224] Power restoration reporting uses the same process and messaging as power outage reporting, except that the parameters PO_RND_PERIOD and PO_RETRY_RND_PERIOD
are replaced by the parameters PR_RND_PERIOD and PR_RETRY_RND_PERIOD. For Nodes 47 of 107 that are members of overlapping networks, power outage and power restoration notifications may be done to any of the registered networks. Different Coordinators are selected in round-robin fashion at each attempt of reporting a notification. Attempts to send power restoration notifications are repeated up to the duration RESTORATION_TIMEOUT. Nodes that are not members of overlapping networks initiate an Association process after waiting an interval whose duration is RESTORATION_TIMEOUT. After a successful Association, the associating Nodes do not need to send Power Event Report messages since the Association process itself sets the Coordinator's state for the Node to "Alive."

[02251 A mesh multicast service is used to send application level information to a group of Nodes that share the same group address. A group address is a 2-octet short address within the range 0x3000 to Ox3FFF. Group addresses are well known or configured, with well known addresses assigned from address Ox3FFF and decreasing while configured addresses are assigned from address 0x3000 and increasing. The mesh layer does not provide services to configure group addresses; such assignment needs to be made by the application layer from a centralized location such as the Coordinator.

102261 A Mesh multicast service consists of a local broadcast by the originator of the multicast message. Each Router receiving this message verifies: that the message has been received from an authenticated Node listed in its Neighborhood table; and that the message Originator address and Request ID do not match those of a previously processed message. The Router then verifies that the Target Address matches one of its own group addresses. If a match is found, the message is propagated to the Router's upper layers for processing. The Router also determines whether the Target Address matches a group address of its child End Devices. If so, the message is sent to each child End Device having a matching group address.
A copy of the message is saved for each Sleeping End Device with a matching group address.

[02271 Child-group-addresses are acquired by a Parent Router by inspecting the first Keep Alive Request message sent by each child End Device after the End Device chooses or changes its primary parent. Routers do not forward group-addressed frames to End Devices for which they are not primary parents.

102281 Multicast Data Transfer frames with a Max Remaining Hops field greater than one are re-broadcast. To re-broadcast a message the Router first decrements the Max Remaining 48 of 107 Hops field and broadcasts the resulting message to its own neighbors.
Duplicate multicast messages are ignored based on the messages' Originator address and Request ID
as specified previously.

[02291 The Max Remaining Hops field can be used to limit the region for which a multicast is sent. To target all Nodes within the network, a Coordinator should set the Max Remaining Hops field to the value MAX_HOPS. To achieve the same result for frames from a different source, a non-Coordinator Node should set the Max Remaining Hops field to twice the value MAX_HOPS. All SM nodes in a group have the well known group address shown in Table 5.

Table 5 - Well known group addresses [02301 Address [02311 Group Ox3FFF 102321 All SecureMesh Nodes [02331 102341 A simple example of the mesh multicast process is shown in Figure 41.
Node-X
initiated the multicast data transfer, which progressed through the mesh network until it reached Node-A and Node-B, where Node-A is a neighbor of Node-B and Node-C, and Node-C
is a neighbor of Node-D, but Node-B is not a neighbor of Node-C. Node-A receives the Multicast Data Transfer frame and checks the Originator Address and Request ID. Because it appears to be a previously-unreceived multicast frame and the value of the Max Remaining Hops field is greater than one, Node-A forwards the frame after decrementing the value of the Max Remaining Hops field. The forwarded frame goes to Node-B and Node-C. Both Node-B and Node-C also forward the frame to their neighbors. The frame forwarded by Node-C goes to Node-D where it is not re-forwarded because the value of the Max Remaining Hops field in the received frame equals one. At a later time, Node-B receives the multicast frame via another route. This duplicate frame carries the same Originator Address and Request ID as the prior frame, so it is discarded and not forwarded.

[02351 The local communication process is used to initiate point-to-point communication between two Nodes that may not already be part of the same mesh network.
Typical applications that use this type of communication are installation, operation and maintenance activities and walk-by reading of Nodes using a handheld reader. Local communications use the Node's long 49 of 107 8-octet IEEE EUI-64 address rather than its short 2-octet address. In the cases of walk-by communication with targeted devices that are not sleeping, the handheld device issues the Local Broadcast Request frame to initiate local communication. From the responses to this local broadcast, the handheld device can build a table of local devices that are awake, where each table entry includes the following information about the responding Node: long and short addresses;
[0236] PAN IDs; Device Class information; and optionally Network Name, security flag, VERSION, OWNER, and BAR-CODE-11).

[0237] From this resulting acquired table of device information, the user can select the device with which to communicate. There are two local communication options:
1) local data transfers that use the application level services using Local Data Transfer frames, and 2) RF link measurements using the Range Test Request and Range Test Response frames.

[0238] Figure 42 shows a typical local communication sequence. The handheld device discovers the local nodes by transmitting a Local Broadcast Request frame.
This message is answered by Node-A and Node-B. The handheld application selects Node-A and sends it a Local Data Transfer frame that executes an application service such as a read operation. Node-A
responds with a Local Data Transfer frame containing the application response.
All frames except the first broadcast frame are acknowledged with MAC-level ACKs.

[0239] The Range Test process uses the local communication Range Test Request and Range Test Response frames. The Range Test Request command frame is used to check whether Node is reachable in the local communication mode. The Range Test Response frame reports the signal strength as recorded by the responder in the forward direction. The signal strength of the response is measured by the range test originator to determine signal strength in the return direction. The Range Test Initiate and Range Initiate Result frames can be used to request one Node to perform a range test with a different Node and to report the test results to the requester.
A typical example of this function is for a handheld test tool to request a Router to do a range test with an End Device.

102401 Figure 43 shows this process, where a handheld device requests Node-A
to perform a range test with Node-B. The Range Test Initiate sent to Node-A tells it to send a Range Test Request to Node-B. Node-B receives the request and records its modem's RSSI and LQI values as measured during request frame reception. Node-B then sends a Range Test 50 of 107 Response to Node-A, which records its modem's RSSI and LQI values as measured during response frame reception . Node-A then sends a Range Test Result to the handheld device, reporting the RSSI and LQI values for both the Range Test Request and Range Test Response frames between Node-A and Node-B.

[02411 The FRR test is used to evaluate the one-way link quality between a sender and a receiver. Theses two Nodes need to be able to reach each other directly. The sender sends a configurable number of frames in local communications mode to the receiver. At the end of the test, the receiver sends a result frame to the sender. This frame contains the FRR and the average LQI for received frames. A frame reception rate session consists of: the transmission of the Frame Reception Rate Test Init message; multiple transmission of the Frame Reception Rate Test Data messages; the transmission of the Frame Reception Rate Test End message; and the reception of the Frame Reception Rate Test Result message.

102421 With the exception of the Frame Reception Rate Test Data messages, Frame Reception Rate Test control messages are transmitted with MAC layer acknowledgment and retry. In the case of a MAC layer transmission failure, such control messages are re-transmitted up to a maximum of FRR_TEST_RETRY times.

102431 An example of the frame reception rate test process is shown in Figure 44. A
handheld initiates the test in this example by sending the Frame Reception Rate Test Init message to Node-A. The test is set to send N test frames without acknowledgements. The handheld starts sending the first of the N test frames to Node-A after it receives the ACK from Node-A for the test-initializing message. The Frame Reception Rate Test End message is sent after the N test frames. The test end message is acknowledged by Node-, which then sends the Frame Reception Rate Test Result v to the testing handheld.

102441 The ping command is used to check whether a Node is reachable through the mesh network, and to determine and trace the routes used for each direction of communication.
The Ping frame tests the ability of a device to reach a Node that is more than one hop distant, since testing of the first hop is provided by Range Test commands. A Ping Request can be used by a Coordinator to determine whether a device that is awake is reachable in the intervals between Keep Alive Requests. The Ping Request frame can be used with any type of routing. As the frame traverses each Node, the RSSI and LQI values measured during frame reception are 51 of 107 noted. Both values are added to the frame before it is forwarded. The addressed receiving device processes the Ping Request frame, converts it to a Ping Response frame, and sends that response back to the originating device. The RSSI and LQI values measured during frame reception on the return path are appended to those accumulated as the Ping Request frame traversed its forward path.

[0245] In Figure 45, Node A initiates a Ping Request message targeting Node-C.
The frame within the Ping Request message is routed through Node-B. Node-B updates the frame data by incrementing the hop count, and appending its 2-octet address, the measured RSSI and the observed LQI to the Ping Request frame's accumulated data before forwarding the frame to Node-C. Node C converts the received Ping Request frame to a Ping Response frame and sends it to Node-A. When the Ping Response frame arrives at Node-A, it contains the path traversed by the request and response frames and the measured RSSI and observed LQI values noted at each hop.

[0246] The SM frame structure is presented so that the leftmost or first-described field is transmitted or received first. Except for octet arrays, all multi-octet fields are transmitted or received least significant octet first. To maintain compatibility with the IEEE 802 standards, addresses and PAN identifiers are considered octet arrays and are transmitted unaltered, which is equivalent to transmitting them most significant octet first when viewed as multi-octet fields.
[0247] Each frame described in this document includes MAC layer fields, which are documented within the mesh layer to provide the context on which the mesh layer operates. The MAC and mesh layers are tightly coupled, so that information required by the mesh layer that is already present at the MAC layer is not duplicated. Descriptions of the MAC
layer fields are provided in this subsection so that they need not be duplicated in the description of each mesh-layer frame format. More information on these fields can be found in the IEEE
802.15.4:2006 standard, which is the controlling specification for the MAC protocol and is incorporated herein by reference in its entirety.

Table 6 - MAC Layer Fields Field Name Data type Description Frame Control Unsigned 16 bits See sub fields below:
52 of 107 Field Name Data type Description Frame Type Bits 2-0 One of the following frame types:
0 = Beacon 1 = Data 2 = MAC acknowledgment 3 = MAC command Security Enabled Bool 3 Set if the frame is cryptographically protected by the MAC
layer as specified in IEEE 802.15.4:2006. This bit is reset in the SM protocol.
Frame Pending Boot 4 Set if the Router sending the frame has additional data frames to send to the targeted End Device following the current transfer. If another frame is pending, the End Device retrieves it by sending another Data Request command to the acknowledging Router.
Ack. Request Boot 5 Specifies whether an acknowledgment is required from the recipient device on receipt of a data or MAC command frame.
Intra-PAN Bool 6 Specifies whether the MAC frame is to be sent within the same PAN (intra-PAN) or to another PAN (inter-PAN).
When set and both destination and source addresses are present, the frame contains only the destination PAN
identifier field.
Destination Addressing Mode Bits 11-10 Specifies the presence and format of the destination address:
0 = PAN identifier and address not present.
2 = 2-octet short address present.
3 = 8-octet EUI-64 extended address present.
Source Addressing Mode Bits 15-14 Specifies the presence and format of the source address:
0 = PAN identifier and address not present.
2 = 2-octet short address present.
3 = 8-octet EUI-64 extended address present.
Sequence Number Unsigned 8 bits Specifies a unique sequence identifier for the frame. When the SM MAC Header Flag is 0: for a data, acknowledgment, or MAC command frame, the sequence number field is used to match an acknowledgment frame to the data or MAC
command frame as specified in the IEEE 802.15.4:2006 standard. When the SM MAC Header Flag is set to 1: the Sequence Number is the least significant octet of the MAC
nonce counter, Destination PAN Identifier Binary 2 octets Specifies the unique PAN identifier of the intended recipient of the frame. A value of OxFFFF in this field is the broadcast PAN identifier, which is accepted as a valid PAN
identifier by all devices currently listening to the channel.
Presence of this field is defined by the Destination Addressing Mode field.
Destination Address Binary 2 octets Specifies the address of the intended recipient of the frame.
A value of OxFFFF in this field represents the broadcast short address, which is accepted as a valid short address by all devices currently listening to the channel. Presence and content of this field is defined by the Destination Addressing Mode field.
Source PAN Identifier Binary 2 octets Specifies the unique PAN identifier of the originator of the frame. This field is included only if the Source Addressing Mode and Intra-PAN subfields of the frame control field are nonzero and zero, respectively.

53 of 107 Field Name Data type Description Source Address Binary 2 octets Specifies the address of the originator of the frame.
Presence and content of this field is defined by the Source Addressing Mode field.
FCS Unsigned 16 bits 2-octet ITU-T CRC as specified by IEEE 802.15.4, without the initial preset or final complementation typical of a frame check sequence (e. g., as in IEEE 802.3).

[02481 Bits 4 to 6 of the first octet of the Mesh header are called the Service type. This field defines the structure of the next of the mesh header and the general behavior of a group of messages. With the exception of the Data Transfer frame, the subsequent header prefix contains a field called Service Code which defines the specific message format for the last of the mesh header. Table 7 enumerates all defined combinations of Service Type and Service Code.

Table 7 - Defined Service Type and Service Code Combinations Service Service Type Service Code Data transfer Data Transfer 0 <none>
Route discovery Route Request I 1 Route Reply 1 2 Route Error 1 3 Routed services Association Confirmation Request 2 0 Association Confirmation Response 2 1 Keep Alive Initiate 2 3 Keep Alive Request 2 4 Keep Alive Response 2 5 Route Establishment Request 2 6 Route Establishment Response 2 7 Power Event Report Notification 2 8 Power Event Report Acknowledgment 2 9 Ping Request 2 10 Ping Response 2 11 Service Forwarding Request 2 12 Service Forwarding Response 2 13 Non routed service Association Request 3 0 Association Response 3 1 Neighbor Info Request 3 2 Neighbor Info Response 3 3 Neighbors Exchange 3 4 End Device Data Request 3 5 End Device Data Response 3 6 Service Request 3 7 Multicast data transfer Mesh Multicast 4 <none>
Point to point communication Local Data Transfer 5 0 Frame Reception Rate Test Init 5 1 54 of 107 Service Service Type Service Code Frame Reception Rate Test Data 5 2 Frame Reception Rate Test End 5 3 Frame Reception Rate Test Result 5 4 Local Broadcast Request 5 20 Local Broadcast Response 5 21 End Device Node Present 5 22 Range Test Request 5 30 Range Test Response 5 31 Range Test Initiate 5 32 Range Test Result 5 33 102491 The following table defines which message is implemented for the supported devices.

Table 8 - Message supported per Node Type Message Endpoint Coordinator Router End Device Handheld Data transfer Originator Y Y Y
Target Y Y Y
Mesh Multicast Originator Y Y Y
Target Y Y Y
End Device Data Request Originator Y
Target Y
End Device Data Response Originator Y
Target Y
Association Request Originator Y Y
Target Y
Association Response Originator Y
Target Y Y
Association Confirmation Request Originator Y
Target Y
Association Confirmation Response Originator Y
Target Y
Neighbor Info Request Originator Y Y
Target Y Y
Neighbor Info Response Originator Y Y
Target Y Y
Neighbors Exchange Originator Y Y
Target Y Y
Route Request Originator Y Y
Target Y Y
Route Reply Originator Y Y
Target Y Y
Route Error Originator Y Y
Target Y Y
Keep Alive Initiate Originator Y
Target Y
Keep Alive Request Originator Y Y
Target Y
Keep Alive Response Originator Y
Target Y Y
Route Establishment Request -Originator Y Y
55 of 107 Message Endpoint Coordinator Router End Device Handheld Target Y
Route Establishment Response Originator Y
Target Y Y
Power Event Report Originator Y Y
Target Y
Ping Request Originator Y Y Y
Target Y Y Y
Ping Response Originator Y Y Y
Target Y Y Y
Service Request Originator Y Y
Target Y Y
Service Forwarding Originator Y Y
Target Y Y
Local Broadcast Request Originator Y
Target Y Y Y
Local Broadcast Response Originator Y Y Y
Target Y
End Device Node Present Originator Y Y Y
Target Y
Local Data Transfer Originator Y Y Y Y
Target Y Y Y Y
Frame Reception Rate Test Init Originator Y
Target Y Y Y
Frame Reception Rate Test Data Originator Y
Target Y Y Y
Frame Reception Rate Test End Originator Y
Target Y Y Y
Frame Reception Rate Test Result Originator Y Y Y
Target Y
Range Test Request Originator Y
Target Y Y Y
Range Test Response Originator Y Y Y
Target Y
Range Test Initiate Originator Y
Target Y Y Y
Range Test Result Originator Y Y Y
Target Y
[0250] This message frame format shown in Figure 46 is used to transport upper layers information for all requests and responses.

Table 9 --Fields Tree and Mesh routing) Field Name Data type Description Common MAC layer fields See description herein.
Unsigned 8 bits See sub fields below:
Source Route Present Bool 7 Reset Service Type Bits 6-4 Set to 0 Urgent Bool 3 Set when the message is urgent and should be forwarded immediately before any other less-urgent pending transmission.
PAN present Bool 2 Set when the Target PAN Identifier and the Originator 56 of 107 Field Name Data type Description PAN Identifier are added to the frame to identify the network of the target Node.
DLL Security Header Flag Bool 1 Set when the DLL Security Header follows this octet Network Security Header Flag Bool 0 Reset, no Network Security Header follows [DLL Security Header] Unsigned 16 bits See description herein.
Unsigned 8 bits See sub fields below:
Sibling Transmission Bool 7 Set when a frame is transmitted using tree routing and if a local repair is done through a Sibling instead of a Parent.
Only one Sibling transmission is allowed per tree level;
when a Node receives a frame with this flag set, it can only route this frame to one of its Parents.
Max Remaining Hops Unsigned bits 6-0 Set to MAX-HOPS by the originator of this message and decremented each time a message is routed. The message is discarded and not forwarded when this value reaches zero and the next hop does not match the Final Destination Address.
Target Address Binary 2 octets Short address of the final target (Router or End Device) of this message.
Originator Address Binary 2 octets Short address of the originator (Router or End Device) of this message.
Target PAN Identifier Binary 2 octets PAN identifier of the target Node as identified by the Target Address field.
Originator PAN Identifier Binary 2 octets PAN identifier of the originator Node as identified by the Originator Address field.
Payload Multi-octet Upper layer information.
[DLL MIC32] Binary 4 octets See description herein.
Table 10 - Fields (Source routing) Field Name Data type Description Common MAC layer fields See description herein.
Unsigned 8 bits See sub fields below:
Source Route Present Bool 7 Set Service Type Bits 6-4 Set to 0 Urgent Bool 3 Set when the message is urgent and should be forwarded immediately before any other less-urgent pending transmission.
PAN present Bool 2 Reset for source routed messages.
DLL Security Header Flag Bool l Set when the DLL Security Header follows this octet Network Security Header Flag Bool 0 Reset, no Network Security Header follows [DLL Security Header] Unsigned 16 bits See description herein.
Unsigned 8 bits See sub fields below:
Sibling Transmission Bool7 Reset Max Remaining Hops Unsigned bits 0-6 Set by the Originator to the value of the Number of Hops field and decremented at each hop. This field is used to index to the next hop in the Hop Addresses list. This field is set to zero when the next hop corresponds to the Target Address.
Target Address Binary 2 octets Short address of the final target (Router or End Device) of this message. Bits 15-14 define the network membership:
0 = The Node is part of the network with the PAN
identifier specified by the first entry in the PAN
Identifiers list.

57 of 107 Field Name Data typ Description 1 = The Node is part of the network with the PAN
identifier specified by the second entry in the PAN
Identifiers list.
2 = The Node is part of the network with the PAN
identifier as specified by the third entry in the PAN
Identifiers list.
3 = The Node is part of a network which is not listed in the PAN Identifiers list. When this option is used, the frame can be routed to the incorrect Node in the following circumstances:
^ More than four networks exist within the same geographical area ^ Multiple Neighbors exist with the same short address but on non-listed networks.
Originator Address Binary 2 octets Short address of the originator (Router or End Device) of this message. Bits 15-14 define the PAN identifier of the network of which the target Node is a member. See the Hop Addresses field (following) for more information on these 2 bits.
Unsigned 8 bits See sub fields below:
Number of PAN identifiers Bits 7-6 Defines the number of entries in the PAN
identifiers field.
Number of Hops Addresses Bits 3-0 Number of Addresses in Hop Addresses list.
Source routing is used when the Target device is more than one hop away. Therefore the Number of hops is at least one.
PAN Identifiers Array of Binary 2 List of Network identifiers. Bits 15-14 of the different octets short addresses specified within this frame reference this list. Each short address is explicitly associated with one of the three specified PAN Identifiers, or none of them.
Hop Addresses Array of Binary 2 Short address of each Node responsible for routing this octets message. Bits 15-14 define network membership of the Node as described by the PAN identifiers field.
Payload Multi-octet Upper layer information.
[DLL MIC32 Binary 4 octets See description herein.

102511 The mesh multicast message format set forth in Figure 47 facilitates multicast of application data to a group of Nodes within a mesh network. Group addresses need either to be pre-assigned or assigned by an upper layer. This layer does not provide services to remotely assign group address to Nodes.

Table 11 - Mesh Multicast Frame Fields Field Name Data type Description Common MAC layer fields See description herein.
Unsigned 8 bits See sub fields below:
Source Route Present Bool 7 Reset Service Type Bits 6-4 Set to 4 Urgent Bool 3 Set when the message is urgent and should be forwarded immediately before any other pending transmission.
PAN present Bool2 Reset DLL Security Header Flag Bool 1 Set when the DLL Security Header follows this octet Network Security Header Flag Bool 0 Reset, no Network Security Header follows 58 of 107 Field Name Data type Description [DLL Security Header] Unsigned 16 bits See description in section Max Remaining Hops Unsigned 8 bits Set by the originator and decremented each time the message is re-broadcast. The initial value represents the maximum number of router hops from the originator that this message will reach. To ensure the message will reach all Nodes on the network, this value should be set to MAX_HOPS if the originator is the Coordinator or two time MAX HOPS if the originator is a Node.
Target Address Address of the group targeted.
Originator Address Binary 2 octets Short address of the originator (Router or End Device) of this message.
Request ID Unsigned 8 bits Unique number used to eliminate duplicated message during a broadcast storm.
Unsigned 8 its Last Fragment Bit 7 Flag which indicate the last fragment of a fragmented multicast.
Fragment ID Bits 0 to 6 When a multicast is fragmented, each fragment has a unique fragment number from 0 to n where n represent the last fragment which is identified by Last Fragment flag set to true.
Payload Multi-octet Upper layer data.
[DLL MIC32 Binary 4 octets See description herein.

[02521 The route request message is used to create a route to a target Node for peer to peer communication between two Nodes using mesh routing. The route request message format is shown in Figure 48.

Table 12 - Route Request Frame Fields Field Name Data typ Description Common MAC layer fields See description herein.
Unsigned 8 bits See sub fields below:
Service Type Bits 6-4 Set to I
DLL Security Header Flag Bool 1 Set when the DLL Security Header follows this octet Network Security Header Flag Bool 0 Reset, no Network Security Header follows [DLL Security Header] Unsigned 16 bits See description in section 5.8.1.
Max Remaining Hops Unsigned 8 bits See description in section 6.4.
Target Address Binary 2 octets Broadcast address (OxFFFF) Originator Address Binary 2 octets Address of the originator of this Route Request.
Service Code Unsigned 8 bits Set to 1.
Unsigned 8 bits See sub fields below:
Trace Route Flag Bool 0 When set, the response contains the list of hops used to route to the target Node. When this option is used, the network is not updated with the routing information;
Routers do not create a route in their routing table.
Min LQI Class Bits 2-1 Used to set a minimum link quality for each hop of the requested route. Before accepting this request, each Node validate that the LQl class corresponding to the Node from which this message have been received is better or equal to the value of this field.
Hop Count Unsigned 8 bits Use to count the number of hops from the Requestor Address. Initially sent with a value of zero and 59 of 107 Field Name Data type Description incremented each time this request is received and re-broadcast.
Request ID Unsigned 8 bits Unique number used to eliminate duplicated message during the broadcast storm.
Requested Address Binary 2 octets Node for which a route is requested.
Requestor Address Binary 2 octets Originator of this Route Request.
Hop List Array of Binary 2 Address of each Node routing this message. The size of octets this list is Hop Count minus one. Present if the Trace Route Flag is set.
Padding Binary 2 octets For backward compatibility.
DLL MIC32 Binary 4 octets See description herein.

102531 The route reply message is sent in response to a Route Request and is given the format shown in Figure 49.

Table 13 - Route Reply Frame Fields Field Name Data type Description Common MAC layer fields See description herein.
Unsigned 8 bits See sub fields below:
Service Type Bits 6-4 Set to I
DLL Security Header Flag Bool 1 Set when the DLL Security Header follows this octet Network Security Header Flag Bool 0 Reset, no Network Security Header follows [DLL Security Header] Unsigned 16 bits See description herein.
Max Remaining Hops Unsigned 8 bits See description herein.
Target Address Binary 2 octets Same as Requestor Address.
Originator Address Binary 2 octets Same as Requested Address.
Service Code Unsigned 8 bits Set to 2.
Unsigned 8 bits See sub fields below:
Trace Route Flag Bool 0 Return the same value as the Trace Route Flag received in the Route Request.
Requested Address Binary 2 octets Node for which a route have been requested.
Requestor Address Binary 2 octets Originator of the Route Request.
Hop Count Unsigned 8 bits Number of hop between the Requestor Node and the Requested Node. Set to I if the Requestor Node is a neighbor of the Requested Node [Hop List] Array of Binary 2 Address of each Node routing this message. The size of octets this list is Hop Count minus one. Present if the Trace Route Flag is set.
[DLL MIC32 Binary 4 octets See description herein.

[02541 The route error message is sent out to inform surrounding Nodes that a route to a destination has fail and need to be invalidated. This message is sent as a broadcast frame with Hop Count set to 1. Each Node receiving this message, re-broadcast the Route Error if its route table shows that other Nodes use this Node as a route to the destination and must therefore be informed of the invalid route. The route error message format is shown in Figure 50.

Table 14 - Route Error Frame Fields Field Name Data type Description 60 of 107 Field Name Data t e Description Common MAC layer fields See description herein.
Unsigned 8 bits See sub fields below:
Service Type Bits 6-4 Set to I
DLL Security Header Flag Bool 1 Set when the DLL Security Header follows this octet Network Security Header Flag Bool 0 Reset, no Network Security Header follows [DLL Security Header] Unsigned 16 bits See description herein.
Max Remaining Hops Unsigned 8 bits See description herein.
Target Address Binary 2 octets Broadcast address (OxFFFF) Originator Address Binary 2 octets Address of the Node generating this message.
Service Code Unsigned 8 bits Set to 3.
Hop Count Unsigned 8 bits Set to OxOI
Invalidated address Binary 2 octets Short [DLL MIC32 s Binary 4 octets See description herein.

[02551 All messages described within this subsection share the same MAC header and Mesh header prefix format. This common portion of the message is shown in Figure 51.
Table 15 - Common Routed Message Frame Fields Field Name Data type Description Common MAC layer fields See description herein.
Unsigned 8 bits See sub fields below:
Source Route Present Boot 7 See description herein.
Service Type Bits 6-4 Set to 2.
Urgent Boot 3 See description herein.
PAN present Boot 2 See description herein.
DLL Security Header Flag Boot l See description herein.
Network Security Header Flag Boot 0 See description herein.
[DLL Security Header] Unsigned 16 bits See description herein.
[Network Security Header] Unsigned 40 bits See description herein.
Unsigned 8 bits See sub fields below:
Sibling Transmission Boot 7 See description herein.
Max Remaining Hops Unsigned bits 0-6 See description herein.
Target Address Binary 2 octets See description herein.
Originator Address Binary 2 octets See description herein.
[Target PAN Identifier] Binary 2 octets See description herein.
[Originator PAN Identifier] Binary 2 octets See description herein.
Unsigned 8 bits [Number of PAN identifiers Bits 7-6 See description herein.
[Number of Hops Addresses] Bits 3-0 See description herein.
[PAN Identifier] Binary 2 octets See description herein.
[Hop Address] Binary 2 octets See description herein.
Specific message fields [Network MIC32] Binary 4 octets See description herein.
[DLL MIC32 Binary 4 octets See description herein.

102561 The association confirmation request message is sent to the Coordinator by a Router when an "Association Request" is received from a Node requesting an association. The association request message format is shown in Figure 52.

61 of 107 Table 16 - Association Confirmation Request Frame Fields Field Name Data t e Description Common routed message See description herein.
format Service Code Unsigned 8 bits Set to 0.
Requesting Node Address Binary 8 octets Long address of the Node requesting the association.
Embedded Association request information Embedded Net Security Binary 5 octets Network Security Header of the embedded Association Header Request, included only for secure association. Enabled only if "DLL Security Header Flag" and/or "Network Security Header Flag" are set.
Unsigned 8 bits Association information of the embedded Association request, see sub fields below:
Secure Node Bool 0 When reset, the device is not configured to associate to a secure network and the Embedded Net Security Header and Embedded Net MIC32 should not be processed. This option is possible only when the entire network is configured insecure.
Secondary Network Bool 1 Set when the Node is already associated to a network and want to create secondary association with neighbor networks to allow overlapping network communications.
Device Type Bool 2 Reset when the device is a Router and set when the device is an End Device.
Receiver On When Idle Bool 3 Set if the End device does not disable its receiver to conserve power during idle periods. This field can be reset only if the Device Type is set.
Embedded Net MIC32 Network MIC32 of the embedded Association Request, included only for secure association.

[02571 The association confirmation response message is returned by the Coordinator to a Router in response to an Association Confirmation Request. The association confirmation response message format is shown in Figure 53.

Table 17 - Association Confirmation Response Frame Fields Field Name Data type Description Common routed message See description herein.
format Service Code Unsigned 8 bits Set to 1.
Requesting Node Address Binary 8 octets Long address of the Node requesting the association.
Embedded Association Response information [Embedded Net Security Unsigned 5 octets Network Security Header of the embedded Association Header] Response. Enabled only if "DLL Security Header Flag"
and/or "Network Security Header Flag" are set.
Short Address Binary 2 octets If the Coordinator was not able to associate this device to its PAN, this field is set to OxFFFF, and the association status field shall contain the reason for the failure. If the Coordinator was able to associate the device to its PAN, this field contains the short address assigned to that device.
Mesh Key Security Header Unsigned 5 octets For the write operation, this field is the security information and has the same format as the Network Security Header that contains the nonce and key 62 of 107 Field Name Data t e Description information used to encrypt the Encrypted Mesh Key.
Encrypted Mesh Key Binary 16 octets Mesh Key encrypted with the Node Key used for the Embedded Network Security Header. The Mesh Key is encrypted using the algorithm in IEEE 802.15.4-2006 section B.4 and the specified Node Key.
Mesh Key MIC32 Binary 4 octets Message Integrity check of the Mesh Key Security Header and the plain text Mesh Key. The MIC is calculated using the algorithm in IEEE 802.15.4-2006 section B.4 and the specified Node Key.
Unsigned 8 bits See sub fields below:
Reserved Bits 7-4 Set to 0 Mesh Key Selection Bits 3-0 2 = Mesh Key 1 3 = Mesh Key 0 All other values reserved Mesh Key PAN ID Binary 2 octets PAN ID associated with the Mesh Key Association Status Unsigned 8 bits 0x00 = Association successful. 0x01 = PAN
at capacity.
0x02 = PAN access denied.
Coordinator Load Unsigned 8 bits Measure of the number of Nodes already associated to the network, relative to router capacity. The value 100%
means full and no further associations are accepted.
[Embedded Net MIC32] Binary 4 octets Network MIC32 of the embedded Association Response.
102581 The Keep Alive Initiate message is sent by the Coordinator to request that a Node initiate immediately its Keep Alive Request. This message is optional and used by the Coordinator to control the flow and distribution of Checkpoint messages.
Independently of this optional message, Nodes autonomously initiate their Checkpoint process by sending a Keep Alive Request after each CHECKPOINT_PERIOD. To control the flow of messages, the Coordinator must send a Keep Alive Initiate prior to the expiration of this period. WARNING
This request is sent using source routing, Routers routing this message shall not create a temporary route. This allows the following Keep Alive Request to trace current tree route from this Node. The Keep Alive Initiate message format is shown in Figure 54.

Table 18 - Keep Alive Initiate Frame Fields Field Name Data type Description Common routed message See description herein.
format Service Code Unsigned 8 bits Set to 3.
MAC Address Binary 8 octets IEEE 802.15.4 EUI64 address (8-octets) of the targeted Node. Used to validate if the Node receiving this message is the Node expected. If a mismatch is detected, the Node does not return its Keep Alive Request.
Information To Report Unsigned 8 bits Specify which information will be reported in the next Keep Alive Request.

102591 The Keep Alive Request message is sent periodically to the Coordinator to maintain the Node association. The Keep Alive Request frame format is shown is Figure 55.
63 of 107 Table 19 - Keep Alive Request Frame Fields Field Name Data typ Description Common routed message See description herein.
format Service Code Unsigned 8 bits Set to 4.
Unsigned 8 bits See sub fields below:
Secure Node Bool 0 When reset, the device is not configured for a secure network and all key information provided below shall be ignored.
Secondary Network Bool 1 Set if this Message is sent to the Coordinator of secondary network.
Device Type Bool 2 Reset when the device is a Router and set when the device is an End Device.
Receiver On When Idle Bool 3 Set if the End device does not disable its receiver to conserve power during idle periods. This field can be reset only if the Device Type is set.
Information Reported Bit 7-4 Identifier of the optional information reported by the Node within the current Keep Alive Request. 0 = Trace Route 1 = Multicast group address Send by End Devices supporting group address to update its Parent. 2 =Neighbor information This information is useful for Network Management. Can be used by the Coordinator and the Head End to compute routes, find weak region on the mesh network, and evaluate route diversity. 3 =Statistic This information is useful for Network Management.
Keep Alive Period Unsigned 8 bits Period in units of 1 min. The reporting Node generates autonomously a Keep Alive Request at the specified periodicity. The Coordinator, at its option, may send a Keep Alive Initiate before the expiration of this period to control the time distribution of Keep Alive Requests of Nodes within the network.
MAC Address Binary 8 octets IEEE 802.15.4 EU164 address (8-octets) of this Node.
Used to validate if the Node sending this message is the Node expected. If a mismatch is detected, the Coordinator does not return a Keep Alive Response, but waits for the Node to re-associate.
Unsigned 8 bits Reports the current state of the encryption key writes. See fields below:
Reserved Bit 7 Set to 0 SMIB Write Toggle Bit 6 Bit toggled each time the SMIB parameter table is written.
Node Key- I Write Toggle Bit 5 Bit toggled each time that Node Key- I is updated.
Node Key-0 Write Toggle Bit 4 Bit toggled each time that Node Key-0 is updated.
Mesh Key- I Write Toggle Bit 3 Bit toggled each time that Mesh Key- I is updated.
Mesh Key-0 Write Toggle Bit 2 Bit toggled each time that Mesh Key-0 is updated.
Maintenance Key-I Write Bit I Bit toggled each time that Maintenance Key-1 is updated.
Toggle Maintenance Key-0 Write Bit 0 Bit toggled each time that Maintenance Key-0 is updated.
Toggle Unsigned 8 bits Reports the current keys used for transmission. See fields below:
Current Node Key Bit 5 Node Key used when sending I = Node Key-1 0 = Node Key-0 Current Mesh Key Bit 4 Mesh Key used when sending I = Mesh Key-] 0 = Mesh 64 of 107 Field Name Data type Description Key-0 Current Maintenance Key Bit 3 Mesh Key used when sending I = Maintenance Key-l, 0 = Maintenance Key-0 Secondary Node Key Allowed Bool 2 Set when frames may be authenticated via either Node key. Reset when only frames authenticated using the Node key specified by the Current Node Key ID are accepted.
Secondary Mesh Key Allowed Bool I Set when frames may be authenticated via either Mesh key. Reset when only frames authenticated using the Mesh key specified by the Current Mesh Key ID are accepted Secondary Maintenance Key Bool 0 Set when frames may be authenticated via either Allowed Maintenance key. Reset when only frames authenticated using the Node key specified by the Current Maintenance Key ID are accepted [0260] The following describes the different extensions to this basic frame format.
Transmission of these extensions follows these rules, which are listed in order of priority:
The Trace Route extension is transmitted with the first Keep Alive sent after a Node associates with a Coordinator, and by default when no other extension needs to be transmitted.

The Multicast Group Addresses extension is transmitted by End Devices with the first Keep Alive Response sent after each Parent change.

The Statistics extension is transmitted once a day with the first Keep Alive sent after midnight local time.

The Neighbors extension is transmitted once every 4 hours.
[0261] The optional Trace Route extension is shown in Figure 56.

Table 20 - Kee Alive Request: Optional Trace Route Frame Fields Field Name Data type Description Number of Hops Unsigned 8 bits Number of entries within the Hop list. This list contains an entry for each Node routing this message.
Array of ... Repeating two-component list Hop PAN identifier Binary 2 octets PAN identifier associated to this Hop list entry.
Hop Addresses Binary 2 octets Short address associated to this Hop list entry.

[0262] This extension is not authenticated by the Network MIC-32 since the Number of Hops value is incremented and a PAN identifier and short address is appended at each hop.

65 of 107 102631 The optional Multicast Group Addresses extension is shown in Figure 57.
Table 21 - Keep Alive Request: Optional Multicast Group Addresses Frame Fields Field Name Data type Description Number Of Group Addresses Unsigned 8 bits Number of Group Address fields.
Group Addresses Array of Binary 2 Group addresses are used during multicast to target a octets group of Nodes. This list corresponds to the groups for which the originator of this message is member. This information is captured by the first Router when the value of Receiver On When Idle is False. In this context, the Router mesh cashed messages targeted to one of these groups until the End Device will wakeup to retrieve this information. This list can also be useful to the Coordinator.

[02641 The optional Neighbors extension is shown in Figure 58.

Table 22 - Keep Alive Request: Optional Neighbors Frame Fields Field Name Data type Description Number Of Neighbors Unsigned 8 bits Number of entry in the Neighbors list.
This list contain the Parents in order of their Preferred Route Ratio (The preferred route is always at index 0) Array of ... Repeating multi-component list Neighbor Address Binary 2 octets See description herein.
Neighbor PAN Identifier Binary 2 octets See description herein.
RSSI rx Signed 8 bits See description herein.
RSSI tx Si ned 8 bits See description herein.
LQI rx Unsigned 8 its See description herein.
LQI tx Unsigned 8 bits See description herein.
Avg LQI Unsigned 8 bits Average of the LQI value of each hop between the current Node and the Coordinator through this Neighbor using the preferred parent within the specified network tree. The LQI for each hop corresponds to the worst LQI
recorded (LQI rx and LQI tx) for this hop.
Unsigned 8 bits Number of Hops Bits 4-7 Number of hops between the current Node and the Coordinator through this Neighbor using the preferred parent within the specified network tree.
LQI Class Bit 2-3 LQI class on the link between the current Node and this Neighbor based on the worst LQI recorded (LQI rx and LQI tx) for this link.
Min LQI Class Bit 0-1 Minimum of all LQI class for each hop between the current Node and the Coordinator through this Neighbor using the preferred parent within the specified network tree.
Transmission success rate Unsigned 8 bits See description herein.
102651 The optional Statistics extension is shown in Figure 59.

Table 23 - Keep Alive Request: Optional Statistics Frame Fields Field Name Data type Description Number Of Statistics Unsigned 8 bits Number of Statistic Code and Statistic Count pairs present in this message.

66 of 107 Unsigned 8 bits Statistic Count Format Bit 7 0 = The Statistic Count is 16 bits I = The Statistic Count is 32 bits Statistic Code Bits 6-0 Identifier assigned to the statistic as defined in the Statistics codes in 6.7.5.11. New statistics can be added by assigning them new identifiers and including them in the list. Statistics can be deprecated simply by removing them from the list.
Statistic Count Unsigned integer Actual count of the specific statistic identified by the 16 or 32; see Statistic Code.
specific Statistic Count Format Table 24 - Statistics Codes Code Label Description Size (bits) Association process 0 Number of association processes Number of times this Node has initiated an association 16 initiated process 1 Number of association processes From the Number of association processes initiated, 16 successful how many were successful 2 Number of re-associations Number of times the Node has switched networks 16 because of a significant improvement Route Discovery process 3 Number of route discovery Number of times this Node has initiated a route 16 processes initiated discovery process 4 Number of route discovery From the Number of route discovery processes 16 processes successful initiated, how many were successful Check oint process Number of Keep Alive Initiate Number of Keep Alive Initiate frames received by this 16 frames received Node.
6 Number of Keep Alive Request Number of Keep Alive Request frames initiated by this 16 frames initiated Node.
7 Number of Keep Alive Response Number of Keep Alive Response frames received by 16 frames received this Node.
Outage Restoration Reporting process 8 Number of power outages Number of power outages recorded by this Node. 16 9 Number of successful power From the Number of power outages, how many were outage notifications reported and acknowledged successfWly Number of successful power From the Number of power outages, how many 16 restoration notifications restorations were reported and acknowledged successfully 11 Power outage notification delay Interval (in seconds) elapsed between the outage and 16 the acknowledgment of the notification 12 Power restoration notification Interval (in seconds) elapsed between the restoration 16 delay and the acknowledgment of the notification Ping pr cess 13 Number of Ping Requests Number of Ping Requests initiated by this Node. 16 initiated 14 Number of Ping Responses Number of Ping Responses received by this Node. 16 received Route Establishment process Number of Route establishment Number of Route establishment Requests originated by 16 Requests originated this Node.
16 Number of Route establishment Number of Route establishment Responses received by 16 67 of 107 Code Label Description Size (bits) Responses received this Node.
Forwarding Service Message process 17 Number of Service Requests sent Number of Service Requests initiated by this Node. 16 18 Number of Service Requests Number of Service Requests received by this Node. 16 received 19 Number of Service Forwarding Number of Service Requests received and forwarded to 16 Requests sent the requested service provider.
20 Number of Service Forwarding Number of Service Responses forwarded to a 16 Responses received requesting Node.
Transmission performance 21 Number of data frames received Number of Data transfer frames received by this Node. 32 22 Number of data frames Number of Data transfer frames originated by this 32 originated Node.
23 Number of data frame failures From the Number of data frames initiated, how many 32 have not been transmitted successfully at the MAC
level.
24 Number of broadcast data frames Number of Multicast frames initiated by this Node. 32 25 Number of control frames Number of frames, excluding Data transfer and 32 received Multicast frames, received by this Node.
26 Number of control frames Number of frames, excluding Data transfer and 32 origin ted Multicast frames, originated by this Node.
27 Number of control frame failures From the Number of control frames originated, how 32 many have not been transmitted successfully at the MAC level.
28 Number of broadcast control Number of control frames broadcast by this Node. 32 frames 29 Number of received local Number of Point to Point messages received by this messages Node.
30 Number of originated local Number of Point to Point messages originated by this 32 messages Node.
31 Number of local message From the Number of originated local messages, how failures many have not been transmitted successfully at the MAC level.
32 Number of broadcast local Number of local broadcasts originated by this Node. 32 frames 33 Number of routed frames Number of data and control frames routed by this 32 Node.
34 Number of routed frame failures From the Number of routed frames, how many have 32 not been transmitted successfully at the MAC level.
35 Number of frames re-broadcast Number of data and control frames re-broadcast by this 32 Node.
Radio performance 36 Number of channel access Number of times the radio has returned a Channel failures Access failure during a transmission attempt.
37 Number of buffer overflows Number of times a frame was not transmitted, routed or 16 received because of a lack of available buffer space 38 Number of MAC retries Number of retries at the MAC level when sending a 32 frame. When excessive, this may be evidence of high noise or a jamming attack.
39 Number of FCS errors Number of frames received with an invalid MAC CRC 32 (called an FCS in IEEE 802.15.4).
End Device 40 Number of Children Number of End Devices using this Router to send and 16 receive messages.

68 of 107 Code Label Description Size (bits) 41 Maximum number of Children Maximum number of End Devices in the End Device Table that use this Router to send and receive messages.
42 Number of pending frames Total number of frames pended for delayed retrieval by 16 Sleeping End Devices 43 Number of frames forwarded Total number of frame received from End Devices from 44 Number of frames forwarded to Total number of frame forwarded to End Devices 16 45 Number of frames never Total number of frames never delivered to the targeted 16 forwarded End Device 46 Number of forwarding buffer Number of data frames sent to an End Device and overflows dropped by the routing device because of a lack of store and forward buffers.
47 Number of Parent changes Numbers of times the End Device has changed Parents 16 by sending a Keep Alive to a different Router of its primary or an secondary network.
Securit 48 Total number of security events Number of security related events. Each specific event 32 is totalized by the following statistics.
49 Number of key write operations Number of times a Key has been written 16 50 Number of DLL MIC errors Number of times a frame is received with a valid (FCS) but an invalid DLL MIC. If this rate is high enough, it may be evidence of an attack 51 Number of Network MIC errors Number of times a frame is received with a valid CRC 16 (FCS), a valid DLL MIC but an invalid Network MIC.
This may be evidence of an insider attack.
52 Number of DLL nonce count Number of time a frame is received with a valid error (FCS) and valid DLL MIC but with a nonce older than expected. This implies a duplicate or replayed frame.
53 Number of Network nonce count Number of time a frame is received with a valid FCS, a 16 error valid DLL MIC and a valid Network MIC but with a non-reflected nonce. This implies a duplicate or replayed frame.
54 Number of times a Security Number of times a frame or frame is received without 16 header is missing Security when security is expected.
55 Number of Message format Number of times a frame or frame is received with errors invalid content such as an invalid length or an invalid field value.
Reset 56 Total number of resets Total number of MCU reset. This counter is in fact the 16 summation of the number of illegal Op Code resets, the number of watchdog resets and the number of physical resets.
57 Number of illegal Op Code Total number of MCU reset caused by the execution of 16 resets an illegal Op Code. It is important to note that these resets is also a consequence of these resets: MAC
supervisor resets, serial port resets and serial port busy resets.
58 Number of watchdog resets Total number of MCU reset caused by the watchdog.

59 Number of physical resets Total number of MCU reset caused by the reset pin. 16 60 Worst stack usage Indicate the minimum number of bytes that remains for 16 stack, since the last radio reprogramming.
61 Current stack usage Indicate the minimum number of bytes that remains for stack, since the last reset.

69 of 107 Code Label Description Size (bits) 62 Number of MAC supervisor Number of times the MAC supervisor did a reset of the 16 resets MAC layer after inference of a lockup at that layer.
Generate also an "illegal Op Code reset".
63 Number of serial port resets Total number of MCU reset requested using the serial 16 protocol. Generate also an "illegal Op Code reset".
64 Number of serial port busy resets Total number of MCU reset caused by a lock of the 16 serial port. Generate also an "illegal Op Code reset".
65 Number of tree optimization Total number of preferred parent changed. 16 66 Number of local tree repair Total number of tree repair used 16 67 Number of frame drop, TTL Total number of frame drop caused by TTL expired expired [02661 The Keep Alive Response message is sent by the Coordinator in response to a Keep Alive Request. The Keep Alive Response frame format is shown in Figure 60.

Table 25 - Keep Alive Response Frame Fields Field Name Data type Description Common routed message format See description herein.
Service Code Unsigned 8 bits Set to 5.
Coordinator Load Unsigned 8 bits Measure of the number of Nodes already associated to the network, relative to router capacity. The value 100%
means full and no further associations are accepted.
MAC Address Binary 8 octets IEEE 802.15.4 EU164 address (8-octets) of the targeted Node. Only Keep Alive Responses with a valid MAC
address are processed. The Node initiates a re-association process if it doesn't receive a valid Keep Alive Response for more than CHECKPOINT-MAX-ATTEMPTS
consecutive Keep Alive Requests.
Parameter List Unsigned 8 bits List of Parameter ID and Parameter Data pairs.
The number of parameters in the list is limited by the space available in the frame. The list always ends with a Parameter ID set to 0, without accompanying data.

102671 The Keep Alive Response parameter list member: current time frame format is shown in Figure 61.

Table 26 - Keep Alive Res onse: Parameter list member: Current time Format Fields Field Name Data type Description Parameter ID Unsigned 8 bits Set to 1.
Current minute Unsigned 32 bits Date and time of the current UTC minute. This field is a 32-bit unsigned integer containing the number of minutes since 1970 UTC.
Current second Unsigned 8 bits This field is an 8-bit unsigned integer containing the number of seconds in the current minute.
Correction ratio Unsigned 8 bits Rate in hundredths of one percent at which the time should be corrected. For example, the value 10 represents a correction rate of 1/10 of 1%, which represents a correction of 3.6 seconds per hour.
Time zone offset Signed 16 bits Signed number of minutes to add to the received UTC
time to obtain the standard localized time.
DST offset Unsigned 8 bits Number of additional minutes to add to the standard 70 of 107 Field Name Data type Description localized time to obtain the current localized time.
Next DST change Unsigned 32 bits Date and time of the next DST change. This field uses the same encoding as the Current minute field.
Next DST offset Unsigned 8 bits The offset to use as DST offset after the Next DST change.
[0268] The Keep Alive Response parameter list member: statistics frame format is shown in Figure 62.

Table 27 - Keep Alive Response: Parameter list member: Statistics Format Fields Field Name Data type Description Parameter ID Unsigned 8 bits Set to 2.
Statistic Reported Unsigned 16- Powerset controlling which statistics are reported. For octets example, bit 5 is set to request reporting of the statistic corresponding to Statistic Code 5. This field is optional and included only when an update is requested.

[0269] The Keep Alive Response parameter list member: SMIB parameter update frame format is shown in Figure 63.

Table 28 - Keep Alive Response: Parameter list member: SMIB parameter update Format Fields Field Name Data t e Description Parameter ID Unsigned 8 bits Set to 3.
SMIB parameter ID Unsigned 8 bits Identifier of the SMIB parameter to be updated. See section 8.10 for the list of SMIB parameter ID.
SMIB parameter Value Unsigned 8 bits New value assigned to the SMIB parameter.

[0270] The Keep Alive Response parameter list member: Write-Switch-Deactivate Key frame format is shown in Figure 64.

Table 29 - Keep Alive Response: Parameter list member: Write-Switch-Deactivate Key Format Fields Field Name Data type Description Parameter ID Unsigned 8 bits Set to 4.
Unsigned 8 bits See sub fields below:
Reserved Bits 7-6 Set to OxOO
Operation Bits 5-4 OxOO = Write the key specified by the Key ID OxO I =
Switch transmissions to the key specified by the Key ID
Ox10 = Deactivate reception using the key specified by the Key ID OxI I = reserved Key ID Bit 3-0 0 = Node Key-I I = Node Key-0 2 = Mesh Key-] 3 =
Mesh Key-O 4 = Maintenance Key-I 5 = Maintenance Key-0 In all key writes and deactivations, the Node shall validate that the Selected Key is not the key currently in use as the transmit key.
Encrypted Key Security Header Unsigned 5 For the write operation, this field is the security octets information and has the same format as the Network Security Header that contains the nonce and key information used to encrypt the Encrypted Key. For the 71 of 107 Field Name Data type Description other operations this field is set to OxOO 00 00 00 00 Encrypted Key Unsigned 16 For the write operation this is the key to be written, octets encrypted using the Node Key indicated in the Encrypted Key Security Header. For the other operations this field is set to all Os. The key is encrypted using the algorithm in IEEE 802.15.4-2006 section B.4 and the specified encryption key.
Encrypted Key MIC32 Binary 4 octets Message Integrity check of the Encrypted Key Security Header and the plain text key. The MIC is calculated using the algorithm in IEEE 802.15.4-2006 section B.4 and the specified authentication key.

102711 Operations on the Mesh Key are associated with the Mesh Key Table entry for the Coordinator sending the Keep Alive Response message. The Write-Switch-Deactivate Key parameter list member may be occurring multiple times in a message.

[0272] The Route Establishment Request message is used by a Node to request from the Coordinator a route to a target Node for peer to peer communication using source routing. The Route Establishment Request message frame format is shown in Figure 65.

Table 30 - Route Establishment Request Format Fields Field Name Data type Description Common routed message See description herein.
format Service Code Unsigned 8 bits Set to 6.
Requested Node Address Binary 8 octets IEEE 802.15.4 long address of the target Node for which a route is requested.

[0273] The Route Establishment Response message format shown in Figure 66 is sent by the Coordinator in response to a Route Establishment Request.

Table 31 - Route Establishment Response Format Fields Field Name Data type Description Common routed message See description herein.
format Service Code Unsigned 8 bits Set to 7.
Target Address Binary 2 octets See description herein.
Originator Address Binary 2 octets See description herein.
Unsigned 8 bits See sub fields below:
Number Of PAN identifiers Bits 5-4 See description herein.
Number of Hops Addresses Bits 3-0 See description herein.
PAN identifiers Up to 3 element See description herein.
array Binary 2 octets Hop Addresses Up to See description herein.
(MAX_HOPS-1) element array Binary 2 octets 72 of 107 102741 The Power Event Report message is sent by Nodes to notify of a power outage or power restoration condition and the frame format is shown in Figure 67.

Table 32 - Power Event Report Frame Fields Field Name Data type Description Common routed message See description herein.
format Service Code Unsigned 8 bits Set to 8 for notifications. Set to 9 for acknowledgments.
Reporting Source Route Node Array of Binary List of addresses of all devices forwarding a power outage Address List 2 octets or a power restoration report. In a request Bit 15:
Power state Set to one if the Node currently has power. Set to zero if the Node currently is in outage. Bits 14 - 0:
device's short address, where Bit 14 is set to zero for Router Nodes and to one for Leaf Nodes 102751 The ping message is used to test mesh communication during quality assessment (QA) or when the network is deployed. The ping message frame format is shown in Figure 68.
Table 33 - Pin Frame Fields Field Name Data type Description Common routed message See description herein.
format Service Code Unsigned 8 bits Set to 10 for Ping Request. Set to 11 for Ping Response.
Number of PAN identifiers Bits 7-6 Defines the number of entries in the PAN
identifiers field.
PAN Identifiers Array of up to 3 List of Network identifiers. This list is referenced by bits Binary 2 octets 15-14 of the different addresses within the Hop Address list.
Number of Hop Addresses Unsigned 8 bits Actual number of entries in the hop list. This number is increased each time this frame is received during the round trip between the originator and the target and back to the originator.
Array of... the following three items:
Hop Address Binary 2 octets Address of Node receiving this frame including the target Node and, on return, the Originator Nodes LQI Unsigned 8 bits LQI recorded at the specified address when receiving this message.
RSSI Unsigned 8 bits RSSI recorded at the specified address when receiving this message.
[02761 The Service Forwarding message is used by the Router servicing a Service Request to send service messages to and from the Coordinator. The Service Forwarding message frame format is shown in Figure 69.

Table 34 - Service Forwarding Frame Fields Field Name Data type Description Common routed message See description herein.
format Service Code Unsigned 8 bits Set to 12 for Service Forwarding Request. Set to 13 for Service Forwarding Response.

73 of 107 Field Name Data type Description Server Unsigned 8 bits 0 = ANSI C 12 Commissioning Host Requestor id Unsigned 8 bits Temporary identifier assigned by the originating Router to the requesting Node. This identifier is required if the originating Router is capable of simultaneously servicing Service Requests from multiple Nodes.

102771 The Association Request message is sent by a Node to Router in its neighborhood to request an association to the identified mesh network. The Association Request message frame format is shown in Figure 70.

Table 35 - Association Request Frame Fields Field Name Data type Description Common MAC layer fields See description herein.
Unsigned 8 bits See subfields below:
Service Type Bits 6-4 Set to 3.
DLL Security Header Flag Boot 1 Set when the DLL Security Header and DLL MIC32 are present Network Security Header Flag Bool 0 Set when the Network Security Header is present [DLL Security Header] Unsigned 16 See description herein.
bits [Network Security Header] Unsigned 40 See description herein.
bits Service Code Unsigned 8 bits Set to 0.
Unsigned 8 bits See sub fields below:
Secure Node Bool 0 See description herein.
Secondary Network Bool I See description herein.
Device Type Bool 2 See description herein.
Receiver On When Idle Bool 3 See description herein.
[Network MIC32] Binary 4 octets See description herein.
[DLL MIC32 Binary 4 octets See description herein.

[02781 An Association Response message is returned by a Router to a Node in response to an Association Request. An Association Response message frame format is shown in Figure 71.

Table 36 - Association Response Frame Fields Field Name Data type Description Common MAC layer fields See description herein.
Unsigned 8 bits See subfields below:
Service Type Bits 6-4 Set to 3.
DLL Security Header Flag Bool I Set when the DLL Security Header and DLL MIC32 are present Network Security Header Flag Bool 0 Set when the Network Security Header is present [DLL Security Header Unsigned 16 bits See description herein.
[Network Security Header] Unsigned 40 bits See description herein.
Service Code Unsigned 8 bits Set to 1.
Short Address Binary 2 octets if the Coordinator was not able to associate this device to its PAN, this field is set to OxFFFF, and the association status field contains the reason for the failure. If the 74 of 107 Field Name Data type Description Coordinator was able to associate the device to its PAN, this field contains the short address assigned to that device.
[Mesh Key Security Header] Unsigned 5 This header, the Encrypted Mesh Key and the Mesh Key octets MIC32 fields are transferred from the Association Confirmation Response frame if one exists.
[Encrypted Mesh Key] Binary 16 octets This Encrypted Key is passed through from the Association Confirmation Response message. The Mesh Key is encrypted using the algorithm in IEEE 802.15.4-2006 section B.4 and the specified Node Key.
[Mesh Key MIC32] Binary 4 octets Message Integrity check of the Mesh Key Security Header and the plain text Mesh Key. The MIC is calculated using the algorithm in IEEE 802.15.4-2006 section B.4 and the specified Node Key.
Unsigned 8 bits Reserved Bits 7-4 Set to 0 Mesh Key Selection Bits 3-0 2 = Mesh Key 1 3 = Mesh Key 0 All other values reserved Mesh Key PAN ID Binary 2 octets PAN ID associated with the Mesh Key Association Status Unsigned 8 bits 0x00 = Association successful. 0x01 = PAN
at capacity.
0x02 = PAN access denied.
Coordinator Load Unsigned 8 bits Measure of the number of Nodes already associated to the network, relative to router capacity. The value 100%
means full and no further associations are accepted.
[Network MIC32] Binary 4 octets See description herein.
[DLL MIC32] Binary 4 octets See description herein.

[0279) The Neighbor Info Request message is broadcast to get information about neighbor Routers. The frame format shown in Figure 72 is used when the originator of the message is not a network member. The frame format shown in Figure 73 is used when the originator of the message is a network member.

Table 37 - Neighbor Info Request Frame Fields Field Name Data t e Description Common MAC layer fields Unsigned 8 bits See description herein.
Unsigned 8 bits See subfields below:
Service Type Bits 6-4 Set to 3.
Service Code Unsigned 8 bits Set to 2.
Network Name Prefix Length Unsigned 8 bits Size in number of octets of the Network Name Prefix field.
Network Name Prefix String Only Node members of a network whose name starts with this string return Neighbor Info Response frames.
[02801 The Neighbor Info Response message is sent by each neighbor Router when a Neighbor Info Request is broadcast. This message contains the network name and Coordinator load of the responding neighbor, the quality of the requesting Node's signal as received by this neighbor, and the list tree position of this neighbor on different network trees. The Neighbor Info Response message frame format for an non-network originator is shown in Figure 74. The 75 of 107 Neighbor Info Response message frame format for an in-network originator is shown in Figure 75.

Table 38 - Neighbor Info Response Frame Fields Field Name Data type Description Common MAC layer fields See description herein.
Unsigned 8 bits See subfields below:
Service Type Bits 6-4 Set to 3.
Security Count Present Bool 2 Set when Source Count and Ticket Count are present.
Service Code Unsigned 8 bits Set to 3.
Source Count Binary 5 octets DLL Security nonce count to be used to validate secure messages from this device. The value received in a message from this source must be greater than this value.
The resulting database value is updated each time a valid message is received.
Ticket Count Binary 5 octets DLL Security nonce count to be used to send secure messages to this device. This value is pre-incremented before each transmission.
Unsigned 8 bits See sub fields below:
Dedicated Router Flag Bit 7 Set when this Node is a Dedicated Router. This value is used to compute the association ratio. It is also used by a Dedicated Router to validate that it associates directly only with a Coordinator or another Dedicated Router.
End Device Load Bits 6-0, range Measure of the number of End Device which are already 0-100 Children of this Router, relative to router capacity. The value 100% means full and no further End Device are accepted.
Unsigned 8 bits See sub fields below:
Neighborhood Table Full Boo] 7 When set, this Router can't be used as an Association Router because it neighborhood table is already full with direct Parents and Children.
Coordinator Load Bits 6-0, range Measure of the number of Nodes already associated to the 0-100 network, relative to router capacity. The value 100%
means full and no further associations are accepted.
Requestor LQI rx Unsigned 8 bits Link Quality Indicator of messages received from the requesting Node.
Network Name Length Unsigned 8 bits Size in number of octets of the Network Name field.
Network Name String Name assigned to the network on which this Node is associated.
Number of Network Trees Unsigned 8 bits Number of network tree descriptions available in the following list.
Array of ... the following fields Tree PAN Identifier Binary 2 octets See description herein.
Avg LQI Unsigned 8 bits See description herein.
Unsigned 8 bits See sub fields below:
Number of Hops Bits 7-4 See description herein.
Power Outage Routing Bool 2 See description herein.
Min LQI Class Bits 1-0 See description herein.
76 of 107 [02811 The Neighbors Exchange message is broadcast locally by each Node and used to maintain the neighborhood information and to optimize the network tree. The Neighbors Exchange message frame format is shown in Figure 76.

Table 39 - Neighbors Exchange Frame Fields Field Name Data type Description Common MAC layer fields See description herein.
Unsigned 8 bits See subfields below:
Service Type Bits 6-4 Set to 3.
DLL Security Header Flag Bool 1 Set when the DLL Security Header and DLL MIC32 are present [DLL Security Header] Unsigned 16 bits See description herein.
Service Code Unsigned 8 bits Set to 4.
Unsigned 8 bits See subfields below:
Immediate Broadcast Requested Bool 7 Set when the originator of the message needs to get information from neighbors in a short interval of time.
When set, recipients send their Neighbors Exchange message using a pseudo-randomly chosen delay within NEIGHBOR EX_RND_PERIOD. This feature is used by Nodes participating in overlapping networks.
reserved Bits 0 to 6 Network List Length Unsigned 8 bits Number of entries in the following list.
Network List Tree PAN Identifier Binary 2 octets See description herein.
Neighbor Address Binary 2 octets See description herein.
Neighbor PAN Identifier Binary 2 octets See description herein.
Avg LQI Unsigned 8 bits See description herein.
Unsigned 8 bits See subfields below:
Number of Hops Bits 7-4 See description herein.
Preferred Parent Flag Bool 3 See description herein.
Power Outage Routing Boo] 2 See description herein.
Min LQI Class Bits 1-0 See description herein.
LQI List Length Unsigned 8 bits Number of entries in the LQI list below.
LQI List This list use the space remaining in the frame and contains 23 entries when the Network List contain one entry, 20 when the Network List contain 2 entries and 17 when the Network List contain 3 entries.
Neighbor Short Address Binary 2 octets Address of the neighbor for which the LQI is reported, LQI rx Unsigned 8 bits Link Quality measured by this neighbor when receiving messages from the current Node, averaged over time.
Success Indication Boo] 7 Set to I if the last Neighbor Exchange of this neighbor was received successfully. Used to calculate TX success rate.
Absolute RSSI rx Bits 6-0 Absolute Received Signal Strength Indicator measured by this neighbor when receiving messages from the current Node. Must be multiply by -1 to obtain the value in dBm.
[DLL MIC32] Binary 4 octets See description herein.

[02821 The End Device Data Request message is used by an End Device to request pending data messages from its Parent. The End Device Data Request message frame format is shown in Figure 77.

77 of 107 Table 40 - End Device Data Request Frame Fields Field Name Data type Description Common MAC layer fields See description herein.
Unsigned 8 bits See subfields below:
Service Type Bits 6-4 Set to 3.
DLL Security Header Flag Bool 1 Set when the DLL Security Header and DLL MIC32 are present [DLL Security Header] Unsigned 16 See description herein.
bits Service Code Unsigned 8 bits Set to 5 [DLL MIC32 Binary 4 octets See description herein.

102831 The End Device Data Response message is used in response to an End Device Request to indicate the presence or not of pending data. The End Device Data Response message frame format is shown in Figure 78.

Table 41 - End Device Data Response Frame Fields Field Name Data type Description Common MAC layer fields See description herein.
Unsigned 8 bits See subfields below:
Service Type Bits 6-4 Set to 3.
DLL Security Header Flag Bool I Set when the DLL Security Header and DLL MIC32 are present [DLL Security Header] Unsigned 16 See description herein.
bits Service Code Unsigned 8 bits Set to 6 Data Pending Unsigned 8 bits 0 = No data pending I = Pending data [DLL MIC321 Bina 4 octets See description herein.

[02841 The Service Request message is used by a device non-member of the network to communicate with a specific service such as the commissioning service. The Router used as a proxy is responsible for limiting the flow of messages to provide protection from denial of service attacks. See the Forwarding Service Messages for more detail. The Service Request message frame format is shown in Figure 79. The Service Request Response frame format is shown in Figure 80.

Table 42 - Service Request Frame Fields Field Name Data type Description Common MAC layer fields See description herein.
Unsigned 8 bits See subfields below:
Service Type Bits 6-4 Set to 3.
DLL Security Header Flag Bool I Set to 0. The DLL Security Header and DLL
MIC32 is not present Service Code Unsigned 8 bits Set to 7.
Server Unsigned 8 bits 0 = ANSI C12 Commissioning Host Payload Multi-octet Up to the maximum frame length permitted by IEEE
802.15.4.
78 of 107 102851 The common frame format for most point to point messages is shown in Figure 81.

Table 43 - Common point to point messaging Frame Fields Field Name Data type Description Common MAC layer fields See description herein.
Unsigned 8 bits See subfields below:
Service Type Bits 6-4 Set to 5.
DLL Security Header Flag Bool 1 Set when the DLL Security Header and DLL MIC32 are present [DLL Security Header] Unsigned 16 See description herein.
bits See the different message specific contents in the following.
[DLL MIC32] Binary 4 octets See description herein.

102861 The Local Data Transfer message is used to transport upper layers information for a point to point communication. The Local Data Transfer message frame format is shown in Figure 82.

Table 44 - Local Data Transfer Frame Fields Field Name Data type Description Common MAC layer fields See description herein.
Unsigned 8 bits See subfields below:
Service Type Bits 6-4 Set to 5.
Service Code Unsigned 8 bits Set to 0.
Payload Multi-octet Upper layer information.

102871 The Frame Reception Rate Test Init messages are used to compute the Frame Reception Rate. This function is provided mainly in support of radio manufacturing. A test is initiated by sending a Frame Reception Rate Test Init frames, follow by one or a multitude of Frame Reception Rate Test Data frames, followed by an optional Frame Reception Rate Test End frame. The target Node responds to the Frame Reception Rate Test End frame with a Frame Reception Rate Test Result frame. When a Frame Reception Rate Test Result is not received, the originator can retry by sending one or more Frame Reception Rate Test End frames. The Frame Reception Rate Test Init message frame format is shown in Figure 83.

Table 45 - Frame Reception Rate Test Init Frame Fields Field Name Data type Description Common p2p message format See description herein.
Service Code Unsigned 8 bits Set to 1.
Sequence Number Unsigned 8 bits Set to 0.
Count Unsigned 8 bits Number of Frame Reception Rate Test Data frames to be transmitted.
Length Unsigned 8 bits Size of the Frame Reception Rate Test Data frame 79 of 107 Field Name Data type Description requested or sent. This size shall match the value of the Frame Length of that Frame Reception Rate Test Data frame as defined in the Physical layer of IEEE 802.15.4, which includes all MAC headers and the CRC (FCSO
trailer Mode Unsigned 8 bits 0 = Acknowledgment and retries disabled I =
Acknowledgment and retries enabled [02881 The frame format for the Frame Reception Rate Test Data is shown in Figure 84.
Table 46 - Frame Reception Rate Test Data Frame Fields Field Name Data type Description Common p2p message format See description herein.
Service Code Unsigned 8 bits Set to 2.
Sequence Number Unsigned 8 bits Pre-incremented before each transmission.
Count Unsigned 8 bits Duplicate of the value sent in the Frame Reception Rate Test Init frame.
Length Unsigned 8 bits Duplicate of the value sent in the Frame Reception Rate Test Init frame.
Mode Unsigned 8 bits Duplicate of the value sent in the Frame Reception Rate Test Init frame.
Padding Unsigned 8 bits Octets added to the Frame Reception Rate Test Data frame to adjust its size to the dimension requested by the initiating Frame Reception Rate Test Init frame's Length field.

102891 The frame format for the Frame Reception Rate Test End is shown in Figure 85.
Table 47 - Frame Reception Rate Test End Frame Fields Field Name Data type Description Common p2p message format See description herein.
Service Code Unsigned 8 bits Set to 3.

[02901 The frame format for the Frame Reception Rate Test Result is shown in Figure 86.

Table 48 - Frame Reception Rate Test Result Frame Fields Field Name Data type Description Common p2p message format See description herein.
Service Code Unsigned 8 bits Set to 4.
Number Of Frame Received Unsigned 8 bits Number of frames received since the last Frame Reception Rate Test Init frame.
Average RSS Signed 8 bits Average RSS of all the frames received since the last Frame Reception Rate Test Init frame.

102911 The Local Broadcast Request message is used to retrieve a list of local devices.
The Local Broadcast Request message frame format is shown in Figure 87.

80 of 107 Table 50 - Local Broadcast Request Frame Fields Field Name Data t e Description Common MAC layer fields See description herein.
Unsigned 8 bits See subfields below:
Service Type Bits 6-4 Set to 5.
Service Code Unsigned 8 bits Set to 20.
Maximum RSSI Signed 8 bits Used to exclude devices in close proximity. A
response is sent only if the RSSI measured at the reception of this message by the target device is less than the value specified.
Minimum RSSI Signed 8 bits Used to exclude too distant devices. A response is sent only if the RSSI measured at the reception of this message by the target device is greater than the value specified.
Max Delay Period Unsigned 8 Maximum delay in units of 1/10 second before a response is returned. Each target Node computes a random response delay within this period.
Unsigned 8 bits See sub fields below:
Payload Content Bits 2-0 Specifies the information included in the frame's Payload field. 0 = None I = None. This is a walk-by request;
Respond only if supported and not already processed 2 =
Network name 3 = Network name prefix 4 = Bar code 5 =
Communications module serial number Requested Response Payload Bits 5-3 Specifies the information to be included in the Local Broadcast Response. 0 = None I = Network name 2 =
Security enable flag, Owner, Bar code id Payload Multi-octet When present a response is sent only if a match exists with the information provided. The length of this field is defined by the remaining capacity of this frame as defined by IEEE 802.15.4 [02921 The Local Broadcast Response message is sent by all Nodes which have received a Local Broadcast Request with matching criteria (RSSIs and Payload). The Local Broadcast Response message frame format is shown in Figure 88.

Table 51 - Local Broadcast Response Frame Fields Field Name Data type Description Common MAC layer fields See description herein.
Unsigned 8 bits See subfields below:
Service Type Bits 6-4 Set to 5.
Service Code Unsigned 8 bits Set to 21.
Source Address Binary 2 octets Short address of the responding Node.
Device Class Binary 4 octets This identifier is used to load the appropriate context for this device, data model and business logic. For table driven devices, this field is equivalent to the DEVICE_CLASS field of the ANSI C 12.19-2008, General Configuration Table (Table 0).
Unsigned 8 bits See sub fields below:
Counts Present Bool 7 Set when the Source Count and Ticket Count are present.
These counters are required to authenticate subsequent communication.
Payload Content ID Bits 3-0 Specifies the information included at the end of this message in the Payload field: 0 = None I = Network name 81 of 107 Field Name Data type Description 2 = Security, Version, Owner and Bar code Source Count Binary 5 octets DLL Security nonce count to be used to validate secured messages from this device. The value received from this source must be greater than the value received in this frame. This value is updated each time a valid frame is received.
Ticket Count Binary 5 octets DLL Security nonce count to be used to send secured messages to this device. This value is pre-incremented before each transmission.
Payload Binary The length of this field is defined by the remaining space for this frame as defined by the Physical layer.

[02931 Within the Local Broadcast message is the Payload Content ID 1 which has the frame format shown in Figure 89.

Table 52 - Local Broadcast: Payload Content ID 1 Frame Fields Field Name Data type Description Network name String Network Name assigned to this specific mesh network.
102941 Within the Local Broadcast message is the Payload Content ID 2 which has the frame format shown in Figure 90.

Table 53 - Local Broadcast: Payload Content ID 2 Frame Fields Field Name Data type Description Unsigned 8 bits See subfields below:
Security Enable Flag Bool 7 Set if the responding device has been configured with its passwords or/and keys and subsequent communication needs to follow the security policies specified for this device.
Bit 4 Set to I for backward compatibility.
Owner Field Length Bits 3-0 Number of octets of Owner field.
Firmware version Unsigned 8 bits Version of the host device. This information is used to configure the device context.
Firmware revision Unsigned 8 bits Revision of the host device. This information is used to configure the device context.
Owner String Identifier of the owner of this device - information which is used to select the proper password or keys when the Security Enable Flag is set.
Bar code id String Identifier available as a readable bar code on the device.
102951 The End Device Node Present message is sent by a battery operated device, e.g., a sleeping device to a wake-up device, following an impulse, such as a magnetic impulse, from a wake-up device, e.g., hand-held device. The End Device Node Present message frame format is shown in Figure 91.

Table 54 - End Device Node Present Frame Fields Field Name Data type Description Common MAC layer fields See description herein.
82 of 107 Field Name Data type Description Unsigned 8 bits See subfields below:
Service Type Bits 6-4 Set to 5.
Service Code Unsigned 8 bits Set to 22.
Source Address Binary 2 octets See description herein.
Device Class Binary 4 octets See description herein.
Unsigned 8 bits See sub fields below:
Counts Present Bool 7 See description herein.
Payload Content ID Bits 3-0 Set to 2.
Source Count Binary 5 octets See description herein.
Ticket Count Binary 5 octets See description herein.
Unsigned 8 bits See sub fields below:
Security Enable Flag Bool 7 See description herein.
Owner Field Length Bits 3-0 See description herein.
Firmware version Unsigned 8 bits See description herein.
Firmware revision Unsigned 8 bits See description herein.
Owner String See description herein.
Bar code id String See description herein.

[02961 The Range Test Request message is used to record the signal strength (RSSI) in both directions between two Nodes. The Range Test Request message frame format is shown in Figure 92.

Table 55 - Range Test Request Frame Fields Field Name Data type Description Common p2p message format See description herein.
Service Code Unsigned 8 bits Set to 30.

102971 The Range Test Response command is returned in response to the Range Test Request. The format is shown in Figure 93.

Table 56 - Range Test Response Frame Fields Field Name Data type Description Common p2p message format See description herein.
Service Code Unsigned 8 bits Set to 31.
RSSI Signed 8 bits Received Signal Strength Indicator of the Range Test Request when received by the target Node. This field is encoded using a signed integer in dBm.
LQI Unsigned 8 bits Link Quality Indicator of the Range Test Request when received by the target Node.

[02981 The Range Test Initiate command is used to request that a Node initiate a Range Test Request to a target Node. The Range Test Initiate command frame format is shown in Figure 94.

Table 57 - Range Test Initiate Frame Fields Field Name Data type Description Common p2p message format See description herein.
83 of 107 Field Name Data type Description Service Code Unsigned 8 bits Set to 32.
Target Address Binary 8 octets Address of the target Node.

[02991 The Range Test Result command is used in response to a request that a Node initiate the Range Test Request to a target Node. The Range Test Result command frame format is shown in Figure 95.

Table 58 - Range Test Result Frame Fields Field Name Data type Description Common p2p message format See description herein.
Service Code Unsigned 8 bits Set to 33.
Originator RSSI Signed 8 bits Received Signal Strength Indicator of the Range Test Request when received by the target Node. This field is encoded using a signed integer in dBm.
Originator LQI Unsigned 8 bits Link Quality Indicator of the Range Test Request when received by the target Node.
Target RSSI Signed 8 bits Received Signal Strength Indicator of the Range Test Response when received by the originator Node. This field is encoded using a signed integer in dBrn.
Target LQI Unsigned 8 bits Link Quality Indicator of the Range Test Response when received by the originator Node.

[03001 The 802.15.4 standard states the following about Link Quality Indicator ("LQI").
The LQI measurement is a characterization of the strength and/or quality of a received frame.
The measurement may be implemented using receiver ED, a signal-to-noise ratio estimation, or a combination of these methods. In a preferred embodiment, transceivers, are used to measure signal strength. The LQI is calculated as follows:

10+ * I for - 3<_ 1 <_ 74 lqi= 0 forI <-3 255 for/ > 74 (Equation 1) 103011 where 1 is the received signal level in dB above the sensitivity level of the radio on the meter (node). The sensitivity is measured for each radio model used in the mesh network.
It is defined as the signal level above ambient noise for which a frame reception rate of 99% is .obtained. Measurement is done with a wired lab setup with frame lengths of 127 octets.

103021 LQI classes group together links that have similar probability of successful transmission. Various studies on RF propagation, mostly targeting cellular market, suggest using 84 of 107 a fade margin between 20 and 40 dB. Since the meters in the preferred embodiment are fixed and time dependent, attenuation is only caused by the movement of external obstacles (persons, vehicles).

[03031 Accordingly, a margin of 15 dB should be sufficient to have a reliable link. In other words we consider a link with a signal strength 50 dB above the sensitivity level has about the same chances of success as a link with a signal strength 15 dB above sensitivity. The limit for average links is set at 5 dB above sensitivity. Table 59 summarizes the significance of the LQI classes.

Table 59 - LQI Class Class ID L I Meaning 0 0 No link I I to LQI CLASS 1 HIGH THRESHOLD Unreliable link 2 (LQI_CLASSI_HIGH _THRESHOLD + 1) to Average link 3 ( LQI CLASS 1 HIGH THRESHOLD + 1) to 255 Reliable link [03041 The Association Ratio is calculated by a Node to select which Coordinator to choose. It is a weighted sum of: the "Number of Hops" to the Coordinator (from Neighbor Info Response), the "Coordinator Load" (from Neighbor Info Response), the number of local neighbors (from the number of Neighbor Info Responses received for the selected network) and the "Min LQI Class" (maximum value from all Neighbor Info Response adjusted for last hop).
Table 60 lists the weighting factors.

Table 60 - Association Ratio Weighting Factors Weighting Factor Parameter Default Weighting Factor in % Weighted Formula Variable COORD LOAD WEIGHT 40 Coordinator Load HOP NUM WEIGHT 40 Number of Hops NUM NEIGHBORS WEIGHT 10 Number of Neighbors LQI CLASS WEIGHT 10 Min LQI Class 85 of 107 The formula for the Association Ratio is:
IF Coordinator Load is 100%
Ignore this network IF Coordinator Load 20"Vo Association Ratio = COORD_LOAD_W&'EIGHT
ELSE
Association Ratio = COORD_LOAD_WEIGHT * (1 - ((Coordinator Load - 20) / 80)) IF the. Dedicated Roamer Flag of the selected Association Router is true Association Ratio HOP_N^L. i_NAoTIGHT
ELSE
Association Ratio += HOP N M_N EIGHT * (1-(Number of Hops)!(MAX HOPS-1)) IF Number of Neighbors::- ASSOCIATION NEIGHBORS
Association Ratio NU I NTEIGHBORS WEIGHT
ELSE
Association Ratio +_ \ C.i_NEIGHBORS_WEIGHT
(Number of Neighbors / ASSOCLATION NEIGHBORS) Association Ratio += LQI_CLASS WEIGHT * (Min LQI Class 13) where ASSOCIATION NEIGHBORS = 5 [03051 The Preferred Route Ratio is computed by a Node to select within its Parents, the one that represents the optimized path to access the Coordinator. This ratio is calculated based on the neighborhood table information as received within a Neighbor Info Response or a Neighbors Exchange.

Preferred Route Ratio = Min LQI class << 12 1(15 -Number of Hops) << 8 1 Avg LQI
[03061 The preferred Router, based on this ratio, will correspond to:

For all the possible routes with the best min LQI class, select the routes with the least number of hops From this remaining list, select the one with the best Avg LQI (not used to change the preferred routers) [03071 End Devices selects a neighboring Router based on the following criteria applied in the order indicated:

From the list of neighbors with the best LQI class (Class computed only on the link between the RFD and its neighbor) select the Routers with the lowest "Router load"
86 of 107 From the remaining list, select a Router with the least number of hops From the remaining list, select the Routers with the best avg LQI

103081 The pseudo-random delays required by Nodes for this layer are computed based on the following equation:.

pseudoRandomNumber = ((shortAddress & Ox7F) << 6) XOR
((longAddress } - i) & Ox if) XOR
((pseudoRandomValue >> i) & Ox7F) pseudoRandomPeriod (sec) = pseudoRandornNunrber * period / 8191 Each time a pseudo-random number is generated, i = ((i+l) % 8) [03091 The pseudoRandomValue represents a value within the radio which changes over time, such as the Neighbor table checksum or the "Number of frames transmitted" statistic.
103101 For example:

16bitsAddress =35=0100011 longAddress =948347=11100111100001111011 pseudoRandomValue =3384854=1100111010011000010110 period =20s lth pseudoRandorn period = (0100011 << 6) xor 1111011 xor 0010110 =0100010101101 =2221 *20i8191=5,423s pseudoRaudom period= (0100011 <<6) xor 0111101 xor 0001011 =0100011110110=2294 * 20i8191 =5,601 s 3` pseudoRandom period = (0100011 << 6) xor 0011110 xor 0000101 =0100011011011 =2267*20/8191=5,535s 46 pseudoRandom period = (0100011 6) xor 0001111 xor 1000010 = 0100010001101 =2 189 * _70/ 8191 = 5,344 s 87 of 107 103111 The IEEE 802.15.4 short addresses are assigned sequentially by the coordinator.
Six bits of this address are used to partition Nodes into 64 different groups.
This number represents bits 8 to 13 of the final pseudo-random number. For example, if a network has 432 Nodes, between 6 and 7 End points will share the same 6 bits. Bit 0 to 7 of the pseudo-random number is computed based on the IEEE 802.15.4 long address and a pseudo-random value that changes over time.

[03121 The pseudo-random number generated is a number between 0 and 8191, which needs to be scaled for the appropriate range.

[03131 The following tables propose data structure definitions in support of the implementation of the SM layer discussed herein and may be adapted for each specific implementation.

Table 61 - Global Variables Field Name Data type Description PAN Coordinator Load Unsigned 8 bits Indication of the number of Nodes actually associated to the Coordinator as reported by the last Neighbors Exchange message received from a Parent.
End Device Load Unsigned 8 bits Value maintained by each Router which represents a percentage of its maximum capacity to accept and manage End Devices.
Counter Unsigned 5 octets The DLL and Network Security nonce count used for all transmissions after the device has associated with the network. This count is stored in non-volatile memory and never reset. The value stored in this table corresponds to the next value to be used.
Ticket Unsigned 5 octets Nonce count provided to Nodes not associated to the network. This count is stored in non-volatile memory and never reset. The value stored in this table corresponds to the next ticket to be sent.

[03141 The Mesh Key Tables stores the Mesh Key(s) used by the device. Each Mesh Key is associated with the PAN ID of the Coordinator it is used with. Mesh Keys are administered by the associated Coordinator.

Table 62a - Mesh Key Table Field Name Data t e Description Mesh Key Table Array(MAX_AS The Mesh Key Table stores the Mesh Key information SOCIATIONS) associated with each Coordinator the device associates of Mesh Key with.
Entries Associated Coordinators Unsigned I octet The number of Coordinators the device has associated with.

88 of 107 Table 62b - Mesh Key Table: Mesh Key Entry Field Name Data type Description Coordinator PAN ID Unsigned 2 The PAN ID of the Coordinator associated with the Mesh octets Key Entry The entire Mesh Key Entry is disabled when the Transmit Mesh Key ID is disabled.
Mesh Key-0 Unsigned 16 In the context of the SM DLL Security, Mesh key used octets when the DLL Key ID is set to 0. In the context of the SM End-To-End Network Security, Mesh key used when the Network Key ID is set to 0.
Mesh Key-1 Unsigned 16 In the context of the SM DLL Security, Mesh key used octets when the DLL Key ID is set to 1. In the context of the SM End-To-End Network Security, Mesh key used when the Network Key ID is set to 1.
Unsigned 8 bits See fields below:
Bits 7-5 Reserved, set to 0 Mesh Key Entry Active Bool 4 Set when Mesh Key Table Entry active Secondary Mesh Key Allowed Bool 3 Set when it is allowed to accept frames authenticated using either Mesh Key. Reset when only frames authenticated using the Mesh key specified by the Transmit Mesh Key ID are accepted Transmit Mesh Key ID Bit 2 0 = Mesh Key-0 used for transmissions 1= Mesh Key-I
used for transmissions Mesh Key-I Write Toggle Bit I Every update operation on a Mesh Key-I toggles the write it. Initialized to 0.
Mesh Key-0 Write Toggle Bit 0 Every update operation on a Mesh Key-0 toggles the write bit. Initialized to 0.

[03151 The Node Key table stores the Node Key(s) used by the device. The SM
network security process uses the Node Key Table to look up the information needed for the Network Security MIC calculation for messages between the Coordinator and devices. The information in the Node Key Table is retained during a power outage and a device reset.

Table 63 - Node Key Table Field Name Data type Description Node Key-0 Binary, 16 Node Key used when the Network Security header is octets present and the Network Key ID is set to 0.
Node Key-I Binary, 16 Node Key used when the Network Security header is octets present and the Network Key ID is set to 1.
Unsigned 8 bits See fields below:
Bits 7-4 Reserved, set to 0 Secondary Node Key Allowed Bool 3 Set when it is allowed to accept frames authenticated using either Node key. Reset when only frames authenticated using the Node key specified by the Transmit Node Key ID are accepted Transmit Node Key ID Bit 2 0 = Node Key-0 used for transmissions 1= Node Key-I
used for transmissions Node Key-] Write Toggle Bit I Every update operation on a Node Key-I toggles the write bit. Initialized to 0.
Node Key-0 Write Toggle Bit 0 Every update operation on a Node Key-0 toggles the write bit. Initialized to 0.

89 of 107 103161 The Maintenance Table stores the information used for Nodes associating with the network and for maintenance devices that access the Nodes using point-to-point messages.
The information in the Maintenance Table is retained during a power outage and a device reset.
Table 64 - Maintenance Key Table Field Name Data type Description RX Source DLL Nonce Count Binary, 5 octet The last valid Source count valued received for the routing device and used during association or the point-to-point communication device for playback protection.
This value is initiated by the Neighbor Information Response or the Local Broadcast Response Ticket Count Binary, 5 octet Use instead of the Counter defined in the Global variables when a Node is not wet associated. This value is initiated by the Neighbor Info Response message, End Device Node Present message or the Local Broadcast Response message Maintenance Key-0 Binary, 16 octets Maintenance Mesh key used when the DLL Key ID is set to 0.
Maintenance Key-I Binary, 16 octets Maintenance Mesh key used when the DLL Key ID is set to 1.
Unsigned 8 bits See fields below:
Bits 7-5 Reserved, set to 0 Maintenance Key-1 Receive Bool 4 Set when reception using Maintenance Key-I is enabled Enabled Secondary Maintenance Key Bool 3 Set when it is allowed to accept frames authenticated Allowed using either Maintenance key. Reset when only frames authenticated using the Maintenance key specified by the Transmit Maintenance Key ID are accepted Transmit Maintenance Key ID Bit 2 0 = Maintenance Key-0 used for transmissions 1=
Maintenance Key- I used for transmissions Maintenance Key-I Write Bit I Every update operation on a Maintenance Key-I
toggles Toggle the write bit. Initialized to 0.
Maintenance Key-0 Write Bit 0 Every update operation on a Maintenance Key-0 toggles Toggle the write bit. Initialized to 0.
Last Maintenance Address Binary, 8 octets The address of the last device address to use the key. Set to zero if no access has been made.
Previous Maintenance Address Binary, 8 octets The address of the previous device to use the key. The address is always different from the Last Maintenance Address. It is set to zero if there is no previous Maintenance device.

103171 The Neighborhood Table data structure is maintained in each radio to keep the information about neighbor Nodes. This data structure is required to implement at least the following processes: Association, Tree Routing, Route Discovery, Neighbors Exchange, Tree Optimization, Checkpoint.

90 of 107 Table 65a - Neighborhood Table Field Name Data type Description Neighborhood Table array[MAX_NU List of neighbors M NEIGHBOR
S] of Neighborhood Table Entry Table 65b - Neigh orhood Table Entries Field Name Data type Description Tree PAN Identifier Binary 2 octets Identify the network tree for this entry.
This network identifier can correspond to foreign network when the concept of overlapping network is implemented. In this context, the same neighbor can be reported multiple times within this list if associated to multiple network trees.
Neighbor Address Binary 2 octets Address of this neighbor.
Neighbor PAN Identifier Binary 2 octets Membership of this neighbor.
Avg LQI Unsigned 8 bits Average of the LQI value of each hop between this neighbor and the Coordinator using the preferred parent within the specified network tree. The LQI for each hop corresponds to the worst LQI recorded (LQI rx and LQI
tx) for this hop.
Unsigned 8 bits See sub fields below:
Number of Hops Bits 7-4 Number of hops between this neighbor and the Coordinator using the preferred parent within the specified network tree.
LQI Class Bool 3-2 LQI class for the hop between the current node and this neighbor.
Min LQI Class Bit 1-0 Minimum of all LQI rx and LQI tx for each hop between this neighbor and the Coordinator using the preferred parent within the specified network tree.
LQI rx Unsigned 8 bits Average link quality measured for frames received from this neighbor.
LQI tx Unsigned 8 bits Average link quality measured for frames transmitted to this neighbor.
RSSI rx Signed 8 bits Average signal strength in dBm measured for frames received from this neighbor.
RSSI tx Signed 8 bits Average signal strength in dBm measured for frames transmitted to this neighbor.
Unsigned 8 bits See sub fields below:
New Entry Flag Bool 7 Set to true if this entry has not been sent at least once in a Neighbor Exchange message. It is not allowed to reuse an entry when this flag set to true. The intent of this flag is to give enough time to child candidates to choose the current node as preferred parent.
Power Outage Routing Bool 6 Set if this neighbor supports routing for some period of time after a power outage.
Remote Preferred Parent Flag Bool 5 Set when this neighbor reports that the current Node is its parent.
Preferred Parent Flag Bool 4 Set when this neighbor is the parent of the current Node within the specified network tree. When set to false, this Neighbor can still be used for tree routing if its Number of Hops is less or equal to the current Node.

91 of 107 Field Name Data t e Description Freshness Bits 3-0 Countdown reset at each Neighbors Exchange received from this neighbor and decremented at each Neighbors Exchange period (each time a Neighbors Exchange transmitted by the radio). When this field reach zero, the entry is considered deleted and can be reused for a different Node.
Preferred Route Ratio Unsigned 16 bits Preferred Route Ratio as defined herein. This value is adjusted up to the current Node.
RX Source DLL Nonce Count Unsigned 5 octets The last authenticated DLL full nonce count received from this neighbor.
Transmission success rate Unsigned 8 bits Success rate in percentage of the last n transmission with this neighbor The value255 means no data available for that neighbor. This value is initialized to 100 prior to the first transmission and is updated as follows: When the transmission is successful:
S = MIiY(s + (s:'n) + (1 fn), 100) When the transmission fails:
S = s - (SAO

For either case the Neighbor Table entry is:

"Transmission success rate"
ROUND(S,0) Where S: Estimated success rate s: Last estimated success rate n: Factor to adjust the adjustment speed of the estimated average (set by default to 30) Note that the ROUND(S,0) function rounds the S to the nearest integer and the MIN(x,y) function selects the smaller of x and y.

[03181 When the number of Neighbors exceeds the capacity of the Neighborhood table, the goal is to keep in the table 5 best Parents/Siblings (best routes) and all nodes that set the current node as preferred Parent (avoid tree instability). We also want to give a chance to new candidates to flag the current Node as preferred Parent. This is done by including them in a round robin fashion among others entry. The radio applies the following logic when it receives a new candidate.

[03191 If the new candidate is a not a parent, replace the next entry that:
is not one of the 5 best Parents/Siblings 92 of 107 has not select the current Node as preferred parent was sent at least once in a Neighbor Exchange message.

[03201 This last clause (3) allows candidates to receive the information needed to choose this node as preferred Parent. If the new candidate has flagged the current node as preferred Parent, this last condition is ignored.

[03211 If the new candidate is a Parent/Sibling:

If we have less than 5 best Parents/Sibling, use the same scheme as if it was not a parent. In last resort, replace a node that set the current Node as preferred parent using the same round robin scheme.

If we have already 5 best Parents/Sibling, replace the worst Parent/Sibling if the candidate's preferred route ratio is greater than its preferred route ratio.

[03221 The Routing table is used to maintain routes established using the Route Discovery process.

Table 66a - Routing Table Field Name Data t e Description Route Table array[MAX_NU List if mesh routes M_STATIC_RO
UTES] of Route Table Entry Table 66b - Route Table Entry Field Name Data t e Description Target Address Binary 2 octets MAC address of target Node Next Hop Address Binary 2 octets MAC address of the Node used to route the frame to the target Node Freshness Unsigned 8 bits Decremented each time the table is used for another entry. Reset to OxFF each time the entry is used.
103231 Freshness rules for each time the table is accessed:

93 of 107 If entry = new new entry Freshness = OxFF
For each other entry If entry Freshness = 0, entry Freshness = 0 Else entry Freshness = Freshness -1 Else Temp_Freshness = access entry Freshness accessed entry Freshness = OxFF
For each other entry If entry Freshness = 0 entry Freshness = 0 Else If entry Freshness > Tenip_Freshness entry Freshness = Freshness -1 Else entry Freshness = Freshness [0324] Freshness Use: The Freshness value is used when the table is full and a new entry is added. The entry with the smallest Freshness value is replaced with the new entry. If more than one entry has a value of zero, anyone can be replaced. This case only occurs if the table size is greater than 255 entries.

[0325] Every time a mesh frame is forwarded, no matter the routing method used, at the exception of the Keep Alive Initiate, the forwarding Node creates a temporary route entry to the originator in Temporary Route Take. This allows the destination Node to quickly send a reply, even if it didn't previously know the route to the originator Node. This route expires after TEMP_ROUTE_TO.

Table 67a - Tem ora Route Table Field Name Data ty e Description Temporary Route Table array[MAX_NU Table of temporary routes record from frames received.
M_TEMP _ROU
TES] of Temp Route Entry Table 67b - Tem ora Route Entry Field Name Data type Description Target Address Binary 2 octets MAC address of target Node Next Hop Address Binary 2 octets MAC address of the Node used to route the frame to the target Node Lifetime Binary I octet Countdown in second initialized to TEMP-ROUTE-TO
when the entry is created. Set to zero when the entry does not contain valid information.

94 of 107 103261 The End Device Table is used to maintain information about each End Device Child.

Table 68a - End Device Table Field Name Data type Description End Device Table array[MAX_NU Table of End Devices associated with a Router M_END_DEV I C
ES] of End Device Entry Table 68b - End Device Entry Field Name Data type Description Long Address Binary, 8 octets EUI address of the End Device Short Address Binary, 2 octets Assigned address of End Device (unassigned =
00000) Communication Age Binary, I octet The UTC time at which the End Device was last communicated with. The units are in 16 minutes increments of time.
RX Source DLL Nonce Count Unsigned, 5 The last authenticated DLL full nonce count received from octets this End Device.

103271 Security events are provided to the upper layers for diagnostic and auditing purposes. The content of each event is described bellow.

Table 69 - Security Events Field Name Data t e Description Security Event Log Control Unsigned Control flags for fields present in the log Bit 7 = 1: UTC
Integer, I octet time present Bit 6 = 1: MAC source long otherwise the source PAN and short address is present Bit 5 = 1: Short address of Network originator present Bit 4 = 1: Service Code present Bits 3-1 = l: key type: l Ix = Reserved 101 =
Node Key-1 100 = Node Key-0 O11 = Mesh Key-I 010 =
Mesh Key-0 001 = Maintenance Key-1 000 =
Maintenance Key-0 Bit 0 Reserved (=0 UTC Time Of Event Unsigned The UTC time is recorded for events by those devices Integer, 4 octets, supporting a UTC clock.
1 minute units MAC Source Address Binary, 8 octets Records the MAC source address of the logged event message. This address is either the long address or the MAC source PAN and short address padded with 0"s in the MSB.
Network Originator Address Binary, 4 octets The Network Originator PAN and Address (optional -used only for messages with network addresses.
Service Type Binary, I octet Full Service Type octet from the event message.
Service Code Binary, I octet Service Code octet from the event message if present.

95 of 107 103281 The Source Route table is used to maintain source routes established by the Route Discovery process with the Trace Route flag bit set and through the Route Establishment process.

Table 70a - Source Route Table Field Name Data type Description Source Route Table array[MAX_NU List if source routes M_SOURCE_R
OUTES] of Source Route Table Entry Table 70b - Source Route Table Entry Field Name Data type Description Target Address Binary 2 octets MAC address of target Node Number of PAN identifiers Bits 7-6 Defines the number of entries in the PAN
identifiers field.
Number of Hops Addresses Bits 3-0 Number of Addresses in Hop Addresses list.
Source routing is used when the Target device is more than one hop away. Therefore the Number of hops is at least one.
PAN Identifiers Array of Binary List of Network identifiers. Bits 15-14 of the different 2 octets short addresses specified within this frame reference this list. Each short address is explicitly associated with one of the three specified PAN Identifiers, or none of them.
Hop Addresses Array of Binary Short address of each Node responsible for routing this 2 octets message. Bits 15-14 define network membership of the Node as described by the PAN identifiers field.
Entry Valid Bit 0 Set if the entry contain valid information Freshness Bits 3 to 7 Decremented each time the table is parsed for another entry. Reset to Ox I F (31) each time the entry is used.
[03291 Finally, the SMIB table of parameters is set forth below.

Table 71 - SM Information Base (SMIB) Table ID Parameter name TVpe/units Range Description I ADDRESS TX 0 or I Order of transmission of the MAC and Mesh level ORDER addresses. The standard transmission order specified by IEEE 802.15.4 is Least Significant Octet First. 0 = Least Significant Octet First 1 = Most Significant Octet First 2 ASSOCIATION- unsigned 1-255 To avoid nodes bouncing back and forth between gates at EVAL_MIN_IMP integer % each re-evaluation, a "hysteresis" factor shall be ROVEMENT implemented; association to a new gate (if already associated) shall only occur if the new network offers an association ratio that is equal or greater than [current association ratio x (I +
ASSOCIATION EVAL MIN IMPROVEMENT)]
3 ASSOCIATION Unsigned 1-255 Maximum number of neighbors used in Association Ratio NEIGHBORS Integer algorithm 4 ASSOCIATION_ Unsigned 1-255 The spec says that the node shall periodically evaluate if EVAL_PERIOD integer (8 "better" networks are visible. A parameter shall dictate bits) I day how frequent this evaluation shall take place.

96 of 107 ID Parameter name Type/units Range Description ASSOCIATION_ Integer 100 100- Response timeout for the Association Request message RESP_TIMEOUT ms 25500 ms 6 CHECKPOINT_ Unsigned 1-255 Maximum number of Checkpoint process initiated without MAX_ATTEMPT Integer receiving a valid Keep Alive Response is allowed before S initiating the Association process.
7 CHECKPOINT_P Unsigned 1-255 Period at which a Node initiate a mandatory ERIOD Integer I min communication with the Coordinator. This communication min always starts by the transmission of a Keep Alive Request and reception of a Keep Alive Response and is optionally follows by exchanges of application level messages, 8 COORD_LOAD_ Unsigned 0-1 Weight for Coordinator load used in Association Ratio WEIGHT Integer algorithm 0.01 9 COORD_RESPO Unsigned 100 to Timeout when waiting for a response from the Coordinator NSE_TIMEOUT Integer 0.1 25500 sec ms DATA_REQUES Integer 10 10-2500 Timeout used by End Devices when waiting for a response T TIMEOUT ms ms to the End Device Data Request 11 END_DEVICE_I Integer 1 1-255 Inactivity timeout used by Sleeping End Devices waiting NACTIVE TO sec sec for the initiation of a local communication 12 END_DEVICE_P Integer 1 1-255 Notification period used by Sleeping End Devices when it ERIOD sec sec is in local communication mode 13 END_DEVICE_ Integer 10 10- 2550 Timeout used by Sleeping End Devices when waiting for WAIT ms ms an incoming frame after an End Device Node Present frame 14 HOP_NUM_WEI Unsigned 0-1 Weight for Number of hops to the Coordinator used in GHT Integer Association Ratio algorithm 0.01 LOCAL_COM_T Integer 100 100- Inactivity timeout used by Sleeping End Devices in local 0 ms 25500 communications mode ms 16 LQI_CLASS_WE Unsigned 0-1 Weight for minimum LQI class used in Association Ratio IGHT Integer algorithm 0.01 17 MAX_HOPS Unsigned 15 Maximum number of hops allowed on the mesh network Integer 18 MAX_NUM_EN Unsigned 1-255 Maximum number of entries in the End Device Table D DEVICES Integer 19 MAX_NUM_EN Unsigned 1-255 Max number of entries in the End Device Table D NODES Integer 21 MAX_NUM_NEI Unsigned 1-255 Maximum number of neighbors recorded in the GHBORS Integer Neighborhood Table 22 MAX_NUM_ST Unsigned 1-255 Maximum number of entries in the Route Table ATIC ROUTES Integer 23 MAX_NUM_TE Unsigned 1-255 Maximum number of entries in the Temporary Route MP ROUTES Integer Table 24 MAX_TREE_RE Unsigned 0-5 Maximum number of time a Router using tree routing PAIR Integer retry to transmit a frame to a different Parent Node or Sibling Node.
MESSAGE_RES Unsigned 1-255 Timeout for a request message to receive a response. Used PONSE_TO Integer I sec to release the Network Security Header count stored until sec the response is received.

97 of 107 ID Parameter name Type/units Range Description 26 NEIGHBOR_EX_ Integer 1-255 A random delay is required before responding to a RND_PERIOD sec Neighbors Exchange message with the Immediate Broadcast Requested parameter set. This period represent the maximum value allowed for this random delay.
27 NEIGHBOR_EX Integer min 1-255 Delay between each Neighbors Exchange CHANGE_PERI min OD
28 NEIGHBOR_INF Integer 10 10-2550 Period used to spray Neighbor Info Response messages O RESP TIME ms ms 29 NUM_NEIGHBO Unsigned 0-1 Weight for the number of neighbors used in Association RS_WEIGHT Integer Ratio algorithm 0.01 30 OVERLAPPING_ 0 or 1 0-1 Penetration of network trees within neighbor networks. 0 =
DEPTH Single hop I = Up to MAX HOPS
31 PO_AGGREGAT Integer 1 1-255 Initial period used just after a power outage or power ION_PERIOD sec sec restoration to allows aggregation of leaf Nodes event by their Parents and the reporting of the first hop Nodes.
32 PO_RECOGNITI Integer 0.1 1-25.5 Minimum of a power outage before sending a reel time ON PERIOD sec sec power outage event report 33 PO_RETRY _RN Integer I 1-255 Period used stray communication of Nodes reporting a D PERIOD sec sec power outage during retries 34 PO_RND_PERIO Integer 10 10-2550 Period used stray communication of Nodes reporting a D sec sec power outage during their first attempt 35 POWER_REPOR Integer 1 1-255 Time allows for a Node to send is power event using tree T_WAIT sec sec routing. After this period, the Node try to use mesh routing to send its event 36 POWER_RESTO Integer min I to 255 Maximum time allows after a power restoration to RATION_ASSOC min successfully send a power restoration event to the Coordinator. Nodes unable to send it event within this timeout initiating an Association process.
37 PR_RETRY_RN Integer 1 1-255 Period used stray communication of Nodes reporting a D PERIOD sec sec power restoration event during retries 38 PR_RND_PERIO Integer 10 10-2550 Period used stray communication of Nodes reporting a D sec sec power restoration event during their first attempt 39 FRR_TEST_RET Integer I to 12 Number of time a Frame Reception Rate Test Init, Frame RY Reception Rate Test End and Frame Reception Rate Test Result are retransmitted in the case of a MAC layer transmission failure.
40 RESP_SLEEP_PE Integer 1 1-255 End device sleep period when it is expecting a response.
RIOD sec sec 41 RESTORATION_ Integer min 1-255 Maximum time allowed for reporting a power restoration TIMEOUT min notification event and receives an acknowledgment.
42 ROUTE_LOST_ Integer 1-255 The number of consecutive times an End Device tries to ATTEMPTS send a frame through its Parent before changing Parent.
43 RREQ_RX_TIME Integer 1 1-255 ms The time the target of a Route Request waits to collect ms route data from other paths before responding.
44 RREQ_TO Integer 10 10-2550 Timeout when waiting for a Route Request after ms ms broadcasting a Route Request 45 SERVICE_PERI Unsigned 0-255 Period used to limits the rate at which frames can be sent OD Integer I sec using the Forwarding Service Messages process.
sec 46 SERVICE_TO Unsigned 0-255 Timeout that determines how long the Router and the Integer I sec Coordinator keep an inactive forwarding processes open sec 98 of 107 ID Parameter name Type/units Range Description 47 SLEEP_CHECK_ Unsigned 1-255 Period at which Sleeping End Devices wakeup to check if PERIOD Integer I sec there is a frame buffered in its Parent sec 48 TEMP_ROUTE_ Integer 10 10-2550 The time a temporary route is retained TO sec sec 49 MAX_ASSOCIA Unsigned 1-15 The number of Coordinators a device can associate with.
TIONS Integer Default 3 Among other things this set the number of Mesh Key entries needed for storage.
50 MAX_MF_WAIT Integer 1 1-255 ms Timeout receiving a buffered message following an End _PERIOD ms default Device Data Request ACK with the Frame Pending bit set.
20 ms 51 PING TO Integer I s 1-255 s Ping time out from Ping request to Ping response.
52 LQI_HIGH_FAC Float 0.00-1.00 The factor used to update the "LQI rx" number when LQI
TOR > LQI rx in Table 2 53 LQI_LOW_FACT Float 0.00-1.00 The factor used to update the "LQI rx" number when LQI
OR rx > LQI in Table 2 54 LQI_MISSED_E Float 0.00-1.00 The factor used to update the "LQI rx" number in Table 2 X FACTOR when the Neighbor Exchange message is missed twice.
55 MAX_NUM_SO Unsigned 1-255 Maximum number of entries in the Source Route Table URCE ROUTES Integer 56 LQI_CLASSI_HI Unsigned 0-255 LQI threshold for class 1. Node with LQI
between 0 and GH_THRESHOL Integer LQI_ CLASS I_HIGH_THRESHOLD are categorized in D class 1.
57 LQI_CLASS2_HI Unsigned 0-255 LQI threshold for class 2. Node with LQI
between GH_THRESHOL Integer LQI_ CLASS I_HIGH_THRESHOLD+I and D LQI_CLASSI_HIGH_THRESHOLD] are categorized in class 2.

99 of 107

Claims (16)

1. A method of associating a device to a mesh network, comprising:
selecting a network for association including:
requesting, by the device, neighbor information from neighboring devices which may belong to one or more networks, receiving, at the device from one or more neighboring devices, neighbor information for each of the one or more neighboring devices, applying an association ratio algorithm to the received neighbor information to determine which of the one or more networks to select for association;
selecting a router within the selected network through which to proxy messages by applying a preferred route ratio algorithm;
sending a network association request from the device through the router to a network coordinator;
at the network coordinator, performing one of the following in response to the network association request:
validating the association request with an association response message which includes a short address for the device, not responding to the network association request; and constructing, at the device, an initial neighborhood table.
2. A process for routing data frames from a first node to a second node within a network, the process including:

a tree routing sub-process, a source routing sub-process, a temporary routing sub-process and a mesh routing sub-process, wherein the particular sub-process for routing a data frame from the first node the second nodes is selected in accordance with the following logic executed on a processor:

if the data frame has a source route header the source routing sub-process is selected;

if there is an entry for the target address in a temporary routing table, the temporary routing sub-process is selected;

if the second node is a coordinator node, the tree routing sub-process is selected;
if the second node is not a coordinator node, the mesh routing sub-process is selected.
3. The process according to claim 2, wherein the tree routing sub-process comprises:
accessing by the first node a neighborhood table to determine a route to the coordinator;
selecting by the first node a neighbor with a preferred parent flag;
transmitting the data frame to a first parent neighbor with the preferred parent flag;
if transmission to the first parent neighbor does not succeed, selecting a next parent neighbor from the neighborhood table with a hop-count value less then the hop-count value of the first node until the transmission succeeds;
if transmission does not succeed via a neighbor having a hop-count value less then the hop-count value of the first node, selecting a sibling neighbor from the neighborhood table for transmission to the second node, wherein a sibling neighbor has a hop-count value that is equal to the hop-count value of the first node.
4. The process according to claim 3, wherein the tree routing sub-process further comprises within the step of selecting a next parent neighbor from the neighborhood table with a hop-count value less than the hop-count value of the first node until the transmission succeeds:
ordering next parent neighbors according to a preferred route ratio value as follows:
Preferred Route Ratio = Min LQI class << 12¦(15 - Number of Hops) << 8 ¦ Avg LQI
where Min LQI class is the minimum of all LQI class for each hop between the first node and the coordinator node through this next parent neighbor, and Avg LQI is the average of the LQI value of each hop between the first node and the coordinator node through this next parent neighbor;
for all the possible routes with the best min LQI class, selecting the next parent neighbors with the least number of hops; and select the next parent neighbor with the best Avg LQI.
5. The process according to claim 2, wherein the source routing sub-process comprises:
following a known route from the first node to the second node, the known route being embedded in a header of the data frame in the form of a list of node addresses located along the known route from the first node to the second node, wherein each node located along a route path from the first node to the second node forwards the data frame to the next node address located on the list after the current node's address;
wherein the known route to the second node is determined by (i) sending by the first node a route request frame to the second node with a trace route flag set or (ii) sending by the first node a route establishment request frame to the coordinator requesting a route to the second node.
6. The process according to claim 2, wherein the mesh routing sub-process comprises:
accessing a first route table at the first node to determine a route for the second node based on the second node address;
sending the data frame from the first node to an interim node in the route using the interim node address from the route;
accessing a second route table at the interim node to determine a second interim node address from the route based on the second node address;
sending the data frame from the interim node to a second interim node address;
if the interim node is unable to send the data frame to the second interim node address, broadcasting a route error message and deleting a second interim node address; and receiving an error message at the first node if the data frame does not reach the second node.
7. 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.
8. 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.
9. 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.
10. The process according to claim 9, wherein the long address is 8 octets and the short address is 2 octets.
11. A data structure for securing data frames transmitted in a single hop within a mesh network from a first node to a second node, the data structure comprising:
a data link layer (DLL) security header located after a service-type octet when a predetermined security header flag is selected within the service-type octet, the DLL security header including:
a first set of bits containing a portion of a transmitted nonce count;
a bit following the first set of bits containing a key identifier (ID), wherein the key ID selects a current version of a key used for calculating a message integrity check (MIC); and a second set of bits containing the MIC.
12. The data structure according to claim 11, wherein a DLL nonce used in the MIC
calculation includes:
a thirteen octet nonce composed of the full DLL nonce count and the MAC layer source address, wherein the Full DLL Nonce Count is five octets long as the MAC layer source address is selected from the group consisting of (i) an 8-octet long extended unique identifier (EUI) address, and (ii) a 2-octet source PAN ID and a 2-octet short address prefixed by four octets of all ones.
13. A process for validating integrity of message data transmitted in a single hop from a first node to a second node within a mesh network, the process comprising:

checking at a processor of the second node the 23 least significant bits (0-22) of a count transmitted from the first node against a last authenticated count;
if the transmitted count value is greater than the last authenticated count, combining at a processor of the second node, the 23 least significant bits (0-22) with the 17 most significant bits (23 - 39) of the last authenticated count to form a revised count;
if the transmitted count value is lower than the last authenticated count, incrementing the value of bits 23 through 29 by one before combining at a processor of the second node, the 23 least significant bits (0-22) with the 17 most significant bits (23 - 39) of the last authenticated count to form a revised count;
calculating at the processor of the second node a message integrity check (MIC) value using the revised count and pre-selected key;
if the calculated MIC value equals a received MIC value, then the message data integrity is validated.
14. A data structure for securing data frames transmitted in multiple hops using multiple nodes across a mesh network, the data structure comprising:
a network security header located after a data link layer (DLL) security layer within a mesh header, the network security header including:
a first set of bits containing a network count;
a bit following the first set of bits containing a network key identifier (ID);
and a second set of bits containing a network message integrity check (MIC).
15. The data structure according to claim 14, wherein a network security nonce for MIC calculation is thirteen octets and when the data frame is a request includes a network count, an originator PAN ID and an address padded with zeros and when the message is a response includes the network count, target PAN ID, target address, originator PAN ID and originator address.
16. A process for validating integrity of a data frame transmitted in multiple hops using multiple nodes across a mesh network, the process comprising:

receiving a data frame at a receiver node, wherein the data frame includes a network security header including a network count, a network key identifier (ID) and a message integrity check (MIC);
processing an identifier (ID) for an originating node that originated the data frame and a source field address to determine if the data frame was received from a coordinator node or a non-coordinator node;
if the data frame was received from a coordinator node, the network key ID
selects a node key for determining verification;
if the data frame was received from a non-coordinator node, the network key ID
selects a mesh key for determining verification;
when the received data frame is a request, a nonce is a combination of at least the network count, the originating node ID and an originating node address and the receiving node verifies the integrity of the frame by:
adding a 0 to the network field to make a 40 bit field, calculating the received MIC using either the node key or the mesh key as identified by the network key ID;
comparing the transmitted MIC with the received MIC, wherein the data frame is verified if the transmitted MIC is equal to the received MIC;
when the received data frame is a response, the network count is combined with the identifier and address for the target of the data frame and the originating node ID and an originating node address and the receiving node compares a network count in the response with a network count in the request, wherein the data frame is verified if the response network count is equal to the request network count.
CA2734953A 2008-09-04 2009-09-04 A system and method for implementing mesh network communications using a mesh network protocol Abandoned CA2734953A1 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US9411608P 2008-09-04 2008-09-04
US61/094,116 2008-09-04
PCT/US2009/005008 WO2010027495A1 (en) 2008-09-04 2009-09-04 A system and method for implementing mesh network communications using a mesh network protocol

Publications (1)

Publication Number Publication Date
CA2734953A1 true CA2734953A1 (en) 2010-03-11

Family

ID=41797385

Family Applications (1)

Application Number Title Priority Date Filing Date
CA2734953A Abandoned CA2734953A1 (en) 2008-09-04 2009-09-04 A system and method for implementing mesh network communications using a mesh network protocol

Country Status (4)

Country Link
US (3) US8699377B2 (en)
EP (1) EP2321983B1 (en)
CA (1) CA2734953A1 (en)
WO (1) WO2010027495A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116866055A (en) * 2023-07-26 2023-10-10 中科驭数（北京）科技有限公司 Method, device, equipment and medium for defending data flooding attack

Families Citing this family (172)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
BRPI0520099A2 (en) * 2005-03-10 2009-04-14 Thomson Licensing hybrid mesh routing protocol
ES2366373T3 (en) * 2005-11-09 2011-10-19 Thomson Licensing ROUTE SELECTION IN WIRELESS NETWORKS.
US7844212B1 (en) * 2007-10-03 2010-11-30 Alec Woo System and method for reliably communicating information without explicit acknowledgements
US8112694B1 (en) 2007-10-03 2012-02-07 Cisco Technology, Inc. System and method for reliably communicating information without explicit acknowledgements including retransmission of older, missed commands
EP2203911A4 (en) 2007-10-25 2011-12-28 Trilliant Networks Inc Gas meter having ultra-sensitive magnetic material retrofitted onto meter dial and method for performing meter retrofit
CA2705091A1 (en) 2007-11-25 2009-05-28 Trilliant Networks, Inc. System and method for power outage and restoration notification in an advanced metering infrasturcture network
US8144596B2 (en) * 2007-11-25 2012-03-27 Trilliant Networks, Inc. Communication and message route optimization and messaging in a mesh network
WO2009067261A1 (en) * 2007-11-25 2009-05-28 Trilliant Networks, Inc. System and method for transmitting and receiving information on a neighborhood area network
CA2705074A1 (en) 2007-11-25 2009-05-28 Trilliant Networks, Inc. Energy use control system and method
EP2215545A4 (en) * 2007-11-25 2011-04-20 Trilliant Networks Inc Upgrade process system and method
US8054769B2 (en) * 2009-02-22 2011-11-08 Chung-Shan Institute of Science and Technology Armaments Bureau, Ministry of National Defense Wireless sensing control network system and operating method thereof
US8542620B2 (en) 2009-05-05 2013-09-24 Qualcomm Incorporated Dynamic energy saving mechanism for access points
CN102111306B (en) * 2009-12-23 2013-06-26 杭州华三通信技术有限公司 Method, system and device for detecting virtual link faults based on fiber channel over Ethernet (FCoE)
JP5589410B2 (en) * 2010-01-29 2014-09-17 沖電気工業株式会社 Communication system and communication apparatus
US8537733B1 (en) 2010-02-12 2013-09-17 Qualcomm Incorporated Dynamic power mode switch in a wireless ad-hoc system
KR101764888B1 (en) 2010-02-16 2017-08-16 한국전자통신연구원 Apparatus and method for wideband high frequency short-range wireless communication
US9311446B1 (en) * 2010-03-19 2016-04-12 Qualcomm Incorporated Multicast transmission for power management in an ad-hoc wireless system
US8588156B1 (en) 2010-04-27 2013-11-19 Qualcomm Incorporated Direct data communication in infrastructure mode in wireless communication systems
US9635693B2 (en) * 2010-05-07 2017-04-25 Samsung Electronics Co., Ltd. Method of performing pairing between coordinator and device in network, method of performing pairing between devices, method of pairing between coordinators and network system including the coordinators and the devices
WO2012027634A1 (en) 2010-08-27 2012-03-01 Trilliant Networkd, Inc. System and method for interference free operation of co-located tranceivers
WO2012047198A1 (en) * 2010-10-05 2012-04-12 Utc Fire & Security Corporation Bi-directional link margin establishment for wireless embedded systems
US9088948B2 (en) 2010-10-27 2015-07-21 Silicon Laboratories Inc. Reduced power consumption in a wireless network device
WO2012068045A2 (en) 2010-11-15 2012-05-24 Trilliant Holdings Inc. System and method for securely communicating across multiple networks using a single radio
KR101217798B1 (en) * 2010-12-07 2013-01-02 금오공과대학교 산학협력단 An efficient routing system basee on link quality and load balancing for wireless sensor networks
US20120147800A1 (en) * 2010-12-10 2012-06-14 Minyoung Park Power management in a wireless network having stations with different power capabilities
KR20120067883A (en) * 2010-12-16 2012-06-26 한국전자통신연구원 A multi hop routing apparatus and a multi hop routing method
US8503309B2 (en) * 2010-12-17 2013-08-06 Cisco Technology, Inc. Dynamic expelling of child nodes in directed acyclic graphs in a computer network
WO2012097204A1 (en) 2011-01-14 2012-07-19 Trilliant Holdings, Inc. Process, device and system for volt/var optimization
US8970394B2 (en) 2011-01-25 2015-03-03 Trilliant Holdings Inc. Aggregated real-time power outages/restoration reporting (RTPOR) in a secure mesh network
KR20120087635A (en) * 2011-01-28 2012-08-07 삼성전자주식회사 Method and apparatus for remotely controlling consumer electronics device using wireless personal area network proxy
EP3288236B1 (en) 2011-02-10 2020-04-01 Trilliant Holdings, Inc. Device and method for facilitating secure communications over a cellular network
US9041349B2 (en) 2011-03-08 2015-05-26 Trilliant Networks, Inc. System and method for managing load distribution across a power grid
US9735860B2 (en) * 2011-03-18 2017-08-15 Nokia Technologies Oy Non-networked wireless communication
US8902894B2 (en) * 2011-05-06 2014-12-02 Qualcomm Incorporated Apparatus and methods for wireless communication using a packet structure that indicates whether payload length field and payload are included in the packet
CN102186261B (en) * 2011-05-30 2014-08-20 杭州华三通信技术有限公司 Implementation method and device for IPv6 (Internet Protocol Version 6) neighbor discovery protocol in WLAN (Wireless Local Area Network)
US9306833B2 (en) * 2011-06-20 2016-04-05 Cisco Technology, Inc. Data routing for power outage management
US8553536B2 (en) * 2011-07-12 2013-10-08 General Electric Company Mesh network management system
GB201113136D0 (en) * 2011-07-29 2011-09-14 Texecom Ltd A method for improving performance and reducing power consumption of a wireless network arrangement
TWI444078B (en) * 2011-08-12 2014-07-01 Nat Univ Tsing Hua Realization of sleep and reconnecting functions on network system and the method
US9082294B2 (en) * 2011-09-14 2015-07-14 Enernoc, Inc. Apparatus and method for receiving and transporting real time energy data
US9001787B1 (en) 2011-09-20 2015-04-07 Trilliant Networks Inc. System and method for implementing handover of a hybrid communications module
US20130086635A1 (en) * 2011-09-30 2013-04-04 General Electric Company System and method for communication in a network
US20130083660A1 (en) 2011-10-03 2013-04-04 Cisco Technology, Inc. Per-Group ECMP for Multidestination Traffic in DCE/TRILL Networks
US8717943B2 (en) 2011-10-18 2014-05-06 Itron, Inc. Peer-to-peer communications in AMI with source-tree routing
US9225660B2 (en) 2011-12-21 2015-12-29 Arm Finland Oy Method, apparatus and system for addressing resources
US10374976B2 (en) 2011-12-21 2019-08-06 Arm Finland Oy Method, apparatus and system for addressing resources
US9094364B2 (en) * 2011-12-23 2015-07-28 A10 Networks, Inc. Methods to manage services over a service gateway
US9066287B2 (en) 2012-01-24 2015-06-23 Qualcomm Incorporated Systems and methods of relay selection and setup
WO2013128317A1 (en) * 2012-03-01 2013-09-06 Nds Limited Anti-replay counter measures
WO2013129671A1 (en) * 2012-03-02 2013-09-06 富士通株式会社 Ad hoc network system, and route selection method
JP5971348B2 (en) * 2012-03-02 2016-08-17 日本電気株式会社 COMMUNICATION SYSTEM, CONTROL DEVICE, AND CONTROL METHOD
US9049658B2 (en) 2012-03-06 2015-06-02 Qualcomm Incorporated Power save mechanism for peer-to-peer communication networks
US9515920B2 (en) * 2012-04-20 2016-12-06 Futurewei Technologies, Inc. Name-based neighbor discovery and multi-hop service discovery in information-centric networks
US20130286909A1 (en) * 2012-04-26 2013-10-31 Qualcomm Atheros, Inc. System and method for reducing power consumption in a wireless communication system
ES2618320T3 (en) 2012-05-04 2017-06-21 Itron, Inc. Verification of the connection of meters to the network
US10455071B2 (en) 2012-05-09 2019-10-22 Sprint Communications Company L.P. Self-identification of brand and branded firmware installation in a generic electronic device
US9860785B2 (en) * 2012-05-11 2018-01-02 Qualcomm, Incorporated Apparatus and methods for control frame and management frame compression
US9191886B2 (en) * 2012-06-01 2015-11-17 Crestron Electronics Inc. Commissioning of wireless devices in personal area networks
US9794796B2 (en) 2012-06-13 2017-10-17 Qualcomm, Incorporation Systems and methods for simplified store and forward relays
US9510271B2 (en) * 2012-08-30 2016-11-29 Qualcomm Incorporated Systems, apparatus, and methods for address format detection
JP5884919B2 (en) * 2012-11-06 2016-03-15 富士通株式会社 Network device and transmission program
US9197541B2 (en) * 2012-11-15 2015-11-24 Compass Electro Optical Systems Ltd. Router with passive interconnect and distributed switchless switching
US9319310B2 (en) * 2012-11-15 2016-04-19 Compass Electro Optical Systems Ltd. Distributed switchless interconnect
US9832035B2 (en) * 2012-11-19 2017-11-28 Arris Enterprises Llc Power saving mode for network devices
US9654604B2 (en) 2012-11-22 2017-05-16 Intel Corporation Apparatus, system and method of controlling data flow over a communication network using a transfer response
US9264103B2 (en) * 2012-12-17 2016-02-16 Texas Instruments Incorporated Asymmetric channels in power line communications
US9251253B2 (en) 2013-01-05 2016-02-02 Qualcomm Incorporated Expeditious citation indexing
JP6007799B2 (en) * 2013-01-16 2016-10-12 富士通株式会社 Centralized network control system
US9549009B1 (en) 2013-02-08 2017-01-17 Sprint Communications Company L.P. Electronic fixed brand labeling
US10355962B2 (en) * 2013-02-11 2019-07-16 Riverbed Technology, Inc. Network topology generation using traceroute data
KR102023402B1 (en) * 2013-02-28 2019-09-23 삼성전자주식회사 Method and apparatus for monitoring internet connection status in communication system
US9614935B2 (en) * 2013-03-15 2017-04-04 Qualcomm Incorporated Protected control frames
ITTO20130297A1 (en) * 2013-04-12 2014-10-13 Selex Es Spa METHOD OF COMMUNICATION OF SMF FOR A MANET NETWORK, AND NETWORK AND MOBILE NETWORK KNOT THAT IMPLEMENT THIS COMMUNICATION METHOD
KR101787867B1 (en) * 2013-06-08 2017-10-18 후아웨이 테크놀러지 컴퍼니 리미티드 Route forwarding method, apparatus and system
US9532211B1 (en) 2013-08-15 2016-12-27 Sprint Communications Company L.P. Directing server connection based on location identifier
US9161209B1 (en) * 2013-08-21 2015-10-13 Sprint Communications Company L.P. Multi-step mobile device initiation with intermediate partial reset
US9743271B2 (en) 2013-10-23 2017-08-22 Sprint Communications Company L.P. Delivery of branding content and customizations to a mobile communication device
US10506398B2 (en) 2013-10-23 2019-12-10 Sprint Communications Company Lp. Implementation of remotely hosted branding content and customizations
US20150120863A1 (en) * 2013-10-25 2015-04-30 Qualcomm Incorporated Proxy network device selection in a communication network
US9743458B2 (en) * 2013-11-06 2017-08-22 Google Technology Holdings LLC Adaptive crowdsourced keep-alive interval determination
US9603009B1 (en) 2014-01-24 2017-03-21 Sprint Communications Company L.P. System and method of branding a device independent of device activation
GB2512748B (en) 2014-02-25 2015-02-18 Cambridge Silicon Radio Ltd Auto-configuration of a mesh relay's TX/RX schedule
US9548918B2 (en) * 2014-02-28 2017-01-17 General Electric Company Edge router systems and methods
WO2015130752A1 (en) * 2014-02-28 2015-09-03 John Boudreaux Sensor network gateway
US10379873B2 (en) 2014-02-28 2019-08-13 Tyco Fire & Security Gmbh Distributed processing system
US9316720B2 (en) 2014-02-28 2016-04-19 Tyco Fire & Security Gmbh Context specific management in wireless sensor network
US9717047B2 (en) * 2014-03-07 2017-07-25 Qualcomm Incorporated Fairness-based message transmission in a wireless network
US9756549B2 (en) 2014-03-14 2017-09-05 goTenna Inc. System and method for digital communication between computing devices
US9602394B2 (en) * 2014-03-20 2017-03-21 Texas Instruments Incorporated Routing frame propagation in power line networks
WO2015146066A1 (en) * 2014-03-28 2015-10-01 日本電気株式会社 Wireless terminal, metering device, and communication control method
US9681251B1 (en) 2014-03-31 2017-06-13 Sprint Communications Company L.P. Customization for preloaded applications
US9380513B2 (en) 2014-05-16 2016-06-28 Qualcomm Incorporated Reducing broadcast duplication in hybrid wireless mesh protocol routing
US9392525B2 (en) 2014-05-16 2016-07-12 Qualcomm Incorporated Establishing reliable routes without expensive mesh peering
US10504148B2 (en) 2014-05-23 2019-12-10 Qualcomm Incorporated Peer-to-peer relaying of discovery information
US10142847B2 (en) * 2014-05-23 2018-11-27 Qualcomm Incorporated Secure relay of discovery information in wireless networks
CN103974202A (en) * 2014-05-28 2014-08-06 苏州鸣伦电子科技有限公司 Multicast-tree-based code dispatching method for power demand side acquisition node
US9426641B1 (en) 2014-06-05 2016-08-23 Sprint Communications Company L.P. Multiple carrier partition dynamic access on a mobile device
EP3123667B1 (en) * 2014-06-26 2020-08-05 NEC Corporation Method for monitoring a status in form of presence and/or absence of a network entity
US9614770B2 (en) * 2014-07-21 2017-04-04 Cisco Technology, Inc. Network traffic control during limited power situations
WO2016039507A1 (en) * 2014-09-11 2016-03-17 이화여자대학교 산학협력단 Position determination method for sensor arrangement based on wireless communications in building and position determination system for sensor arrangement based on wireless communications in building
US10111071B2 (en) 2014-09-19 2018-10-23 Avago Technologies General Ip (Singapore) Pte. Ltd. Bluetooth low energy automation mesh network
US9992326B1 (en) 2014-10-31 2018-06-05 Sprint Communications Company L.P. Out of the box experience (OOBE) country choice using Wi-Fi layer transmission
US9727513B1 (en) * 2014-11-02 2017-08-08 Netronome Systems, Inc. Unicast packet ready command
US9727512B1 (en) * 2014-11-02 2017-08-08 Netronome Systems, Inc. Identical packet multicast packet ready command
US9588928B1 (en) * 2014-11-02 2017-03-07 Netronome Systems, Inc. Unique packet multicast packet ready command
DE102014222662A1 (en) * 2014-11-06 2016-05-12 Siemens Ag Österreich Method for data enrichment of measurement data records of a low-voltage network
US9785509B2 (en) 2014-11-07 2017-10-10 Cisco Technology, Inc. Phased network formation for power restoration
US20160150459A1 (en) * 2014-11-19 2016-05-26 Qualcomm Incorporated Techniques to support heterogeneous network data path discovery
US20160182252A1 (en) * 2014-12-22 2016-06-23 Greenvity Communications, Inc. Wireless and Powerline Communication Mesh Network
US9280389B1 (en) 2014-12-30 2016-03-08 Tyco Fire & Security Gmbh Preemptive operating system without context switching
US9398462B1 (en) 2015-03-04 2016-07-19 Sprint Communications Company L.P. Network access tiered based on application launcher installation
KR102281737B1 (en) * 2015-03-16 2021-07-26 한국전자통신연구원 Apparatus and Method for Running Dynamically Packet Relay in Sensor Network
WO2016175638A1 (en) * 2015-04-30 2016-11-03 엘지전자(주) Method and device for allocating address of device in bluetooth mesh network
EP3298710B1 (en) * 2015-05-22 2020-02-26 Linear Technology Corporation Low power sensor node operation for wireless network
US20170048310A1 (en) * 2015-08-14 2017-02-16 Google Inc. Peer-to-peer enabled activation
US10637765B2 (en) * 2015-09-24 2020-04-28 At&T Intellectual Property I, L.P. Management of forwarding tables at edge routers
US10505948B2 (en) * 2015-11-05 2019-12-10 Trilliant Networks, Inc. Method and apparatus for secure aggregated event reporting
US9954777B2 (en) * 2016-01-14 2018-04-24 International Business Machines Corporation Data processing
EP3409071B1 (en) * 2016-01-28 2021-11-10 Hewlett Packard Enterprise Development LP Wireless mesh network formation
JP2017152855A (en) * 2016-02-23 2017-08-31 株式会社東芝 Radio communication device, radio communication method, and program
US11570098B2 (en) 2016-07-05 2023-01-31 Six Impossible Things Before Breakfast Limited Systems, apparatuses and methods for cooperating routers
US10841222B2 (en) 2016-07-05 2020-11-17 Ologn Technologies Ag Systems, apparatuses and methods for network packet management
US9992097B2 (en) * 2016-07-11 2018-06-05 Cisco Technology, Inc. System and method for piggybacking routing information in interests in a content centric network
EP3485608B1 (en) * 2016-07-13 2020-06-24 Telefonaktiebolaget LM Ericsson (PUBL) Methods and servers for managing traffic steering policies
US10420006B2 (en) * 2016-08-18 2019-09-17 Bridgefy, Inc. Mesh connection systems and algorithms for connecting devices through intermediate nodes
US9913132B1 (en) 2016-09-14 2018-03-06 Sprint Communications Company L.P. System and method of mobile phone customization based on universal manifest
US10021240B1 (en) 2016-09-16 2018-07-10 Sprint Communications Company L.P. System and method of mobile phone customization based on universal manifest with feature override
WO2018175781A1 (en) * 2017-03-22 2018-09-27 Pressto, Inc. System and method for mesh network streaming
CA2963434A1 (en) * 2017-04-06 2018-10-06 Hydro-Quebec Signal verification for communicating computers
US10826815B2 (en) * 2017-04-09 2020-11-03 Barefoot Networks, Inc. Verification of access control list rules provided with a message
US10425330B2 (en) * 2017-04-24 2019-09-24 International Business Machines Corporation Routing packets in multiple destination networks with overlapping address spaces
US10306433B1 (en) 2017-05-01 2019-05-28 Sprint Communications Company L.P. Mobile phone differentiated user set-up
AU2018313982A1 (en) * 2017-08-10 2020-03-26 Parasol Medical, Llc Patient movement and incontinence notification system
US10708172B2 (en) * 2017-10-03 2020-07-07 Itron Networked Solutions, Inc. Energy aware routing for mesh networks
US10299096B2 (en) 2017-10-20 2019-05-21 Crestron Electronics, Inc. Automatic wireless network formation
US10742429B2 (en) * 2017-11-14 2020-08-11 Silicon Laboratories Inc. Ultra low power mesh network
EP3725110B1 (en) * 2017-12-11 2022-03-02 Telefonaktiebolaget LM Ericsson (publ) Method and apparatus for validating messages in a wireless communications network
US10607012B2 (en) 2017-12-29 2020-03-31 Delphian Systems, LLC Bridge computing device control in local networks of interconnected devices
CN108055679B (en) * 2018-01-26 2020-11-13 乐鑫信息科技（上海）股份有限公司 Mesh network flow control method
US11350340B2 (en) * 2018-02-07 2022-05-31 Telefonaktiebolaget Lm Ericsson (Publ) Method for updating a number of hops that is to be used for communication between a publisher mesh node and a subscriber mesh node in a wireless mesh network
US10944669B1 (en) 2018-02-09 2021-03-09 GoTenna, Inc. System and method for efficient network-wide broadcast in a multi-hop wireless network using packet echos
US10855753B2 (en) * 2018-02-23 2020-12-01 Standard Cognition, Corp. Distributed computing of vehicle data by selecting a computation resource of a remote server that satisfies a selection policy for meeting resource requirements according to capability information
US10616340B2 (en) 2018-02-23 2020-04-07 Standard Cognition, Corp. Distributed computing of large data by selecting a computational resource of a remote server based on selection policies and data information wherein the selections policies are associated with location constraints, time constraints, and data type constraints
EP3785468A1 (en) 2018-04-24 2021-03-03 Carrier Corporation Automated routing in a mesh network of wireless messaging devices
WO2019209816A1 (en) 2018-04-24 2019-10-31 Carrier Corporation Automated routing in a mesh network of wireless messaging devices
US11743253B2 (en) * 2018-05-08 2023-08-29 Roche Diabetes Care, Inc. Methods and systems for bidirectional device authentication
US10419293B1 (en) 2018-06-08 2019-09-17 Cisco Technology, Inc. Fast reformation in a directed acyclic graph based on deferred contention to higher devices
WO2020023909A1 (en) 2018-07-27 2020-01-30 GoTenna, Inc. Vine™: zero-control routing using data packet inspection for wireless mesh networks
JP7277480B2 (en) * 2018-09-07 2023-05-19 グーグル エルエルシー Enhanced frame hold
US10972957B2 (en) * 2018-11-07 2021-04-06 Kabushiki Kaisha Toshiba Method and device for routing data in 6TiSCH networks
WO2020185707A1 (en) 2019-03-08 2020-09-17 goTenna Inc. Method for utilization-based traffic throttling in a wireless mesh network
FR3095708B1 (en) * 2019-05-02 2022-03-04 Sagemcom Broadband Sas Secure data transmission method
CN110602746B (en) * 2019-08-20 2022-09-13 福建星网智慧科技有限公司 Information interaction method between master device and slave device in Mesh network
US11075848B2 (en) * 2019-08-21 2021-07-27 Hewlett Packard Enterprise Development Lp Fast path for acknowledgement frames in wireless networks
CN111046065B (en) * 2019-10-28 2022-06-17 北京大学 Extensible high-performance distributed query processing method and device
FR3105681B1 (en) * 2019-12-20 2021-12-03 Sagemcom Broadband Sas Method and device for determining a topology of a network of wireless access points
US20210211910A1 (en) * 2020-01-06 2021-07-08 Alarm.Com Incorporated Mesh network connection quality
CN113472664B (en) * 2020-03-31 2022-09-16 华为技术有限公司 Method and device for storing routing information
DE102020114199A1 (en) * 2020-05-27 2021-12-02 Basler Aktiengesellschaft Protection of computer systems against manipulation and functional anomalies
CN111757413B (en) * 2020-06-12 2022-04-19 广州安凯微电子股份有限公司 Broadcast and route hybrid transmission method and system in wireless Mesh network
US11457072B2 (en) * 2020-07-20 2022-09-27 Izuma Tech, Inc. Network connection and maintenance
DE102020123413B4 (en) * 2020-09-08 2022-12-08 Thales Alenia Space Deutschland Gmbh Process for data transmission in an ad hoc network
US11843939B2 (en) 2020-12-16 2023-12-12 Itron, Inc. Secure messaging for outage events
CN112671649A (en) * 2020-12-22 2021-04-16 广州技象科技有限公司 Path selection method and device based on Internet of things transmission fault detection
US11758369B2 (en) 2020-12-23 2023-09-12 Itron Global Sarl Discovery of forwarders to mitigate asymmetric links in a multicast group
US11924077B2 (en) * 2021-08-13 2024-03-05 Itron, Inc. Determining network reliability using message success rates
US11483224B1 (en) * 2021-08-13 2022-10-25 Itron, Inc. Determining network reliability using message success rates
WO2023055853A2 (en) * 2021-09-28 2023-04-06 Semitech Semiconductor Pty Ltd Improved routing for trickle algorithm
US20230246960A1 (en) * 2022-02-03 2023-08-03 Karunesh Rama KAIMAL Methods and systems for determining preferred linked network path between two network devices
US11606260B1 (en) 2022-03-24 2023-03-14 Red Hat, Inc. Consensus-based node retirement process in a mesh
CN114629518B (en) * 2022-03-31 2024-03-01 厦门骐俊物联科技股份有限公司 Dynamic ad hoc network method of digital interphone
CN117499870A (en) * 2022-07-25 2024-02-02 霍尼韦尔国际公司 Method, apparatus and system for automatic configuration of LoRa private network in gas detection system

Family Cites Families (442)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4132981A (en) 1976-10-21 1979-01-02 Rockwell International Corporation Self-powered system for measuring and storing consumption of utility meter
US4190800A (en) 1976-11-22 1980-02-26 Scientific-Atlanta, Inc. Electrical load management system
US4204195A (en) 1977-05-23 1980-05-20 General Electric Company Meter terminal unit for use in automatic remote meter reading and control system
US4254472A (en) 1978-08-14 1981-03-03 The Valeron Corporation Remote metering system
US4322842A (en) 1979-10-23 1982-03-30 Altran Electronics Broadcast system for distribution automation and remote metering
US4396915A (en) 1980-03-31 1983-08-02 General Electric Company Automatic meter reading and control system
US4425628A (en) 1981-05-26 1984-01-10 General Electric Company Control module for engergy management system
US4638314A (en) 1984-01-12 1987-01-20 American Science And Engineering, Inc. Meter transponder hybrid
US4644320A (en) 1984-09-14 1987-02-17 Carr R Stephen Home energy monitoring and control system
US4749992B1 (en) 1986-07-03 1996-06-11 Total Energy Management Consul Utility monitoring and control system
US4792946A (en) 1987-04-07 1988-12-20 Spectrum Electronics, Inc. Wireless local area network for use in neighborhoods
US5010568A (en) 1989-04-04 1991-04-23 Sparton Corporation Remote meter reading method and apparatus
US5007052A (en) 1989-04-11 1991-04-09 Metricom, Inc. Method for routing packets by squelched flooding
US5138615A (en) 1989-06-22 1992-08-11 Digital Equipment Corporation Reconfiguration system and method for high-speed mesh connected local area network
US4939726A (en) 1989-07-18 1990-07-03 Metricom, Inc. Method for routing packets in a packet communication network
US5115433A (en) 1989-07-18 1992-05-19 Metricom, Inc. Method and system for routing packets in a packet communication network
US5553094A (en) 1990-02-15 1996-09-03 Iris Systems, Inc. Radio communication network for remote data generating stations
US5056107A (en) 1990-02-15 1991-10-08 Iris Systems Inc. Radio communication network for remote data generating stations
US5673252A (en) 1990-02-15 1997-09-30 Itron, Inc. Communications protocol for remote data generating stations
US5079768A (en) 1990-03-23 1992-01-07 Metricom, Inc. Method for frequency sharing in frequency hopping communications network
US5130987A (en) 1990-03-23 1992-07-14 Metricom, Inc. Method for synchronizing a wide area network without global synchronizing
US5077753A (en) 1990-04-09 1991-12-31 Proxim, Inc. Radio communication system using spread spectrum techniques
US5216623A (en) 1990-06-06 1993-06-01 M. T. Mcbrian, Inc. System and method for monitoring and analyzing energy characteristics
US5117422A (en) 1990-07-09 1992-05-26 Itt Corporation Method for providing an efficient and adaptive management of message routing in a multi-platform and apparatus communication system
US5159592A (en) 1990-10-29 1992-10-27 International Business Machines Corporation Network address management for a wired network supporting wireless communication to a plurality of mobile users
CA2054591C (en) 1991-02-28 1996-09-03 Giovanni Vannucci Wireless telecommunication systems
CA2040234C (en) 1991-04-11 2000-01-04 Steven Messenger Wireless coupling of devices to wired network
US5394436A (en) 1991-10-01 1995-02-28 Norand Corporation Radio frequency local area network
US5708680A (en) 1991-05-14 1998-01-13 Norand Corporation Network utilizing a controller and base transceivers to route voice packets
US6407991B1 (en) 1993-05-06 2002-06-18 Intermec Ip Corp. Communication network providing wireless and hard-wired dynamic routing
US6084867A (en) 1991-10-01 2000-07-04 Intermec Ip Corp. Apparatus and method of routing data in a radio frequency local area network
US5974236A (en) 1992-03-25 1999-10-26 Aes Corporation Dynamically reconfigurable communications network and method
US5761083A (en) 1992-03-25 1998-06-02 Brown, Jr.; Robert J. Energy management and home automation system
US5544036A (en) 1992-03-25 1996-08-06 Brown, Jr.; Robert J. Energy management and home automation system
AU4661793A (en) 1992-07-02 1994-01-31 Wellfleet Communications Data packet processing method and apparatus
US5442633A (en) 1992-07-08 1995-08-15 International Business Machines Corporation Shortcut network layer routing for mobile hosts
EP0582373B1 (en) 1992-07-17 1999-10-06 Sun Microsystems, Inc. Method and apparatus for implementing self-organization in a wireless local area network
IT1257167B (en) 1992-10-27 1996-01-05 METHOD FOR IMPROVING THE MANAGEMENT OF DISTRIBUTION NETWORKS, IN PARTICULAR OF GAS, WATER, ELECTRICITY, HEAT.
US6970434B1 (en) 1995-06-07 2005-11-29 Broadcom Corporation Hierarchical communication system providing intelligent data, program and processing migration
GB9312836D0 (en) 1993-06-22 1993-08-04 Schlumberger Ind Ltd Multipoint to point radiocommunications network
US5528507A (en) 1993-08-11 1996-06-18 First Pacific Networks System for utility demand monitoring and control using a distribution network
US5465398A (en) 1993-10-07 1995-11-07 Metricom, Inc. Automatic power level control of a packet communication link
DE69434586T2 (en) 1993-11-04 2006-11-09 Broadcom Corp., Irvine COMMUNICATION NETWORK WITH WIRELESS AND WIRE-LINKED DYNAMIC CONDUCTIVITY
US5608780A (en) 1993-11-24 1997-03-04 Lucent Technologies Inc. Wireless communication system having base units which extracts channel and setup information from nearby base units
US5530963A (en) 1993-12-16 1996-06-25 International Business Machines Corporation Method and system for maintaining routing between mobile workstations and selected network workstation using routing table within each router device in the network
US5471469A (en) 1994-02-08 1995-11-28 Metricon, Inc. Method of resolving media contention in radio communication links
US5453977A (en) 1994-02-08 1995-09-26 Metricom, Inc. Method for network configuration via third party query
US5400338A (en) 1994-02-08 1995-03-21 Metricom, Inc. Parasitic adoption of coordinate-based addressing by roaming node
US5963457A (en) 1994-03-18 1999-10-05 Hitachi, Ltd. Electrical power distribution monitoring system and method
US5430729A (en) 1994-04-04 1995-07-04 Motorola, Inc. Method and apparatus for adaptive directed route randomization and distribution in a richly connected communication network
US5488608A (en) 1994-04-14 1996-01-30 Metricom, Inc. Method and system for routing packets in a packet communication network using locally constructed routing tables
US5467345A (en) 1994-05-31 1995-11-14 Motorola, Inc. Packet routing system and method therefor
US5479400A (en) 1994-06-06 1995-12-26 Metricom, Inc. Transceiver sharing between access and backhaul in a wireless digital communication system
US5515369A (en) 1994-06-24 1996-05-07 Metricom, Inc. Method for frequency sharing and frequency punchout in frequency hopping communications network
US5903566A (en) 1994-06-24 1999-05-11 Metricom, Inc. Method for distributing program code to intelligent nodes in a wireless mesh data communication network
US5570084A (en) 1994-06-28 1996-10-29 Metricom, Inc. Method of loose source routing over disparate network types in a packet communication network
CA2129199C (en) 1994-07-29 1999-07-20 Roger Y.M. Cheung Method and apparatus for bridging wireless lan to a wired lan
US5696501A (en) 1994-08-02 1997-12-09 General Electric Company Method and apparatus for performing the register functions for a plurality of metering devices at a common node
US5758331A (en) 1994-08-15 1998-05-26 Clear With Computers, Inc. Computer-assisted sales system for utilities
US5490139A (en) 1994-09-28 1996-02-06 International Business Machines Corporation Mobility enabling access point architecture for wireless attachment to source routing networks
MY123040A (en) 1994-12-19 2006-05-31 Salbu Res And Dev Proprietary Ltd Multi-hop packet radio networks
US5727057A (en) 1994-12-27 1998-03-10 Ag Communication Systems Corporation Storage, transmission, communication and access to geographical positioning data linked with standard telephony numbering and encoded for use in telecommunications and related services
US7761910B2 (en) 1994-12-30 2010-07-20 Power Measurement Ltd. System and method for assigning an identity to an intelligent electronic device
US6988025B2 (en) 2000-11-28 2006-01-17 Power Measurement Ltd. System and method for implementing XML on an energy management device
US7188003B2 (en) 1994-12-30 2007-03-06 Power Measurement Ltd. System and method for securing energy management systems
US5659300A (en) 1995-01-30 1997-08-19 Innovatec Corporation Meter for measuring volumetric consumption of a commodity
US7133845B1 (en) 1995-02-13 2006-11-07 Intertrust Technologies Corp. System and methods for secure transaction management and electronic rights protection
US5572528A (en) 1995-03-20 1996-11-05 Novell, Inc. Mobile networking method and apparatus
US5608721A (en) 1995-04-03 1997-03-04 Motorola, Inc. Communications network and method which implement diversified routing
US5596722A (en) 1995-04-03 1997-01-21 Motorola, Inc. Packet routing system and method for achieving uniform link usage and minimizing link load
US5623495A (en) 1995-06-15 1997-04-22 Lucent Technologies Inc. Portable base station architecture for an AD-HOC ATM lan
US5757783A (en) 1995-06-15 1998-05-26 Lucent Technologies Inc. Method and apparatus for routing ATM cells in an AD-ATM LAN
US5822309A (en) 1995-06-15 1998-10-13 Lucent Technologies Inc. Signaling and control architecture for an ad-hoc ATM LAN
US5726644A (en) 1995-06-30 1998-03-10 Philips Electronics North America Corporation Lighting control system with packet hopping communication
US5898826A (en) 1995-11-22 1999-04-27 Intel Corporation Method and apparatus for deadlock-free routing around an unusable routing component in an N-dimensional network
US5737318A (en) 1995-12-27 1998-04-07 Philips Electronics North America Corporation Method for initializing a wireless, packet-hopping network
US6195018B1 (en) 1996-02-07 2001-02-27 Cellnet Data Systems, Inc. Metering system
US5896097A (en) 1996-03-06 1999-04-20 Schlumberger Resource Management Services, Inc. System for utility meter communications using a single RF frequency
US5767790A (en) 1996-03-07 1998-06-16 Jovellana; Bartolome D. Automatic utility meter monitor
US5719564A (en) 1996-05-10 1998-02-17 Sears; Lawrence M. Utility meter reading system
US5748104A (en) 1996-07-11 1998-05-05 Qualcomm Incorporated Wireless remote telemetry system
US5920697A (en) 1996-07-11 1999-07-06 Microsoft Corporation Method of automatic updating and use of routing information by programmable and manual routing information configuration based on least lost routing
GB2315197B (en) 1996-07-11 2000-07-12 Nokia Mobile Phones Ltd Method and apparatus for system clock adjustment
US5892758A (en) 1996-07-11 1999-04-06 Qualcomm Incorporated Concentrated subscriber wireless remote telemetry system
US5774660A (en) 1996-08-05 1998-06-30 Resonate, Inc. World-wide-web server with delayed resource-binding for resource-based load balancing on a distributed resource multi-node network
DE19632261C2 (en) 1996-08-09 1998-07-09 Siemens Ag Method for establishing telecommunication connections between telecommunication devices in wireless telecommunication systems, in particular between DECT devices of a DECT system
US6075777A (en) 1996-08-21 2000-06-13 Lucent Technologies Inc. Network flow framework for online dynamic channel allocation
JP3227390B2 (en) 1996-08-27 2001-11-12 松下電工株式会社 Building management system
US5987011A (en) 1996-08-30 1999-11-16 Chai-Keong Toh Routing method for Ad-Hoc mobile networks
US6246677B1 (en) 1996-09-06 2001-06-12 Innovatec Communications, Llc Automatic meter reading data communication system
US5880677A (en) 1996-10-15 1999-03-09 Lestician; Guy J. System for monitoring and controlling electrical consumption, including transceiver communicator control apparatus and alternating current control apparatus
US6078785A (en) 1996-10-15 2000-06-20 Bush; E. William Demand reporting of electricity consumption by radio in relays to a base station, and demand relays wattmeters so reporting over a wide area
US6018659A (en) 1996-10-17 2000-01-25 The Boeing Company Airborne broadband communication network
JPH10126439A (en) * 1996-10-17 1998-05-15 Fujitsu Ltd Route selection device for packet exchange communication network
US6014089A (en) 1996-10-28 2000-01-11 Tracy Corporation Ii Method for transmitting data using a digital control channel of a wireless network
US6150955A (en) 1996-10-28 2000-11-21 Tracy Corporation Ii Apparatus and method for transmitting data via a digital control channel of a digital wireless network
JPH10135965A (en) 1996-10-29 1998-05-22 Ricoh Co Ltd Radio communication system
US7143204B1 (en) 1996-11-15 2006-11-28 Logiclink Corporation Method and apparatus for suspending or adjusting billing charge for usage of electrically powered devices if abnormal or halt condition detected
US6839775B1 (en) 1996-11-15 2005-01-04 Kim Y. Kao Method and apparatus for vending machine controller configured to monitor and analyze power profiles for plurality of motor coils to determine condition of vending machine
US5901067A (en) 1996-11-15 1999-05-04 Kim Y. Kao System for interactively selecting and activating groups of electrically powered devices
US7054271B2 (en) 1996-12-06 2006-05-30 Ipco, Llc Wireless network system and method for providing same
US6044062A (en) 1996-12-06 2000-03-28 Communique, Llc Wireless network system and method for providing same
JP3097581B2 (en) 1996-12-27 2000-10-10 日本電気株式会社 Ad-hoc local area network configuration method, communication method and terminal
US5894422A (en) 1997-01-27 1999-04-13 Chasek; Norman E. System and methods that facilitate the introduction of market based economic models for electric power
US7046682B2 (en) 1997-02-12 2006-05-16 Elster Electricity, Llc. Network-enabled, extensible metering system
AR011440A1 (en) 1997-02-12 2000-08-16 Abb Power T & D Co ELECTRONIC MEASUREMENT PROVISION
US6628764B1 (en) 1997-02-14 2003-09-30 Statsignal Systems, Inc. System for requesting service of a vending machine
US6618578B1 (en) 1997-02-14 2003-09-09 Statsignal Systems, Inc System and method for communicating with a remote communication unit via the public switched telephone network (PSTN)
US6233327B1 (en) 1997-02-14 2001-05-15 Statsignal Systems, Inc. Multi-function general purpose transceiver
US5926531A (en) 1997-02-14 1999-07-20 Statsignal Systems, Inc. Transmitter for accessing pay-type telephones
US7079810B2 (en) 1997-02-14 2006-07-18 Statsignal Ipc, Llc System and method for communicating with a remote communication unit via the public switched telephone network (PSTN)
US7137550B1 (en) 1997-02-14 2006-11-21 Statsignal Ipc, Llc Transmitter for accessing automated financial transaction machines
US6430268B1 (en) 1997-09-20 2002-08-06 Statsignal Systems, Inc. Systems for requesting service of a vending machine
CN1153352C (en) 1997-03-18 2004-06-09 皇家菲利浦电子有限公司 Receiver tuning system
US6118269A (en) 1997-03-26 2000-09-12 Comverge Technologies, Inc. Electric meter tamper detection circuit for sensing electric meter removal
US5898387A (en) 1997-03-26 1999-04-27 Scientific-Atlanta, Inc. Modular meter based utility gateway enclosure
US6073169A (en) 1997-04-08 2000-06-06 Abb Power T&D Company Inc. Automatic meter reading system employing common broadcast command channel
US6457054B1 (en) 1997-05-15 2002-09-24 Intel Corporation System for reducing user-visibility latency in network transactions
US5874903A (en) 1997-06-06 1999-02-23 Abb Power T & D Company Inc. RF repeater for automatic meter reading system
US5991806A (en) 1997-06-09 1999-11-23 Dell Usa, L.P. Dynamic system control via messaging in a network management system
US5914672A (en) 1997-06-13 1999-06-22 Whisper Communications Incorporated System for field installation of a remote meter interface
US6108699A (en) 1997-06-27 2000-08-22 Sun Microsystems, Inc. System and method for modifying membership in a clustered distributed computer system and updating system configuration
US6058355A (en) 1997-06-30 2000-05-02 Ericsson Inc. Automatic power outage notification via CEBus interface
JP3180726B2 (en) 1997-08-05 2001-06-25 日本電気株式会社 Mobile terminal control method
US6414952B2 (en) 1997-08-28 2002-07-02 Broadcom Homenetworking, Inc. Virtual gateway system and method
US6538577B1 (en) 1997-09-05 2003-03-25 Silver Springs Networks, Inc. Electronic electric meter for networked meter reading
US20080129538A1 (en) 1999-02-23 2008-06-05 Raj Vaswani Electronic electric meter for networked meter reading
US6088659A (en) 1997-09-11 2000-07-11 Abb Power T&D Company Inc. Automated meter reading system
AU9480798A (en) 1997-09-12 1999-03-29 Williams Wireless, Inc. Wide area remote telemetry
US6631402B1 (en) 1997-09-26 2003-10-07 Worldcom, Inc. Integrated proxy interface for web based report requester tool set
US20020120569A1 (en) 1997-10-16 2002-08-29 Day Mark E. System and method for communication between remote locations
US5986574A (en) 1997-10-16 1999-11-16 Peco Energy Company System and method for communication between remote locations
US6711166B1 (en) 1997-12-10 2004-03-23 Radvision Ltd. System and method for packet network trunking
SE9801172D0 (en) 1998-04-01 1998-04-01 Ericsson Telefon Ab L M Cell selection in a system with different cell capabilities
NO309550B1 (en) 1998-04-07 2001-02-12 It & Process As System for controlling the power consumption of a user of electrical power
US6778099B1 (en) 1998-05-01 2004-08-17 Elster Electricity, Llc Wireless area network communications module for utility meters
US6122603A (en) 1998-05-29 2000-09-19 Powerweb, Inc. Multi-utility energy control system with dashboard
US6311105B1 (en) 1998-05-29 2001-10-30 Powerweb, Inc. Multi-utility energy control system
US6553355B1 (en) 1998-05-29 2003-04-22 Indranet Technologies Limited Autopoietic network system endowed with distributed artificial intelligence for the supply of high volume high-speed multimedia telesthesia telemetry, telekinesis, telepresence, telemanagement, telecommunications, and data processing services
US6445691B2 (en) 1998-06-08 2002-09-03 Koninklijke Philips Electronics N. V. Wireless coupling of standardized networks and non-standardized nodes
US6914533B2 (en) 1998-06-22 2005-07-05 Statsignal Ipc Llc System and method for accessing residential monitoring devices
US6914893B2 (en) 1998-06-22 2005-07-05 Statsignal Ipc, Llc System and method for monitoring and controlling remote devices
US6028522A (en) 1998-10-14 2000-02-22 Statsignal Systems, Inc. System for monitoring the light level around an ATM
US6522974B2 (en) 2000-03-01 2003-02-18 Westerngeco, L.L.C. Method for vibrator sweep analysis and synthesis
US6891838B1 (en) 1998-06-22 2005-05-10 Statsignal Ipc, Llc System and method for monitoring and controlling residential devices
US6218953B1 (en) 1998-10-14 2001-04-17 Statsignal Systems, Inc. System and method for monitoring the light level around an ATM
US6437692B1 (en) 1998-06-22 2002-08-20 Statsignal Systems, Inc. System and method for monitoring and controlling remote devices
US6304556B1 (en) 1998-08-24 2001-10-16 Cornell Research Foundation, Inc. Routing and mobility management protocols for ad-hoc networks
US6665620B1 (en) 1998-08-26 2003-12-16 Siemens Transmission & Distribution, Llc Utility meter having primary and secondary communication circuits
US6826620B1 (en) 1998-08-26 2004-11-30 Paradyne Corporation Network congestion control system and method
US6246689B1 (en) 1998-09-21 2001-06-12 Lucent Technologies Inc. Method and apparatus for efficient topology aggregation for networks with hierarchical structure
US20020013679A1 (en) 1998-10-14 2002-01-31 Petite Thomas D. System and method for monitoring the light level in a lighted area
US7103511B2 (en) 1998-10-14 2006-09-05 Statsignal Ipc, Llc Wireless communication networks for providing remote monitoring of devices
US6480497B1 (en) 1998-11-23 2002-11-12 Ricochet Networks, Inc. Method and apparatus for maximizing data throughput in a packet radio mesh network
US6636894B1 (en) 1998-12-08 2003-10-21 Nomadix, Inc. Systems and methods for redirecting users having transparent computer access to a network using a gateway device having redirection capability
US6718137B1 (en) 1999-01-05 2004-04-06 Ciena Corporation Method and apparatus for configuration by a first network element based on operating parameters of a second network element
US20080136667A1 (en) 1999-02-23 2008-06-12 Raj Vaswani Network for automated meter reading
EP1169691A1 (en) 1999-03-12 2002-01-09 Graviton, Inc. Systems and methods for network based sensing and distributed sensor, data and memory management
US20040183687A1 (en) 1999-03-18 2004-09-23 Petite Thomas D. System and method for signaling a weather alert condition to a residential environment
US6747557B1 (en) 1999-03-18 2004-06-08 Statsignal Systems, Inc. System and method for signaling a weather alert condition to a residential environment
US7650425B2 (en) 1999-03-18 2010-01-19 Sipco, Llc System and method for controlling communication between a host computer and communication devices associated with remote devices in an automated monitoring system
US7263073B2 (en) 1999-03-18 2007-08-28 Statsignal Ipc, Llc Systems and methods for enabling a mobile user to notify an automated monitoring system of an emergency situation
US6751672B1 (en) 1999-06-02 2004-06-15 Nortel Networks Limited Efficient dynamic home agent discovery algorithm and system
US6300881B1 (en) 1999-06-09 2001-10-09 Motorola, Inc. Data transfer system and method for communicating utility consumption data over power line carriers
US7231482B2 (en) 2000-06-09 2007-06-12 Universal Smart Technologies, Llc. Method and system for monitoring and transmitting utility status via universal communications interface
US7185131B2 (en) 1999-06-10 2007-02-27 Amron Technologies, Inc. Host-client utility meter systems and methods for communicating with the same
US6954814B1 (en) 1999-06-10 2005-10-11 Amron Technologies Inc. Method and system for monitoring and transmitting utility status via universal communications interface
US6725281B1 (en) 1999-06-11 2004-04-20 Microsoft Corporation Synchronization of controlled device state using state table and eventing in data-driven remote device control model
US6681110B1 (en) 1999-07-02 2004-01-20 Musco Corporation Means and apparatus for control of remote electrical devices
US6691173B2 (en) 1999-07-06 2004-02-10 Widcomm, Inc. Distributed management of an extended network containing short-range wireless links
US6785592B1 (en) 1999-07-16 2004-08-31 Perot Systems Corporation System and method for energy management
US6980973B1 (en) 1999-09-07 2005-12-27 Visa International Service Association Self-paying smart utility meter and payment service
US6751455B1 (en) 1999-09-17 2004-06-15 The Regents Of The University Of California Power- and bandwidth-adaptive in-home wireless communications system with power-grid-powered agents and battery-powered clients
US6976062B1 (en) 1999-09-22 2005-12-13 Intermec Ip Corp. Automated software upgrade utility
WO2001026332A2 (en) 1999-10-06 2001-04-12 Sensoria Corporation Apparatus for vehicle internetworks
US7020701B1 (en) 1999-10-06 2006-03-28 Sensoria Corporation Method for collecting and processing data using internetworked wireless integrated network sensors (WINS)
US6904025B1 (en) 1999-10-12 2005-06-07 Telefonaktiebolaget Lm Ericsson (Publ) Wide area network mobility for IP based networks
US7315257B2 (en) 1999-10-16 2008-01-01 Datamatic, Ltd. Automated meter reader having high product delivery rate alert generator
US6710721B1 (en) 1999-10-16 2004-03-23 Datamatic Inc. Radio frequency automated meter reading device
US7042368B2 (en) 1999-10-16 2006-05-09 Datamatic, Ltd Automated meter reader device having optical sensor with automatic gain control
US20060028355A1 (en) 1999-10-16 2006-02-09 Tim Patterson Automated meter reader having peak product delivery rate generator
ATE287101T1 (en) 1999-11-01 2005-01-15 Abb Research Ltd INTEGRATION OF A FIELD CONTROL DEVICE INTO A PLANT CONTROL SYSTEM
US6909705B1 (en) 1999-11-02 2005-06-21 Cello Partnership Integrating wireless local loop networks with cellular networks
US6697331B1 (en) 1999-11-17 2004-02-24 Telefonaktiebolaget Lm Ericsson (Publ) Link layer acknowledgement and retransmission for cellular telecommunications
EP1107508A1 (en) 1999-12-06 2001-06-13 Telefonaktiebolaget Lm Ericsson System, method and computer program product for sending broadcast messages
US6975613B1 (en) 1999-12-06 2005-12-13 Telefonaktiebolaget L M Ericsson (Publ) System and method for scheduling communication sessions in an ad-hoc network
US6535498B1 (en) 1999-12-06 2003-03-18 Telefonaktiebolaget Lm Ericsson (Publ) Route updating in ad-hoc networks
US6480505B1 (en) 1999-12-06 2002-11-12 Telefonaktiebolaget Lm Ericsson (Publ) Batched fair exhaustive polling scheduler
US6711409B1 (en) 1999-12-15 2004-03-23 Bbnt Solutions Llc Node belonging to multiple clusters in an ad hoc wireless network
US6885309B1 (en) 2000-06-01 2005-04-26 Cellnet Innovations, Inc. Meter to internet pathway
US6577671B1 (en) 1999-12-29 2003-06-10 Nokia Mobile Phones Limited Enhanced code allocation method for CDMA systems
US6298053B1 (en) 2000-01-14 2001-10-02 Metricom, Inc. Method and apparatus for connection handoff between connected radios
US7213063B2 (en) 2000-01-18 2007-05-01 Lucent Technologies Inc. Method, apparatus and system for maintaining connections between computers using connection-oriented protocols
US7379981B2 (en) 2000-01-31 2008-05-27 Kenneth W. Garrard Wireless communication enabled meter and network
US8019836B2 (en) 2002-01-02 2011-09-13 Mesh Comm, Llc Wireless communication enabled meter and network
AU2001234669A1 (en) 2000-01-31 2001-08-07 Telemetry Technologies, Inc. Wireless communication enabled meter and network
US20010033554A1 (en) 2000-02-18 2001-10-25 Arun Ayyagari Proxy-bridge connecting remote users to a limited connectivity network
US6865185B1 (en) 2000-02-25 2005-03-08 Cisco Technology, Inc. Method and system for queuing traffic in a wireless communications network
US6369769B1 (en) 2000-02-25 2002-04-09 Innovatec Communications, Llc Flush mounted pit lid antenna
US6845091B2 (en) 2000-03-16 2005-01-18 Sri International Mobile ad hoc extensions for the internet
US6775258B1 (en) 2000-03-17 2004-08-10 Nokia Corporation Apparatus, and associated method, for routing packet data in an ad hoc, wireless communication system
GB0007266D0 (en) 2000-03-25 2000-05-17 Hewlett Packard Co Providing location data about a mobile entity
US7062361B1 (en) 2000-05-02 2006-06-13 Mark E. Lane Method and apparatus for controlling power consumption
US6933857B2 (en) 2000-05-05 2005-08-23 Charles A. Foote Method and system for airborne meter communication
US20020066095A1 (en) 2000-05-12 2002-05-30 Yueh-O Yu Process and device for updating personalized products
US6880086B2 (en) 2000-05-20 2005-04-12 Ciena Corporation Signatures for facilitating hot upgrades of modular software components
US7487282B2 (en) 2000-06-09 2009-02-03 Leach Mark A Host-client utility meter systems and methods for communicating with the same
US6900738B2 (en) 2000-06-21 2005-05-31 Henry Crichlow Method and apparatus for reading a meter and providing customer service via the internet
US6519509B1 (en) 2000-06-22 2003-02-11 Stonewater Software, Inc. System and method for monitoring and controlling energy distribution
US7072945B1 (en) 2000-06-30 2006-07-04 Nokia Corporation Network and method for controlling appliances
US6633823B2 (en) 2000-07-13 2003-10-14 Nxegen, Inc. System and method for monitoring and controlling energy usage
US7197046B1 (en) 2000-08-07 2007-03-27 Shrikumar Hariharasubrahmanian Systems and methods for combined protocol processing protocols
US6836737B2 (en) 2000-08-09 2004-12-28 Statsignal Systems, Inc. Systems and methods for providing remote monitoring of consumption for a utility meter
US6829216B1 (en) 2000-08-18 2004-12-07 Hitachi Telecom (U.S.A.), Inc. Method and system for designing a network
US7200633B2 (en) * 2000-08-25 2007-04-03 Ntt Docomo, Inc. Information delivery system and information delivery method
US6728514B2 (en) 2000-09-08 2004-04-27 Wi-Lan Inc. Scalable wireless network topology systems and methods
US20020031101A1 (en) 2000-11-01 2002-03-14 Petite Thomas D. System and methods for interconnecting remote devices in an automated monitoring system
US7016336B2 (en) 2000-11-22 2006-03-21 Telefonaktiebolaget L M Ericsson (Publ) Administrative domains for personal area networks
US20070136817A1 (en) 2000-12-07 2007-06-14 Igt Wager game license management in a peer gaming network
US6965575B2 (en) 2000-12-29 2005-11-15 Tropos Networks Selection of routing paths based upon path quality of a wireless mesh network
US6842706B1 (en) 2001-01-17 2005-01-11 Smart Disaster Response Technologies, Inc. Methods, apparatus, media, and signals for managing utility usage
US6946972B2 (en) 2001-01-25 2005-09-20 Smartsynch, Inc. Systems and methods for wirelessly transmitting data from a utility meter
US6671635B1 (en) 2001-02-23 2003-12-30 Power Measurement Ltd. Systems for improved monitoring accuracy of intelligent electronic devices
BR0204473A (en) 2001-03-12 2003-05-13 Koninkl Philips Electronics Nv Receiver device for securely storing a content item, playback device for reproducing a content item stored on a storage medium, and computer program product
JP3700596B2 (en) 2001-03-14 2005-09-28 日本電気株式会社 Communication network, path setting method, and path setting program
US7266085B2 (en) 2001-03-21 2007-09-04 Stine John A Access and routing protocol for ad hoc network using synchronous collision resolution and node state dissemination
AUPR441401A0 (en) 2001-04-12 2001-05-17 Gladwin, Paul Utility usage rate monitor
EP1393022B1 (en) 2001-05-02 2011-04-06 Invensys Metering Systems/North America Inc. Add-on module for utility meters
AR033319A1 (en) 2001-05-04 2003-12-10 Invensys Metering Systems Nort PROVISION AND METHOD FOR COMMUNICATION AND CONTROL OF AUTOMATED METER READING
US20020186619A1 (en) 2001-05-07 2002-12-12 Reeves Michael H. Apparatus, system and method for synchronizing a clock with a master time service
US20030156715A1 (en) * 2001-06-12 2003-08-21 Reeds James Alexander Apparatus, system and method for validating integrity of transmitted data
US7009493B2 (en) 2001-06-22 2006-03-07 Matsushita Electric Works, Ltd. Electronic device with paging for energy curtailment and code generation for manual verification of curtailment
US6999441B2 (en) 2001-06-27 2006-02-14 Ricochet Networks, Inc. Method and apparatus for contention management in a radio-based packet network
US6509801B1 (en) 2001-06-29 2003-01-21 Sierra Monolithics, Inc. Multi-gigabit-per-sec clock recovery apparatus and method for optical communications
US7076244B2 (en) * 2001-07-23 2006-07-11 Research In Motion Limited System and method for pushing information to a mobile device
US7277414B2 (en) 2001-08-03 2007-10-02 Honeywell International Inc. Energy aware network management
US7346463B2 (en) 2001-08-09 2008-03-18 Hunt Technologies, Llc System for controlling electrically-powered devices in an electrical network
US6993571B2 (en) 2001-08-16 2006-01-31 International Business Machines Corporation Power conservation in a server cluster
US6993417B2 (en) 2001-09-10 2006-01-31 Osann Jr Robert System for energy sensing analysis and feedback
KR100452508B1 (en) 2001-09-25 2004-10-12 엘지전자 주식회사 remote detecting equipment using CO-LINE and controlling method therefore
US7362709B1 (en) 2001-11-02 2008-04-22 Arizona Board Of Regents Agile digital communication network with rapid rerouting
US20030123394A1 (en) 2001-11-13 2003-07-03 Ems Technologies, Inc. Flow control between performance enhancing proxies over variable bandwidth split links
US6829347B1 (en) 2001-12-14 2004-12-07 Nortel Networks Limited Constraint based routing
US7106757B2 (en) 2001-12-19 2006-09-12 Intel Corporation System and method for streaming multimedia over packet networks
ITMI20012726A1 (en) 2001-12-20 2003-06-20 Enel Distribuzione Spa SYSTEM OF REMOTE CONSUMPTION OF CONSUMPTION AND REMOTE MANAGEMENT OF USERS ALSO DISTRIBUTED OF A DOMESTIC TYPE
US7609673B2 (en) 2002-02-08 2009-10-27 Telefonaktiebolaget Lm Ericsson (Publ) Packet-based conversational service for a multimedia session in a mobile communications system
US6744740B2 (en) 2001-12-21 2004-06-01 Motorola, Inc. Network protocol for wireless devices utilizing location information
US6714787B2 (en) 2002-01-17 2004-03-30 Motorola, Inc. Method and apparatus for adapting a routing map for a wireless communications network
US7626508B2 (en) 2002-03-05 2009-12-01 Aeromesh Corporation Monitoring system and method
US6985087B2 (en) 2002-03-15 2006-01-10 Qualcomm Inc. Method and apparatus for wireless remote telemetry using ad-hoc networks
US6801865B2 (en) 2002-03-21 2004-10-05 Engage Networks, Inc. Meter monitoring and tamper protection system and method
US6831921B2 (en) 2002-03-27 2004-12-14 James A. Higgins Wireless internet access system
CN1656661A (en) 2002-03-28 2005-08-17 罗伯绍控制器公司 Energy management system and method
US7230544B2 (en) 2002-04-22 2007-06-12 Cellnet Innovations, Inc. Intelligent two-way telemetry
US20040082203A1 (en) 2002-05-07 2004-04-29 Oleg Logvinov Method and apparatus for power theft prevention based on TDR or FDR signature monitoring on LV and MV power lines
AU2003239385A1 (en) 2002-05-10 2003-11-11 Richard R. Reisman Method and apparatus for browsing using multiple coordinated device
US20030212821A1 (en) * 2002-05-13 2003-11-13 Kiyon, Inc. System and method for routing packets in a wired or wireless network
US7561977B2 (en) 2002-06-13 2009-07-14 Whirlpool Corporation Total home energy management system
US7119713B2 (en) 2002-06-27 2006-10-10 Elster Electricity, Llc Dynamic self-configuring metering network
US20040113810A1 (en) 2002-06-28 2004-06-17 Mason Robert T. Data collector for an automated meter reading system
GB0218452D0 (en) 2002-08-08 2002-09-18 Lal Depak Energy consumption monitoring
DE10237782A1 (en) * 2002-08-17 2004-02-26 Daimlerchrysler Ag Combined spare seat and resting area for single lorry driver traveling long distances, comprising folding seat, folding sleeping area and storage unit
US7069438B2 (en) 2002-08-19 2006-06-27 Sowl Associates, Inc. Establishing authenticated network connections
US7324453B2 (en) 2002-08-30 2008-01-29 Alcatel Lucent Constraint-based shortest path first method for dynamically switched optical transport networks
US7009379B2 (en) 2002-09-12 2006-03-07 Landis & Gyr, Inc. Electricity meter with power supply load management
WO2004030152A2 (en) 2002-09-30 2004-04-08 Basic Resources, Inc. Outage notification device and method
CN1322722C (en) 2002-10-11 2007-06-20 诺基亚公司 Dynamic tunneling peering with performance optimization
US6995666B1 (en) 2002-10-16 2006-02-07 Luttrell Clyde K Cellemetry-operated railroad switch heater
US7599323B2 (en) * 2002-10-17 2009-10-06 Alcatel-Lucent Usa Inc. Multi-interface mobility client
WO2004047382A1 (en) 2002-11-20 2004-06-03 Fujitsu Limited Radio terminal apparatus
JP3773049B2 (en) 2002-11-28 2006-05-10 ヤマハ株式会社 A musical tone attenuation rate control device that generates decibel linear attenuation rate data according to the position of the knob.
US20040117788A1 (en) 2002-12-11 2004-06-17 Jeyhan Karaoguz Method and system for TV interface for coordinating media exchange with a media peripheral
US20040125776A1 (en) 2002-12-26 2004-07-01 Haugli Hans C. Peer-to-peer wireless data communication system with progressive dynamic routing
US7366113B1 (en) 2002-12-27 2008-04-29 At & T Corp. Adaptive topology discovery in communication networks
US6859186B2 (en) 2003-02-03 2005-02-22 Silver Spring Networks, Inc. Flush-mounted antenna and transmission system
US7174170B2 (en) 2003-02-12 2007-02-06 Nortel Networks Limited Self-selection of radio frequency channels to reduce co-channel and adjacent channel interference in a wireless distributed network
US20070013547A1 (en) 2003-02-14 2007-01-18 Boaz Jon A Automated meter reading system, communication and control network from automated meter reading, meter data collector, and associated methods
US7304587B2 (en) 2003-02-14 2007-12-04 Energy Technology Group, Inc. Automated meter reading system, communication and control network for automated meter reading, meter data collector program product, and associated methods
US7400264B2 (en) 2003-02-14 2008-07-15 Energy Technology Group, Inc. Automated meter reading system, communication and control network for automated meter reading, meter data collector, and associated methods
US20040185845A1 (en) * 2003-02-28 2004-09-23 Microsoft Corporation Access point to access point range extension
US7406298B2 (en) 2003-03-25 2008-07-29 Silver Spring Networks, Inc. Wireless communication system
US7089089B2 (en) 2003-03-31 2006-08-08 Power Measurement Ltd. Methods and apparatus for retrieving energy readings from an energy monitoring device
US7664806B1 (en) * 2003-04-22 2010-02-16 At&T Corp. Routing XML queries
US7010363B2 (en) 2003-06-13 2006-03-07 Battelle Memorial Institute Electrical appliance energy consumption control methods and electrical energy consumption systems
US7533184B2 (en) * 2003-06-13 2009-05-12 Microsoft Corporation Peer-to-peer name resolution wire protocol and message format data structure for use therein
US7562024B2 (en) 2003-06-18 2009-07-14 Hewlett-Packard Development Company, L.P. Method and system for addressing client service outages
US20070169074A1 (en) 2003-07-07 2007-07-19 Ja-In Koo Upgrade apparatus and its method for home network system
US7701858B2 (en) 2003-07-17 2010-04-20 Sensicast Systems Method and apparatus for wireless communication in a mesh network
US7321316B2 (en) 2003-07-18 2008-01-22 Power Measurement, Ltd. Grouping mesh clusters
US7251570B2 (en) 2003-07-18 2007-07-31 Power Measurement Ltd. Data integrity in a mesh network
KR100547788B1 (en) 2003-07-31 2006-01-31 삼성전자주식회사 High speed personal wireless network and data transmission method capable of communication between devices of piconets
JP4218451B2 (en) 2003-08-05 2009-02-04 株式会社日立製作所 License management system, server device and terminal device
US7336642B2 (en) 2003-08-07 2008-02-26 Skypilot Networks, Inc. Communication protocol for a wireless mesh architecture
WO2005033964A1 (en) 2003-09-05 2005-04-14 Itron, Inc. Synchronizing and controlling software downloads, such as for utility meter-reading data collection and processing
US20050055432A1 (en) 2003-09-08 2005-03-10 Smart Synch, Inc. Systems and methods for remote power management using 802.11 wireless protocols
US7289887B2 (en) 2003-09-08 2007-10-30 Smartsynch, Inc. Systems and methods for remote power management using IEEE 802 based wireless communication links
JP4139758B2 (en) 2003-09-29 2008-08-27 関西電力株式会社 Path setting method and network, relay station, and master station that employ the path setting method
US7324824B2 (en) 2003-12-09 2008-01-29 Awarepoint Corporation Wireless network monitoring system
KR100640327B1 (en) 2003-11-24 2006-10-30 삼성전자주식회사 The Frame Structure and Data Transmission Method for Bridge Operation of WPAN
US7215926B2 (en) 2003-12-05 2007-05-08 Microsoft Corporation Enhanced mode technique for growing mesh networks
KR100547849B1 (en) 2003-12-05 2006-01-31 삼성전자주식회사 Frame Structure for Selecting Bridge Device in WPAN and Method for Selecting Bridge Device in WPAN
WO2005060127A1 (en) 2003-12-19 2005-06-30 Nokia Corporation Selection of radio resources in a wireless communication device
US7317404B2 (en) 2004-01-14 2008-01-08 Itron, Inc. Method and apparatus for collecting and displaying consumption data from a meter reading system
US7802015B2 (en) 2004-01-26 2010-09-21 Tantalus Systems Corp. Communications system of heterogeneous elements
GB2412193A (en) 2004-03-19 2005-09-21 Matsushita Electric Ind Co Ltd Reprogramming a non-volatile memory system.
US7626990B2 (en) * 2004-05-07 2009-12-01 Samsung Electronics Co., Ltd. Packet counters and packet adders for traffic profiling in a multiprocessor router
JP4033302B2 (en) * 2004-05-07 2008-01-16 株式会社ソニー・コンピュータエンタテインメント Wireless communication terminal device, wireless interface device, and wireless network participation method
US20050251403A1 (en) 2004-05-10 2005-11-10 Elster Electricity, Llc. Mesh AMR network interconnecting to TCP/IP wireless mesh network
JP4449588B2 (en) 2004-06-09 2010-04-14 ソニー株式会社 Wireless communication system, wireless communication apparatus, wireless communication method, and computer program
US7847706B1 (en) 2004-06-23 2010-12-07 Wireless Telematics Llc Wireless electrical apparatus controller device and method of use
WO2006012211A2 (en) * 2004-06-24 2006-02-02 Meshnetworks, Inc. A system and method for adaptive rate selection for wireless networks
JP4445351B2 (en) 2004-08-31 2010-04-07 株式会社東芝 Semiconductor module
US7590589B2 (en) 2004-09-10 2009-09-15 Hoffberg Steven M Game theoretic prioritization scheme for mobile ad hoc networks permitting hierarchal deference
US7554941B2 (en) 2004-09-10 2009-06-30 Nivis, Llc System and method for a wireless mesh network
US7627283B2 (en) 2004-09-10 2009-12-01 Nivis, Llc System and method for a wireless mesh network of configurable signage
US7263371B2 (en) 2004-09-13 2007-08-28 Lucent Technologies Inc. Method for controlling paging and registration of a mobile device in a wireless communications system
US7170425B2 (en) 2004-09-24 2007-01-30 Elster Electricity, Llc System and method for creating multiple operating territories within a meter reading system
US7349355B2 (en) 2004-10-27 2008-03-25 Intel Corporation Methods and apparatus for providing a communication proxy system
US7369856B2 (en) 2004-11-24 2008-05-06 Intel Corporation Method and system to support fast hand-over of mobile subscriber stations in broadband wireless networks
US8050248B2 (en) * 2004-12-17 2011-11-01 Telefonaktiebolaget Lm Ericsson (Publ) Retransmission in wireless communication systems
US8060683B2 (en) 2004-12-17 2011-11-15 International Business Machines Corporation System, method and program to preserve a cache of a virtual machine
US7327998B2 (en) 2004-12-22 2008-02-05 Elster Electricity, Llc System and method of providing a geographic view of nodes in a wireless network
US7428229B2 (en) 2004-12-28 2008-09-23 Motorola, Inc. Ad hoc cluster idle node coordination
US7697459B2 (en) 2005-01-05 2010-04-13 Intel Corporation Methods and apparatus for identifying a distance-vector route associated with a wireless mesh network
US7626967B2 (en) 2005-01-05 2009-12-01 Intel Corporation Methods and apparatus for providing a transparent bridge associated with a wireless mesh network
GB2439490B (en) 2005-03-08 2008-12-17 Radio Usa Inc E Systems and methods for modifying power usage
US20060215673A1 (en) 2005-03-11 2006-09-28 Interdigital Technology Corporation Mesh network configured to autonomously commission a network and manage the network topology
US7308370B2 (en) 2005-03-22 2007-12-11 Elster Electricity Llc Using a fixed network wireless data collection system to improve utility responsiveness to power outages
US8599822B2 (en) 2005-03-23 2013-12-03 Cisco Technology, Inc. Slot-based transmission synchronization mechanism in wireless mesh networks
EP1710764A1 (en) 2005-04-07 2006-10-11 Sap Ag Authentication of products using identification tags
US7676231B2 (en) 2005-04-13 2010-03-09 Intel Corporation Methods and apparatus for selecting communication channels based on channel load information
US7522540B1 (en) 2005-04-15 2009-04-21 Nvidia Corporation Extended service set mesh topology discovery
US7814322B2 (en) 2005-05-03 2010-10-12 Sri International Discovery and authentication scheme for wireless mesh networks
KR100737854B1 (en) 2005-05-10 2007-07-12 삼성전자주식회사 Optimal path routing method in Wireless Network
US7539882B2 (en) 2005-05-30 2009-05-26 Rambus Inc. Self-powered devices and methods
US20070036353A1 (en) 2005-05-31 2007-02-15 Interdigital Technology Corporation Authentication and encryption methods using shared secret randomness in a joint channel
US7274975B2 (en) 2005-06-06 2007-09-25 Gridpoint, Inc. Optimized energy management system
DE602005002259T2 (en) 2005-06-30 2008-05-21 Ntt Docomo Inc. Apparatus and method for improved handoff in mesh networks
US7539151B2 (en) 2005-06-30 2009-05-26 Intel Corporation Channel selection for mesh networks having nodes with multiple radios
CA2616587C (en) 2005-07-20 2017-07-11 Firetide, Inc. Route optimization for on-demand routing protocols for mesh networks
US20070060147A1 (en) * 2005-07-25 2007-03-15 Shin Young S Apparatus for transmitting data packets between wireless sensor networks over internet, wireless sensor network domain name server, and data packet transmission method using the same
US7602747B2 (en) 2005-07-29 2009-10-13 Intel Corporation Systems and methods increased mobility among mobile nodes in a wireless network
US7106044B1 (en) 2005-08-02 2006-09-12 General Electric Company Systems, methods, and apparatuses for detecting residential electricity theft in firmware
US7400253B2 (en) 2005-08-04 2008-07-15 Mhcmos, Llc Harvesting ambient radio frequency electromagnetic energy for powering wireless electronic devices, sensors and sensor networks and applications thereof
US7583984B2 (en) 2005-08-12 2009-09-01 Lg Electronics Inc. Method of providing notification for battery power conservation in a wireless system
US7495578B2 (en) 2005-09-02 2009-02-24 Elster Electricity, Llc Multipurpose interface for an automated meter reading device
US7333903B2 (en) 2005-09-12 2008-02-19 Acuity Brands, Inc. Light management system having networked intelligent luminaire managers with enhanced diagnostics capabilities
US8874477B2 (en) 2005-10-04 2014-10-28 Steven Mark Hoffberg Multifactorial optimization system and method
US7498873B2 (en) 2005-11-02 2009-03-03 Rosom Corporation Wide-lane pseudorange measurements using FM signals
US7814478B2 (en) 2005-11-09 2010-10-12 Texas Instruments Norway As Methods and apparatus for use in updating application programs in memory of a network device
ES2366373T3 (en) * 2005-11-09 2011-10-19 Thomson Licensing ROUTE SELECTION IN WIRELESS NETWORKS.
US7756538B2 (en) 2005-11-09 2010-07-13 Motorola, Inc. Wide area network handset assisted content delivery system and method of using same
US20070110024A1 (en) 2005-11-14 2007-05-17 Cisco Technology, Inc. System and method for spanning tree cross routes
US7962101B2 (en) 2005-11-17 2011-06-14 Silver Spring Networks, Inc. Method and system for providing a routing protocol for wireless networks
KR20130036332A (en) 2005-11-17 2013-04-11 실버 스프링 네트웍스, 인코포레이티드 Method and system for providing a network protocol for utility services
US7623043B2 (en) 2005-12-19 2009-11-24 General Electric Company Method and system for metering consumption of energy
US20070147268A1 (en) 2005-12-23 2007-06-28 Elster Electricity, Llc Distributing overall control of mesh AMR LAN networks to WAN interconnected collectors
US8626178B2 (en) 2006-01-31 2014-01-07 Niels Thybo Johansen Audio-visual system control using a mesh network
US20070177576A1 (en) 2006-01-31 2007-08-02 Niels Thybo Johansen Communicating metadata through a mesh network
US7680041B2 (en) 2006-01-31 2010-03-16 Zensys A/S Node repair in a mesh network
US20080151795A1 (en) 2006-01-31 2008-06-26 Peter Shorty Home electrical device control within a wireless mesh network
US8194569B2 (en) 2006-01-31 2012-06-05 Sigma Designs, Inc. Static update controller enablement in a mesh network
US20080165712A1 (en) 2006-01-31 2008-07-10 Peter Shorty Home electrical device control within a wireless mesh network
US8626251B2 (en) 2006-01-31 2014-01-07 Niels Thybo Johansen Audio-visual system energy savings using a mesh network
US8300652B2 (en) 2006-01-31 2012-10-30 Sigma Designs, Inc. Dynamically enabling a secondary channel in a mesh network
US8219705B2 (en) 2006-01-31 2012-07-10 Sigma Designs, Inc. Silent acknowledgement of routing in a mesh network
US20080170511A1 (en) 2006-01-31 2008-07-17 Peter Shorty Home electrical device control within a wireless mesh network
US20080159213A1 (en) 2006-01-31 2008-07-03 Peter Shorty Home electrical device control within a wireless mesh network
US20080151824A1 (en) 2006-01-31 2008-06-26 Peter Shorty Home electrical device control within a wireless mesh network
US8509790B2 (en) 2006-01-31 2013-08-13 Tommas Jess Christensen Multi-speed mesh networks
US8223783B2 (en) 2006-01-31 2012-07-17 Sigma Designs, Inc. Using battery-powered nodes in a mesh network
US20080154396A1 (en) 2006-01-31 2008-06-26 Peter Shorty Home electrical device control within a wireless mesh network
US9166812B2 (en) 2006-01-31 2015-10-20 Sigma Designs, Inc. Home electrical device control within a wireless mesh network
US20080151825A1 (en) 2006-01-31 2008-06-26 Peter Shorty Home electrical device control within a wireless mesh network
US20070257813A1 (en) 2006-02-03 2007-11-08 Silver Spring Networks Secure network bootstrap of devices in an automatic meter reading network
US7427927B2 (en) 2006-02-16 2008-09-23 Elster Electricity, Llc In-home display communicates with a fixed network meter reading system
US7545285B2 (en) 2006-02-16 2009-06-09 Elster Electricity, Llc Load control unit in communication with a fixed network meter reading system
US7729496B2 (en) 2006-02-28 2010-06-01 International Business Machines Corporation Efficient key updates in encrypted database systems
US20070206521A1 (en) 2006-03-05 2007-09-06 Osaje Emeke E Wireless Utility Monitoring And Control Mesh Network
US7936681B2 (en) 2006-03-06 2011-05-03 Cisco Technology, Inc. Cross-layer design techniques for interference-aware routing configuration in wireless mesh networks
US7768926B2 (en) 2006-03-09 2010-08-03 Firetide, Inc. Effective bandwidth path metric and path computation method for wireless mesh networks with wired links
US8738013B2 (en) * 2006-04-24 2014-05-27 Marvell World Trade Ltd. 802.11 mesh architecture
US7958032B2 (en) 2006-05-10 2011-06-07 International Business Machines Corporation Generating event messages corresponding to event indicators
US7548907B2 (en) 2006-05-11 2009-06-16 Theresa Wall Partitioning electrical data within a database
WO2007132473A1 (en) 2006-05-17 2007-11-22 Tanla Solutions Limited Automated meter reading system and method thereof
US8103389B2 (en) 2006-05-18 2012-01-24 Gridpoint, Inc. Modular energy control system
EP2039088A4 (en) 2006-07-03 2012-02-15 Tanla Solutions Ltd Home security system using an ad-hoc wireless mesh and method thereof
US7843842B2 (en) * 2006-08-04 2010-11-30 Cisco Technology, Inc. Method and system for initiating a remote trace route
US20080032703A1 (en) 2006-08-07 2008-02-07 Microsoft Corporation Location based notification services
US7548826B2 (en) 2006-08-24 2009-06-16 Blue Pillar, Inc. Power monitoring and testing
US20080074285A1 (en) 2006-08-31 2008-03-27 Guthrie Kevin D Interface between meter and application (IMA)
US7707415B2 (en) 2006-09-07 2010-04-27 Motorola, Inc. Tunneling security association messages through a mesh network
US8138944B2 (en) 2006-09-15 2012-03-20 Itron, Inc. Home area networking (HAN) with handheld for diagnostics
US7843834B2 (en) 2006-09-15 2010-11-30 Itron, Inc. Use of minimal propagation delay path to optimize a mesh network
US8055461B2 (en) 2006-09-15 2011-11-08 Itron, Inc. Distributing metering responses for load balancing an AMR network
WO2008036756A2 (en) 2006-09-19 2008-03-27 Firetide, Inc. A multi-channel assignment method for multi-radio multi-hop wireless mesh networks
US7720010B2 (en) 2006-09-29 2010-05-18 Cisco Technology, Inc. Tree based wireless mesh for an OSPF network with intra-tree communication optimization
US20080177678A1 (en) 2007-01-24 2008-07-24 Paul Di Martini Method of communicating between a utility and its customer locations
US8155007B2 (en) 2007-01-25 2012-04-10 Cisco Technology, Inc. Path optimization for mesh access points in a wireless mesh network
US7853417B2 (en) 2007-01-30 2010-12-14 Silver Spring Networks, Inc. Methods and system for utility network outage detection
US8489716B2 (en) 2007-02-02 2013-07-16 Silver Spring Networks, Inc. Method and system of providing network addresses to in-premise devices in a utility network
AU2008210195B2 (en) 2007-02-02 2013-09-12 Aztech Associates Inc. Utility monitoring device, system and method
US7957322B2 (en) 2007-02-02 2011-06-07 Silver Sring Networks, Inc. Flow-through provisioning in utility AMR/AMI networks
US8023482B2 (en) 2007-03-15 2011-09-20 Cisco Technology, Inc. Dynamic rate limiting in wireless mesh networks
US7859477B2 (en) 2007-03-30 2010-12-28 Silver Spring Networks, Inc. J-pole antenna
US8230108B2 (en) 2007-04-13 2012-07-24 Hart Communication Foundation Routing packets on a network using directed graphs
US8233905B2 (en) 2007-06-15 2012-07-31 Silver Spring Networks, Inc. Load management in wireless mesh communications networks
US8189577B2 (en) 2007-06-15 2012-05-29 Silver Spring Networks, Inc. Network utilities in wireless mesh communications networks
US8072951B2 (en) 2007-06-15 2011-12-06 Silver Spring Networks, Inc. Method and system for providing routing protocols in a frequency hopping spread spectrum network
US8130700B2 (en) 2007-06-15 2012-03-06 Silver Spring Networks, Inc. Method and system for providing network and routing protocols for utility services
US7940669B2 (en) 2007-06-15 2011-05-10 Silver Spring Networks, Inc. Route and link evaluation in wireless mesh communications networks
US7769888B2 (en) 2007-06-15 2010-08-03 Silver Spring Networks, Inc. Method and system for providing network and routing protocols for utility services
US20090003356A1 (en) 2007-06-15 2009-01-01 Silver Spring Networks, Inc. Node discovery and culling in wireless mesh communications networks
US20080317047A1 (en) 2007-06-20 2008-12-25 Motorola, Inc. Method for discovering a route to a peer node in a multi-hop wireless mesh network
US20090010178A1 (en) 2007-07-03 2009-01-08 Digi International Inc. Cordless mains powered form factor for mesh network router node
US9464917B2 (en) 2007-07-18 2016-10-11 Silver Spring Networks, Inc. Method and system of reading utility meter data over a network
US7894371B2 (en) 2007-07-31 2011-02-22 Motorola, Inc. System and method of resource allocation within a communication system
US7961740B2 (en) 2007-08-01 2011-06-14 Silver Spring Networks, Inc. Method and system of routing in a utility smart-grid network
US8279870B2 (en) 2007-08-01 2012-10-02 Silver Spring Networks, Inc. Method and system of routing in a utility smart-grid network
US20090115626A1 (en) 2007-11-02 2009-05-07 Raj Vaswani Electronic meter for networked meter reading
WO2009067261A1 (en) 2007-11-25 2009-05-28 Trilliant Networks, Inc. System and method for transmitting and receiving information on a neighborhood area network
US8144596B2 (en) * 2007-11-25 2012-03-27 Trilliant Networks, Inc. Communication and message route optimization and messaging in a mesh network
US8289883B2 (en) 2007-12-21 2012-10-16 Samsung Electronics Co., Ltd. Hybrid multicast routing protocol for wireless mesh networks
US7522639B1 (en) 2007-12-26 2009-04-21 Katz Daniel A Synchronization among distributed wireless devices beyond communications range
US8442092B2 (en) 2007-12-27 2013-05-14 Silver Spring Networks, Inc. Creation and use of unique hopping sequences in a frequency-hopping spread spectrum (FHSS) wireless communications network
US20090167547A1 (en) 2007-12-31 2009-07-02 Brad Gilbert Utility disconnect monitor node with communication interface
US7961554B2 (en) 2008-01-11 2011-06-14 Cellnet Innovations, Inc. Methods and systems for accurate time-keeping on metering and other network communication devices
US8402455B2 (en) 2008-03-17 2013-03-19 Landis+Gyr Innovations, Inc. Methods and systems for distributing firmware through an over-the-air network
US8311063B2 (en) 2008-03-28 2012-11-13 Silver Spring Networks, Inc. Updating routing and outage information in a communications network
US7839899B2 (en) 2008-03-28 2010-11-23 Silver Spring Networks, Inc. Method and system of updating routing information in a communications network
US20090267792A1 (en) 2008-04-25 2009-10-29 Henry Crichlow Customer supported automatic meter reading method
US7978632B2 (en) 2008-05-13 2011-07-12 Nortel Networks Limited Wireless mesh network transit link topology optimization method and system
US20090303972A1 (en) 2008-06-06 2009-12-10 Silver Spring Networks Dynamic Scrambling Techniques for Reducing Killer Packets in a Wireless Network
US8756675B2 (en) 2008-08-06 2014-06-17 Silver Spring Networks, Inc. Systems and methods for security in a wireless utility network
US8484486B2 (en) 2008-08-06 2013-07-09 Silver Spring Networks, Inc. Integrated cryptographic security module for a network node
US8467370B2 (en) 2008-08-15 2013-06-18 Silver Spring Networks, Inc. Beaconing techniques in frequency hopping spread spectrum (FHSS) wireless mesh networks
US8207726B2 (en) 2008-09-05 2012-06-26 Silver Spring Networks, Inc. Determining electric grid endpoint phase connectivity
US9025584B2 (en) 2008-09-09 2015-05-05 Silver Spring Networks, Inc. Multi-channel mesh nodes employing stacked responses
US8325060B2 (en) 2008-09-22 2012-12-04 Silver Spring Networks, Inc. Transparent routing in a power line carrier network
WO2010033245A1 (en) 2008-09-22 2010-03-25 Silver Spring Networks, Inc. Power line communication using frequency hopping
US9743337B2 (en) 2008-09-22 2017-08-22 Silver Spring Networks, Inc. Meshed networking of access points in a utility network
US8630272B2 (en) 2008-12-30 2014-01-14 Intel Corporation Multi-radio controller and methods for preventing interference between co-located transceivers

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116866055A (en) * 2023-07-26 2023-10-10 中科驭数（北京）科技有限公司 Method, device, equipment and medium for defending data flooding attack
CN116866055B (en) * 2023-07-26 2024-02-27 中科驭数（北京）科技有限公司 Method, device, equipment and medium for defending data flooding attack

Also Published As

Publication number Publication date
US20100061272A1 (en) 2010-03-11
WO2010027495A1 (en) 2010-03-11
EP2321983A4 (en) 2012-01-11
US9621457B2 (en) 2017-04-11
EP2321983B1 (en) 2018-05-09
US8699377B2 (en) 2014-04-15
US9942824B2 (en) 2018-04-10
US20140226667A1 (en) 2014-08-14
EP2321983A1 (en) 2011-05-18
US20170070941A1 (en) 2017-03-09

Similar Documents

Publication Publication Date Title
US9942824B2 (en) System and method for implementing mesh network communications using a mesh network protocol
Liu et al. An acknowledgment-based approach for the detection of routing misbehavior in MANETs
Crosby et al. A framework for trust-based cluster head election in wireless sensor networks
Qayyum et al. Multipoint relaying for flooding broadcast messages in mobile wireless networks
Khalil et al. Stealthy attacks in wireless ad hoc networks: detection and countermeasure
US7656851B1 (en) Adaptive message routing for mobile ad HOC networks
Wang et al. Corlayer: A transparent link correlation layer for energy efficient broadcast
US20090135843A1 (en) System and method for operating mesh devices in multi-tree overlapping mesh networks
Liang et al. When watchdog meets coding
US9614799B2 (en) System and method for operating mesh devices in multi-tree overlapping mesh networks
Xu et al. Trust-based probabilistic broadcast scheme for mobile ad hoc networks
Tseng et al. Demem: Distributed evidence-driven message exchange intrusion detection model for manet
Luo et al. Time‐aware and energy‐efficient opportunistic routing with residual energy collection in wireless sensor networks
Chabalala et al. Cross-layer adaptive routing protocol for wireless sensor networks
Marin-Perez et al. SBGR: A simple self-protected beaconless geographic routing for wireless sensor networks
Bhandari et al. Reliable broadcast in radio networks with locally bounded failures
Santhanam et al. Distributed self-policing architecture for fostering node cooperation in wireless mesh networks
Cai et al. A novel self‐checking ad hoc routing scheme against active black hole attacks
Alves et al. No way back? An SDN protocol for directed IoT networks
Guo et al. Efficient and reliable broadcast protocol for clustered wireless sensor networks
Nagtilak et al. The detection of routing misbehavior in mobile ad hoc networks using the 2ack scheme with OLSR protocol
Vijayalakshmi et al. Collaborating Intelligent Mobile Agents Based Wireless Sensor Network Optimization and Security Enhancement
Wang et al. Broadcast based on layered diffusion in wireless ad hoc and sensor networks
Giruka et al. A secure position-based protocol framework for multi-hop ad-hoc networks
Santhi et al. Randomized routing techniques for Ad-Hoc on-demand distance vector of wireless networks

Legal Events

Date Code Title Description
FZDE Discontinued

Effective date: 20140904