JP2003069579A - Route registration method of radio node, radio node, program and recording medium with program recorded thereon - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a route registration method of a radio node, the radio node, the program, etc., for conforming a transmission and reception route between radio nodes WR1 and WR2. SOLUTION: A node WR1 sends a broadcasting packet to adjacent nodes WR3 and WR4 for asking whether a node WR2 is registered in a route table; when the WR3 and WR4 register the node WR2 in the route table, the nodes WR3 and WR4 send a broadcasting answer packet to the node WR1, the node WR1 selects an adjacent node WR3 out of adjacent nodes WR3 and WR4 which send the broadcasting answer packet, the node WR1 sends a route registration packet for the destination WR2 to the repeating node WR3, and the receiving node WR2 registers the WR3 of the originating node of the route registering packet in the route table as a repeating node of the node WR1.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a route registration method for a wireless node, the wireless node, a program, and a recording medium having the program recorded therein.

[0002]

2. Description of the Related Art FIG. 1 is a block diagram showing the first step of a conventional route registration method. According to FIG. 1, WR (Wirel
ess Router) 2 has a wireless link with WR3 and WR4. Therefore, WR2 registers WR3 and WR4 in the routing table as adjacent nodes with a hop count of 1.
Like WR2, WR3 and WR4 are also registered as adjacent nodes to each other.

In the following, for example, consider a case where WR1 having a wireless link with WR3 and WR4 newly joins in the route registration state as shown in FIG. Also, W
It is assumed that R1 wants to establish a path with WR2, but does not have a radio link with WR2.

FIG. 2 is a block diagram showing the second step of the conventional route registration method. WR1 first broadcasts a PR packet at hop 1 to search for an adjacent node that has registered WR2 in its routing table. At this time, WR
Since 3 and WR4 have already registered WR2 in the route table, they each transmit a PR response packet to WR1. As a result, WR1 registers WR3 and WR4 as adjacent nodes with a hop count of 1 in the routing table. Also, W
Since both RR3 and WR4 register WR2 in the routing table, WR1 can select either WR3 or WR4. At this time, for example, it is assumed that WR1 selects WR3 as a relay node according to a predetermined condition. In this case, the adjacent node WR3 and the number of hops 2 are registered for the destination node WR2 in the route table of WR1. Therefore, WR1 transmits all packets to be transmitted to WR2, using WR3 as a relay node. still,
As the predetermined condition, for example, there is a method of assigning a weighting factor to the links between the respective nodes, calculating the weighting factor, and selecting an optimum route.

FIG. 3 is a block diagram showing the third step of the conventional route registration method. What was explained in FIG. 2 is that WR
2 also corresponds to the case where a route is constructed with WR1. However, according to FIG. 3, WR2 may select WR4 as a relay node. In this case, WR
The adjacent node WR4 and the number of hops 2 are registered for the destination node WR1 in the routing table of No. 2. Therefore, WR1 is W
When transmitting a packet to R2, WR3 becomes a relay node, and when WR2 transmits a packet to WR1, WR4 becomes a relay node.

According to such a conventional technique, the transmission / reception paths are different between WR1 and WR2. In order to match the transmission / reception paths, it was usually necessary to manually set them.

On the other hand, an on-demand method for constructing a route on demand, for example, "Charles E. Perkins," Ad
hoc On-Demand Distance Vector Routing. ”, in Proce
edings of the 2nd IEEE Workshop on Mobile Computin
g Systems and Applications, 1999, pp. 90-100 ”, it is possible to broadcast a route search packet to the entire network when communication occurs and communicate with the destination node or the destination node. The route is registered by a response from another node or the like. Therefore, the source node is
While the relay node is selected based on the response packet that was first received, the destination node selects the route based on the route search packet that came from a route different from that route, so the route may be different. . That is, the route may be different even in the hybrid system in which the route is constructed based on the on-demand system and held.

[0008]

