KR20070048431A - Reliable routing device and method in wireless multi-hop network - Google Patents

Abstract

The present invention relates to stable routing in a wireless multi-hop network. A first secret key and a second secret key are stored between the transmitting node and the destination node, and the transmitting node generates a key chain for message authentication between delivery nodes using the second secret key, and When the last key is disclosed to the network and the message is to be transmitted, information requiring security on the network is encrypted using the first secret key to transmit the message to the receiving node, and the receiving node discloses the keychain. The message is validated using a key, and if the receiving node is a destination node of the message, message authentication is performed using the first secret key.

Wireless multi-hop network, source node, destination node, secret key, public key

Description

A reliable routing device and method in a wireless multi-hop network {APPARATUS AND METHOD FOR IN A STABILITY ROUTING MOBILE AD-HOC NETWORK}

1 schematically illustrates a typical multi-hop network

2 illustrates an example of abnormal operations caused by message change in a typical wireless multi-hop network.

3 is a flow chart schematically illustrating the operation of a transmitting node of a wireless multi-hop network according to an embodiment of the present invention.

4 is a diagram schematically illustrating the structure of a keychain generated using a secret key according to an embodiment of the present invention.

5 schematically illustrates a message of a wireless multi-hop network according to an embodiment of the invention.

6 is a flow chart schematically illustrating the operation of a receiving node of a wireless multi-hop network according to an embodiment of the present invention.

7 is a diagram schematically illustrating message transmission and reception according to an embodiment of the present invention.

The present invention relates to a mobile multi-hop network (MANET), and more particularly, to an apparatus and a method for stably performing routing in a wireless multi-hop network.

In general, a wireless communication system includes a plurality of base stations (BSs) that manage the cells through a multi-cell structure, and a plurality of terminals (Mobile Stations / Subscriber Stations) include cells of the base stations. (I.e., signal transmission and reception with the base station in the service area). As such, a terminal moving through a plurality of fixed base stations performs communication through a wireless link with the base station.

Such a wireless communication system has a low flexibility in configuring a wireless network due to a fixed base station location, and thus, it is difficult to provide an efficient communication service in a wireless environment in which traffic distribution or call demands are changed. In addition, due to the limitation of the radio transmission distance, it is difficult for each terminal to communicate with each other when it is desired to communicate with a terminal that does not exist in the service area, that is, the cell.

In order to overcome such drawbacks, the wireless communication system can be reconfigured quickly by responding to environmental changes through a wireless multi-hop method using a fixed relay station (RS) or a mobile relay station or general terminals. It is possible to operate the entire wireless network more efficiently. Thus, the wireless communication system can expand a cell service area and increase system capacity by configuring a network using the wireless multi-hop scheme.

In the wireless multi-hop network, for example, when a channel state is poor between a base station and a terminal, a relay station is provided between the base station and the terminal to configure a multi-hop path through the relay station, thereby providing a radio channel having a better channel state. It can be provided to the terminal. In addition, by using the multi-hop method in a cell boundary region having a poor channel state from a base station, it is possible to provide a faster data channel and expand a cell service area.

In the wireless multi-hop network, it is possible to perform a routing function to terminals as well as a base station and a relay station. Next, a multi-hop network using the multi-hop scheme in a wireless communication system will be described with reference to FIG. 1.

1 is a diagram schematically illustrating a general multi-hop network.

Referring to FIG. 1, a wireless multi-hop network is shown that includes a base station 100, relay stations 130 and 160, and terminals 101, 131, 161, and 163. The base station 100, the relay stations (130, 160), the terminals (101, 131, 161, 163) are all nodes having a routing function, each relays the received signal to the base station, relay station, It is possible to route to the terminal.

If the terminal 101 is a source node to which data is to be transmitted, and the terminal 161 is a destination node to receive data transmitted by the terminal 101, for example, each base station is known. Since all the relay stations and terminals have a routing function, data can be transmitted through various paths. In this example, the terminal 101, which is the source terminal, may transmit data to the terminal 163, which is the target terminal, through the base station 100, the relay station 130, and the relay station 160. It is also possible to route data through any other node to communicate between the source and destination nodes. In such a wireless multi-hop network, a routing scheme based on a topology through a physical arrangement, that is, an arrangement or configuration of a network including nodes and circuits connected thereto has been used. However, in a network in which the size of the network increases or the topology itself changes frequently, it is difficult to apply the topology-based routing method to the network. The location-based routing method has recently attracted attention as a routing method to replace the topology-based routing method.

