HK40047987A - Switching pans while maintaining parent/child relationships - Google Patents

Description

Switching PAN while maintaining parent/child relationship

Technical Field

The present invention relates to managing nodes in a mesh network, and in particular to maintaining parent/child (parent/child) relationships when switching PANs.

Background

The PAN architecture may have hysteresis (hysteresis) in the network topology to prevent jitter (thrashing) when there is a temporary interruption in the network, such as a temporary loss of backhaul connection. However, some systems and devices cannot tolerate a temporary loss of backhaul connection and need to switch PANs once backhaul connection becomes unavailable.

Typically, the root node does not routinely communicate the status of the backhaul connection to other nodes in the PAN. Instead, each node must determine the status of the backhaul connection by sending upper layer messages and receiving responses from the backhaul. Since a node cannot send upper layer messages until it joins the PAN, the node cannot determine the status of the backhaul connection before joining. A node requiring a backhaul connection may join the PAN and then determine that a backhaul connection is not available.

A node that determines that a backhaul connection for its current PAN is not available may determine that it needs to switch PANs. However, the node may not have direct visibility into another PAN, which may delay handover to a different PAN.

When a node switches PANs, any child node stays with the current PAN by finding a new parent node, or switches to the new PAN by joining it without joining the current PAN. This process is time consuming and makes the child node unavailable until it locates a new parent node or completes the join/join process.

Disclosure of Invention

Aspects of the present invention provide improvements to the way in which a node determines the status of a backhaul connection and joins or switches to a PAN with an available backhaul connection. Additional aspects of the invention provide a more efficient way of switching PANs when a node has child nodes. Regardless of the cause of the handover, a node may take its children together when it performs the handover.

The node may consider the status of the backhaul connection before joining the PAN. This node may be a critical node that requires an available backhaul connection. The status of the backhaul connection may be included in a layer 2 message (such as a beacon). In one example, the backhaul status information is included in an information element in the beacon.

Once a key node joins a PAN, a critical path may be established from the key node to the root of the PAN. In one example, layer 3 messages (such as DAO messages) are used to establish the critical path. Nodes along the critical path may seek to join a new PAN when the backhaul connection for the current PAN becomes unavailable.

When a node switches to a new PAN, it may coordinate the switch with its child nodes. The switched node identifies the new PAN and obtains timing synchronization information for the new PAN. The switching node transmits timing synchronization information of the new PAN and a time for switching to the new PAN to its child node. The switched node and child node maintain timing synchronization information for both the current PAN and the new PAN. At the time for the handover, the handed over node and its children are handed over to the new PAN. Whenever a handover occurs, a node may coordinate the handover to the new PAN with its child nodes. The coordination is not limited to handover based on backhaul connection loss.

These illustrative aspects and features are mentioned not to limit or define the invention, but to provide examples to aid understanding of the inventive concepts disclosed in this application. Other aspects, advantages, and features of the present invention will become apparent after review of the entire application.

Drawings

These and other features, aspects, and advantages of the present disclosure will become better understood when the following detailed description is read with reference to the accompanying drawings, wherein:

fig. 1 illustrates two PANs and an unjoined key node in accordance with an aspect of the invention.

Fig. 2 illustrates a key node joining a PAN according to an aspect of the invention.

Fig. 3 illustrates loss of backhaul connection for a PAN in accordance with an aspect of the subject innovation.

Fig. 4 illustrates a key node switching to a different PAN in accordance with an aspect of the invention.

Fig. 5 illustrates a parent node switching to a different PAN in accordance with an aspect of the subject invention.

Fig. 6 illustrates a parent node and its child nodes switching to different PANs in accordance with an aspect of the invention.

Fig. 7 illustrates communication between a joining node and two PANs in accordance with an aspect of the present invention.

FIG. 8 illustrates an exemplary node in accordance with an aspect of the present invention.

Detailed Description

