KR102163670B1 - Methods and apparatuses for routing in tree structured network - Google Patents

Abstract

The present invention relates to a routing method and apparatus in a tree structure network. According to an embodiment of the present invention, a routing method in a tree structure network comprises the steps of: selecting a parent node to be connected to the tree structure network; updating a routing table by setting an address of the selected parent node to a next address; generating an association notification packet based on the set next address and the address of a destination node and transmitting it to the destination node through the parent node; and receiving a federation notification response packet from the destination node through the parent node.

Description

Routing method and apparatus in tree structure network {METHODS AND APPARATUSES FOR ROUTING IN TREE STRUCTURED NETWORK}

The present invention relates to a routing method in a tree structured network.

In general, a personal area network (PAN) is a concept in contrast to a widely known local area network (LAN) or a long-distance network (WAN), and each individual has a unique network. For example, PAN can be used in various fields such as wireless sensor networks and home networks. In accordance with the efforts to implement such PAN wirelessly, the high-speed wireless personal area network standard was announced as the IEEE 802.15.3 standard, and low power wireless personal area networks (LoWPAN) as the IEEE 802.15.4-2003 standard. Specifications have been published.

The medium access control (MAC) layer in a wireless personal area network (WPAN) used for data communication functions to form a personal area network (PAN) consisting of a coordinator node and neighboring nodes. And transmits data between the coordinator node and neighboring nodes in the personal area network. In the communication technology for the MAC layer, various frame information, channel scan method, device registration method, channel access method, direct and indirect data transmission method, and the like are defined. In addition, the functions of the physical layer and the MAC layer to simultaneously perform data communication and distance measurement in wireless personal area network technology are presented.

However, only P2P data between nodes can be transmitted in the conventional MAC layer, Layer 2 (L2). Therefore, routing is not performed in the conventional layer 2, and an upper network layer is required for routing.

Republic of Korea Patent Publication No. 10-2010-0004944 (published on January 13, 2010)

Embodiments of the present invention are intended to provide a routing method and apparatus in a tree structure network capable of performing routing through a layer 2 (L2) layer in a tree structure network in which a plurality of nodes are connected in a tree structure.

According to an embodiment of the present invention, there is provided a routing method in a tree structure network in which a plurality of nodes are connected in a tree structure, the method comprising: selecting a parent node to be connected to the tree structure network; Updating a routing table by setting the address of the selected parent node to a next address; Generating an association notification packet based on the set next address and the address of the destination node and transmitting the packet to the destination node through the parent node; And receiving a federation notification response packet from the destination node through the parent node, a routing method in a tree structure network may be provided.

The association notification packet is configured according to a MAC (Media Access Control) frame format used in Layer 2, and the next address may be included in a frame payload.

The selecting of the parent node may include selecting a parent node using a beacon received through a beacon request to a plurality of nodes in the tree structure network, or manually selecting one node from among the plurality of nodes. You can choose

Meanwhile, according to another embodiment of the present invention, there is provided a routing method in a tree structure network in which a plurality of nodes are connected in a tree structure, the method comprising: receiving an association notification packet from a previous node in the tree structure network; Updating a routing table by setting the address of the previous node based on the next address set in the received federation notification packet; Comparing the destination address and the next address set in the received federation notification packet with its own address, generating a new federation notification packet according to the comparison result, and transmitting it to the destination node through the next node; And transmitting, to the previous node, a federation notification response packet replied from the destination node based on the updated routing table, a routing method in a tree structure network.

The association notification packet is configured according to a MAC (Media Access Control) frame format used in Layer 2, and the next address may be included in a frame payload.

The method may further include determining itself as a destination node if the destination address and the next address are the own address and confirming the received federation notification packet.

The method may further include discarding the received federation notification packet if the destination address and the next address are not the own address.

In the step of transmitting to the destination node, if the destination address is not the own address and the next address is its own address, a new association notification packet may be generated and transmitted to the destination node through the next node.

The relaying to the destination node may generate the new association notification packet by setting the own address as a source address and setting the address of the next node as the next address.

