KR100579828B1 - Wireless network system for determining communication path according to resource consumption degree of wireless node, and, method thereof - Google Patents

Abstract

A communication path establishment method in a wireless network system including a plurality of wireless nodes is disclosed. The communication path establishment method includes the steps of (a) setting a resource consumption class for each of a plurality of wireless nodes, (b) the source node broadcasting a route establishment request packet toward a destination node, and (c) a path. The destination node receiving the establishment request packet transmits a response packet through a path through a wireless node having a low resource consumption level among the paths through which the route establishment request packet is transmitted. Accordingly, it is possible to efficiently use all the resources of the wireless network system.

One-way hash function, wireless network, wireless node

Description

Wireless network system and method for determining communication path according to resource consumption of wireless node {Wireless network system for determining communication path according to resource consumption degree of wireless node, and, method}

1 is a schematic diagram showing a general configuration of a wireless network system;

2 is a schematic diagram showing a hash chain divided by class according to resource consumption;

3 is a schematic diagram showing a process of a network coordinator distributing a secret key to each wireless node in a wireless network system according to the present invention;

4 is a schematic diagram illustrating a process of transmitting a route establishment request packet in a wireless network system according to an embodiment of the present invention;

5 is a schematic diagram illustrating a process of transmitting a response packet in response to a route establishment request packet in the wireless network system according to FIG. 4;

6 is a schematic diagram of a wireless network system in which a communication path is established between a source node and a destination node by the process of FIGS. 4 and 5;

7 is a flowchart illustrating a method for establishing a communication path between nodes in a wireless network system according to the present invention.

The present invention relates to a wireless network system and a method for establishing a communication path within the system, and more particularly, to determine a class according to the resource consumption degree of each wireless node constituting the wireless network, and then to publicly disclose the resource consumption. The present invention relates to a wireless network system and a method for establishing an optimal communication path with a low number.

Recently, due to the rapid development of computer technology, there is a growing interest in technology that allows a user to conveniently use a computer in various ways. One such technology is network technology. Users can connect their PCs to other PCs on a network, send and receive data, and share peripherals such as printers and scanners, making the PC more convenient.

In addition, as various portable electronic devices such as notebook PCs, PDAs, and the like have recently been developed and distributed, efforts for developing wireless network systems considering the mobility of such portable electronic devices have been accelerated.

Meanwhile, in order to implement such a wireless network system, stable and fast communication between nodes is basically required, but a technology for more efficient resource consumption at each node is also required. Accordingly, in recent years, research on a routing technique for establishing a communication path between wireless nodes constituting a wireless network system has been activated.

1 is a schematic diagram showing a general configuration of a wireless network system composed of a plurality of wireless nodes. According to FIG. 1, a wireless network system includes a plurality of wireless nodes A to F as well as a network coordinator M. FIG. The network coordinator M is responsible for coordinating the overall network connection between the wireless nodes A to F and operations on the network.

In the wireless network environment according to FIG. 1, one node (ie, source node) of each node A to F establishes a communication path with another node (destination node) using a predetermined routing protocol. That is, the source node broadcasts a route establishment request packet to wireless nodes located in the direction of the destination node, and each wireless node checks the address of the destination node included in the route establishment request packet. Or it sends a route establishment request packet back to the surrounding wireless node. When the destination node receives the RREQ packet, it establishes a communication path by transmitting the corresponding response packet to the source node.

On the other hand, since each radio node has a different resource consumption degree for communication, the destination node can efficiently use the entire network resources by selecting a path with the least resource consumption and transmitting a response packet. In addition to the radio bandwidth allocated for communication, a resource may be a power consumption required to contribute to communication at each node. The network coordinator (M) checks in advance information on the resource consumption of each wireless node to provide information so that the destination node can select the path that consumes the least.