The present invention relates to systems and methods for managing nodes in a mesh network, including joining a critical node to a PAN, creating and maintaining a critical path, PAN switching through critical path nodes, and maintaining parent/child relationships while switching PANs. The key node may consider the status of the backhaul connection of the PAN before joining the PAN. Once joined, a critical path from the critical node to the root is identified, and if backhaul connections for the current PAN become unavailable, nodes along the critical path (including the critical node) may attempt to join the new PAN. The status of the backhaul connection for the PAN may be communicated with an Information Element (IE) in the beacon. If the critical path node is a parent node with one or more child nodes and it switches PANs, the critical path node and the child nodes may switch PANs while maintaining their parent-child relationship. When a parent node switches PANs for reasons other than backhaul connection loss, the parent node may maintain its parent-child relationship with its child nodes.

Key node and key path

Fig. 1 illustrates two PANs — PAN a and PAN B. Node 110 is the root of PAN a and node 150 is the root of PAN B. PAN a comprises nodes a-1 to a-6 and PAN B comprises nodes B-1 and B-2. Backhaul connection 104 connects PAN a with central system 102 and backhaul connection 106 connects PAN B with the central system. Although not shown in fig. 1, there may be any number of intermediate devices between the PAN and the central system 102.

Nodes 110 and 150 monitor the status of their respective backhaul connections and include information about the status of their backhaul connections in their beacons. In one example, they determine whether they are connected to an NTP server and, if so, determine that their backhaul connection is available. Other implementations may consider other factors to determine whether their backhaul connection is available or unavailable, including but not limited to a connection to a particular system or server, or to a time source. Each node includes its current backhaul status information in the IE in its respective beacon. The IE may be a new IE or may be an existing IE. If an existing IE is used, the backhaul status information may be appended to the IE. Any type of IE that includes backhaul status information is referred to herein as a backhaul status IE. One bit may be used to convey backhaul status information, where a first value indicates that a backhaul connection is available and a second value indicates that a backhaul connection is not available or unknown. In some implementations, the backhaul status information includes additional information, such as how long the backhaul connection has been in its current state. For example, a timestamp indicating the time of the last state change may be used. In the example illustrated in fig. 1, backhaul connection 104 is available and backhaul connection 106 is not available.

In fig. 1, node N is a key node that does not join any PAN. The key nodes are the nodes that need backhaul connections. If a backhaul connection becomes available, the key node may not wait for the backhaul connection to reconnect. One example of a critical node is a node associated with DA (Distribution Automation) equipment (e.g., line sensors, switches, and reclosers). The node may be designated as a key node at installation or may be designated as a key node after installation.

Node N receives beacon a from PAN a and beacon B from PAN B. In this example, beacon a includes a backhaul status IE indicating that backhaul connection 104 is available, and beacon B includes a backhaul status IE indicating that backhaul connection 106 is not available. Since node N is a key node, it joins PAN a. The critical nodes may be configured to avoid joining a PAN with an unavailable backhaul connection even though other factors (e.g., rating, load, etc.) may be beneficial for joining the PAN.

Fig. 2 illustrates PAN a after node N joins. After node N joins, it sends a DAO message that identifies node N as a critical node. In one example, node N sets a bit in the DAO flag field to indicate that it is a critical node. Based on the DAO message, node 110, which is the root of PAN a, determines the critical path of node N, i.e., the path including node N, node a-5, node a-4, and node a-1, and stores information describing the critical path of node N. The root may send a DAO-ACK message to node N with a bit set to indicate that the critical path is in place.

In some implementations, when each node between the root and node N receives a DAO-ACK message, that node checks the bit and determines that it is a critical path node. If the node does not support critical path nodes, it does not forward the message after it receives it. Instead, it may discard the message or send an error message.

Node N may use other types of messages or other fields to indicate that it is a critical node, including but not limited to an indication in the hop-by-hop extension header of an IPv6 message. In one example, node N sets a bit in the hop-by-hop extension header to indicate that it is a critical node and is requesting a critical path. When node a-5 supports critical path nodes, it receives the message, checks the bit, enters a pre-critical path state, and forwards the message to the next node. This process repeats until the message reaches the root of PAN a. When the root sends a message back to node N indicating that the critical path is in place, the nodes between the root and node N may examine the message and transition from the pre-critical path state to the critical path state.

