Nodes and methods for directed acyclic graph network configuration

By introducing address generators and DIO/DAO signaling mechanisms into the self-organized wireless communication network, the complexity of node address assignment and reassignment is solved, and the uniqueness of node identity identification and address management in the network are realized. , reduces memory and power consumption requirements.

CN113365294BActive Publication Date: 2024-11-12TEXAS INSTRUMENTS INC
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202110751775.2
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Priority Date
2015-08-28
Filing Date
2016-08-29
Publication Date
2024-11-12
Estimated Expiration
2036-08-29

AI Technical Summary

Technical Problem

In the prior art In the self-organized wireless communication network, there are complexity and inconveniences in node address assignment and reassignment, especially when nodes move or parent nodes change, the lack of effective address management methods, which leads to difficulty in initializing and re-arrangement of networks. .

Method used

By introducing an address generator in the node, the address value of the parent node is appended to create a unique network address of the child node by using the address value of multiple bits, and when the parent node changes, temporary address assignment and Recycling, simplifying the management of nodes' network address.

Benefits of technology

It realizes unique identity identification of each node in the network, reduces the need for routing tables, saves memory and power consumption, simplifies handshake communication, and improves network flexibility and efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN113365294B_ABST
    Figure CN113365294B_ABST
Patent Text Reader

Abstract

The present invention relates to nodes and methods for directed acyclic graph network configuration. The present invention is an improvement to the hierarchical Do-Dag based RPL (H-DOC) network configuration, wherein the network address of each node corresponds to its position within the hierarchical network. The network addresses are initialized hierarchically (600). Candidate parent nodes signal availability (602). Candidate child nodes select candidate parent nodes (603) and respond with a temporary address (604). The selected candidate parent node confirms the selection and transmits the hierarchical address of the child node to the temporary address in transmission (605). The child node changes its address to the hierarchical address from the parent node (606).
Need to check novelty before this filing date? Find Prior Art

Description

[0001] This application is a divisional application of Chinese patent application 201680047318.2, entitled “Network Address Assignment and Recycling Based on Hierarchical RPL Network”, filed on August 29, 2016. Technical Field

[0002] The present invention relates to network communications involving nodes having changeable addresses. Background Art

[0003] Ad hoc wireless communication networks are dynamically formed when nodes come within the range of existing network resources. These networks can be used in many applications to provide communication between lower level devices (such as sensors) on the network and upper tier devices that communicate with these sensors. Sensors typically operate with limited processing and memory and are typically constrained by various technical limitations. Such limitations may include issues related to power consumption, small form factors, and communication challenges (low speed, high error rate, etc.) for forming corresponding networks. The challenges are further complicated by the fact that there may be interdependencies between the problems. For example, the level of communication within the network affects the power consumption in the network devices.

[0004] The present disclosure relates to address generation for such ad hoc communication networks. The network includes at least two nodes that use a routing protocol to communicate across the network. The routing protocol can be, for example, a low power routing (RPL) network protocol. One of the nodes is a parent node, and the other nodes are child nodes of the parent node. In some cases, the parent node can be a root node at the top of a hierarchical network. In other cases, the parent node can also be an intermediate node, which can also have other child nodes communicating with it downstream of the root node, and the other child nodes are sometimes referred to as leaf nodes. Summary of the invention

[0005] The address generator assigns a unique network address to each node by appending a plurality of address values ​​to the parent address of the parent node to create a unique network address of the child node. In this way, when creating a unique network address via various assignment protocols disclosed herein, each node in the network can partially assume its identity from its corresponding parent node. The address assignment protocol allows each node to know which node is the next hop (hop) for message routing in the ad hoc network, because each node can determine whether to route messages upstream or downstream based on its derived parent address assignment. This reduces the need for the routing table required for conventional systems, and thus saves memory in the corresponding nodes of the system. In addition, the handshake in the network is reduced, because each intermediate node encountering a new child node does not have to transmit additional address notifications to the network, because the upcoming node is already part of the parent node address. Reducing handshake communication reduces the power consumed in the system. BRIEF DESCRIPTION OF THE DRAWINGS

[0006] FIG. 1 (Prior Art) is a block diagram of an example node.