Meanwhile, according to another embodiment of the present invention, a communication module for communicating with other nodes in a tree structure network in which a plurality of nodes are connected in a tree structure; A memory for storing at least one program; And a processor connected to the communication module and the memory, wherein the processor selects a parent node to be connected to a tree structure network by executing the at least one program, and transfers the address of the selected parent node to a next address. It sets and updates the routing table, generates a federation notification packet based on the set next address and the address of the destination node, transmits it to the destination node through the parent node, and sends the federation notification response packet replied from the destination node to the parent A routing device in a tree structured network may be provided that receives via a node.

The association notification packet is configured according to a MAC (Media Access Control) frame format used in Layer 2, and the next address may be included in a frame payload.

The processor may select a parent node using a beacon received through a beacon request from a plurality of nodes in the tree structure network, or may manually select any one node as a parent node from among the plurality of nodes.

Meanwhile, according to another embodiment of the present invention, a communication module for communicating with other nodes in a tree structure network; A memory for storing at least one program; And a processor connected to the communication module and the memory, wherein the processor receives an association notification packet from a previous node in a tree structure network by executing the at least one program, and is set in the received association notification packet. Set the address of the previous node based on the address to update the routing table, compare the destination address and the next address set in the received federation notification packet with its own address, and generate a new federation notification packet according to the comparison result Thus, a routing apparatus in a tree structure network may be provided, which transmits to the destination node through the next node and transmits the federation notification response packet responded from the destination node to the previous node based on the updated routing table.

The association notification packet is configured according to a MAC (Media Access Control) frame format used in Layer 2, and the next address may be included in a frame payload.

If the destination address and the next address are the own addresses, the processor may determine itself as a destination node and check the received federation notification packet.

If the destination address and the next address are not the own address, the processor may discard the received association notification packet.

If the destination address is not the own address and the next address is its own address, the processor may generate a new association notification packet and transmit it to the destination node through the next node.

The processor may generate the new association notification packet by setting its own address as a source address and setting the address of the next node as the next address.

Embodiments of the present invention may perform routing through an L2 (Layer 2) layer in a tree structure network in which a plurality of nodes are connected in a tree structure.

1 is a flowchart of a routing method in a tree structure network according to an embodiment of the present invention.
2 is a flow chart of a routing method in a tree structure network according to another embodiment of the present invention.
3 is a diagram showing comments used in a routing method in a tree structure network according to an embodiment of the present invention.
4 is a diagram showing a conventional MAC frame format and a MAC frame format used in an embodiment of the present invention.
5 is a diagram illustrating an operation of an association notification packet and an association notification response packet according to an embodiment of the present invention.
6 to 9 are diagrams illustrating frames and routing tables of an association notification packet for each transmission operation of an association notification packet according to an embodiment of the present invention.
10 is a flowchart of a routing operation performed by a node in a tree structure network according to an embodiment of the present invention.
11 is a block diagram illustrating a configuration of a routing device in a tree structure network according to an embodiment of the present invention.

Since the present invention can make various changes and have various embodiments, specific embodiments will be illustrated in the drawings and described in detail.

However, this is not intended to limit the present invention to a specific embodiment, it is to be understood to include all changes, equivalents, or substitutes included in the spirit and scope of the present invention.

Terms such as first and second may be used to describe various components, but the components should not be limited by the terms. These terms are used only for the purpose of distinguishing one component from another component. For example, without departing from the scope of the present invention, a first element may be referred to as a second element, and similarly, a second element may be referred to as a first element. The term and/or includes a combination of a plurality of related listed items or any of a plurality of related listed items.

When a component is referred to as being "connected" or "connected" to another component, it is understood that it may be directly connected or connected to the other component, but other components may exist in the middle. Should be. On the other hand, when a component is referred to as being "directly connected" or "directly connected" to another component, it should be understood that there is no other component in the middle.

The terms used in the present application are only used to describe specific embodiments, and are not intended to limit the present invention. Singular expressions include plural expressions unless the context clearly indicates otherwise. In the present application, terms such as "comprise" or "have" are intended to designate the presence of features, numbers, steps, actions, components, parts, or combinations thereof described in the specification, but one or more other features. It is to be understood that the presence or addition of elements or numbers, steps, actions, components, parts, or combinations thereof, does not preclude in advance.