Since PAN a may be a wireless mesh network, the critical path for node N may change. The critical path for node N may include additional or different nodes if the critical path changes. The critical path information maintained by the root and the critical path state of each node affected by the change are updated to reflect the change in the critical path.

After node N joins PAN a, it generates and sends a beacon containing the backhaul status IE. Node N obtains information for the backhaul status IE from the following beacons: the beacon is received by node N from its parent node a-5 or other node in PAN a.

Backhaul connection loss and critical path

Fig. 3 illustrates a scenario in which the backhaul connection of PAN a becomes unavailable and the backhaul connection of PAN B is available. When the node 110 detects that its backhaul connection is not available, it may generate a beacon, beacon a, which includes backhaul status information in the backhaul status IE. Information about the status of the backhaul connection is propagated through the network until node N receives a beacon with a backhaul status IE indicating that the backhaul connection of PAN a is not available. Since node N is a critical node, once node N determines that the backhaul connection for its current PAN is not available, it may start searching for a new PAN to join. If node N receives beacons from a different PAN (such as beacon B from PAN B), it may consider whether the backhaul connection of PAN B is available when determining whether to switch PANs. If it decides to switch PANs, it may follow a procedure similar to that described above in connection with fig. 1 and 2 for joining PAN B. In this example, other nodes joining PAN a may remain joined to PAN a as shown in fig. 4.

When node N joins PAN B, its parent node, node A-5, determines that node N is no longer a child node. In one example, node N sends a disassociation message to node A-5 to notify node A-5 of the handover before joining PAN B. Node N determines whether it has any other child nodes that are critical nodes or critical path nodes. If it does not have any other child nodes that are critical nodes or critical path nodes, it determines that it is no longer on the critical path and sends a DAO message indicating that it is no longer a critical path node. Similarly, if node A-4 does not have a child node that is a critical node or critical path node, it sends a DAO message indicating that it is no longer a critical path node. If node A-1 does not have a child node that is a critical node or critical path node, it sends a DAO message to its parent node, node 110, and node 110 removes the critical path for node N. If node A-5 has another child node (e.g., node A-6) that is a critical node or critical path node, then node A-5 may still be a critical path node. In this case, node 110 stores the critical path information for node A-6. Once a node (e.g., node a-5) is no longer a critical path node, it may remain participating in its current PAN or switch to a target PAN based on factors other than the backhaul connection status of its current PAN and target PAN.

In some instances, the critical node may only rarely receive beacons from another PAN. Once a node on the critical path receives a beacon from another PAN with an available backhaul connection while the backhaul connection of the current PAN is unavailable, it may switch PANs. For example, if node a-5 receives a beacon from node a-4 or another node in PAN a with a backhaul status IE indicating that the backhaul connection for PAN a is unavailable, node a-5 may search for another PAN to join. Since node a-5 is on the critical path, it may be more aggressive when seeking a different PAN than if it were not on the critical path. In some implementations, a node considers its RPL layer in determining how aggressively to seek different PANs. For example, a tier 1 node may not be as aggressive as a lower tier node.

If node a-5 receives beacons from a different PAN (such as beacon B from PAN B), it may determine whether to switch PANs based on whether the backhaul connection of PAN B is available. When the backhaul connection for PAN B is available, node a-5 joins PAN B as shown in fig. 5. Fig. 5 illustrates: after node A-5 joins PAN B, its children nodes, node A-6 and node N, may not join PAN A or PAN B. Since node a-5 is not a critical node in fig. 5 and does not have child nodes as critical nodes, it will not identify itself as a critical node or critical path node after joining PAN B. In some implementations, both node A-6 and node N perform separate join processes. Each node may rejoin PAN a by finding a new parent, join PAN B by finding a node a-5 (its PAN a parent), or join PAN B by finding a different parent. Node N joins PAN B because node N is a critical node and the backhaul connection for PAN a is not available. In a scenario where node N joins PAN B as a child of node A-5, node N sends a DAO message identifying node N as a key node. The critical path is established in a manner similar to that discussed above in connection with fig. 2.

