JP2011109412A - Node device, ad hoc network system, and method of participating in network - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a node device executing a control operation for newly participating in a multihop network with a further small traffic volume and delay time. <P>SOLUTION: The node device can participate in a multihop network of a tree structure using, as a root, a line concentration node for managing information of a node having participated in the network. When newly participating in the multihop network, the node device acquires information related to a route to the line concentration node of the multihop network in which each node participates from respective surrounding nodes, and transmits a registration request message showing a participation request into the multihop network to a node selected based on the acquired information. <P>COPYRIGHT: (C)2011,JPO&amp;INPIT

Description

  The present invention relates to a node device constituting a tree-shaped multihop network rooted at a concentrator node, an ad hoc network system including the multihop network, and a network participation method.

  With the progress of wireless communication technology and the downsizing and sophistication of electronic devices in recent years, communication between communication devices can be performed without using existing network infrastructure, compared to the conventional infrastructure type communication form. There is a growing interest in ad hoc networks. This ad hoc network is different from the conventional fixed infrastructure type network in that (1) communication between objects and devices, (2) construction of autonomous networks with a large number of objects and devices, and (3) existing It has features such as (4) easy and temporary network construction, and can respond autonomously to changes in topology. At present, many routing protocols (ad hoc routing protocols) for forming an ad hoc network have been proposed in order to satisfy the above features (1) to (4). For example, DSR (Dynamic Source Routing) described in Non-Patent Document 1 below, AODV (Ad Hoc On Demand Distance Vector Routing) described in Non-Patent Document 2 below, OLSR (Optimized) described in Non-Patent Document 3 below Link State Routing) is known.

  DSR and AODV are on-demand type routing protocols, and perform communication by obtaining a route from a transmission source to a transmission destination when a communication request occurs. On the other hand, OLSR is a proactive routing protocol, and topology information is managed by always exchanging route information between communication devices (nodes) constituting a network. For this reason, when a communication request is generated, it is possible to start communication based on the stored route information.

  Here, in order to realize communication between the nodes constituting the network, each node needs to hold a unique communication identifier in the network. However, in a large-scale multi-hop network, it is necessary to manually Setting a unique identifier for each node is not practical. In contrast to the above, automatic configuration of communication identifiers has been proposed. For example, in IPv6, stateful automatic configuration (see Non-Patent Document 4 below) and stateless automatic configuration (see Non-Patent Document 5 below) are supported. In Stateful Automatic Configuration, DHCPv6 (Dynamic Host Configuration Protocol for IPv6) In response to a request from each node, a unique address (communication identifier) and a valid period of the address are assigned.

  On the other hand, in the stateless automatic configuration, an address is determined based on information held by each node. In general, in order to confirm that the determined address is unique to the network (link), inquiry messages for the determined address are distributed in the network. If the node receives any response, it determines that the address is already in use and assigns another address. Here, if a response is not received within a certain time after the inquiry message is transmitted, it is determined that the determined address of the own node is unique. Regardless of IPv6, the same mechanism (confirmation of whether the determined address is unique) is necessary for automatic address configuration.

IETF RFC4728 IETF RFC3561 IETF RFC3626 IETF RFC3315 IETF RFC4862

  However, a system to which the various protocols described above are applied has the following problems.

  For example, by applying an on-demand routing protocol, a concentrator node collects information from nodes installed in a wide area, or a concentrator node notifies each node in a wide area area of control information. For this purpose, consider a system in which a tree-like multi-hop network rooted at a concentrator node is constructed. When a new node tries to enter such a system, it is necessary for the node trying to enter to notify the concentrator node of a registration request message in order to indicate its presence. Here, in the conventional method, first, a newly entering node distributes a route search request message in the network as a route search for the concentrator node, and receives a route search response message from the target node. It is necessary to obtain a route to the concentrator node and to transmit a registration request message according to the obtained route information. Therefore, there are problems such as an increase in traffic for route search accompanying new entry and an increase in delay until route establishment by route search. In addition, even when the concentrating node notifies the node that newly enters, whether entry is possible or not, it is necessary to first perform a route search for the newly entering node, and traffic increase for route search, and route search There was a problem such as an increase in delay until route establishment.

  In addition, even in the automatic configuration of identifiers for communication, in the conventional stateful automatic configuration method, it is necessary to request allocation of identifiers to a specific server performing address management. There are problems such as route establishment (route search) for notifying a specific server of a message requesting allocation of traffic and increase in traffic due to notification by broadcast. In the conventional stateless automatic configuration method, each node needs to distribute packets (messages) for confirming that the determined identifier is unique in the network. There is a problem in that the delay time required for confirming the property increases.

  The present invention has been made in view of the above, and is transmitted and received between a newly entering node and a concentrating node in a system having a multi-hop network constructed in a tree shape with the concentrating node as a root. An object of the present invention is to obtain a node device, an ad hoc network system, and a network participation method capable of executing control operations for new entry with a smaller amount of traffic and delay time.

  In order to solve the above-described problems and achieve the object, the present invention is a node device that can participate in a multi-hop network having a tree structure rooted in a concentrator node that manages information on nodes that have already entered the network. When newly entering a multi-hop network, information on the route from each surrounding node to the concentrating node of the multi-hop network in which each node has entered is acquired and selected based on the acquired information. A registration request message indicating a request to participate in a multi-hop network is transmitted to the node.

  According to the present invention, since the overhead of route search is reduced, it is possible to realize low traffic and low delay in new entry operation to an ad hoc network.