Unless otherwise defined, all terms used herein, including technical or scientific terms, have the same meaning as commonly understood by one of ordinary skill in the art to which the present invention belongs. Terms such as those defined in a commonly used dictionary should be interpreted as having a meaning consistent with the meaning in the context of the related technology, and should not be interpreted as an ideal or excessively formal meaning unless explicitly defined in this application. Does not.

Hereinafter, preferred embodiments of the present invention will be described in more detail with reference to the accompanying drawings. In describing the present invention, in order to facilitate an overall understanding, the same reference numerals are used for the same elements in the drawings, and duplicate descriptions for the same elements are omitted.

1 is a flowchart of a routing method in a tree structure network according to an embodiment of the present invention.

In the tree structure network, an example in which the first node 11 and the second node 12 are connected in a tree structure is illustrated in FIG. 1. A routing method in the case where the third node 13 wishes to associate with the tree structure network will be described. Here, an embodiment of the present invention is not limited to a specific network, and may be applied to a wireless network including a plurality of nodes.

In step S101, the third node 13 transmits a beacon request packet to nodes included in the tree structure network.

In step S102, the third node 13 receives a beacon in response to the beacon request.

In step S103, the third node 13 selects a parent node to be connected to the tree structure network based on the received beacon. For example, node 3 13 may select node 2 12, which is located closest to, as a parent node. That is, the third node 13 may select the parent node by using the beacon received through a beacon request to a plurality of nodes in the tree structure network.

In step S104, the third node 13 updates the routing table based on the received beacon. Here, the third node 13 may update the routing table by setting the address of the selected parent node to the next address.

In step S105, the third node 13 generates an association notification packet based on the set next address and the address of the destination node and transmits it to the second node 12, which is a parent node. This is to transmit the federation notification packet to the first node 11, which is the destination node, through the second node 12.

In step S106, the second node 12 updates the routing table based on the federation notification packet received from the third node 13. Here, the second node 12 may update the routing table by setting the third node 13 as a child node.

In step S107, the second node 12 sets the address of the first node 11, which is the parent node, as the next address, and generates a federation notification packet based on the set next address and the address of the destination node, It transmits to node 11.

In step S108, the first node 11 updates the routing table based on the federation notification packet received from the second node 12. Here, the first node 11 may update the routing table by setting the second node 12 as a child node.

In step S109, node 1 11 generates an Association notification ack packet in response to the received association notification packet and transmits it to node 2 12.

In step S110, the second node 12 transmits the received federation notification response packet to the third node 13. Thereafter, the third node 13 may confirm that the transmission of the federation notification packet transmitted in step S105 is completed to the first node 11 through the received federation notification response packet.

2 is a flow chart of a routing method in a tree structure network according to another embodiment of the present invention.

In step S201, the third node 13 manually selects the second node 12 as a parent node. In this way, the third node 13 may manually select a parent node from among a plurality of nodes included in the tree structure network.

In step S202, the third node 13 updates the routing table based on the manually selected address of the second node 12. Here, the third node 13 may update the routing table by setting the address of the selected parent node to the next address.

In step S203, the third node 13 generates an association notification packet based on the set next address and the address of the destination node, and transmits it to the second node 12, which is a parent node. This is to transmit the federation notification packet to the first node 11, which is the destination node, through the second node 12.

In step S204, the second node 12 updates the routing table based on the federation notification packet received from the third node 13. Here, the second node 12 may update the routing table by setting the third node 13 as a child node.

In step S205, the second node 12 sets the address of the first node 11, which is the parent node, to the next address, and generates a federation notification packet based on the set next address and the address of the destination node, It transmits to node 11.

In step S206, the first node 11 updates the routing table based on the federation notification packet received from the second node 12. Here, the first node 11 may update the routing table by setting the second node 12 as a child node.

In step S207, node 1 11 generates an association notification response packet in response to the received association notification packet and transmits it to node 2 12.

In step S208, the second node 12 transmits the received federation notification response packet to the third node 13. Thereafter, the third node 13 may confirm that the transmission of the federation notification packet transmitted in step S203 is completed to the first node 11 through the received federation notification response packet.

3 is a diagram showing comments used in a routing method in a tree structure network according to an embodiment of the present invention.