[0007] FIG. 2 (Prior Art) illustrates a hierarchical network of nodes.

[0008] FIG. 3 (Prior Art) is a diagram of address segments in a hierarchical network address technique.

[0009] Figure 4 FIG. 3 is a flowchart illustrating message routing when the hierarchical network address technology of FIG. 3 is adopted.

[0010] Figure 5 A flow chart illustrating the actions of a possible parent node in network address initialization according to the present invention.

[0011] Figure 6 A flow chart illustrating possible child node actions in network address initialization according to the present invention.

[0012] Figure 7 A flow chart illustrating the actions of a selected parent node in network address initialization according to the present invention.

[0013] Figure 8 The flowchart is for illustrating the actions of a child node when the parent node is changed according to the present invention.

[0014] Fig. 9 The flowchart is for illustrating the action of the old parent node when the parent node is changed according to the present invention.

[0015] Fig.10 The flowchart is for illustrating the actions of the new parent node when the parent node is changed according to the present invention. DETAILED DESCRIPTION

[0016] FIG. 1 (PRIOR ART) is a flow chart of an example node 100. Node 100 is one of a plurality of nodes that are commonly used. Node 100 includes a communication transceiver 101. Communication transceiver 101 enables bidirectional communication with other nodes. According to known techniques, each node is provided with a communication address. Node 100 only responds to communications with a message header that identifies node 100 as a target node. This identification is typically performed by the communication address of the target node. The node communication address is described more fully below. The node 100 illustrated in FIG. 1 is not limited to a specific communication medium. Wireless communication is typically provided between nodes via low-power radio frequency signals.

[0017] The node 100 includes a node controller 102. The node controller 102 typically includes a programmable microprocessor. The microprocessor of the node controller 102 provides the operating features of the node 100. The node controller 102 can exchange messages with other nodes via a bidirectional connection to the communication transceiver 101. As known in the art, the microprocessor of the node controller 102 is programmed by instructions stored in the memory 103. The memory 103 typically includes both non-volatile memory and volatile memory, the contents of which do not rely on continuous electrical power, such as read-only memory (ROM) or flash memory, and the volatile memory is usually referred to as random access memory (RAM), and the contents of the volatile memory are lost when the electrical power is interrupted. Typically, program instructions are stored in non-volatile memory, and more temporary data are stored in volatile memory. The node controller 102 communicates with sensors 105 and actuators 106 (described below), and communicates with other nodes via the communication transceiver 101. 1 , the memory 103 includes at least a portion 104 dedicated to storing a network address assigned to the node 100. The node 100 only responds to messages having a destination address that matches the network address 104 stored in the memory 103, as will be described below.

[0018] Node 100 optionally includes one or more sensors 105 or actuators 106. Typically, multiple nodes (such as node 100) are used together. Sensors 105 detect environmental conditions for use by the network of nodes. These environmental conditions can be ambient temperature, wind speed, pressure, and similar conditions. Actuators 106 can be used to control the environment based on commands received from the network of nodes. Actuators can include controls for electrical switches, fluid valves, or motive parts of node 100. Any specific example of a node can include one or more sensors and one or more actuators, only one sensor, or only one actuator.

[0019] Node 100 includes power source 107. In typical applications, node 100 is designed to use very little electrical power. Power source 107 can be a small battery. In other applications, power source 107 is designed to obtain power from the environment. This power source can be a solar cell with a backup capacitor or other power storage device for dark intervals. Alternatively, this power source can be some kind of motion capture device that generates electrical power from environmental motion. An example is a weather buoy that generates electrical power from wave motion.

[0020] Fig. 2 illustrates the prior art preferred communication between nodes in a network of such nodes. In a preferred embodiment, the nodes are arranged in a hierarchical network. Network 200 illustrates a single level 0 node N1, also referred to as a root node. Level 0 node N1 communicates directly with level 1 nodes N2 and N3. Level 1 node N2 communicates directly with level 2 nodes N4 and N5. Level 1 node N3 communicates directly with level 2 nodes N6 and N7. Level N nodes N16 to N63 communicate directly with level N1 nodes (not shown). Top level node N1 therefore directly communicates only with child nodes N2 and N3. Level 1 node N2 communicates with parent node N1 and child nodes N4 and N5. Level 1 node N3 communicates directly with parent node N1 and with child nodes N6 and N7. At the bottom level (level N), each node N16 to N64 communicates directly with its corresponding parent node (not shown).