FIG. 1 is a diagram showing a configuration example of an ad hoc network system according to the present invention. FIG. 2 is a sequence diagram showing an operation example when a node newly enters the ad hoc network system having the configuration shown in FIG. FIG. 3 is a diagram illustrating a configuration example of a message used in the active scan. FIG. 4 is a diagram illustrating a configuration example of a registration request / response message. FIG. 5 is a diagram illustrating a configuration example of an encapsulated message. FIG. 6 is a sequence diagram illustrating an operation example in the case of confirming the uniqueness of the communication identifier determined by the node desiring new entry. FIG. 7 is a sequence diagram showing an operation example when the concentrating node accepts a request from a node desiring new entry and permits entry.

  Hereinafter, embodiments of a node device, an ad hoc network system, and a network participation method according to the present invention will be described in detail with reference to the drawings. Note that the present invention is not limited to the embodiments.

Embodiment 1 FIG.
FIG. 1 is a diagram showing a configuration example of an ad hoc network system according to the present invention. The ad hoc network system shown in FIG. 1 includes multi-hop networks 10 and 20 and a server 100.

  The multi-hop network 10 includes nodes (node devices) 1-1 to 1-N and 1-X. In addition, the node 1-X operates as a concentrator node, performs a control operation such as receiving a control message (registration request message) from a node that desires new entry, and determining whether or not to join, and has already entered Information such as communication identifiers for each node is managed. The multi-hop network 20 includes nodes 2-1 to 1-M and 2-X, and the node 2-X operates as a concentration node. In other words, each multi-hop network collects information from nodes where the concentrating nodes are installed in a wide area (nodes that have already joined the multi-hop network), or the concentrating nodes control each node in the wide area. For the purpose of realizing a communication mode for notifying information, a tree-like configuration having a concentration node as a root is applied. In addition, the concentration nodes of each multi-hop network are connected to an external network, and can communicate with the server 100 and other multi-hop networks via the external network. The server 100 is a server for managing the system. Note that the node 3 illustrated in FIG. 1 communicates with the node 1-3 of the multihop network 10 (the node 1-3 entering the multihop network 10) and the node 2-1 of the multihop network 20. It is a node that exists in a possible position and is in a state where it can enter both the multi-hop networks 10 and 20, but has not entered any multi-hop network.

  Next, a characteristic operation in the ad hoc network system having the above configuration will be described. In the present embodiment, an operation when a new node (a node that has not yet entered) enters the ad hoc network system will be described. Here, as an example, the operation when the node 3 enters will be described with reference to FIG. FIG. 2 is a sequence diagram showing an operation example when the node 3 newly enters the ad hoc network system having the configuration shown in FIG. FIG. 2 shows an operation example when the node 3 wishes to participate in the multi-hop network 10 among the multi-hop networks 10 and 20 that can participate.

  When the node 3 starts an entry operation to the network, for example, when power is turned on, first, an identifier for communication (here, ComID-N3) indicating the own node is determined (step S11). The communication identifier ComID-N3 is derived based on an identifier indicating the uniqueness of the own node.

  Next, the node 3 selects a radio channel in order to enter the network (step S12). Here, the wireless medium used by the node 3 can be used by switching a plurality of wireless channels, for example, a plurality of wireless channels from Ch01 to ChZZ. In this case, in step S12, the node 3 sequentially performs an active scan on each radio channel that can use its own radio medium. In the active scan, the node 3 transmits an active scan request message as a one-hop broadcast on a specific radio channel ChXX. When the node 1-3 located in the vicinity of the node 3 uses the radio channel ChXX, the node 1-3 receives the active scan request message. Then, a response message (Active scan reply) to the received message is returned to the node 3. In response to this response message, the node 1-3 indicates the distance (the number of hops) to the concentrating node (here, the node 1-X) of the multi-hop network in which the node 1-3 has already entered, the degree of network congestion, and the like. Send it with the indicated indicators. When the node 3 receives the response message, the node 3 holds the index included in the response message.

  Note that the node 2-1 exists within the reach of the message transmitted by the node 3, but the wireless channel used is different from the wireless channel used by the node 1-3. Therefore, the node 2-1 does not receive the message from the node 3 that the node 1-3 receives on the channel ChXX.

  After the active scan for all the available radio channels is completed, the node 3 determines a new entry line concentration node (a new entry line concentration node of the multi-hop network) (step S13). The concentration node is determined based on an index such as a distance to the concentration node and a network congestion level included in an active scan reply message. The message used in the active scan has a configuration as shown in FIG. 3, for example. In the configuration example shown in FIG. 3, the response flag is used to identify the request message and the response message. The network identifier, the concentrator node identifier, the number of hops to the concentrator node, and other information are information included only in the response message. Information on the degree of network congestion is included as other information. Here, the node 3 determines the node to join as the node 1-X that is the concentrating node of the multi-hop network 10.

  Next, the node 3 transmits a registration request message (Registration message) to the new concentrator node 1-X (the concentrator node 1-X that manages the multi-hop network 10 that wants to enter). (Step S14). Here, with respect to the route to the concentrator node 1-X (via which adjacent node the registration request message for the concentrator node 1-X is transmitted), the index (concentrator node) obtained in the active scan in step S12 The number of hops up to 1-X, the degree of network congestion, etc.). Here, the description will be continued assuming that a route passing through the node 1-3 in the adjacent nodes is determined (selected). That is, in step S14, the node 3 transmits a registration request message with the node 1-3 as the next hop node. Also, the node 1-3 that has received the registration request message from the node 3 transfers the registration request message to the next hop node toward the concentration node 1-X according to the route information (route table) that the node has. Thereafter, each node that has received the registration request message transfers the registration request message toward the concentrating node. The registration request message transmitted by the node 3 includes the next hop of the route toward the concentrated node 1-X in the node 3 in addition to the information (communication identifier ComID-N3 and other information) held by the node 3 -The node (here, the node 1-3) is included, and the concentrator node 1-X passes through the adjacent node (node 1-3) of the node 3 indicated by the registration request message transmitted in step S14. A response to the registration request message can be notified to the transmission source node 3. The registration request / response message has a configuration as shown in FIG. 4, for example. In the configuration example shown in FIG. 4, the response flag is used to identify the registration request message and the registration response message. The error factor is information included only in the registration response message.

  The concentrator node 1-X that has received the registration request message checks whether or not the new node can be accommodated. If it cannot be accommodated, it sends a registration response message (Registration ack.) Having an error cause to the node 3. Notification is made (steps S15 and S16). The operation when a new node can be accommodated will be described in the second and subsequent embodiments. Here, the concentration node 1-X does not hold the routing table (route information) for the node 3, and therefore encapsulates the registration response message to the node 3 and the next hop node of the node 3 (node 1-3). ) As an encapsulated message (step S16). The encapsulated message has a configuration as shown in FIG. 5, for example.

  Upon receiving the encapsulated message, the destination node (node 1-3) of the encapsulated message decapsulates it and confirms the transmission destination (destination) of the obtained message. If the routing information for the destination node (the routing table indicating the destination of the message addressed to this node) is not held, the message is transferred as a one-hop broadcast packet. On the other hand, when the route information for the transmission destination is held, the message is transferred according to the route information.

  As described above, in the ad hoc network system according to the present embodiment, a node that has received an active scan request message from a node that desires to newly enter the network (a node that has already entered the network) is a node that is a transmission source of the request message A response message including information on the route to the concentrated node (number of hops to the concentrated node, congestion level, etc.) as a route selection index is sent back to the (newly entered node). For the route to the concentrator node determined based on the index included in the response message received from (adjacent node located on the route to the concentrator node), its own identification information and the adjacent node on the determined route (next The registration request message including the identification information of the (hop node) is transmitted. In addition, the node that has received the registration request message from the new entry node transfers the registration request message in accordance with the stored route table. Further, the concentrator node receives the registration request message and encapsulates a response message for the new entry node when it is impossible to accommodate the new entry node of the transmission source, and the identification information included in the registration request message It is decided to transmit to the adjacent node of the new entry node. Further, the node that has received the encapsulated response message addressed to itself (the adjacent node of the new entry node) performs decapsulation, and the original response message obtained as a result of the node ( It was decided to transmit to a new entry node. At this time, if route information to the new entry node is not held, it is transferred as a 1-hop broadcast packet.

  As a result, in the new entry node, the route search when sending the registration request message for new entry to the concentrator node becomes unnecessary, and the route search overhead for sending the registration request message (in the network by route search) The amount of control messages to be transmitted and the processing time required for route search can be reduced. Further, in the concentrator node, route search when returning a response message to the registration request message to the new entry node becomes unnecessary, and the overhead of route search for returning the response message can be reduced. Therefore, a new entry operation can be executed with low traffic and low delay.

  In the present embodiment, the multi-hop networks 10 and 20 have shown examples using different radio channels. However, even when they use the same radio channel, the above control operation (for new entry) Control action) is applicable. In this case, the newly entering node determines the multihop network to enter based on the identifier of the concentrating node.

  In the present embodiment, an ad hoc network system including a plurality (two) of multi-hop networks (multi-hop networks 10 and 20) has been described. However, the number of multi-hop networks may be one. . Of course, there may be three or more.

Embodiment 2. FIG.
In the first embodiment, when a new node (a node that has not yet entered) enters the ad hoc network system, specifically, a registration request message is transmitted to the concentrating node of the multi-hop network that the new node wishes to join. Although the response message transmission (error notification) operation when the concentrating node cannot accept entry of the new node has been described, in this embodiment, the new entry node determines the communication identifier The operation when confirming uniqueness (whether or not unique in the network to be entered) will be described. The configuration of the ad hoc network system according to the present embodiment is the same as that of the first embodiment (see FIG. 1).

  FIG. 6 is a sequence diagram illustrating an operation example in the case of confirming the uniqueness of the communication identifier determined by the node desiring new entry in the ad hoc network system according to the present embodiment. FIG. 6 shows an operation example when the node 3 wishes to join the multi-hop network 10 among the multi-hop networks 10 and 20 that can participate. In FIG. 6, the same step numbers are assigned to the same processes as those included in FIG. 2 used in the description of the first embodiment. Therefore, a detailed description of the process with the same step number as in FIG. 2 is omitted.

  Upon receiving the registration request message transmitted by the node 3 (the node desiring new entry) executing the processing of steps S11 to S14 described in the first embodiment, the concentrator node 1-X accommodates the new node. If it can be accommodated, then the communication identifier (communication identifier set in the received registration request message) of the node 3 that wants to join is self-multiple. It is unique within the hop network (multi-hop network 10), that is, it does not overlap with the node IDs (= identifiers for communication) of other nodes (nodes 1-1 to 1-N) that have already joined. Whether or not (step S21). If duplication is detected as a result of the confirmation, “duplicate detection” is set as an error factor, and a registration response message for setting a new communication identifier without duplication is also sent to the node (node 3) that wants to join. ) (Step S22). Here, the method by which the concentration node 1-X determines a new identifier for communication without duplication is not particularly specified. As for the transmission of the registration response message, as shown in the first embodiment (similar to the processing in step S16 shown in the first embodiment), the adjacent node of the node (node 3) that wants to join The encapsulated message is transmitted to (node 1-3). When there is no overlap, the process proceeds to the next process, which will be described in the third embodiment.

  When receiving the registration response message in which “duplicate detection” is set as the error factor, the node 3 resets the communication identifier notified in the registration response message as its own communication identifier (step S23). Again, a registration request message is transmitted to the concentrator node 1-X (step S24).

  As described above, in the ad hoc network system according to the present embodiment, when the concentrator node receives a registration request message, it can receive the registration request received if it can accommodate a new entry node (node from which the registration request message is transmitted). Check whether the communication identifier of the new entry node (the node that sent the registration request message) included in the message is unique within the local multi-hop network. Is set in the response message to the new entry node, encapsulated, and transmitted to the adjacent node of the new entry node. In addition, the node that has received the encapsulated response message addressed to itself from the concentrator node (the adjacent node of the new entry node) performs decapsulation, and sends the original response message obtained as a result to the new entry node. I decided to send it. As a result, the new entry node does not need to send a message for confirming the uniqueness (duplication) of the communication identifier to each node in the multihop network that wants to join, In this case, it is not necessary to repeat the same processing (processing for uniqueness confirmation), so that the overhead required for uniqueness confirmation can be reduced. Further, in the concentrator node, route search when returning a response message to the registration request message to the new entry node becomes unnecessary, and overhead of route search for returning the response message can be reduced.