Comments used in a routing method in a tree structured network are shown in FIG. 3. The commands are divided into a command specified in the existing IEEE 802.15.4 and a new command used in an embodiment of the present invention. The existing commands specified in IEEE802.15.4 include an Association Request command with a comment ID of 0x01, an Association Response command with a comment ID of 0x02, a Disassociation Notification command with a comment ID of 0x03, and a comment ID. Data request command with 0x04, PAN ID Conflict Notification command with comment ID 0x05, Orphan Notification command with comment ID 0x06, Beacon request with comment ID 0x07 Request) Command, Coordinator realignment command with comment ID 0x08, GTS request command with comment ID 0x09, TRLE Management Reques command with comment ID 0x0A, and comment ID 0x0B A TRLE Management Response command may be included. The new command used in an embodiment of the present invention may include an Association Notification command with a comment ID of 0x0c and an Association Notification Ack command with a comment ID of 0x0d.

4 is a diagram showing a conventional MAC frame format and a MAC frame format used in an embodiment of the present invention.

4A shows a conventional MAC frame format. In the conventional MAC frame format, frame control, sequence number, destination PAN ID (Destiantion PAN ID), destination address, source address, frame payload And FCS (Frame Check Sequence).

4B shows the MAC frame format used in an embodiment of the present invention. The MAC frame format used in an embodiment of the present invention includes frame control, sequence number, destination PAN ID (Destiantion PAN ID), destination address, source address, Frame Payload and Frame Check Sequence (FCS) are included, and Frame Payload includes Next Address and Payload for routing methods in a tree-structured network. . Next Address represents the address of the next node in the tree structure. As a modified example, the next address may be located differently from (b) of FIG. 4 in the MAC frame format, and is not limited to a specific location.

5 is a diagram illustrating an operation of an association notification packet and an association notification response packet according to an embodiment of the present invention.

In the tree structure network, a packet transmission operation when nodes 0 to 3 (10 to 13) are connected in a tree structure and node 4 (14) is to be associated with the tree structure network will be described.

Node 4 (14) generates a federation notification packet in which the address of node 3 (13) is set as the next address and the address of node 0 (10) is the address of the destination node, and sends it to node 3 (13). send. In addition, the third node 13 generates an association notification packet in which the address of the second node 12 is set to the next address and transmits it to the second node 12. The second node 12 generates an association notification packet in which the address of the first node 11 is set to the next address and transmits it to the first node 11. Subsequently, node 1 11 generates an association notification packet in which the address of node 0 10 is set to the next address and transmits it to node 0 10. Here, the address of the destination node is set to the address of node 0 (10).

On the other hand, node 0 10 generates an association notification response packet in response to the received association notification packet and transmits it to node 1 11. Contrary to the transmission direction of the federation notification packet, node 0 (10) sets the address of node 1 (11) to the next address and the address of node 4 (14) is set as the address of the destination node. Is generated and transmitted to node 1 (11). In addition, node 1 11 generates an association notification response packet in which the address of node 2 12 is set to the next address and transmits it to node 2 12. The second node 12 generates a federation notification response packet in which the address of the third node 13 is set to the next address, and transmits it to the third node 13. Subsequently, the third node 13 generates an association notification response packet in which the address of the fourth node 14 is set to the next address, and transmits it to the fourth node 14. Here, the address of the destination node is set to the address of the fourth node 14.

6 to 9 are diagrams illustrating frames and routing tables of an association notification packet for each transmission operation of an association notification packet according to an embodiment of the present invention.

As shown in (a) of FIG. 6, a case where the fourth node 14 transmits an association notification packet to the third node 13 will be described.

The frame of the association notification packet transmitted by the fourth node 14 is shown in FIG. 6B. First, the frames of the association notification packet are Association Notification, Sequence Number, Destination PAN ID, Destination Address, Source Address, IE, and frame payload. It is composed of (Frame payload) and FCS (Frame Check Sequence).

Here, in the frame of the association notification packet transmitted by node 4 14, the destination address is the address (0x00) of node 0 10, which is a coordinator. The source address is the address (0x04) of node 4, which is its own address (My address). As the next address in the frame payload, the address (0x03) of the third node 13, which is the next node, is set. In addition, a device address (0x04) indicating an association notification packet generated by the fourth node 14 is set in the frame payload.