[0021] As mentioned above, the network of nodes according to the present invention generally adopts inter-node wireless communication via low-power radio frequency signals. Therefore, the parent node is not hardwired to its child nodes. All wireless communications can share one or only a small amount of radio frequency. This environment requires a certain way for the node to determine whether the communication is intended for the node. Such networks generally use network addresses to distinguish communications. Each node in the network is assigned a network address. Each communication in the network contains a reference to the network address of the target node. This target node network address is generally specified in the message header. After receiving the communication, each node extracts the target node network address from the message. The node compares this target node network address with its own network address. If the target node network address matches its own network address, the node responds to the message. If the target node network address does not match its own network address, the node ignores this communication. The node can also route the message to its parent node or to one of its child nodes in an attempt to reach the target node. The node generally only handles (processes (service) or routes) messages from its parent node or from one of its child nodes.

[0022] The provision of the network address of the target node identifies the desired node. The target network address does not automatically provide information about routing. In a preferred embodiment where low power radio frequency signals are used for communication, not all nodes will be within range of all other nodes. In a preferred embodiment, only a parent node and its (multiple) child nodes are guaranteed to communicate. Therefore, communications directed to another node must be sent up the hierarchy to the parent node or down the hierarchy to the appropriate child node.

[0023] The communication between the parent node and the child node is performed according to a network routing protocol. The routing protocol may be, for example, a low power routing network (RPL) protocol. The parent node may be a root node or an intermediate node, and the child node may be a leaf node of the root node or the intermediate node configured in a target-oriented directed acyclic graph (DODAG). The DODAG includes at least one root node and at least one leaf node.

[0024] To properly route communications directed to another node, each node must access the routing information of the target node. The RPL routing protocol has two modes of operation. The first mode is a storage mode. The second mode is a non-storage mode. In the RPL protocol storage mode, each node stores information used to route to all other nodes in a memory 103. After receiving the communication, the node controller 102 extracts the target node address. If this address matches the node address, the node responds to the communication. If this target node address does not match the node address, the node must route the communication to another node. The node controller 102 queries the stored routing information to determine the route of the communication. The routing table only needs to indicate whether the communication is routed upward along the hierarchical network or routed downward along the hierarchical network to one of the node's child nodes. This technology is disadvantageous because it requires the routing table to be stored at each node. This is a burden on hardware because it requires memory and power at each node to store the routing table. The routing table size is linearly proportional to the number of child nodes of the node plus an additional entry of the parent node. This is disadvantageous for low-cost, low-power nodes. In the RPL protocol non-storage mode, only the root node stores information for routing. All communications between any pair of nodes must first be routed upward to the root node. The root node routes communications to appropriate child nodes and grandchild nodes based on its routing table. This technique eliminates the need to store routing tables at each node. However, this technique increases the amount of communication because all communications must pass through the root node.

[0025] The network configuration illustrated in FIG2 is referred to as a directed acyclic graph (DODAG) configuration. As shown in FIG2, a DODAG consists of at least one root node and at least one leaf node. A candidate parent node transmits a DODAG Information Object Request (DIO) signal indicating the availability of the candidate parent node as a parent node. In response to the DIO, the candidate child node responds with a Target Advertisement Object (DAO) signal to its preferred parent node.