The location-based routing scheme prevents unnecessary flow of data, that is, flooding, between nodes in a network by routing using location information. In this location-based routing method, in the location-based routing method, an intermediate node, that is, nodes (base stations, relay stations, and relay terminals) relaying data on a network, are required to relay their own messages. Location information, location information of neighbor nodes, and location information of a destination node are required. Thus, the relay node transmits a message between the source node and the target node through various data transmission methods, and transmits the message to the neighbor node closest to the target node.

The nodes may then determine the location of the destination terminal through a global positioning system (GPS), or relative position information without using the GPS. In this location-based routing scheme, each terminal has a location table that stores location information of other terminals.

Most existing wireless multi-hop routing schemes are designed on the assumption that all terminals operate normally. However, due to the presence of malicious terminals, many wireless multi-hop routing schemes cannot be applied to the network. There was a difficulty. The malicious terminals perform abnormal operations such as control message manipulation on the network with reference to FIG. 2.

2 illustrates an example of abnormal operations caused by message change in a typical wireless multi-hop network.

Referring to FIG. 2, networks performing abnormal operations are illustrated, and the abnormal operation will be described through message transmission between a plurality of nodes. In general, in a wireless multi-hop network, since each terminal has a relay function, a network performing abnormal operation through message transmission between terminals will be described.

In a, a network that performs abnormal operation by receiving a message including normal location information and changing the location information to generate and relay an abnormal message is shown. Here, a source node that transmits a message, that is, terminal B 201 and a destination node that receives the message, that is, terminal A 207 is shown, and a network exists between terminal B 201 and terminal A 207. The attack terminal C 203 and the attack terminal D 211 are shown to interfere with the normal operation of the terminal. Accordingly, the message transmission paths of the terminal B 201 and the terminal A 207 include the paths of the terminal B 201-the terminal C 203-the terminal E 205-the terminal A 207 and the terminal B 201-the terminal. Suppose there is a path from C (203) -terminal F (209) -terminal D (211) -terminal E (205) -terminal A (207).

In general, when routing is performed using location information, since information for message relaying, that is, location information of a destination terminal is included in the message, attacking terminals change and transmit the location information, thereby preventing normal operation of the network. . Accordingly, the attack terminal C 203 may generate the message m 'which has changed the location information of the message m received from the terminal B 201 and transmit the message m' to the other attack terminal D 211 via the terminal F 209. . The attack terminal D 211 receives m '' and changes it again to generate an m '' message and transmit it to the terminal C 203 through the terminal E 205. Due to the operation of the terminal C 203 and the terminal D 211, the message m to be transmitted to the terminal A 207 is not transmitted to the terminal A 207, but the terminal C 203-the terminal F 209- The message is circulated through an endless loop of terminal D 211-terminal E 205-terminal C 203.

In Figure b, there is shown a network that performs an abnormal operation by receiving a normal location update (LU) message, changing the location information update message, and transmitting an abnormally changed location information update message to a network. In a network having a location server (LS), each terminal updates its information stored in the location server through a location information update message at regular intervals through the location server.

The terminal A 235 transmits the location information message of the terminal A 235, that is, the LU message to the location server 230 at intervals in order to update its location information. At this time, if the terminal transmitting the LU message of the terminal A (235) is an attacking terminal, that is, the terminal C (233), the terminal C (233) receives the location information update message of the terminal A (235), the terminal The LU message transmitted by A is modified to transmit the LU 'message to neighboring terminals or the location server 230. In such a case, the attack terminal C 233 may not correctly find a path for communication with the terminal A 235 and the terminal A 235 or more than two hops.

In addition, the attacking terminal D 231 may operate as if it is the terminal A 235 to generate a changed LU '' message and transmit it to the location server 230 or to neighboring terminals. Even in this case, terminals A 235 and two hops apart from each other do not exactly find a path for communication with terminal A 235.

In c, the network which receives a location information request (LQ: Location Quarry) message to check the location information of a normal terminal, changes the location request message, transmits the abnormally changed location information request message to a network, and performs an abnormal operation. Appear. In a network having a specific location server, each terminal updates its information stored in the location server through a location information update message at regular intervals through the location server. Each terminal may request information of a target node to which data is to be transmitted, and use the requested location information.