On the other hand, if the network is actually implemented in this manner, there are cases where a wireless node behaving selfishly is found. That is, in order for the developer of the wireless node to show that the performance of the wireless nodes provided by the wireless node is excellent, the wireless node may be manufactured so that the wireless node provides false information to other wireless nodes around. As a result, if false information is provided as high despite the fact that resource consumption is low, neighboring nodes transmit response packets through other nodes, which may not contribute to establishing a path between a destination node and a source node. . As such, if it does not contribute to the establishment of the communication path, it is possible to save power to be consumed as compared to the case of contributing to the establishment of the communication path. Therefore, it can be recognized by the user that the service life is longer than other nodes in the vicinity.

However, according to this, there is a problem that the resource utilization of the entire network is reduced by making resources of other nodes around them more than necessary.

In the existing wireless network system, there is no technology for overlooking this selfish wireless node behavior and preventing it.

The present invention has been made to solve the problems described above, the object of the present invention is to determine the resource consumption class for a plurality of wireless nodes, and to give a secret key proportional to the self-node by false The present invention provides a wireless network system capable of preventing information provision and a method for establishing a communication path between nodes in such a system.

In order to achieve the above object, the communication path establishment method in a wireless network system according to the present invention, (a) setting the resource consumption level for each of the plurality of radio nodes, (b) source node path establishment Broadcasting a request packet toward a destination node, and (c) the destination node receiving the route establishment request packet via a radio node having a low resource consumption level among the paths through which the route establishment request packet is transmitted. Sending a response packet through the path.

In this case, step (a) may include: (a1) checking a consumption amount of a predetermined resource required for communication with respect to each of the plurality of wireless nodes, and (a2) determining the resource consumption class to be proportional to the consumption amount. And (a3) assigning each of the plurality of wireless nodes a secret key corresponding to each of the resource consumption classes.

In addition, in step (a3), after setting a secret key of the highest level among the resource consumption level arbitrarily, the secret key of the lower level may be determined using a one-way hash function. As a result, each radio node cannot provide false information to other neighboring nodes to appear to have a higher level than the secret key granted to it.

Preferably, in step (b), (b1) a predetermined first wireless node receives the route establishment request packet, and (b2) the first wireless node uses a secret key below its own level. And hashing information necessary for route establishment and its own node ID, and (b3) including the hashed value in the route establishment request packet, and broadcasting in the direction of the destination node.

More preferably, the step (b), (b4) a predetermined second wireless node receives the route establishment request packet from the first wireless node, (b5) the second wireless node has its own Recognizing a resource consumption class of the first wireless node by checking a hash function value included in the route establishment request packet using a secret key corresponding to a class; and (b6) the second wireless node recognizes the resource node. If not, the method may further include repeating steps (b2) and (b3).

Meanwhile, step (c) may be implemented in another embodiment according to a routing protocol method. According to a method in which a lower node, that is, a wireless node in a direction of a destination node selects an upper node in a relationship between a wireless node that transmits and receives a route establishment message between a source node and a destination node, step (c) includes: Transmitting a response packet toward the source node, and when a predetermined third wireless node in the source node direction receives a route establishment request packet from at least two nodes, among the nodes that have transmitted the route establishment request packet. The method may include selecting a node having a low resource consumption level and transmitting the response packet.

Preferably, in the step (c), after the destination node transmits the response packet, receiving a route establishment request packet from a fourth wireless node, wherein the destination node consumes resources of the fourth wireless node. The method may further include determining a class, and retransmitting the response packet to the fourth wireless node when the resource consumption class of the fourth wireless node is lower than that of the wireless node transmitting the response packet.

Meanwhile, according to a method in which an upper node in a source node direction selects a lower node and establishes a communication path, the step (c) includes: transmitting, by the destination node, a response packet toward the source node, and the response packet The method further includes the step of transmitting the information to the source node in the response packet after hashing the node ID and the node ID necessary for the establishment of the path by using the secret key assigned to the node. More preferred.

Preferably, in the step (c), when the sixth wireless node in the direction of the source node receives the response packet from at least two nodes, the node having the low resource consumption level among the nodes transmitting the response packet is selected. The method may further include selecting a communication path.

In the communication path establishment method as described above, the resource consumption level may be determined based on at least one of power consumption, delay, mobility, and bandwidth of each of the plurality of wireless nodes.