In some implementations, an auxiliary backhaul connection (such as ethernet or cellular) may be available. If so, when the critical path node receives a beacon with a backhaul status IE indicating that a backhaul connection is not available, then the node may choose to remain on the current PAN and use a secondary backhaul connection.

If the backhaul status IE indicates that the backhaul connection is not available and includes information about how long the backhaul connection has been unavailable, the critical path node may consider how long the backhaul connection has been unavailable when determining when to switch to the new PAN.

Although the foregoing examples discuss using the backhaul status IE in conjunction with the key node, the backhaul status IE may be used whenever backhaul status information is useful. It is not limited to use by critical path nodes.

Maintaining parent-child relationships when switching PANs

When a node switches to a new PAN, it may maintain the existing parent-child relationship. This handover may occur because the backhaul connection is lost or for any other reason.

Continuing with the example of fig. 3, node a-5 may take its child nodes together when it joins PAN B. Once node a-5 determines that it is to switch to the target PAN, it maintains timing synchronization information for both its current PAN (e.g., PAN a) and its target PAN (e.g., PAN B). Node a-5 obtains timing synchronization information for the target PAN from beacons in the target PAN. Node a-5 transmits timing synchronization information for the target PAN, and the time when it plans to switch to the target PAN, to its child nodes, node a-6 and node N. The slave node a-5 may use beacons to transmit timing synchronization information and handoff times. For example, the IE in the beacon currently provides information about the network and includes absolute slot number (absolute slot number), channel hopping sequence, and slot offset information. The IE in the beacon may be modified to include a PAN switch timestamp. Only the node that identifies node a-5 as its parent node may act according to the timing synchronization information and the switch time. Once nodes a-6 and node N receive the beacon with timing synchronization information and the switch time, these nodes maintain the timing synchronization information for both PAN a and PAN B. At the switch time, node A-5 and its children (node A-6 and node N) switch from PAN A (as shown in FIG. 3) to PAN B (as shown in FIG. 6). After the handover, node A-5 may send a DIS message to node B-2 to trigger a DIO message from node B-2. In response to the DIO message, node A-5 may send a DAO message indicating that its child node (node N) is a critical node and that node A-5 is on the critical path. Once node a-5 receives the DAO-ACK message, it may send a DIO message via unicast, multicast, or broadcast methods to its child nodes (e.g., node a-6 and node N) that it brought from PAN a so that these child nodes can obtain a new network prefix.

After the node switches to PAN B, the critical path includes node A-5, node B-2, node B-1, and node 150. By switching node a-5, node a-6, and node N together to the target PAN, timing and network connectivity are maintained and the availability of the child nodes (e.g., node a-6 and node N) is improved.

The parent-child relationship between nodes may be maintained when the parent node determines that it has switched to the target PAN for any reason. This is not limited to the case where the parent node is a critical path node or when the switch is based on backhaul connection status.

Communication between a key node and a PAN

Fig. 7 illustrates a key node 704 seeking to join a PAN. The node 704 initially determines whether to join a PAN corresponding to the mesh network 702. At 710, a backhaul connection of the network 702 becomes unavailable. The border router or root node of the network 702 then communicates the loss of the backhaul connection to the network at 712. In one example, the border router sends a beacon with a backhaul status IE indicating that a backhaul connection is not available. The key node 704 begins listening for beacons at 714 to find a network to join. At 716, node 704 receives a beacon from network 702. The beacon includes a backhaul status IE indicating that the network 702 has lost its backhaul connection. Since node 704 is a critical node, it continues to listen for additional beacons to find a network with available backhaul connections.