[0026] FIG. 3 illustrates features of a prior art hierarchical Do_Dag based RPL network (H-DOC) addressing technique that is advantageously used with the hierarchical network illustrated in FIG. 2 . For each node, a network address 300 includes a prefix bit 301, a level 1 bit 302, a level 2 bit 303 ... level N bit 309. The prefix bit 301 includes bits common to all nodes in the network and bits associated with the root node. All nodes within the hierarchical network include bits in the prefix bit 301. For the root node of the network, all other bit fields (302, 303 ... 309) have a predetermined null value, such as all 0s. Each node at level 1 includes a prefix bit 301 having the same value as the root node, and a unique value in the level 1 bit 302 that is different from all other level 1 nodes. For level 1 nodes, all other bit fields (303 ... 309) have a predetermined null value. Each node at level 2 includes a prefix bit 301 having the same value as the root node, a level 1 bit 302 having the same value as its parent node, and a unique value in the level 2 bit 302 that is different from all other level 2 nodes having the same parent level 1 node. For level 2 nodes, all other bit fields (... 309) have a predetermined null value. The number of address bits assigned to each level field is a design choice that depends on the desired parent-child fan-out. Note that the order of the level fields within the network address is arbitrary. That is, the level fields can be in any order, not just the high-order to low-order order illustrated in Figure 3. It is only required that all nodes within the network adopt the same level field order.

[0027] One feature of this hierarchical network address technology is that the network address of each node corresponds to its position within the hierarchical network. Each node has a network address that depends on its parent node and all intermediate nodes along the hierarchy up to the root node. This simplifies the routing decisions made at each node.

[0028] Figure 4The diagram illustrates a flow chart of a process 400 for handling message routing when hierarchical addresses are used. In a preferred embodiment, the memory 103 at each node stores instructions that cause the node controller 102 to perform this process. There are three routing possibilities. The message may need to be routed up the hierarchy to the parent node of the current node. The message may be intended for the current node. The message may need to be routed down the hierarchy to the child nodes of the current node. Messages received from the parent node of the current node may be directed to the current node or need to be routed to a node in the hierarchy downward. Messages from child nodes may need to be routed up the hierarchy to the parent node, may be directed to the current node, or need to be routed down the hierarchy to another child node.

[0029] Process 400 begins upon receiving a message from another node (block 401). The node extracts the destination address from the message header (block 402). The routing of the message depends on the relationship of the destination address to the node address of the current node.

[0030] Test block 403 determines whether the target address matches the higher level address slot of the current node address and does not match the current level address of the current node address. If so (yes at test block 403), the message should be routed up the hierarchy. Block 404 routes the message to the parent node of the current node. After this routing of the message in block 404, process 400 ends at end block 405. If not (no at block 403), the flow goes to test block 406.

[0031] Test frame 406 determines whether the target address matches the address of the current node of the predetermined null value of the hierarchy field below the current node level. If the target address matches the address of the current node of the predetermined null value of the hierarchy field below the current node level (yes at test frame 406), the current node is the intended target. Therefore, frame 407 processes the message. The exact way of processing the message depends on the intended use of the network. The message can be a request for data from the sensor 104 at the current node. The message can be a command for taking a certain action via the actuator 105 at the current node. The exact nature of processing this message is beyond the scope of the present invention. After the processing of the message in frame 407, process 400 ends at end frame 408.

[0032] If the target address does not match the address of the current node of the predetermined null value of the level field contained below the current node level (no at test box 406), the current node is not the intended target. Test box 409 determines whether the target node address matches the field of the current node address and contains a significantly lower level address field in addition. If this is true (yes at test box 409), the message is routed to the child node of the current node. Frame 410 routes the message to the appropriate child node along the hierarchy downward. The appropriate child node is determined by the level address field one level lower than the level of the current node. After this routing of the message in frame 410, process 400 ends at end frame 411.

[0033] If none of these conditions are met (no at test block 403, no at test block 406 and no at test block 409), then there is an error in the target address. Error handling block 412 handles this error. This is beyond the scope of the present invention.

[0034] There are severe limitations in the practical implementation of H-DOC technology. There is no clear method to assign node addresses in the network. There is no provision for reassigning node addresses. It is complicated or impossible for a node to change its parent node. This change may be required if the node is mobile. The present invention addresses the limitations of H-DOC technology for address assignment and reassignment of mesh networks. The present invention slightly modifies two messages used in RPL networks that employ H-DOC technology. In the prior art, a node sends a DODAG Information Object Request (DIO) message to its possible child nodes. Child nodes that wish to connect to the node respond with a Target Advertisement Object (DAO) message. In general, each node connects to its parent node before attempting to connect to a child node. The present invention provides better assignment of network addresses in hierarchical networks.