The terminal B 261 may request the location server 260 for the information of the terminal A 265 to transmit data to the terminal A 265. In this case, when the location server 260 is an attacking terminal, the location location response (LR) message may be transmitted in response to the request of the terminal B 261. That is, the changed location information response message, that is, the LR 'message is transmitted to the terminal B 261. In this case, since the terminal B 261 receives the abnormal location information response message, the terminal B 261 cannot accurately locate the terminal A 265. In addition, the location server 260, which is the attack terminal, may receive the LQ message, change the LQ message, and resend the LQ 'message at another location at different time zones. As a result, the network cannot perform normal operation due to the message transmission.

In the wireless multi-hop network, there is a problem in that network resources such as wireless bandwidth, terminal resources such as memory, battery, etc. are wasted due to the network attack such as message change as described above. In addition, there has been a problem that the network is in a defenseless state due to the lack of research on the security problem in the network using the location-based routing method.

Accordingly, an object of the present invention is to propose an apparatus and method for stably routing a message in a wireless multi-hop network.

Another object of the present invention is to propose a stable routing apparatus and method for preventing waste of network resources and node resources in a wireless multi-hop network.

Another object of the present invention is to propose a reliable routing apparatus and method considering randomly generated messages or randomly changed messages in a wireless multi-hop network.

According to an aspect of the present invention, there is provided a stable routing method in a wireless multi-hop network, the method comprising: storing a first secret key and a second secret key between a transmitting node and a destination node; 2 a process of generating a key chain for message authentication between forwarding nodes using a secret key, publishing from the last key of the generated key chain to the network, and information requiring security on the network if a message is to be transmitted The method may further include transmitting a message to a receiving node by performing encryption using the first secret key, validating the message using a public key of the key chain, and receiving the message. In the case of the destination node of the message, the step of performing a message authentication using the first private key All.

An apparatus of the present invention for achieving the above object is a stable routing device in a wireless multi-hop network, storing the destination node, the first secret key and the second secret key, the forwarding node using the second secret key Create a key chain for message authentication between the public and public from the last key of the key chain to the network, and if you want to transmit the message, the information that needs security on the network is encrypted using the first secret key to perform a message A transmitting node for transmitting to a receiving node, and a receiving node for validating the message using the public key of the key chain, and performing a message authentication using the first secret key in the case of the destination node of the message. It is characterized by.

Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings. It should be noted that in the following description, only parts necessary for understanding the operation according to the present invention will be described, and descriptions of other parts will be omitted so as not to distract from the gist of the present invention.

The present invention relates to a wireless multi-hop network and proposes an apparatus and method for stable message transmission between a source node and a destination node for transmitting a message. At this time, each source node, which is a transmitting node that transmits the message, has a private key, and includes a first secret key for authenticating the message and a key chain for validating a message between nodes when transmitting the message. Use a second private key for Thus, the transmitting node transmitting the message generates a key chain using the second secret key, publishes the keys of the key chain from the last key at predetermined time intervals, and requires security using the first secret key. Send the message by encrypting the message. Then, the receiving node including the destination node can authenticate the validity of the message using the public key, and the destination terminal can authenticate and receive the message using the first public key.

The multi-hop network of the present invention consists of a plurality of nodes, each of which transmits and relays a message to each node. Accordingly, the transmitting node of the present invention means a source node for transmitting the message, and the receiving node means each node of the multi-hop network for relaying the message including the destination node, and the destination node is the source node. The final destination node that receives the message sent by. And since the multi-hop network has a public key infrastructure, each terminal stores the public key of a trusted certificate authority, and through the public key infrastructure, the transmitting node and the destination node can use the example of the authentication base. For example, it is assumed that a secret key can be jointly generated using a Diffie-Hellman key exchange protocol or the like.

3 is a flowchart schematically illustrating the operation of a transmitting node of a wireless multi-hop network according to an embodiment of the present invention.

In step 301, the transmitting node stores the first secret key and the second secret key jointly with the destination node and proceeds to step 303. In this case, the first secret key is a secret key for authenticating the message when the transmitting node and the destination node transmit a message. The second secret key is a secret key for message authentication between nodes by generating a key-chain on a wireless multi-hop network.