On the other hand, the wireless network system according to the present invention, a network coordinator for setting each resource consumption class for a plurality of wireless nodes connected to the wireless network, a source node for broadcasting a route establishment request packet to the neighboring node, in the source node When the broadcasted route establishment request packet is received, the route establishment request packet includes a destination node for transmitting a response packet through a route through the radio node having a low resource consumption level among the transmitted paths.

In this case, the network coordinator checks the consumption amount of a predetermined resource required for communication with respect to each of the plurality of wireless nodes, determines the resource consumption class to be proportional to the consumption amount, and a secret key corresponding to the resource consumption class. Is assigned to each of the plurality of wireless nodes.

Preferably, the network coordinator may arbitrarily set a secret key of the highest rank among the resource consumption classes, and then determine a secret key of a lower rank using a one-way hash function.

Meanwhile, in the wireless network system according to the present invention, when the route establishment request packet broadcasted from the source node is received, information necessary for route establishment and its node ID using each of secret keys below the level assigned to the wireless network system are received. After hashing, may further include a first wireless node to include in the route establishment request packet to broadcast toward the destination node.

Preferably, after receiving the route establishment request packet broadcast from the first wireless node, the hash function value included in the route establishment request packet is checked by using a secret key corresponding to its class. The second wireless node may further include a resource consumption class of the first wireless node.

Meanwhile, as described above, according to a routing protocol in which a lower node selects an upper node and establishes a path, the wireless network system includes the resource consumption class among nodes transmitting the route establishment request packet when the response packet is received. The third node may further include a third wireless node for transmitting the response packet to the lower node.

In this case, when the route establishment request packet has received at least two paths, the destination node may transmit the response packet to an upper node having a low resource consumption level among upper nodes that have transmitted the route establishment request packet. have.

On the other hand, according to the routing protocol in which the upper node determines the lower node, when the response packet is received from the destination node, the wireless network system uses the secret key assigned to it and information necessary for establishing the route. After hashing the node ID of the node, the node may further include a fourth wireless node included in the response packet and transmitted in the direction of the source node.

In this case, when the response packet is received through at least two or more paths, it is preferable to further include a fifth wireless node for selecting a path through the node of the low resource consumption class of the path as a communication path.

As described above, in the wireless network system, the resource consumption level may be determined based on at least one of power consumption, delay, mobility, and bandwidth of each of the plurality of wireless nodes.

Hereinafter, with reference to the accompanying drawings will be described in detail with respect to the present invention.

FIG. 2 is a schematic diagram illustrating a hash chain in which a network coordinator (M) divides a grade according to resource consumption of each wireless node and gives secret information in a wireless network system according to the present invention. According to FIG. 2, a node with a high resource consumption (ie, cost) occupies a higher level, and the highest level is assigned a secret key x1. On the other hand, the lower the resource consumption, the lower the rank. This secret key can be arbitrarily divided into n levels according to the characteristics of the network. The network coordinator (M) compares the consumption of resources required for communication by each wireless node, and allocates a secret key by dividing by class.

In this case, the secret key may use a value determined by the one-way hash function. In general, a hash function refers to a function that reduces long-length data to data of a predetermined length, and one-way hash function refers to a function having the following conditions.

That is, (1) it can be applied to an input value of arbitrary size, (2) to produce an output value of constant size, and (3) to calculate H = h (x) for any input value x. Easy, (4) given H = h (x), the reverse calculation of x is practically impossible, and so on. These four conditions are among the most basic definitions that a one-way hash function must have. Hash functions frequently used in the industry include MD2 and MD5.

According to FIG. 2, x2 can be obtained by taking the hash function H for the secret information x1 provided to the first class, but cannot reversely obtain x1 from x2. Therefore, each radio node has a higher resource consumption than the level given to it, and thus cannot provide false information.

Accordingly, when establishing a communication path between the source node and the destination node, the wireless node located on the intermediate path adds predetermined information informing its resource consumption level to the route establishment request packet transmitted from the source node, and the destination node. The radio node in the direction is notified. When the destination node transmits the corresponding response packet, the wireless node receiving the response packet checks the information on the resource consumption level previously notified by the upper node in the direction of the source node, and selects the node with the low resource consumption level to respond. Will be sent.