At 720, backhaul connections for PANs corresponding to the mesh network 706 are available. At 722, the border router of network 706 communicates the availability of the backhaul connection to the network. In one example, the border router sends a beacon with a backhaul status IE indicating that a backhaul connection is available. At 724, node 704 receives a beacon from network 706. Since the beacon from the network 706 indicates that a backhaul connection is available, the node 704 determines that it will attempt to join the network 706. The node 704 and the network 706 perform message exchanges 726, 728 at layer 2. The message exchange may include an association request and an association response message. Other types of message exchanges are also possible. Once joined at layer 2, node 704 and network 706 conduct another message exchange at layer 3. For example, node 704 may send a DAO message indicating that it is a critical node, and nodes within network 706 may respond with DAO-ACK messages.

At 734, a backhaul connection of network 706 becomes unavailable. The border router of network 706 then communicates the loss of the backhaul connection to the network at 736. At 738, the beacon from network 706 indicates that a backhaul connection for network 706 is unavailable. In response to receiving the beacon, node 704 begins searching for a new PAN at 740.

Although fig. 7 uses beacons to transmit backhaul status information, other implementations may use a different type of message, including but not limited to another type of layer 2 message or a proprietary frame.

Exemplary node

Fig. 8 illustrates an exemplary node 800. The node may include a processor 802, a memory 804, and a transceiver device 820, all communicatively coupled via a bus 806. The components of node 800 may be powered by an a/C power source or a low energy source, such as a battery (not shown). The transceiver device 820 may include (or be communicatively coupled to) an antenna 808 for communicating with other nodes. In some examples, the transceiver device is a radio frequency ("RF") transceiver for wirelessly transmitting and receiving signals.

The processor may include a microprocessor, an application specific integrated circuit ("ASIC"), a state machine, a field programmable gate array ("FPGA"), or other suitable computing device. The processor may include any number of computing devices and may be communicatively coupled to a computer-readable medium, such as the memory 804. The processor may execute computer-executable program instructions or access information stored in the memory to perform operations, such as those described herein. The instructions may include processor-specific instructions generated by a compiler and/or interpreter from code written in any suitable computer programming language. When executing instructions (such as those provided in critical path module 814), they may configure the node to perform any of the operations described herein. Although the processor, memory, bus, and transceiver devices are depicted in fig. 8 as separate components in communication with each other, other implementations are possible. The systems and components discussed herein are not limited to any particular hardware architecture or configuration.

While the subject matter has been described in detail with respect to specific aspects thereof, it will be appreciated that those skilled in the art, upon attaining an understanding of the foregoing, may readily produce alterations to, variations of, and equivalents to these aspects. Accordingly, it should be understood that the present disclosure has been presented for purposes of illustration and not limitation, and does not preclude inclusion of such modifications, variations and/or additions to the present subject matter as would be readily apparent to one of ordinary skill in the art.

Claims (16)

1. A method for switching PANs (personal area networks), wherein a first parent node and at least one child node join a first PAN, comprising:

maintaining, by the first parent node, timing synchronization with the first PAN;

identifying, by the first parent node, the second PAN;

obtaining, by the first parent node, timing synchronization information for the second PAN;

maintaining, by the first parent node, timing synchronization with both the first PAN and the second PAN;

transmitting, by a first parent node, a message to the at least one child node, wherein the message comprises synchronization information for a second PAN;

switching, by the first parent node, from the first PAN to the second PAN; and

maintaining, by the first parent node, a parent-child relationship with the at least one child node.

2. The method of claim 1, further comprising:

after switching from the first PAN to the second PAN, a DIS (DODAG (destination oriented directed acyclic graph) info enlistment) message is transmitted by the first parent node to a second node in the second PAN, wherein the second node is a parent node of the first parent node.

3. The method of claim 2, further comprising:

receiving, by a first parent node, a DIO (DODAG information object) message from a second node; and

in response to receiving the DIO message, transmitting a DAO (destination advertisement object) message to the second node, wherein the DAO message indicates that the first parent node is a critical path node.

4. The method of claim 3, further comprising:

receiving, by the first parent node, a DAO-ACK (destination advertisement object acknowledgement) message from the second node; and

transmitting a second DIO message to the at least one child node in response to receiving the DAO-ACK message.

5. The method of claim 1, wherein the message further comprises a time for switching from the first PAN to the second PAN, and wherein switching from the first PAN to the second PAN comprises: the handover is performed at a time for handover.

6. The method of claim 1, wherein the first parent node is a critical path node, further comprising:

determining, by the first parent node, that a backhaul connection of the first PAN is unavailable prior to obtaining, by the first parent node, timing synchronization information for the second PAN.

7. The method of claim 1, wherein transmitting a message comprises: a beacon is transmitted by the first parent node.

8. A method for switching PANs (personal area networks), wherein a parent node and a first child node join a first PAN, comprising:

maintaining, by the first child node, timing synchronization with the first PAN;

receiving, by a first child node, a message from the parent node, wherein the message includes synchronization information for a second PAN and a switch time;

maintaining, by the first child node, timing synchronization with both the first PAN and the second PAN;

switching, by the first child node, from the first PAN to the second PAN at a switch time; and

maintaining, by the first child node, a parent-child relationship with the parent node in the second PAN.

9. The method of claim 8, further comprising:

receiving a DIO (DODAG (destination oriented directed acyclic graph) information object) message from the parent node after switching from the first PAN to the second PAN; and

a new network prefix is obtained by the first child node.

10. The method of claim 8, wherein the message from the parent node is a beacon, further comprising:

determining, after receiving a beacon from the parent node by a first child node, whether the first child node is a child node of the parent node before maintaining timing synchronization with both the first PAN and the second PAN.

11. A network, comprising:

a first parent node;

a first child node; and

second child node

Wherein the first parent node has a parent-child relationship with the first child node and the second child node in a first PAN (personal area network);

wherein the first parent node is operable to:

identifying a second PAN;

obtaining timing synchronization information of the second PAN;

maintaining timing synchronization with both the first PAN and the second PAN;

transmitting a message including synchronization information of the second PAN and the switching time to the first child node and the second child node; and

switching to the second PAN at a switching time.

12. The network of claim 11, further comprising:

a root node, wherein the root node provides a backhaul connection for the first PAN,

wherein the first parent node is further operable to:

determining that a backhaul connection of the first PAN is unavailable prior to transmitting a message including synchronization information for the second PAN and the switch time to the first child node and the second child node.

13. The network of claim 11, wherein the first child node is operable to:

receiving a message including synchronization information of the second PAN and a switching time from the first parent node;

maintaining timing synchronization with both the first PAN and the second PAN; and

switching to the second PAN at a switching time.

14. The network of claim 13, wherein the first child node is further operable to:

after receiving a message from the first parent node including synchronization information for the second PAN and a switch time, determining that a parent-child relationship exists between the first parent node and the first child node before switching to the second PAN at the switch time.

15. The network of claim 11, wherein the first parent node is further operable to:

transmitting a DIS (DODAG (destination oriented directed acyclic graph) info solicitation) message to a fourth node in the second PAN after switching to the second PAN, wherein the first parent node is a child node of the fourth node in the second PAN;

receiving a DIO (DODAG information object) message from a fourth node in the second PAN;

transmitting a DAO (destination advertisement object) message to a fourth node in the second PAN in response to receiving the DIO message;

receiving a DAO-ACK (destination advertisement object acknowledgement) message from a fourth node in the second PAN; and

the second DIO message is transmitted to the first child node and the second child node.

16. The network of claim 11, further comprising:

a third node in the first PAN; and

a fourth node in the first PAN, wherein the third node is a parent node for the fourth node, an

Wherein the fourth node in the first PAN is operable to:

receiving a message including synchronization information of the second PAN and a switching time from the first parent node;

determining that a parent-child relationship does not exist between the first parent node and a fourth node in the first PAN;

maintaining timing synchronization with the first PAN; and

remaining on the first PAN after the switching time.