In step 303, the transmitting node generates a key chain, that is, a one-way key chain, using a hash function of the initial secret key of the transmitting node, that is, the second secret key. Proceed to step. At this time, if the second secret key is Kn, a key chain having a length of n + 1 is generated, and the process of generating the key chain will be described in detail with reference to FIG. 4 below. And through the key chain, the receiving nodes determine the validity of the message.

In step 305, the transmitting node publishes the last generated key on the key chain to the network and proceeds to step 307. The transmitting node then publishes the keys on the key chain at regular intervals.

In step 307, the transmitting node encrypts information that requires security, such as location information, that does not change on the network among the messages by using the first secret key, and proceeds to step 309. The destination node receiving the message may receive the message because the destination node has the first secret key together with the transmitting node.

In step 309, the transmitting node determines whether the message is a Location Update Update (LU) message for updating location information. If the determination result is not the location information update message, the flow proceeds to step 315. Thus, attach a message authentication code (MAC) and proceed to step 313. However, if it is determined that the message is a location information update message, the process proceeds to step 311. Each message on the network according to the present invention will be described with reference to FIG. 5 below.

In step 311, the transmitting node attaches the digital signature to the message and proceeds to step 313. Thus, the destination node receiving the message receives the message if the content of the digital signature matches the attached location information.

In step 313, the transmitting node transmits the message generated through the above operation process.

Next, a key chain generated using the second secret key will be described with reference to FIG. 4.

4 is a diagram schematically illustrating a keychain generated using a secret key according to an embodiment of the present invention.

(401)을 도시된 해쉬 함수를 사용하여 키 체인을 생성하였다. 그리고 상기 키 체인을 생성하는 방향은 410으로 도시되어 있고, 상기 키 체인은 일정 주기를 간격으로 공개 또는 사용되는 방향은 420으로 도시되어 있다. 이러한 키 체인을 통해서 생성된 n+1개의 키들이 도시되어 있으며, 키 체인 상의 마지막에 공개되는 공개 키,

(403)이 나타나있다.Referring to FIG. 4, the second secret key, that is,

401 was created using the hash function shown. In addition, the direction in which the key chain is generated is shown at 410, and the direction in which the key chain is disclosed or used at intervals of a predetermined period is shown at 420. Shown are n + 1 keys generated through this keychain, the last public key on the keychain,

403 is shown.

라 하면, j<i일 경우 상기 무선 멀티-홉 네트워크의 모든 노드는 하기의 수학식 1을 통해서 이전의 키

를 계산할 수 있다.Any value on the keychain

If j <i, all nodes of the wireless multi-hop network is the previous key through the following equation (1)

Can be calculated.

를 송신한 경우 수신 노드는 상기 수학식 1과 같은 방법을 통해 상기

를 해쉬 함수를 사용하여 계산하고, 계산된 값을 네트워크 상에 공개되어 있는 상기

값과 비교한다. 이에 상기 계산된 값이 공개된 값,

과 동일한 경우 상기 수신 노드는 수신된 메시지가 유효한 것임을 확인한다.For this purpose, the transmitting node

In case of transmitting the data, the receiving node transmits the data through the same method as in Equation 1 above.

Is calculated using a hash function, and the calculated value is

Compare with the value. The calculated value is a published value,

If equal to the receiving node confirms that the received message is valid.

Next, a structure of a message of a wireless multi-hop network according to the present invention will be described with reference to FIG. 5.

5 schematically illustrates a message of a wireless multi-hop network according to an embodiment of the present invention.

,

,

,

가 도시되어 있다. Referring to FIG. 5, the destination node 500, the location server 530, and the transmitting node 560 are shown, and each message

,

,

,

Is shown.

은 위치 기반 라우팅 방식을 사용하는 모든 노드들이 위치 정보를 업데이트 하기 위해서 사용하는 메시지이며, 목적 노드(500)가 상기 네트워크 상에 존재하는 위치 서버(LS: Location Server)(530)에 자신의 위치 정보를 업데이트 하 기 위해서 위치 서버에 전송하는 위치 정보 업데이트 메시지이다.

는 목적 노드(500)의 위치 정보를 필요로 하는 소스 노드 즉, 송신 노드(560)가 위치 서버(530)에 위치 정보 요청(LQ: Location Query) 메시지이다.

은 송신 노드(560)가 요청한 위치 정보 요청 메시지를 위치 서버(530)가 중계하여 목적 노드(500)로 전송하는 위치 정보 요청 메시지이다. 그리고