On the other hand, the network coordinator (M) checks the actual resource consumption of each wireless node in the process of setting up the network to determine the resource consumption class, and to give each wireless node secret information x1 to xn according to the class. In this case, the criteria for determining the resource consumption level may be determined in consideration of power consumption, mobility, latency, and the like.

The power consumption may be a problem, especially in a wireless home network system in which a wireless node powered by its own battery is not directly supplied from an external AC power source.

The home network system refers to a technology that enables communication between various home appliances by extending the concept of a network to home appliances used in general homes. In other words, home network technology is a state-of-the-art technology that allows a user to operate a boiler with a single cell phone or control a VCR to record TV programs. As home appliances are increasingly digitalized, the implementation of such a home network system is becoming more and more visible.

If the resource consumption level is determined according to the power consumption for various home appliances that implement such home network technology, the node powered by an external AC power source such as a TV or a refrigerator may be judged to have low power consumption. Nodes that receive power from their own batteries, such as notebook PCs, and have high power consumption can be considered to have high power consumption. Even if the power is supplied from its own battery, the resource consumption class of the remote control and mobile phone, which have relatively low power consumption, can be allocated to a medium level.

On the other hand, when implementing such a wireless home network system, the network coordinator (M) serves as a ruler for each node by registering information about each node. That is, when a wireless home network system is introduced into each home, in order to prevent a node used in one home from operating in response to a wireless control signal generated in the next home, it is registered once with the network coordinator M used by the user. If so, it can be prevented from responding to control signals transmitted from other network coordinators (M). This technique is also called a duckling model, as if ducklings were born and perceived for the first time as a mother and follow only that object. Accordingly, when a new wireless node is incorporated into the wireless network system, the network coordinator (M) checks the resource consumption amount of the incorporated wireless node, determines its class, and assigns a secret key accordingly. According to the clocking model, each wireless node cannot be changed by another network coordinator once the private key has been granted by the network coordinator (M).

3 is a schematic diagram showing a wireless network system in which a secret key is assigned to each of the wireless nodes A to F according to an embodiment of the present invention. According to the embodiment shown in Figure 3, the network coordinator (M) is divided into a total of four classes for each of the wireless nodes (A to F), and then for the node B of the first class is a secret key x1, second class A secret key x2 is assigned to nodes A, E, and F, a secret key x3 is assigned to node C, which is a third class, and a secret key x4 is assigned to node D, a fourth class. As described above, the secret keys x1 to x4 are information values calculated by the hash function according to the hash chain shown in FIG.

4 to 6 illustrate a process of establishing a communication path between a source node A and a destination node F in a state in which a secret key is provided as shown in FIG. 3.

According to Fig. 4, node A broadcasts a route establishment request packet P _A in the direction of node F. P _A means a packet including a hash function value that hashes its node ID and information necessary for route establishment by using a secret key of node A that is lower than the resource consumption level assigned to it. That is, P _A is x2 corresponding to the second class having its own ID, in addition to information on the address of the source node, the address of the destination node, and the number of nodes to establish a communication path. Each of the following secret keys (x3, x4) contains the hashed value.

Receiving P _A , the neighbor node (B, C) includes the route establishment request packet P _B , P _C by hashing its node ID with the secret key below its level. Will be generated and broadcast back to the destination node. Similarly, neighboring nodes D and E receiving P _B and P _C also generate P _D and P _E and transmit them to the destination node F.

In this case, the route establishment request packet transmitted from each node may be displayed as follows.

P _A = {M, H (M, x2, ID _A ), H (M, x3, ID _A ), H (M, x4, ID _A )}

P _B = {M, H (M, x1, ID _B ), H (M, x2, ID _B ), H (M, x3, ID _B ), H (M, x4, ID _A )}

P _C = {M, H (M, x3, ID _C ), H (M, x4, ID _C )}

P _D = {M, H (M, x4, ID _D )}

P _E = {M, H (M, x2, ID _E ), H (M, x3, ID _E ), H (M, x4, ID _E )}