[Problems to be Solved by the Invention] However, WR1
When the transmission / reception paths are different between WR2 and WR2, if one path fails, one-way communication is performed. This allows WR
Even if the request packet transmitted from 1 arrives at WR2, the response packet transmitted from WR2 does not arrive at WR1. Therefore, there is a problem that WR1 continues to retransmit the packet until it times out. Further, even if the failure is recovered, the packet already received by WR2 will be retransmitted, and there is a problem that it takes time to recover from the failure.

Regarding such problems, WR1 and WR
It is considered that the problem can be solved by matching the transmission and reception paths between the two nodes and grasping the occurrence of the failure at both nodes almost at the same time.

Therefore, an object of the present invention is to provide a wireless node route registration method for matching transmission / reception routes between wireless nodes, the wireless node, a program, and a recording medium recording the program.

[0011]

According to the method of registering a route of a wireless node of the present invention, the first node sets the route table to one or more adjacent nodes which can directly communicate with each other and the second node to the route table. The first step is to broadcast a PR packet asking whether or not it has been registered, and if the adjacent node has registered the second node in the routing table, it sends a PR packet to the first node. A second step; a third step in which the first node selects one neighboring node as a relay node from among one or more neighboring nodes that transmitted the advertisement response packet; and the first node relays A fourth step of transmitting a route registration packet addressed to the second node to the node; and when the second node receives the route registration packet from the relayed adjacent node, the adjacent node is set as the relay node. Fifth register 1 of node in the path table
And the steps of.

According to another embodiment of the present invention, the second node transmits a route registration response packet to be transmitted to the first node to an adjacent node which is a relay node of the first node in the route table. It is also preferable to further include a sixth step of

According to another embodiment of the present invention, when the first node does not receive the route registration response packet within the fixed time, the third node may:
It is also preferable to select another adjacent node as a relay node from the one or more adjacent nodes that have transmitted the advertisement response packet, and further repeat the fourth to sixth steps.

According to another embodiment of the invention, for the third step, the one adjacent node selected is the first
It is also preferable that the node is a neighbor node that has transmitted the advertisement response packet that is received first in time.

According to another embodiment of the present invention, it is also preferable that the route table has a destination node, an adjacent node serving as a relay node to the destination node, and a metric of the relay route.

According to another embodiment of the present invention, the metric is the number of hops, the weighting factor associated with the number of links passing through the relay node, the amount of bandwidth that can be transmitted, and / or the communication quality of the wireless link. Is also preferable.

According to another embodiment of the invention, for the second step, the advertisement response packet contains the metric of the second node registered in the routing table, and for the third step it is selected. One adjacent node is
It is also preferable that the metric of the node of is optimal.

According to the wireless node of the present invention, one or more adjacent nodes that can directly communicate with each other are broadcast by broadcasting a broadcast packet for inquiring whether or not the route registration destination node is registered in the route table. A packet transmitting means, and a public relation response packet transmitting means for transmitting a public relation response packet to an adjacent node which has transmitted the public relation packet when the route registration destination node is registered in the route table when the public relation packet is received, and a public relation response. When a packet is received, a relay node selecting unit that selects one adjacent node as a relay node from one or more nodes that have transmitted the advertisement response packet, and a route to the relay node, the route having the route registration destination node as a destination. A route registration packet transmitting means for transmitting a registration packet,
When a route registration packet is received from the relayed adjacent node, the route registration unit has the route registration source node registered in the route table as the relay node.

According to another embodiment of the present invention, a route registration response packet for transmitting a route registration response packet to be transmitted to a route registration source node to an adjacent node which is a relay node of the route registration source node in the route table. It is also preferable to further have means.

According to another embodiment of the present invention, when the route registration response packet is not received within a certain period of time, the relay node selecting means selects from among the one or more adjacent nodes which have transmitted the advertisement response packet. It is also preferable to select another adjacent node as a relay node.