는 상기 위치 정보 요청 메시지를 수신한 목적 노드(500)에서 상기 위치 정보 요청 메시지에 상응하여 송신 노드(560)로 전송하는 위치 정보 응답(LR: Location Reply) 메시지이다. 본 발명에서는 상기한 3가지 메시지, 즉 위치 정보 업데이트 메시지, 위치 정보 요청 메시지, 위치 정보 응답 메시지의 3가지의 메시지를 사용하며, 상기한 세 가지 메시지를 사용하여 안전 위치 정보 서비스(SLS: Secure Location Service, 이하 'SLS'라 칭하기로 한다)를 제공한다. At this time

Is a message used by all nodes using the location-based routing method to update location information, and the destination node 500 has its location information in a location server (LS) 530 existing on the network. Location information update message sent to the location server to update the.

Is a source node requiring location information of the destination node 500, that is, a transmitting node 560 is a location information request (LQ) message to the location server 530.

The location information request message transmitted by the location server 530 to the destination node 500 is transmitted by the location node 560. And

Is a Location Reply (LR) message transmitted from the destination node 500 receiving the location information request message to the transmitting node 560 in response to the location information request message. In the present invention, three messages, namely, location information update message, location information request message, and location information response message, are used. The three location messages are used for secure location information service (SLS: Secure Location). Service, hereinafter referred to as 'SLS').

Then, the above three messages will be described with reference to Table 1 below.

로 나타난 부분은 모두 전송 중에 변하지 않는 정보를 나타낸다. 이때 상기 위치 정보 업데이트 메시지는 다른 메시지들과 다르게 디지털 서명(sign)을 첨부하여 전송한다. 그러나 다른 메시지들은 메시지 인증 코드(MAC: Message Authentication Code)를 생성하여 상기 메시지 인증 코드를 첨부하여 전송한다. UPDATE, QUERY, and REPLY shown in Table 1 indicate location information updates, location information requests, and location information responses, respectively. And said

All parts indicated by represent information that does not change during transmission. In this case, the location information update message is transmitted by attaching a digital signature unlike other messages. However, other messages generate a message authentication code (MAC) and attach the message authentication code to be transmitted.

In this way, the location information update message is transmitted by attaching a digital signature to protect the information that does not change at the time of message transmission, for example, destination location information, etc., when the location server is an internal attack node compromised with the network. Since the digital signature is attached and transmitted when the location information request message is relayed, the nodes receiving the message will not receive the message if the content of the digital signature does not match the attached location information. Discard.

Next, the operation of the receiving node receiving the message of the transmitting node will be described with reference to FIG. 6.

6 is a flowchart schematically illustrating an operation of a receiving node of a wireless multi-hop network according to an embodiment of the present invention.

Referring to FIG. 6, in step 601, a receiving node receives a public key transmitted from the transmitting node and proceeds to step 603. At this time, each of the receiving nodes has the last key of the key chain generated using the second secret key, and the keys of the key chain are disclosed at regular intervals.

이내에 동기를 맞추고 있다. 그리하여 상기 GPS를 이용한 시동기를 기반으로 각각의 노드들은 다른 노드들의 키 체인 상의 특정키가 공개되는 시점을 계산하는 것이 가능하다. 이에 상기 수신 노드는 상기 공개키를 사용하여 메시지의 유효성을 인증할 수 있으며, 이를 통해 상기 무선 멀티-홉 네트워크의 노드들 간의 메시지를 인증한다. In step 603, the receiving node verifies the message using the public key and proceeds to step 605. All nodes on the network may have a predetermined maximum synchronization error time,

Within a few minutes. Thus, based on the GPS-based starter, it is possible for each node to calculate when a particular key on the keychain of other nodes is released. Accordingly, the receiving node may authenticate the validity of the message using the public key, thereby authenticating the message between the nodes of the wireless multi-hop network.

In step 605, the receiving node determines whether the message is a corresponding message that the receiving node should receive. In this case, when the receiving node is a message for receiving the message, the receiving node becomes a destination node of the message. Since the message includes a message authentication code or a digital signature using location information, for example, information that does not change on the network, it is possible to confirm the message using the first secret key. However, if the node receiving the message changes the above information, it checks whether the message authentication code or digital signature matches and discards the message.