In Equation 1, M denotes a route establishment request message including an address of a source node and an address of a destination node, and H (M, xn, ID _M ) denotes a value of hashing M, xn, and ID _M. do. In this case, xn means a class n secret key, and ID _M means a unique ID of an arbitrary node M.

Since node A corresponds to the second class, it can transmit a secret key of x2 or less to neighbor nodes B and C. In this case, H (M, x3, ID _A ) and H (M, x4, ID _A ) are also transmitted, so that nodes having lower classes can be identified. That is, since node C has only x3 information, it cannot be verified with x2 (h, IDA). Therefore, if we check with x3 (h, IDA), node C cannot verify that node A has a cost class of 2, but we know that the cost class is at least 3, so we estimate node A's rating. You can do it. On the other hand, Node B with x1 can know for certain that Node A is the second class.

Nodes B and C include their secret keys x3 and x1 in the path establishment request message received from node A, and then hash them and transmit them to neighbor nodes E and D, respectively. Accordingly, node E, the second class, may confirm that node C is a third class, and node B may know that the second class is at least two classes.

As a result, since the secret key is the information set by the one-way hash function, each node cannot generate a higher level secret key than itself, thus providing false information to the neighboring nodes so that it is recognized as having a higher rank. You can't. On the other hand, each node can display the ID _A to ID _F indicating its own address together so that the lower node can not utilize the received higher-class secret key.

Meanwhile, FIG. 5 is a diagram illustrating a process of completing a route establishment by sending a response packet back to the source node A when the destination node F receives the route establishment request packet in this manner.

According to FIG. 5, the destination node F transmits a response packet to the source node A in two ways, the first path through the nodes C and E and the second path through the nodes C and D. If the path establishment request packet is first received through the first path, the destination node F transmits a response packet to the node E without delay, and the node E recorded as its parent node in the process of receiving the path establishment request packet. The response packet is transmitted by selecting C having a low resource consumption level from among D and D. C again sends a response packet to node A, the source node, and as a result, a communication path between node A and node F is established.

On the other hand, if the destination node F receives a route establishment request packet again through the second path later, the destination node F checks the resource consumption level of D, which is the upper node on the second path, and compares it with the class of the node C. Since node D is a class 4, node F establishes a new communication path by releasing resources established through the first path and transmitting a response packet again through the second path.

In this case, if the number of radio nodes constituting the wireless network system is not so large, the destination node F does not immediately transmit a response packet as soon as the path establishment request packet is received, and the path establishment request packet is no longer received. The system may be implemented to wait for a predetermined time for which no node is available, and then select a node having a low resource consumption level among the upper nodes and transmit a response packet. Accordingly, even if a quick path is not established, frequent path changes may be prevented, thereby increasing the stability of the connection.

On the other hand, according to another embodiment of the present invention, a method for establishing a communication path to a path via a node having a low resource consumption level may vary according to differences in routing protocols. That is, when the upper node in the direction of the source node receives at least one or more response packets from several lower nodes in the direction of the destination node, a node having a low resource consumption level may be selected among the lower nodes that transmit each response packet. To this end, the destination node transmits a response packet including a hashed value using its secret key to a plurality of nodes that have sent the route establishment request packet to them. In this case, the destination node F transmits the hashed value by using a secret key corresponding to the rank of the parent node when the rank of the top node is lower than itself, and uses a secret key that has a common value when it is higher than itself. Send a hashed value. This is to ensure that even if the upper node is lower than itself, it can check the transmitted response packet.

 According to FIG. 5, the destination node F may transmit a hashed value to the node E using x2 and a node D may transmit a hashed value to the node D using x4. Similarly, the nodes E and D check whether the rank of the upper node Node C is higher than that of the node C and transmit the hashed value to the node C along with the response packet by using the appropriate secret key. Node C checks the hash function value of the response packet received from Node D and Node E, recognizes Node D's resource consumption level is lower, and selects Node D as the routing path. Therefore, even in this embodiment, the communication path between the source node and the destination node is established through the second path of FIG. 5.

FIG. 6 is a schematic diagram illustrating a state in which a communication path is finally established between nodes A and F according to the processes of FIGS. 4 and 5. According to FIG. 6, it can be seen that Node A and Node F have established communication paths through Nodes C and D having a relatively low resource consumption level among several wireless nodes.