According to another embodiment of the present invention, in the relay node selecting means, one adjacent node selected is
It is also preferable that the first node is the adjacent node that has transmitted the advertisement response packet that was received first in time.

According to another embodiment of the present invention, it is also preferable that the route table has a destination node, an adjacent node serving as a relay node to the destination node, and a metric of the relay route.

According to another embodiment of the present invention, the metric is the number of hops, the weighting coefficient associated with the number of links passing through the relay node, the amount of transmittable bandwidth, and / or the communication quality of the wireless link. Is also preferable.

According to another embodiment of the present invention, regarding the advertisement response packet transmitting means, the advertisement response packet includes the metric of the second node registered in the routing table, and the relay node selecting means selects the relay node selecting means. It is also preferable that the metric of the route registration destination node for the one adjacent node to be established is the optimum one.

Further, according to the route registration program for causing the computer of the wireless node of the present invention to function, whether or not the route registration destination node is registered in the route table to one or more adjacent nodes that can directly communicate with each other. A public relations packet transmitting means for broadcasting a public relations packet for inquiring about the information, and when a public relations packet is received, if the route registration destination node is registered in the route table, a public relations response packet is transmitted to the adjacent node that transmitted the public relations packet. And a relay node selecting means for selecting one adjacent node as a relay node from one or more nodes that have transmitted the public relation response packet when the public relation response packet transmitting means A route registration packet transmitting means for transmitting a route registration packet addressed to the route registration destination node,
When the route registration packet is received from the relayed adjacent node, the computer of the wireless node functions as the route registration means for registering the route registration source node in the route table using the second adjacent node as the relay node. Further, a recording medium recording this route registration program may be used.

[0026]

DETAILED DESCRIPTION OF THE INVENTION Embodiments of the present invention will be described in detail below with reference to the drawings.

FIG. 4 is a block diagram showing a route registration method according to the present invention. According to FIG. 4, as compared with FIG.
Transmits a route registration packet addressed to WR2 to WR3, and when WR2 receives the route registration packet from WR3, which is a relayed adjacent node, registers WR1 as a relay node in WR1. Is different. Therefore, the adjacent node WR3 and the number of hops 2 are registered for the destination node WR1 in the routing table of WR2, and WR1
And the transmission / reception path between WR2 and WR2 match.

FIG. 5 is a flowchart of the route registration source node (WR1) according to the present invention.

First, WR1 broadcasts a one-hop publicity packet to an adjacent node (S51). At this time,
The information packet includes the information of WR2 as the route registration destination node. According to FIG. 4, this advertisement packet is received by WR3 and WR4. And WR1
Waits for reception of the PR response packet from the adjacent nodes WR3 and WR4.

Next, when the public relation response packet is received from one or more adjacent nodes, the WR1 selects one adjacent node determined to be optimum from the adjacent nodes as a relay node (S52). According to FIG. 4, since WR3 and WR4 have already registered WR2 in the routing table, W
R1 receives the advertisement response packet from WR3 and WR4. Then, it is assumed that WR1 selects WR3 as a relay node according to a predetermined condition.

As a condition for judging one relay node, the metric included in the advertisement response packet is referred to. The metric represents the route status until the packet reaches the destination node. Specifically, the metric refers to the number of hops, the weighting coefficient associated with the number of links passing through the relay node, the amount of bandwidth that can be transmitted, and / or the communication quality of the wireless link. In FIGS. 1 to 4 described above and FIG. 9 described later, the metric is described as the number of hops.

Next, WR1 transmits a route registration packet to be transmitted to WR2 to WR3 which is a relay node (S53). The WR2 that has received the route registration packet can be registered in the route table as the adjacent node WR3 and the hop number 2 with respect to the destination node WR1. The above S51
The sequence from S53 to S53 is a minimum necessary configuration sequence for realizing the present invention.