Embodiment 3 FIG.
In Embodiments 1 and 2, when a new node joins a multi-hop network, a registration request message is transmitted to the concentrator node, and an error notification when the concentrator node cannot accept the new node In this embodiment, the operation when the concentrating node can accept a new node will be described. The configuration of the ad hoc network system according to the present embodiment is the same as that of the first embodiment (see FIG. 1).

  FIG. 7 is a sequence diagram showing an operation example in the case where the concentrating node accepts a request from a node desiring to newly enter and permits entry in the ad hoc network system according to the present embodiment. FIG. 7 shows an operation example when the node 3 wishes to join the multi-hop network 10 among the multi-hop networks 10 and 20 that can participate. In FIG. 7, the same step numbers are assigned to the same processes as those included in FIG. 6 used in the description of the second embodiment. Therefore, a detailed description of the process with the same step number as in FIG. 6 is omitted.

  When Steps S11 to S14 and Steps S21 to S24 described in the first and second embodiments are executed and the registration request message transmitted from the node 3 is received in Step S24, the concentrating node 1-X can accommodate the new node. If it can be accommodated, then whether or not the communication identifier of the node 3 that wants to join is unique in the multihop network (whether it is duplicated) Check. Note that information indicating that the node 3 has set the communication identifier determined by the concentrating node 1-X (corresponding to the communication identifier notified in step S22) is included in the registration request message and transmitted. As described above, the duplication confirmation operation at the concentrator node may be omitted. When the communication identifier is unique, the concentrator node 1-X performs a route search for the node 3 that wants to join. Specifically, a route search request (Route Request) message for the node 3 is transmitted into the multi-hop network 10 (step S31), and the node 3 receiving the route search request sends a route search response (Route reply) message. Is transmitted to the concentrating node 1-X (step S32). When the route search is completed, the concentrator node 1-X sends an operation information notification message (Operational Info. Message) according to the search result (route table indicating a destination adjacent node when transmitting a signal to the node 3). It transmits to the node 3 (step S33).

  As shown in FIG. 7, when no duplication of communication identifiers is detected in the duplication detection process in step S21, the concentrator node 1-X executes step S31 without executing step S22.

  As described above, in the ad hoc network system according to the present embodiment, when the registration node receives the registration request message, the concentrator node can accommodate the transmission source node (the node that wishes to enter the network) and the node. When it is confirmed that the communication identifier is unique within the multihop network, the route search to the node is performed. This eliminates the need to perform a route search just for sending a response message to the registration request message (response message indicating that the node cannot be accommodated) in a state where a new node cannot be accommodated, thereby reducing the overhead of the route search. The overhead of new entry operation can be reduced.

  As described above, the node device according to the present invention is useful as a node device of a multi-hop network, and is particularly suitable for a node device of an ad hoc network system that performs a new entry operation into a network with low traffic and low delay. Yes.