Meanwhile, the routing table may include a destination address, a next address, a hop, and a signal strength (RSSI). Node 3 13 is previously associated with the tree structure network. Therefore, for the address of node 0 10, which is the destination address, the next address is the address of node 2 12, the number of hops from node 0 10 is set to 0, and RSSI is set to xx. The first node 11 and the second node 12 are also set as shown in FIG. 6C. Node 3 13 may update this routing table as shown in (c) of FIG. 6 based on the federation notification packet received from node 4 14. Node 3 (13) is the address of node 4 (14) as the destination address, the next address is the address of node 4 (14), the number of hops from node 0 (10) is 4, and RSSI is xx. Can be updated.

Meanwhile, as shown in (a) of FIG. 7, a case in which the third node 13 transmits an association notification packet to the second node 12 will be described.

The frame of the association notification packet transmitted by the third node 13 is shown in FIG. 7B. Here, in the frame of the association notification packet transmitted by node 3 13, the destination address is the address (0x00) of node 0 10, which is the coordinator. The source address is the address (0x03) of node 3, which is its own address. The next address in the frame payload is the address (0x02) of the second node 12, which is the next node. In addition, a device address (0x04) indicating an association notification packet generated by the fourth node 14 is set in the frame payload.

On the other hand, node 2 12 is previously associated with the tree structure network. Therefore, with respect to the address of node 0 10, which is the destination address, the next address is the address of node 1 11, the number of hops from node 0 10 is set to 0, and RSSI is set to xx. The first node 11 and the third node 13 are also set as shown in Fig. 7(c). Node 2 12 may update this routing table as shown in (c) of FIG. 7 based on the federation notification packet received from node 3 13. Node 2 (12) is the address of node 4 (14), which is the destination address, the next address is the address of node 3 (13), the number of hops from node 0 (10) is 4, and RSSI is xx. Can be updated.

On the other hand, as shown in (a) of FIG. 8, a case where the second node 12 transmits an association notification packet to the first node 11 will be described.

The frame of the association notification packet transmitted by the second node 12 is shown in FIG. 8B. Here, in the frame of the association notification packet transmitted by node 2 12, the destination address is the address (0x00) of node 0, which is the coordinator. The source address is the address (0x02) of node 2, which is its own address. The next address in the frame payload is the address (0x01) of node 1, which is the next node. In addition, a device address (0x04) indicating an association notification packet generated by the fourth node 14 is set in the frame payload.

On the other hand, node 1 11 is previously associated with the tree structure network. Therefore, with respect to the address of node 0 10, which is the destination address, the next address is the address of node 0 10, the number of hops from node 0 10 is set to 0, and RSSI is set to xx. The second node 12 and the third node 13 are also set as shown in FIG. 8C. Node 1 11 may update this routing table as shown in (c) of FIG. 8 based on the federation notification packet received from node 2 12. For the address of node 4 (14), which is the destination address, node 1 (11) is the next address as the address of node 2 (12), the number of hops from node 0 (10) is 4, and RSSI is xx. Can be updated.

On the other hand, as shown in (a) of FIG. 9, a case where the first node 11 transmits the federation notification packet to the 0 node 10 will be described.

The frame of the association notification packet transmitted by the first node 11 is shown in FIG. 9B. Here, in the frame of the association notification packet transmitted by node 1 11, the destination address is the address (0x00) of node 0 10, which is the coordinator address. The source address is the address (0x01) of node 1, which is its own address. The next address in the frame payload is the address (0x00) of node 0, which is the next node. In addition, a device address (0x04) indicating an association notification packet generated by the fourth node 14 is set in the frame payload.

On the other hand, node 0 10 is previously associated with the tree structure network and operates as a coordinator. Therefore, with respect to the address of the first node 11, which is the destination address, the next address is the address of the first node 11, the number of hops from the 0 node 10 is set to 1, and the RSSI is set to xx. The second node 12 and the third node 13 are also set as shown in FIG. 9C. Node 0 10 may update this routing table as shown in (c) of FIG. 9 based on the federation notification packet received from node 1 11. Node 0 10 is the address of node 4, which is the destination address, the next address is the address of node 1 11, the number of hops from node 0 10 is 4, and RSSI is xx. Can be updated.