[0035] Figures 5 to 7 Together the diagrams illustrate hierarchical address initialization according to the present invention. Figure 5 The diagram illustrates a process 500 occurring at a candidate parent node. Figure 6 The diagram illustrates a process 600 occurring at a candidate child node. Figure 7 The diagram illustrates the process 700 occurring at a selected parent node.

[0036] Figure 5The process 500 on the candidate parent node is illustrated, starting with a start frame 501. In a preferred embodiment, the memory 103 at each node stores instructions that cause the node controller 102 to perform this process. At frame 502, the candidate parent node broadcasts a DIO signal. The DIO signal is similar to the prior art. The DIO signal notifies the transmission node of the availability and its network address as a parent node. The DIO signal is usually broadcast to all candidate child nodes of the transmission node. This broadcast is possible in a typical network using wireless communication. The initialization process preferably starts with the root node and continues down the hierarchy. It is assumed that the root node knows that it is a root node and starts initialization. The node cannot transmit a DIO signal to connect to a child node until the child node has been attached to the parent node. The transmission of the DIO signal indicates that the current node can accept at least one node as a child node. Therefore, this ensures that the current node has a number less than the maximum number of assigned child nodes, which is limited by the size of the next level field in Figure 3. The process 500 ends with an end frame 503.

[0037] Figure 6 The process 600 of a candidate child node is illustrated. In a preferred embodiment, the memory 103 at each node stores instructions that cause the node controller 102 to perform this process. The process 600 starts at a start box 601. At box 602, the candidate child node receives at least one DIO signal from a candidate parent node. The candidate child node selects a parent node from the received DIO signal. The manner of this selection is not important to the present invention. This selection includes identifying the network address of the selected parent node from the received DIO signal. In box 604, the node transmits a DAO signal to the selected parent node. This DAO signal is directed to the selected parent node via a target network address that matches the network address of the selected parent node extracted from the DIO signal. According to the present invention, this DAO signal contains information about a temporary network address to which the transmitting node will respond. This temporary node address can be an address selected from a set of node addresses set aside for this purpose.

[0038] Figure 7The process 700 performed by the selected parent node is illustrated. In a preferred embodiment, the memory 103 at each node stores instructions that cause the node controller 102 to perform this process. The process 700 starts with a start frame 701. The selected parent node receives a DAO signal in frame 702. As mentioned above, this DAO signal is directed to the current node by the target address and includes an indication of the temporary address of the child node. In frame 703, the process 700 selects an available network address to assign to the requesting node. As mentioned above, this node transmits a DIO signal (frame 502) indicating the availability of the parent node. This ensures that the current node can accept another child node. This node stores an indication of the network address of the currently assigned child node. The process 700 then transmits a DAO_ACK signal back to the requesting node (frame 704). This DAO_ACK signal is transmitted to the temporary address (frame 702) of the received DAO signal. This DAO_ACK signal includes a payload indicating the network address assigned to this child node in frame 703. As indicated in conjunction with FIG. 3 , according to the hierarchical address technique, this assigned address includes high-level fields down to the level of the parent node that is the same as the network address of the parent node. Fields one level lower than the parent node's level are set to unused addresses from the currently assigned child nodes (if any). Process 700 ends with end block 705.

[0039] Process 600( Figure 6 ) continues at block 604. The node receives a DIA_ACK signal from the selected parent node (block 605). As mentioned above, this DAO_ACK signal contains the child network address assigned by the selected parent node. The child node then changes its network address to the assigned address contained in the payload of the DAO_ACK transmission (block 606). The current node then responds to this newly assigned child address in the manner described above. Process 600 ends with end block 607. As previously described, after this assignment of the network address, this child node can transmit a DIO signal to other nodes, which indicates that the child node can be a parent node.

[0040] Prior art hierarchical addressing techniques do not provide a way to rearrange the network after initialization. If the network contains mobile nodes, then the node can be moved to a location that is more accessible to its current parent node. Due to the hierarchical nature of the address, this requires the reassignment of the addresses of the child nodes. Figures 8 to 10 The diagram illustrates this process. Figure 8 The diagram illustrates a process 800 occurring at a moving child node. Fig. 9 The diagram illustrates the process 900 occurring at the old parent node. Fig.10 The diagram illustrates the process 1000 occurring at a new parent node.