1-1 to 1-N, 2-1 to 2-M node 1-X, 2-X node (concentration node)
10,20 Multi-hop network 100 servers

Claims (13)

A node device that can participate in a tree-structured multi-hop network rooted in a concentrator node that manages information on nodes that have already entered the network,
When entering a new multi-hop network,
Obtain information about the route from each surrounding node to the concentrating node of the multi-hop network in which each node has joined, and participate in the multi-hop network for the node selected based on the obtained information A node device characterized by transmitting a registration request message indicating a request.   The node apparatus according to claim 1, wherein the node apparatus transmits the registration request message including its own information and next-hop node information that is information of the selected node. If you have already entered a given multi-hop network,
In response to an inquiry from a new entry node that is a node that wishes to newly enter the multi-hop network, the information about the route to the concentration node of the already-entered multi-hop network is notified to the new entry node.
In addition, when a registration request message including information on the new entry node and including information on the own node as next hop node information is received from the new entry node, the registration is performed based on the stored route information. The node device according to claim 1 or 2, wherein the request message is forwarded toward a concentrating node of a multihop network that has already entered. When an encapsulated message addressed to itself is received, the received message is decapsulated, and if the route information to the destination node of the original message obtained as a result is not retained, the original message is set as a one-hop broadcast. The node device according to claim 1, wherein the node device transmits the node device.   5. The node device according to claim 1, wherein the information regarding the route is information including the number of hops to the concentrating node and the congestion degree of the network. In a multi-hop network of a tree structure rooted in a concentrator node that manages information on nodes that have already entered the network, a node device that operates as the concentrator node,
A multi-hop transmission that is transmitted from a new entry node that is a node that wishes to newly enter the managed multi-hop network and includes information on the new entry node and information on the next hop node of the new entry node. When a registration request message indicating a request to join the network is received,
If the new entry node cannot be accommodated, a response message addressed to the new entry node indicating that accommodation is not possible is generated, further encapsulated, and transmitted to the node indicated by the next hop node information. apparatus. In addition, when the registration request message is received, if the new entry node can be accommodated, the communication identifier of the new entry node included in the registration request message is stored in the multiple Check whether it is unique within the hop network, and if not unique, determine a communication identifier that is unique within the multi-hop network as a communication identifier for the new entry node, and for the determined communication The node apparatus according to claim 6, wherein a response message addressed to the new entry node including an identifier is generated, encapsulated, and transmitted to a node indicated by the next hop node information. In addition, when the registration request message is received, the new entry node can be accommodated, and the communication identifier of the new entry node included in the registration request message is managed by itself. The node device according to claim 6 or 7, wherein if it is unique in a multi-hop network, a route search for the new entry node is performed. An ad hoc network system including one or more tree-structured multi-hop networks rooted in a concentrator node that manages information on nodes that have already entered the network,
The concentrator node of each multi-hop network is the node device according to any one of claims 6 to 8,
An ad hoc network system characterized in that each node device according to claim 1 is a node that can be entered. This is a network participation method when a new node participates in an ad hoc network system including one or more tree-structured multi-hop networks rooted in a concentrator node that manages information on nodes that have already joined the network. And
A route information acquisition step in which a new entry node, which is a node that wishes to participate in an ad hoc network system, acquires information on a route from each surrounding node to a concentration node of the multi-hop network in which each node has joined; ,
Based on the information on the acquired route, the new entry node sends a first hop destination of a registration request message indicating a participation request to a multihop network to join and a multihop network to join. A participating network determination step for determining a node;
The new entry node transmits a registration request message including its own information and next-hop node information that is information of the determined first-hop destination node to the first-hop destination node. A message sending step;
A message transfer step in which the node that has received the registration request message forwards the registration request message toward the concentrating node of the multihop network that has already entered, based on the route information held by itself.
A network participation method characterized by including: When the concentrator node that has received the registration request message is in a state where it cannot accommodate the new entry node, it generates a response message addressed to the new entry node indicating that it cannot be accommodated, and further encapsulates it, and is included in the registration request message A non-accommodation notification message transmission step to be transmitted to the node indicated by the next hop node information,
If the destination node of the response message encapsulated in the non-accommodation notification message transmission step decapsulates the received message and does not hold the path information to the destination node of the response message obtained as a result, the response A non-accommodation notification message transfer step for transmitting the message as a one-hop broadcast;
The network participation method according to claim 10, further comprising: When the concentrating node that has received the registration request message is in a state that can accommodate the new entry node, the communication identifier of the new entry node included in the registration request message is a multihop Check whether it is unique within the network, and if not unique, determine a communication identifier that is unique within the multi-hop network as a communication identifier for the new entry node, and determine the determined communication identifier Including, generating a response message addressed to the new entry node, further encapsulating, and transmitting to the node indicated by the next hop node information included in the registration request message, the communication identifier determination notification step;
If the destination node of the response message encapsulated in the communication identifier determination notification step decapsulates the received message and does not hold the path information to the destination node of the response message obtained as a result, the response A communication identifier determination notification message transfer step for transmitting a message as a one-hop broadcast;
The network participation method according to claim 10 or 11, further comprising: The concentrator node that has received the registration request message is in a state that can accommodate the new entry node, and the communication identifier of the new entry node that is included in the registration request message is managed by itself. If unique within the hop network, a route search step for performing a route search for the new entry node,
The network participation method according to claim 10, 11 or 12, further comprising:

Images