WR2, which is the route registration destination node,
It is also preferable to transmit the route registration response packet when the route registration packet is received. As a result, WR1
It can be surely confirmed that the transmission / reception paths match with WR2. WR1 cannot receive the route registration response packet transmitted from WR2 for a certain period of time (S54),
In addition, if there is another adjacent node that has transmitted the PR response packet in the step of S52 (S55), the other adjacent node can be changed as a relay node (S5).
6). After that, by performing the above-described step S53, it is possible to surely match the transmission / reception paths between the WR1 and the WR2.

FIG. 6 shows adjacent nodes (WR3 and WR4).
It is a flowchart of. According to FIG. 6, WR3 and W
R4 receives the advertisement packet from the route registration source node WR1 (S61). Since the information packet contains the information of WR2 as the route registration destination node, WR3 and WR4 search whether or not WR2 is registered in their respective route tables. If WR2 is included in the routing table,
The PR response packet is transmitted to WR1 (S62). At this time, each of WR3 and WR4 transmits the metric up to WR2 (here, the number of hops) in the advertisement response packet.

FIG. 7 is a flowchart of the relay node (WR3). According to FIG. 7, WR3 receives the route registration packet from WR1 (S71). Next, WR3
Registers the adjacent node that has transmitted the route registration packet, the source node, and the number of hops from the source node in the route table (S72). Next, the WR3 increments the hop count of the route registration packet by 1 and transmits the route registration packet to the relay node in the route table.

If the route registration destination node WR4 transmits a route registration response packet, the WR3 also receives the route registration response packet (S74). And
The route registration response packet is transmitted from the route table to the corresponding adjacent node (S75).

FIG. 8 is a flowchart of the route registration destination node (WR2). WR2 receives the route registration packet transmitted from WR1 (S81). And WR
2 registers the adjacent node that has transmitted the route registration packet, the source node, and the number of hops in the route table (S
82). As a result, the transmission / reception routes between the route registration source node WR1 and the route registration destination node WR2 match.

WR2 also transmits a route registration response packet to the adjacent node which has transmitted the route registration packet. As a result, the route registration source node WR1 that has received the route registration response packet that has been relayed receives WR1 and WR2.
It is possible to confirm that the transmission / reception paths between and have matched.

FIG. 9 is a block diagram showing a route registration method consisting of a plurality of relay nodes. FIG. 10 is a packet configuration diagram showing the contents of the packet transmitted and received in FIG.

It is assumed that WR7 has been newly introduced into the network. In order to acquire the AP information, the WR 7 broadcasts the advertisement packet of FIG. 10 to the adjacent node by one hop. According to FIG. 9, the nodes that receive the advertisement packet are WR4 and WR5. The WR4 responds to the WR7 with the number of hops to the AP of 2 by the advertisement response packet of FIG. On the other hand, WR5 responds to WR7 with the number of hops to the AP of 2. Also, WR4 and W
R5 has a destination “WR7” and an adjacent “WR” in each routing table.
7 ”and the number of hops“ 1 ”are added.

WR7 receives the response from WR4 and WR5 and determines the relay node to the AP based on the hop count. In addition, WR7, in the route table, as the route of WR4, the destination "WR4", the adjacent "WR4", and the number of hops "1",
A destination “WR5”, an adjacent “WR5”, and a hop count “1” are added as a route of WR5. As the relay node to the AP, both WR4 and WR5 have a hop count of 2, so the one that arrives first is the relay node. Here, it is assumed that WR5 arrives first. WR7 is W
With R5 as the relay node, the destination "AP" and the adjacency "under construction" are written in the routing table. The WR 7 transmits the route registration packet of FIG. 10 addressed to the AP to the WR 5, and waits for a response to the route registration packet until it times out.

When the route registration packet is received from WR7, WR5 sets the destination node of the route table to WR7 because the source is WR7, and the node that transmitted the route registration packet is WR7. Since the number of hops in the route registration packet is WR7, the number of hops in the route table is changed to "1". Next, the destination node of the route registration packet is checked. Since the destination node is the AP, the adjacent node addressed to the AP in the routing table is checked. Since the adjacent node is WR2, WR5 transfers the route registration packet addressed to the AP to WR2.