[0041] Figure 8The diagram illustrates a process 800 that occurs on a moving child node. In a preferred embodiment, the memory 103 at each node stores instructions that cause the node controller 102 to perform this process. The process 800 begins at a start block 801. Assume that the child node has determined to change the parent node, and the child node has selected the identity of the new parent node (and therefore selected its network address). The process 800 transmits a new signal DAO_NO_PATH to the old parent node. The child node directs this transmission to the network address of the old parent node. This DAO_NO_PATH signal also preferably identifies the transmitting node by the old network address.

[0042] Fig. 9 The diagram illustrates a process 900 that occurs on an old parent node. In a preferred embodiment, the memory 103 at each node stores instructions that cause the node controller 102 to perform this process. The process 900 begins with a start block 901. At block 902, the old parent node receives a DAO_NO_PATH signal. In response to the DAO_NO_PATH signal, the old parent node deallocates the address assigned to the transmitting node (block 903). Therefore, the old parent node is no longer the parent node of the transmitting node. The process 900 ends at an end block 904.

[0043] Return to Figure 8 , after the transmission of the DAO_NO_PATH signal, the mobile child node transmits the DAO signal to the selected new parent node (box 803). This process is similar to box 604 described above. The DAO signal includes a target node indicating the selected new parent node. The DAO signal also includes a temporary node address for reply. This temporary node address can be a previous address. Note that the old parent node has de-allocated this node address and will not attempt to communicate with the mobile child node via this address. This temporary node address can be an address selected from a set of node addresses set aside for this purpose.

[0044] Fig.10 The diagram illustrates a process 1000 that occurs on a new parent node. In a preferred embodiment, the memory 103 at each node stores instructions that cause the node controller 102 to perform this process. The process 1000 begins with a start block 1001. At block 1002, the new parent node receives a DAO signal that contains an indication of the temporary address of the child node. In a test block 1003, the process 1000 determines whether a network address is available for the new child node. This is slightly different from Figure 71000. In process 700, the node has transmitted a DIO signal indicating availability to accept a new child node. In process 1000, the selected parent node may not have a network address that can be used to assign to another child node. If the new parent node has an available network for assigning to the new child node (yes at test box 1003), then process 1000 selects an available network address for assigning to the requesting node in box 1004. Process 1000 then transmits a DAO_ACK signal back to the requesting node (box 1006). This DAO_ACK signal is transmitted to the temporary address of the received DAO signal (box 1002). This DAO_ACK signal contains a payload indicating the network address selected for this child node in box 1004. Process 1000 ends with end box 1006.

[0045] If the new parent node does not have an available network for assignment to the new child node (no at test block 1003), then process 1000 begins error handling in block 1007. This error handling may not be able to respond to the DAO signal. This relies on the requesting child node to recognize the lack of response (via, for example, a timeout) and select another new parent node. This can be done by sending a non-acknowledgement (NAK) signal to the requesting node. The requesting node responds to the NAK signal by selecting another new parent node and transmitting a new DAO signal. After error handling, process 1000 ends with end block 1006.

[0046] Return to Figure 8 , after the transmission of the DAO signal (block 804), the process 800 continues at block 804 by receiving a DIA_ACK signal from the new parent node. As mentioned above, this DAO_ACK signal includes the network address assigned by the new parent node. The child node then changes its network address to the assigned address included in the DAO_ACK transmission (block 807). The current node then responds to this newly assigned child address in the manner described above. The process 800 ends with end block 806.

[0047] The present invention may be practiced with a MAC_ACK signal instead of a DAO_ACK signal. This MAC_ACK signal is similarly directed to the temporary address of the requesting child node and contains the newly assigned network address as part of the payload.

[0048] The present invention has the following advantages in network address assignment and reclaim. The present invention is a simple and elegant solution for network address assignment, reclaim and re-assignment. The present invention applies the same basic principle to all three aspects of address management. The present invention fully complies with existing standards by using payload network address information. The present invention does not incur any additional implementation overhead. The present invention ensures that a hierarchical Do_Dag based RPL network (H-DOC) operates with a routing table of size 1 (corresponding to the node network address).