Thereafter, node 0 10 generates a federation notification response packet in response to the federation notification packet received from node 1 11, as described in FIG. 5, and sends the generated federation notification response packet to node 1 (11), it can be transmitted to the fourth node 14 through the second node 12 and the third node 13.

10 is a flowchart of a routing operation performed by a node in a tree structure network according to an embodiment of the present invention.

In step S301, the routing device at the node receives an association notification packet.

In step S302, the routing device checks whether the destination address (Dst Addr) set in the received association notification packet matches its own address (My addr).

In step S303, if the destination address set in the received federation notification packet does not match its own address, the routing device checks whether the next address set in the received federation notification packet matches its own address.

In step S304, if the next address set in the received association notification packet matches its own address, the routing device checks the routing table and updates the routing table based on the association notification packet.

In step S305, the routing device checks the next address based on the checked routing table and generates a new association notification packet. As a modified example, the routing device may change some information (eg, source address, next address, etc.) of the association notification packet received in step S301.

In step S306, the routing device transmits a new association notification packet generated to the next node.

On the other hand, in step S307, if the next address set in the received association notification packet does not match its own address, the routing device discards the received association notification packet. If the next address does not match its own address, it means that the federation notification packet was not received directly from the previous node.

On the other hand, in step S308, if the destination address set in the received federation notification packet matches its own address, the routing device checks whether the next address set in the received federation notification packet matches its own address.

In step S309, when the destination address and the next address match its own address, the routing apparatus checks the association notification packet and transmits the association notification response packet to the previous node in response to the association notification packet.

11 is a block diagram illustrating a configuration of a routing device in a tree structure network according to an embodiment of the present invention.

As shown in FIG. 11, the routing apparatus 100 according to an embodiment of the present invention includes a communication module 110, a memory 120, and a processor 130. However, not all of the illustrated components are essential components. The routing device 100 may be implemented by more components than the illustrated components, and the routing device 100 may be implemented by fewer components than the illustrated components.

Hereinafter, a detailed configuration and operation of each component of the routing device 100 of FIG. 11 will be described.

The communication module 110 communicates with other nodes in a tree structure network in which a plurality of nodes are connected in a tree structure.

The memory 120 stores at least one program.

An operation of the processor 130 included in the routing apparatus 100 of a node to be associated with a tree structure network as a node according to an embodiment of the present invention will be described. The processor 130 is connected to the communication module 110 and the memory 120. By executing at least one program, the processor 130 selects a parent node to be connected to the tree structure network, updates the routing table by setting the address of the selected parent node to the next address, and updates the routing table. A federation notification packet is generated based on the address and transmitted to the destination node through the parent node, and the federation notification response packet received from the destination node is received through the parent node.

According to embodiments, the association notification packet is configured according to the MAC (Media Access Control) frame format used in Layer 2, and the next address may be included in the frame payload.

According to embodiments, the processor 130 selects a parent node using a beacon received through a beacon request to a plurality of nodes in a tree structure network, or manually selects any one node as a parent node from among a plurality of nodes. You can choose.

Meanwhile, an operation of the processor 130 included in a node associated with a tree structure network as a node according to another embodiment of the present invention will be described. The processor 130 receives the federation notification packet from the previous node in the tree structure network, sets the address of the previous node based on the next address set in the received federation notification packet, and updates the routing table, and the received federation notification packet The destination address and the next address set in are compared with their own address, a new federation notification packet is generated according to the comparison result, and transmitted to the destination node through the next node, and federation notification received from the destination node based on the updated routing table A response packet may be transmitted to the previous node.

According to embodiments, the association notification packet is configured according to the MAC (Media Access Control) frame format used in Layer 2, and the next address may be included in the frame payload.

According to embodiments, if the destination address and the next address are its own addresses, the processor 130 may determine itself as a destination node and check the received federation notification packet.

According to embodiments, the processor 130 may discard the received association notification packet if the destination address and the next address are not the own address.

According to embodiments, if the destination address is not the own address and the next address is its own address, the processor 130 may generate a new association notification packet and transmit it to the destination node through the next node.

According to embodiments, the processor 130 may generate the new association notification packet by setting its own address as a source address and setting the address of the next node as the next address.