When WR2 receives the route registration packet from WR5, the transmission source is WR7, the destination node of the route table is set to "WR7", and the node transmitting the route registration packet is WR5. Set the adjacent node to "W
R5 ”and the number of hops in the route registration packet is 2, so the number of hops in the route table is added as“ 2 ”. next,
The destination of the route registration packet is checked. Since the destination is the AP, the adjacency to the AP in the route table is checked. The adjacent node is A
Since it is P, WR2 sends a route registration packet addressed to AP to A
Transfer to P.

When the AP receives the route registration packet from WR2, the source is WR7, so the destination node of the route table is set to "WR7", and the node that transmitted the route registration packet is WR2. Adjacent node to "WR
2 ”and the number of hops in the route registration packet is 3, so the number of hops in the route table is added as“ 3 ”.

Next, the destination of the route registration packet is checked.
Since the destination is the AP, the route registration response packet of the route registration packet shown in FIG. 10 is generated. The destination of the route registration response packet is set to WR7 and transmitted to WR2.

When the WR2 receives the route registration response packet, it checks the destination of the route registration response packet. Since the destination node is WR7, the adjacent node addressed to WR7 in the route table of the own node is checked. Since the adjacent node is WR5, WR2 transfers the route registration response packet to WR5.

Upon receiving the route registration response packet, the WR 5 checks the destination node of the route registration response packet.
Since the destination node is WR7, W in the routing table of the own node
Examine the adjacent node addressed to R7. Since the adjacent node is WR7, WR5 transfers the route registration response packet to WR7.

Upon receiving the route registration response packet, the WR 7 checks the destination node of the route registration response packet.
Since the destination node is WR7, the destination node "AP" in the routing table of the own node is changed to the adjacent node "WR5" and the hop count "3".

In the above description, the number of hops is taken as an example of the metric. As another example, the metric may be one in which a weight coefficient is given to a link that is a communication path between nodes that can be a path to the AP. The node to which the new node has joined broadcasts a PR packet, but the AP responds to the AP with the AP reply packet.
It is also preferable to include the number of hops up to and the weighting factor up to AP. A route to the AP is selected in consideration of this weighting factor. Thereby, if the number of hops is the same, the relay node can be selected based on the weight coefficient. If the weighting factors are the same, either route is randomly selected. Each node existing in the route between the new node and the AP registers the new node in the route table, notifies the previous weighting factor of +1 and notifies the surrounding nodes of +1 to the previous weighting factor. The weight coefficient is +1 from the node that is the route to the AP
The node that has received the information reconstructs the route and notifies the adjacent node of +1 as the weighting factor so far. And
The AP registers the new node.

When a certain packet is transmitted from the source node to the destination node and there is no destination node in the route table, the route registration packet is broadcast to the destination node. The node receiving the route registration packet returns the route registration response packet to the transmission source node if it has the destination node in the route table, and otherwise broadcasts the route registration packet. When the route registration response packet is received, the route is maintained for a certain time (10 seconds). When the source node receives a plurality of route registration response packets, that is, when there are a plurality of routes, it selects a route by the number of hops, but when it is the same, it randomly selects one of the routes. The source node transmits a route registration confirmation packet to the destination node for the selected route. The node receiving the route registration confirmation packet maintains the route for a certain time (100 seconds). The destination node selects the route that received the route registration confirmation packet.

FIG. 11 is a block diagram of a wireless node according to the present invention. According to FIG. 11, the wireless node 1 realizes a function as a route registration source node, a public relation packet transmitting means 11, a public relation response packet receiving means 12, a relay node selecting means 14, and a route registration packet transmission. Means 1
3 and route registration response packet receiving means 15.
Further, in order to realize the function as the route registration destination node, the route registration means 16 is further provided. Further, in order to realize the function as the adjacent node, the advertisement packet response means 17 is further included. Routing table 10 and relay node selection means 1
All other means except 4 are able to communicate via communication means 18 with other wireless nodes having a wireless link.