Claims

1. A node, comprising: a transceiver that communicates with one or more other nodes in the network; a node controller coupled to the transceiver; as well as a memory coupled to the node controller to store network addresses and instructions for a control program, wherein the control program, when executed by the node controller, is configured to cause the node controller to: In response to receiving a temporary address from another node in the network and a first signal indicating that the other node desires to become a child of the node, wherein the temporary address is a previous address of the other node and the temporary address has been deallocated by an old parent node of the other node: selecting a hierarchical address for the other node, the hierarchical address comprising: a first level address subset, a second level address subset selected to be unique to the other node, and at least one additional level address subset including predetermined slots; as well as The transceiver is caused to transmit a second signal to the temporary address, the second signal including an indication of the selected hierarchical address.

2. The node according to claim 1, wherein the network is a target-oriented directed acyclic graph network (DODAG network).

3. The node according to claim 2, wherein the first signal is a targeted advertisement object signal (DAO) signal. The node according to claim 3 , wherein the second signal is a DAO acknowledgement signal (DAO_ACK signal).

5. The node according to claim 2, wherein the second signal is a MAC confirmation signal (MAC_ACK signal).

6. The node according to claim 2, wherein the control program, when executed by the node controller, is configured to cause the node controller to: assign a sub-state to the other node in response to the transmission of the second signal.

7. A node according to claim 6, wherein the control program, when executed by the node controller, is configured to cause the node controller to: in response to receiving a third signal from the other node after the transmission of the second signal, deallocate the substate of the other node.

8. A node, comprising: a transceiver that communicates with one or more other nodes in the network; a node controller coupled to the transceiver; as well as a memory coupled to the node controller to store network addresses and instructions for a control program, wherein the control program, when executed by the node controller, is configured to cause the node controller to: in response to receiving a communication via the transceiver, comparing a destination address of the communication to the network address; causing the communication to be routed to a second node at a hierarchical level higher than the hierarchical level of the node when the subset of the destination addresses corresponding to the hierarchical level of the node does not match the subset of the network addresses corresponding to the hierarchical level of the node; causing the communication to be serviced by the node when the subset of the target addresses corresponding to the hierarchical level of the node matches a subset of the network addresses corresponding to the hierarchical level of the node, and all subsets of the target addresses that include predetermined gaps and correspond to hierarchical levels lower than the hierarchical level of the node match all subsets of the network addresses that include predetermined gaps and correspond to hierarchical levels lower than the hierarchical level of the node; as well as When the subset of the target addresses corresponding to the hierarchical level of the node matches the subset of the network addresses corresponding to the hierarchical level of the node, and all subsets of the target addresses that include predetermined vacancies and correspond to hierarchical levels lower than the hierarchical level of the node do not match all subsets of the network addresses that include predetermined vacancies and correspond to hierarchical levels lower than the hierarchical level of the node, the communication is routed to a third node at a hierarchical level lower than the hierarchical level of the node.

9. The node according to claim 8, wherein the network is a DODAG network.

10. The node of claim 9, wherein the node is a child node of the second node. The node according to claim 9 , wherein the node is a parent node of the third node.

12. A method for initializing a network address in a network, the method comprising: receiving, at a first node device of the network, a communication including a first signal and a temporary address, the first signal indicating that a second node device desires to establish a child relationship with the first node device, and the temporary address corresponds to the second node device, wherein the temporary address is a previous address of the second node and an old parent node of the second node has deallocated the temporary address; selecting a hierarchical address for the second node, the hierarchical address comprising: a first-level address subset, a second-level address subset, and at least one additional-level address subset including predetermined slots, wherein the second-level address subset is selected to uniquely identify the second node device; and A second signal is transmitted to the temporary address, the second signal indicating the selected hierarchical address.

13. The method according to claim 12, wherein the network is a target-oriented directed acyclic graph network (DODAG network).

14. The method of claim 13, wherein the first signal is a targeted advertising object (DAO) signal. The method according to claim 14 , wherein the second signal is a DAO acknowledgement signal (DAO_ACK signal).