7 is a flowchart illustrating a method for establishing a communication path between nodes in a wireless network system according to the present invention. According to FIG. 7, first, the network coordinator M checks and compares a resource consumption cost for each of the wireless nodes A to F constituting the network, and determines a grade accordingly (S710).

The network coordinator M distributes a secret key to each of the wireless nodes A to F according to the determined classes (S720). Each secret key uses a value set by the one-way hash function to prevent selfish wireless nodes from providing false information.

On the other hand, the source node (A) of the several wireless nodes (A to F) broadcasts the route establishment request packet to the neighboring node in order to establish a communication path with the destination node (F) (S730). In this case, each node transmitting the route establishment request packet hashes its secret key to a source node address, a destination node address, and the like according to Equation 1 above.

According to the routing protocol, when the route establishment request packet is transmitted to the destination node F, the destination node F waits for a predetermined time and selects a node having a low resource consumption level among the higher nodes that have transmitted the route establishment request packet. Then, the response packet is transmitted to the node (S740). Upon receiving the response packet, the upper node checks the resource consumption class of each of the higher nodes registered to it, and transmits the response packet to the wireless node having the lowest resource consumption class. According to this routing protocol, when the response packet is transmitted to the source node A, the establishment of the communication path between the source node A and the destination node B is completed (S750).

Meanwhile, as a method for establishing a communication path through a path with a low resource consumption level by the destination node F, according to an embodiment of the present invention, first, a response packet is transmitted to a higher node that has transmitted a path establishment request packet. The upper node can establish a communication path by transmitting a response packet only to a node having a low resource consumption level among the nodes registered to it. Later, when the route establishment request packet is sent to the destination node again, if the resource consumption class of the node that sent the route establishment request packet is lower than the resource consumption class of the existing node, the response path is transmitted again. Can be changed. If a fast communication path is required, it is desirable to implement the system in this embodiment.

As such, when the path is established according to the flowchart of FIG. 7, the path having the least resource consumption may be selected to establish a communication path, and each wireless node may provide false information to prevent its own resource consumption. This makes it possible to efficiently utilize resources across the network.

As described above, in the wireless network system according to the present invention, a secret key determined by a one-way hash function is assigned to each of the plurality of wireless nodes. As a result, in establishing a communication path between wireless nodes, each wireless node cannot provide a secret key that exceeds the level of the secret key granted to the wireless node, thereby providing false information about its resource consumption level to the neighboring nodes. There will be no. Therefore, it is possible to prevent malicious behavior of the selfish node, thereby enabling efficient use of network-wide resources. In addition, since each wireless node needs to store only one secret key corresponding to its class, it can efficiently use its own memory.

 In addition, although the preferred embodiment of the present invention has been shown and described above, the present invention is not limited to the specific embodiments described above, but the technical field to which the invention belongs without departing from the spirit of the invention claimed in the claims. Of course, various modifications can be made by those skilled in the art, and these modifications should not be individually understood from the technical spirit or the prospect of the present invention.

Claims (20)