With the above description and the configuration of FIG. 11, the present invention can be realized as a route registration program that causes a computer of a wireless node to function. Further, it may be a recording medium recording the program.

According to the various embodiments of the present invention described above, various changes, modifications and omissions in the technical idea and scope of the present invention can be easily made by those skilled in the art. The above description is merely an example and is not intended to be limiting. The invention is limited only by the claims and equivalents thereof.

[0054]

As described above in detail, according to the wireless node route registration method, the wireless node, the program, and the recording medium in which the program is recorded according to the present invention, the transmission and reception routes can be matched between the wireless nodes. Therefore, it is possible to understand the occurrence of a failure at both nodes almost at the same time.

[Brief description of drawings]

FIG. 1 is a configuration diagram showing a first step of a conventional route registration method.

FIG. 2 is a configuration diagram showing a second step of a conventional route registration method.

FIG. 3 is a configuration diagram showing a third step of a conventional route registration method.

FIG. 4 is a configuration diagram showing a route registration method according to the present invention.

FIG. 5 is a flowchart of a route registration source node (WR1) according to the present invention.

FIG. 6 is a flowchart of adjacent nodes (WR3 and WR4).

FIG. 7 is a flowchart of a relay node (WR3).

FIG. 8 is a flowchart of a route registration destination node (WR2).

FIG. 9 is a configuration diagram illustrating a route registration method including a plurality of relay nodes.

FIG. 10 is a packet configuration diagram showing contents of packets transmitted and received in FIG.

FIG. 11 is a block diagram of a wireless node according to the present invention.

[Explanation of symbols]

1 wireless node 10 route table 11 Publicity packet transmission means 12 Publicity response packet receiving means 13 Route registration packet transmission means 14 Relay node selection means 15 Route registration response packet receiving means 16 Route registration means 17 Public information packet response means 18 Communication means

   ─────────────────────────────────────────────────── ─── Continued front page    (72) Inventor Hiroto Suda             2-3-1, Otemachi, Chiyoda-ku, Tokyo             Inside Telegraph and Telephone Corporation (72) Inventor Motonori Nakamura             2-3-1, Otemachi, Chiyoda-ku, Tokyo             Inside Telegraph and Telephone Corporation F term (reference) 5K030 HA08 JL01 KA05 LA02 LB05                       LD02 LE17 MB12                 5K033 CB06 CB13 DA17 DB12                 5K067 BB21 CC08 DD11 DD19 DD57                       EE10 EE16 HH11 JJ64 JJ71

Claims (16)