Thus, if the message is not the corresponding message to be received at the receiving node, the flow proceeds to step 607. In step 607, the receiving node transmits the message to an adjacent corresponding node.

However, if the message is the corresponding message to be received by the receiving node, the process proceeds to step 609. In step 609, the message is authenticated using the first private key. Thus, if the message is a message corresponding to the receiving node, the receiving node becomes the corresponding destination node receiving the message.

In step 611, the receiving node receives the message and proceeds to step 613. In step 613, the receiving node checks whether the received message is a message for requesting location information update from the transmitting node. If the received message is not the location information update message as a result of the checking, the procedure ends.

However, if the received message is the location information update message as a result of the check, step 615 is performed. Thus, in step 615, the terminal generates a location information response message corresponding to the location information update message and transmits it to the corresponding transmitting node.

The message transmission between the transmitting node and the receiving node will now be described with reference to FIG. 7.

7 is a diagram schematically illustrating message transmission and reception according to an embodiment of the present invention.

Referring to FIG. 7, a message authentication code (MAC) is generated and transmitted to information that does not change even during transmission, that is, information that requires security, between a transmitting node and a receiving node, and the message is transmitted. Since the relay nodes do not have a secret key between the transmitting node and the destination node, the relay nodes cannot change the security-needed information. And even if the security information is changed, if the destination node verifies the message authentication code, it is determined whether the attached value matches the calculated value and discards the message.

When a message is transmitted from a source node, that is, a transmitting node, to a destination node, receiving nodes, that is, relay nodes except for the transmitting node and the destination node, generate and relay a message as shown in Equation 2 below.

는 전송 중에 변경되지 않는 정보를 나타낸다.

는 소스 노드가 생성한 메시지 중 전송 중에 변하지 않는 정보를 나타내고,

는 j번째 구간에서 송신 노드 i의 키 체인 중에서 해당 구간에서 사용되는 키를 나타낸다.

는 송신 노드와 목적 노드의 비밀키를 나타낸다.

는 해쉬 메시지 인증 코드 알고리즘을 사용하여 대칭 키 K로 생성된 메시지의 메시지 인증 코드를 의미한다. Equation 2 is a message generated by each transmitting node i or relay node i.

Indicates information that does not change during transmission.

Represents information that does not change during transmission among the messages generated by the source node,

Denotes a key used in a corresponding section of the key chain of the transmitting node i in the j-th section.

Denotes the private key of the sending node and the destination node.

Denotes a message authentication code of a message generated with a symmetric key K using a hash message authentication code algorithm.

를 첨부하여 전송하므로 도시된 바와 같은 메시지를 통해서 키를 공개하게 된다. 그리하여 도면에는 송수신 간에 메시지 전송을 도시한 도면이다. 여기서 상기 시간 t_i는 송신 노드 i가 메시지 전송을 시작하는 시점을 의미하며,

는

의 공개 시점을 의미한다. 그리고 상기 송신 노드와 수신 노드 간에는 시간 동기가 이루어져 있으므로 수신 노드가

를 수신하였을 때 상기 수 신 노드는 하기의 수학식 3이 만족하는 경우 송신 노드 i가 해당키, 즉

를 아직 전송하지 않았다는 것을 검증하는 것이 가능하다. Sending node i or relay node i are mutually symmetric at the end of the message

Since the transmission is attached to the public key through a message as shown. Thus, the figure illustrates message transmission between transmission and reception. Herein, the time t _i means a time point at which the transmitting node i starts transmitting a message.

Is

It means the point of release. In addition, since the time synchronization is performed between the transmitting node and the receiving node,

When the receiving node receives the following equation (3), the receiving node i is the corresponding key, that is,

It is possible to verify that it has not sent yet.

는 전파 지연(propagation delay)을 나타내고, Q는

를 제외한 메시지의 크기를 나타내고, r은 전송률을 나타낸다. Where above

Represents propagation delay, and Q represents

Represents the size of the message except r, and r represents the transmission rate.

를 유추하는 것이 불가능하다. 이에 목적 노드가 수학식 2에 도시된 바와 같은 메시지를 수신하였을 경우, 송신 단말기와 미리 설정한 공동의 비밀키, 즉 제 1 비밀키

를 사용하여 수신 메시지의

부분의 메시지 인증 코드 값을 계산하여 수신한