The routing method in the tree structure network according to the embodiments of the present invention can be implemented as computer-readable codes on a computer-readable recording medium. The routing method in a tree-structured network according to embodiments of the present invention may be implemented in the form of program instructions that can be executed through various computer means and recorded in a computer-readable recording medium.

A non-transitory computer-readable storage medium comprising at least one program executable by a processor, wherein when the at least one program is executed by the processor, the processor causes: selecting a parent node to be connected to a tree structure network And, the routing table is updated by setting the address of the selected parent node to the next address, and an association notification packet is generated based on the set next address and the address of the destination node, and transmitted to the destination node through the parent node, and the A non-transitory computer-readable storage medium may be provided comprising instructions for causing, via the parent node, a federated notification response packet replied from a destination node.

Meanwhile, as a non-transitory computer-readable storage medium including at least one program executable by a processor, when the at least one program is executed by the processor, the processor causes: an association notification from a previous node in a tree structure network Receives a packet, updates the routing table by setting the address of the previous node based on the next address set in the received federation notification packet, and sets the destination address and the next address set in the received federation notification packet with its own address. Compare and generate a new federation notification packet according to the comparison result and transmit it to the destination node through the next node, and transmit the federation notification response packet responded from the destination node to the previous node based on the updated routing table. A non-transitory computer-readable storage medium may be provided that includes instructions for doing so.

The above-described method according to the present invention may be implemented as a computer-readable code on a computer-readable recording medium. The computer-readable recording medium includes all kinds of recording media in which data that can be decoded by a computer system is stored. For example, there may be read only memory (ROM), random access memory (RAM), magnetic tape, magnetic disk, flash memory, optical data storage device, and the like. In addition, the computer-readable recording medium can be distributed to a computer system connected through a computer communication network, and stored and executed as code that can be read in a distributed manner.

Although described above with reference to the drawings and examples, it does not mean that the protection scope of the present invention is limited by the drawings or examples, and those skilled in the art It will be appreciated that various modifications and changes can be made to the present invention without departing from the spirit and scope.

Specifically, the described features may be implemented in digital electronic circuitry, or computer hardware, firmware, or combinations thereof. Features may be executed in a computer program product implemented in storage in a machine-readable storage device, for example, for execution by a programmable processor. And the features can be performed by a programmable processor executing a program of directives to perform the functions of the described embodiments by operating on input data and generating output. The described features include at least one programmable processor, at least one input device, and at least one output coupled to receive data and directives from the data storage system and to transmit data and directives to the data storage system. It can be executed within one or more computer programs that can be executed on a programmable system including the device. A computer program includes a set of directives that can be used directly or indirectly within a computer to perform a specific action on a given result. A computer program is written in any form of a programming language, including compiled or interpreted languages, and is included as a module, element, subroutine, or other unit suitable for use in another computer environment, or as a independently operable program. It can be used in any form.

Suitable processors for execution of a program of directives include, for example, both general and special purpose microprocessors, and either a single processor or multiple processors of a different type of computer. Storage devices suitable for implementing computer program directives and data implementing the described features are, for example, semiconductor memory devices such as EPROM, EEPROM, and flash memory devices, magnetic devices such as internal hard disks and removable disks. Devices, magneto-optical disks, and all types of non-volatile memory including CD-ROM and DVD-ROM disks. The processor and memory may be integrated within application-specific integrated circuits (ASICs) or added by ASICs.

The present invention described above is described on the basis of a series of functional blocks, but is not limited by the above-described embodiments and the accompanying drawings, and various substitutions, modifications and changes within the scope not departing from the technical spirit of the present invention It will be apparent to those of ordinary skill in the art to which this invention pertains.

Combinations of the above-described embodiments are not limited to the above-described embodiments, and combinations of various types as well as the above-described embodiments may be provided according to implementation and/or need.

In the above-described embodiments, the methods are described on the basis of a flow chart as a series of steps or blocks, but the present invention is not limited to the order of steps, and certain steps may occur in a different order or concurrently with other steps as described above. I can. In addition, those of ordinary skill in the art understand that the steps shown in the flowchart are not exclusive, other steps are included, or one or more steps in the flowchart may be deleted without affecting the scope of the present invention. You can understand.