In the method for establishing a communication path between a source node and a destination node in a wireless network environment connecting a plurality of wireless nodes, (a) setting a resource consumption level for each of the plurality of wireless nodes; (b) the source node broadcasting a route establishment request packet toward the destination node; And (c) transmitting, by the destination node receiving the route establishment request packet, a response packet through a route through the wireless node having a low resource consumption level among the routes through which the route establishment request packet is transmitted; Communication path establishment method, characterized in that. The method of claim 1, In step (a), (a1) checking a consumption amount of a predetermined resource for communication for each of the plurality of wireless nodes; (a2) determining the resource consumption class to be proportional to the consumption amount; And (a3) assigning each of the plurality of wireless nodes with a secret key corresponding to each of the resource consumption classes. The method of claim 2, Step (a3), And randomly setting a secret key of the highest level among the resource consumption levels, and determining a secret key of a lower level by using a one-way hash function. The method of claim 3, In step (b), (b1) receiving a route establishment request packet by a first wireless node; (b2) hashing, by the first wireless node, its own node ID and information necessary for establishment of a path by using a secret key below its class; And and (b3) including the hashed value in the route establishment request packet, and broadcasting the packet in the direction of the destination node. The method of claim 4, wherein In step (b), (b4) a predetermined second wireless node receives the route establishment request packet from the first wireless node; (b5) the second wireless node recognizing a resource consumption level of the first wireless node by checking a hash function value included in the route establishment request packet by using a secret key corresponding to its class; And (b6) if the second wireless node is not the destination node, repeating steps (b2) and (b3); and establishing a communication path. The method of claim 5, Step (c) is, Transmitting, by the destination node, a response packet toward the source node; And If a predetermined third wireless node in the direction of the source node receives a route establishment request packet from at least two nodes, select a node having a low resource consumption level among the nodes that have transmitted the route establishment request packet and select the response packet. Communication path establishment method comprising a; transmitting. The method of claim 6, Step (c) is, Receiving, by the destination node, a route establishment request packet from a predetermined fourth wireless node after transmitting the response packet; Confirming, by the destination node, a resource consumption level of the fourth wireless node; And And retransmitting the response packet to the fourth wireless node when the resource consumption level of the fourth wireless node is lower than that of the wireless node which has transmitted the response packet. The method of claim 4, wherein Step (c) is, Transmitting, by the destination node, a response packet toward the source node; And Receiving the response packet by the upper node hashing information necessary for establishment of a route and its node ID by using a secret key assigned to the response packet, and including the response packet in the response packet to transmit to the source node; Communication path establishment method, characterized in that it further comprises. The method of claim 8, Step (c) is, When the sixth wireless node toward the source node receives the response packet from at least two nodes, selecting a node having a low resource consumption level as a communication path among nodes transmitting the response packet; Communication path establishment method, characterized in that. The method according to any one of claims 1 to 9, The resource consumption level is determined based on the power consumption of each of the plurality of wireless nodes communication path establishment method. A network coordinator for setting each resource consumption class for a plurality of wireless nodes connected to a wireless network; A source node broadcasting a route establishment request packet to a peripheral node; When the route establishment request packet broadcasted from the source node is received, a destination node for transmitting a response packet through a route through the radio node with a low resource consumption level of the route that the route establishment request packet is transmitted; Wireless network system. The method of claim 11, The network coordinator, Check the consumption amount of a predetermined resource required for communication for each of the plurality of wireless nodes, determine the resource consumption class to be proportional to the consumption amount, and assign a secret key corresponding to the resource consumption class to each of the plurality of wireless nodes. Wireless network system, characterized in that the grant. The method of claim 12, The network coordinator, And randomly setting a secret key of the highest level among the resource consumption levels, and determining a secret key of a lower level by using a one-way hash function. The method of claim 13, When the route establishment request packet broadcasted from the source node is received, hash the information necessary for route establishment and its node ID by using a secret key below the level assigned to the source node, and then, to the route establishment request packet. And a first wireless node to broadcast in the direction of the destination node. The method of claim 14, After receiving the route establishment request packet broadcasted by the first wireless node, by checking a hash function value included in the route establishment request packet by using a secret key corresponding to its class, And a second wireless node for estimating a resource consumption level. The method of claim 15, And a third wireless node configured to transmit the response packet to a node having a low resource consumption level among nodes which have transmitted the route establishment request packet when the response packet is received. The method of claim 16, The destination node, And if the path establishment request packet has received at least two paths, transmitting the response packet to an upper node having a lower resource consumption level among higher level nodes that have transmitted the path establishment request packet. The method of claim 14, When the response packet is received from the destination node, hashing information necessary for establishment of a route and its own node ID using a secret key assigned to the destination node, and including the same in the response packet to transmit to the source node. Wireless node; characterized in that it further comprises. The method of claim 18, And a fifth wireless node configured to select, as a communication path, a path via the node having a low resource consumption level among the paths when the response packet is received through at least two paths. The method according to any one of claims 11 to 19, The resource consumption class is determined based on the power consumption of each of the plurality of wireless nodes, the wireless network system.

Images