와 비교하여 메시지의 신뢰성을 검증하는 것이 가능하다. 그리고 상기한 바와 같은 방식을 사용하여 메시지를 송수신 하는 것을 지리 기반 중계 방법(SGF: Secure Geographic Forwarding)이라하고, 상기한 지리 기반 중계 방법을 이용하여 상기 안전 위치 정보 서비스를 제공한다. After all, the receiving node knows when each key expires, and because the sending node only releases the key when it expires, the attacker's terminal

It is impossible to infer it. When the destination node receives the message as shown in Equation 2, the shared secret key, that is, the first secret key, set in advance with the transmitting terminal.

Of incoming messages

The message authentication code value of the

It is possible to verify the reliability of the message in comparison with. The transmission and reception of a message using the above-described method is called a geographic based relay method (SGF: Secure Geographic Forwarding), and provides the secure location information service using the geographic based relay method.

Meanwhile, in the detailed description of the present invention, specific embodiments have been described, but various modifications are possible without departing from the scope of the present invention. Therefore, the scope of the present invention should not be limited to the described embodiments, but should be defined not only by the scope of the following claims, but also by those equivalent to the scope of the claims.

As described above, the present invention performs message authentication using keys that are disclosed using key chains between neighboring nodes in a wireless multi-hop network, and a transmitting node, that is, a source node and a destination node, uses a mutual public secret key. By transmitting and receiving a message, an unauthenticated terminal can be prevented from arbitrarily changing or generating a message. In addition, the relay terminals have an advantage in that the routing can be stably performed by preventing the transmission of the message by changing the information that requires security, that is, the location information, in transmitting the message. The stable routing prevents the waste of network resources and node resources, and thus has an advantage of efficient network operation.

Claims (18)

A stable routing method in a wireless multi-hop network, Storing a first secret key and a second secret key between a transmitting node and a destination node; The transmitting node generates a key chain for message authentication between delivery nodes using the second secret key; Publishing to the network from the last key of the generated keychain; When the message is to be transmitted, information requiring security on the network may be encrypted by using the first secret key to transmit the message to a receiving node; The receiving node validating the message using the public key of the key chain; And if the receiving node is a destination node of the message, performing message authentication using the first secret key. The method of claim 1, The wireless multi-hop network is a stable routing method, characterized in that the public key infrastructure.  The method of claim 1, And the transmitting node and the receiving node are synchronized within a predetermined maximum synchronization error time. The method of claim 1, And the key chain is generated by using a hash function. The method of claim 1, The disclosure of the keys of the key chain is a stable routing method, characterized in that for releasing the keys on the key chain at regular intervals. The method of claim 1, The security information is a stable routing method characterized in that the location information of the destination node. The method of claim 1, The encryption is a stable routing method characterized in that the encryption using a message authentication code using the first secret key and the second secret key. The method of claim 1, And when the receiving node is not the destination node of the corresponding message as a result of verifying using the second secret key, transmitting the message to the corresponding node. The method of claim 1, And when the transmitting node transmits a location information update request message, the transmitting node transmits and receives a digital signature in the message. A stable routing device in a wireless multi-hop network, Store a destination node, a first secret key and a second secret key, generate a key chain for message authentication between forwarding nodes using the second secret key, publish from the last key of the key chain to the network, and In order to transmit the information, information that needs security on the network includes a transmitting node for transmitting a message to a receiving node by performing encryption using the first secret key; And a receiving node verifying validity of the message using the public key of the key chain, and performing a message authentication using the first secret key when the destination node of the message. The method of claim 10, The wireless multi-hop network is a stable routing device, characterized in that the public key infrastructure. The method of claim 10, And the transmitting node and the receiving node are synchronized within a predetermined maximum synchronization error time. The method of claim 10, And the key chain is generated using a hash function. The method of claim 10, And the transmitting node releases the keys on the key chain at regular intervals. The method of claim 10, The security information is a stable routing device, characterized in that the location information of the destination node. The method of claim 10, The encryption is a stable routing device, characterized in that the encryption using a message authentication code using the first secret key and the second secret key. The method of claim 10, And the receiving node transmits the message to the corresponding node when it is not the destination node of the corresponding message as a result of verifying using the second secret key. The method of claim 10, And the transmitting node transmits and receives a digital signature in a message when the message is a request message for updating location information.

Images