The above-described embodiments include examples of various aspects. Although not all possible combinations for representing the various aspects can be described, those of ordinary skill in the art will recognize that other combinations are possible. Accordingly, the present invention will be said to include all other replacements, modifications and changes falling within the scope of the following claims.

10, 11, 12, 13, 14: Nodes 0, 1, 2, 3, and 4:
100: routing device
110: communication module
120: memory
130: processor

Claims (18)

In the routing method in a tree structure network in which a plurality of nodes are connected in a tree structure,
Selecting a parent node to be connected to the tree structured network;
Updating a routing table by setting the address of the selected parent node to a next address;
Generating an association notification packet based on the set next address and the address of the destination node and transmitting the packet to the destination node through the parent node; And
Receiving a federation notification response packet received from the destination node through the parent node,
The association notification packet is configured according to a MAC (Media Access Control) frame format used in Layer 2, and the next address is included in a frame payload. delete The method of claim 1,
The step of selecting the parent node,
In the tree structure network, in which a parent node is selected using a beacon received through a beacon request to a plurality of nodes in the tree structure network, or any one node is manually selected as a parent node from the plurality of nodes. Routing method. In the routing method in a tree structure network in which a plurality of nodes are connected in a tree structure,
Receiving an association notification packet from a previous node in a tree structured network;
Updating a routing table by setting the address of the previous node based on the next address set in the received federation notification packet;
Comparing the destination address and the next address set in the received federation notification packet with its own address, generating a new federation notification packet according to the comparison result, and transmitting it to the destination node through the next node; And
Transmitting a federation notification response packet replied from the destination node to the previous node based on the updated routing table,
The association notification packet is configured according to a MAC (Media Access Control) frame format used in Layer 2, and the next address is included in a frame payload. delete The method of claim 4,
If the destination address and the next address are the own address, determining itself as a destination node and confirming the received federation notification packet. The method of claim 4,
And discarding the received federation notification packet if the destination address and the next address are not the own address. The method of claim 4,
Transmitting to the destination node,
If the destination address is not the own address and the next address is its own address, a new association notification packet is generated and transmitted to the destination node through the next node. The method of claim 4,
Transmitting to the destination node,
The routing method in a tree structure network, wherein the new association notification packet is generated by setting the own address as a source address and the next node address as the next address. A communication module for communicating with other nodes in a tree structure network in which a plurality of nodes are connected in a tree structure;
A memory for storing at least one program; And
And a processor connected to the communication module and the memory,
The processor, by executing the at least one program,
Select the parent node to be connected to the tree structure network,
Update the routing table by setting the address of the selected parent node to the next address,
An association notification packet is generated based on the set next address and the address of the destination node and transmitted to the destination node through the parent node,
Receiving a federation notification response packet from the destination node through the parent node,
The association notification packet is configured according to a MAC (Media Access Control) frame format used in Layer 2, and the next address is included in a frame payload. delete The method of claim 10,
The processor,
Routing in a tree structure network, in which a parent node is selected using a beacon received through a beacon request to a plurality of nodes in the tree structure network, or one node is manually selected as a parent node from the plurality of nodes Device. A communication module for communicating with other nodes in a tree structure network;
A memory for storing at least one program; And
And a processor connected to the communication module and the memory,
The processor, by executing the at least one program,
Receiving a federation notification packet from a previous node in a tree structured network,
Update the routing table by setting the address of the previous node based on the next address set in the received federation notification packet,
The destination address and the next address set in the received federation notification packet are compared with their own address, a new federation notification packet is generated according to the comparison result, and transmitted to the destination node through the next node,
Transmitting a federation notification response packet replied from the destination node to the previous node based on the updated routing table,
The association notification packet is configured according to a MAC (Media Access Control) frame format used in Layer 2, and the next address is included in a frame payload. delete The method of claim 13,
The processor,
If the destination address and the next address are the own address, it determines itself as a destination node and checks the received federation notification packet. The method of claim 13,
The processor,
Discarding the received federation notification packet if the destination address and the next address are not the own address. The method of claim 13,
The processor,
If the destination address is not the own address and the next address is its own address, a new association notification packet is generated and transmitted to the destination node through the next node. The method of claim 13,
The processor,
The routing device in a tree structure network, configured to generate the new association notification packet by setting the own address as a source address and the next node address as the next address.

Images