[Claims] 1. A wireless node route registration method for matching transmission and reception routes between a first node and a second node, wherein the first node is a directly communicable one. First, a broadcast packet for inquiring whether or not the second node is registered in the routing table is broadcasted to the above adjacent node.
A second step of transmitting a public relation response packet to the first node when the adjacent node has registered the second node in the routing table; A third step of selecting, as a relay node, one adjacent node from the one or more adjacent nodes that have transmitted the PR response packet; and the first node connecting the second node to the relay node. A fourth step of transmitting a route registration packet as a destination; and when the second node receives the route registration packet from a relayed adjacent node, sets the first node as the relay node by using the adjacent node as a relay node. A fifth step of registering in a route table, a route registration method for a wireless node. 2. A sixth step in which the second node transmits a route registration response packet to be transmitted to the first node to an adjacent node which is a relay node of the first node in the route table. The wireless node route registration method according to claim 1, further comprising: 3. If the first node does not receive the route registration response packet within a fixed time, the first node transmits the public relation response packet in the third step. The route registration method for a wireless node according to claim 2, wherein another adjacent node is selected as a relay node from one or more adjacent nodes, and the fourth to sixth steps are repeated. . 4. For the third step, the one neighbor node selected is the neighbor node that transmitted the PR response packet that the first node received first in time. The route registration method for a wireless node according to any one of claims 1 to 3. 5. The routing table has a destination node, an adjacent node serving as a relay node to the destination node, and a metric of the relay route, according to any one of claims 1 to 3. The method for registering a route of a wireless node according to. 6. The metric according to claim 5, wherein the metric is a number of hops, a weighting coefficient associated with the number of links passing through a relay node, an amount of transmittable bandwidth, and / or a communication quality of a wireless link. The route registration method of the wireless node described. 7. In the second step, the advertisement response packet includes the metric of the second node registered in a routing table, and in the third step, the one selected. 7. The wireless node route registration method according to claim 5, wherein the metric of the second node is optimal for the adjacent node. 8. A wireless node for matching a transmission / reception route with a route registration destination node desiring to register a route, said route registration destination node being provided to one or more adjacent nodes capable of direct communication. And a public relation packet transmitting means for broadcasting a public relation packet for inquiring whether or not is registered in the route table, and when the public relation packet is received, when the route registration destination node is registered in the route table, A public relation response packet transmitting means for transmitting a public relation response packet to an adjacent node that has transmitted the public relation packet, and, when receiving the public relation response packet, selects one adjacent node from one or more nodes that have transmitted the public relation response packet. Relay node selecting means for selecting as a relay node, and a route for transmitting a route registration packet addressed to the route registration destination node to the relay node. A radio having a registration packet transmitting means and a route registration means for registering the route registration source node in a route table when the route registration packet is received from a relayed adjacent node, using the adjacent node as a relay node. node. 9. A route registration response packet transmitting means for transmitting a route registration response packet to be transmitted to the route registration source node to an adjacent node which is a relay node of the route registration source node in the route table. Claim 8
Wireless node described in. 10. If the route registration response packet is not received within a fixed time, the relay node selection means selects another adjacent node from the one or more adjacent nodes that have transmitted the public relation response packet. 10. The wireless node according to claim 9, wherein is selected as a relay node. 11. The relay node selecting means is characterized in that the one adjacent node selected is the adjacent node that has transmitted the advertisement response packet that the first node received first in time. The wireless node according to any one of claims 8 to 10. 12. The routing table has a destination node, an adjacent node serving as a relay node to the destination node, and a metric of the relay route, according to any one of claims 8 to 10. Wireless node described in. 13. The metric according to claim 12, wherein the metric is a number of hops, a weighting factor associated with the number of links passing through a relay node, a transmittable bandwidth amount, and / or a communication quality of a wireless link. The wireless node described. 14. The public relation response packet transmitting means, wherein the public relation response packet includes the metric of the second node registered in a routing table, and the relay node selecting means selects the 1 The wireless node according to claim 12 or 13, wherein one adjacent node has the optimum metric of the route registration destination node. 15. A route registration program for causing a computer of a wireless node to function so as to match a transmission / reception route with a route registration destination node for which route registration is desired, the one or more adjacent neighbors being capable of direct communication. A public relation packet transmitting means for broadcasting a public relation packet for inquiring whether or not the route registration destination node is registered in the route table to the node; and, when the public relation packet is received, the route registration destination node is set in the route table. When registered, a public relation response packet transmitting means for transmitting a public relation response packet to the adjacent node that transmitted the public relation packet, and, when the public relation response packet is received, one or more nodes that transmitted the public relation response packet. Relay node selecting means for selecting one adjacent node as a relay node from among the above, and the route registration destination to the relay node. Route registration packet transmitting means for transmitting a route registration packet destined to a node, and when the route registration packet is received from a relayed adjacent node, the route registration source node is registered in the route table with the second adjacent node as a relay node. A route registration program that causes a computer of a wireless node to function as a route registration means for performing the route registration. 16. A recording medium on which the route registration program according to claim 15 is recorded.