KR102041717B1 - Methdo for calculating turst parameter between nodes in wireless network, method and apparatus for establishment of routing path using turst parameter - Google Patents

Abstract

Disclosed are a method and a device for configuring a routing path on the basis of a reliability parameter between communication nodes. The disclosed method for configuring a routing path in a wireless network comprises the steps of: collecting reliability information on communication nodes on the basis of whether a packet transmitted between the communication nodes is received; and determining a routing path from a departure node to a destination node by using the reliability information, wherein the step of determining a routing path comprises the steps of: calculating a directional reliability value in the direction from an evaluating node to an evaluated node by using a subjective reputation value of the evaluating node for the evaluated node and a statistical value of the subjective reputation value; generating a directional global reliability value in the direction from the evaluating node to the evaluated node by reflecting a global reputation value for the evaluating node in the directional reliability value; and determining a final routing path according to a reliability value, which is calculated from the directional global reliability value, for the routing path from the departure node to the destination node.

Description

METHODO FOR CALCULATING TURST PARAMETER BETWEEN NODES IN WIRELESS NETWORK, METHOD AND APPARATUS FOR ESTABLISHMENT OF ROUTING PATH USING TURST PARAMETER}

The present invention relates to a method and apparatus for establishing a routing path in a wireless network including a plurality of communication nodes, and more particularly, to a method and apparatus for establishing a routing path based on reliability parameters between communication nodes. .

The concept of trust first appeared in the social sciences, and it is a concept that represents a measure of subjective faith based on the behavior of the object.

Recently, a trust management scheme that secures network security by applying the concept of social trust has been studied. Trust management technology aims to keep the network safe by excluding malicious nodes by evaluating the trust of network members, that is, nodes.

The packet forwarding behavior of a node is largely divided into positive behavior and negative behavior. Positive behavior is the behavior when packet delivery occurs normally. Negative behavior is the behavior when packet delivery is attempted but fails. By observing this behavior, the evidence of the behavior of the node can be accumulated to calculate the reliability of all nodes in the network and reflected in the network policy.

 Trust management technology evaluates reliability based on the behavioral pattern of packet forwarding, so that a consistent security paradigm can be maintained even in a network with various heterogeneous devices. In the case of a security technology such as a conventional key authentication method, a common hardware value and software are required because a common key value must be shared in advance. Also, if a security key is stolen by a hacker, the existing network can be compromised. Furthermore, the additional packet overhead incurred in the encryption process increases the end-to-end delay and increases the value of the equipment terminal to support encryption. This is not suitable for future IoT networks that primarily use low-capacity, low-power devices.

On the other hand, trust management technology continuously monitors the behavior of nodes and calculates trust based on the collected results at the Trust Authority (TA), so it is not applicable even in network environment where low specification and low power devices are used. It is possible. Therefore, trust-based security technology is much better suited for sensor-based IoT networks in terms of security and cost of equipment.

Trust management technologies include GlobalTrust technology, Self-ORganizing Turst (SORT) technology, and Context Aware Trust (CATrust) technology.

SORT technique is proposed to block malicious attacks in peer-to-peer systems, and CATrust (Context Aware Trust) technology is proposed to prepare for malicious attacks in SOANET (Service Oriented Ad Hoc Network) environments. Technology has become.

And GlobalTrust (Global Reliability) technology is proposed to enhance the security of the network in military tactical operations environment. GlobalTrust technology uses Local Trust Opinion (LTO), Subjective Reputation (SR), Behavioral Reputation (BR), and Credibility Reputation (Credibility) for communication nodes included in the wireless network. Parameters such as Reputation and Global Reputation are proposed.

As related prior art, the non-patent literature "X. Chen, JH. Cho, and S. Zhu," GlobalTrust: An Attack-Resilient Reputation System for Tactical Networks, "Proc. IEEE SECON, pp. 275-283, Singapore, Singapore , July 2014. "

The present invention is to provide a method and apparatus for establishing a routing path based on reliability parameters between communication nodes.

In particular, it is an object of the present invention to provide a method and apparatus for proposing directional reliability between nodes and establishing a routing path in which directional reliability is maximum.

According to an embodiment of the present invention to achieve the above object, collecting reliability information for the communication node, based on whether or not to receive a packet transmitted between the communication node; And using the reliability information, determining a routing path from a departure node to a destination node, wherein determining the routing path includes the subjective reputation value and the subjective reputation value of the node under evaluation of the evaluation node. Calculating a directional reliability value from the evaluation node toward the evaluated node by using a statistical value; Generating a directional global confidence value from the evaluation node toward the evaluated node by reflecting a global reputation value for the evaluation node in the directional reliability value; And determining a final routing path according to a reliability value for the routing path from the source node to the destination node, calculated from the directional global confidence value.

In addition, according to another embodiment of the present invention to achieve the above object, collecting reliability information for the communication node, based on whether or not to receive packets transmitted between the communication node; And using the reliability information, determining a routing path from a departure node to a destination node, wherein determining the routing path includes the subjective reputation value and the subjective reputation value of the node under evaluation of the evaluation node. Calculating a directional reliability value from the evaluation node toward the evaluated node by using a statistical value; And determining a final routing path according to a reliability value for the routing path from the departure node to the destination node, calculated from the directional reliability value.

In addition, according to another embodiment of the present invention to achieve the above object, receiving a neighbor node reliability value calculated based on whether or not to receive a packet transmitted between the communication node; Calculating a subjective reputation value for the node under evaluation and a global reputation value for the communication node using the neighbor node confidence value; Calculating a directional reliability value from the evaluation node toward the evaluated node using the subjective reputation value and the statistical value of the subjective reputation value; Generating a directional global reliability value from the evaluation node toward the evaluated node by reflecting a global reputation value for the evaluation node in the directional reliability value; And calculating a reliability value for a routing path by using the directional global reliability value.

In addition, according to another embodiment of the present invention to achieve the above object, a communication unit for receiving a neighbor node reliability value calculated based on whether or not to receive a packet transmitted between the communication node; A reliability parameter calculator for calculating a reliability parameter between communication nodes using the neighbor node reliability value; And a routing path calculator configured to determine a routing path from a departure node to a destination node by using the reliability parameter, wherein the reliability parameter calculator includes a subjective reputation value for the node under evaluation and a global reputation for the evaluation node. Calculates a value, a directional reliability value from the evaluation node toward the evaluated node, and a directional global reliability value from the evaluation node to the evaluated node, and the routing path calculation unit is calculated from the directional global reliability value. A routing path setting device is provided in a wireless network that determines a final routing path according to a reliability value of a routing path from the departure node to the destination node.

According to the present invention, it is possible to ensure the highest data transmission success rate by selecting the most reliable optimal routing path based on the existing trust-based scheme.

In addition, according to the present invention, since malicious attack behavior is avoided in the routing selection process through the directional reliability, it is possible to maintain a higher data transmission success rate compared to other routing techniques, even for various network attacks.

1 is a diagram illustrating communication nodes in a wireless network according to an embodiment of the present invention.
2 is a diagram for explaining a trust quorum.
3 and 4 are diagrams for explaining a routing path establishment method in a wireless network according to an embodiment of the present invention.
5 is a diagram illustrating a pseudo code of a routing path establishment method in a wireless network according to an embodiment of the present invention.
6 and 7 are diagrams for explaining the performance of the routing path setting method according to an embodiment of the present invention.
8 is a diagram illustrating an apparatus for setting a routing path in a wireless network according to an embodiment of the present invention.
9 illustrates a trust management node according to an embodiment of the present invention.

As the invention allows for various changes and numerous embodiments, particular embodiments will be illustrated in the drawings and described in detail in the written description. However, this is not intended to limit the present invention to specific embodiments, it should be understood to include all modifications, equivalents, and substitutes included in the spirit and scope of the present invention. In describing the drawings, similar reference numerals are used for similar elements.

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

FIG. 1 is a diagram illustrating communication nodes of a wireless network according to an embodiment of the present invention, and FIG. 2 is a diagram for describing a trust quorum.

As shown in FIG. 1, the wireless network 100 consists of a plurality of communication nodes 101-107. The wireless network may be various types of networks through which communication nodes transmit and receive data, such as an Internet of Things (IoT) network and a wireless sensor network.

The communication nodes transmit and receive packets with neighboring neighbor nodes, generate neighbor node reliability values which are one of reliability parameters, and transmit them to the trust management node 107 which is one of the communication nodes. The trust management node 107 calculates various reliability parameters using neighbor node reliability values, and determines a routing path from the source node to the destination node based on the reliability parameters.

The reliability parameters used in the present invention are described as follows.

<Adjacent node Confidence value ( LTO , Local Trust Opinion)>

The neighbor node reliability value represents a ratio of positive behaviors among packet reception behaviors of neighboring nodes after each communication node transmits packets of neighboring neighboring nodes. The positive behavior indicates the behavior of the neighbor node receiving the packet normally, and can be confirmed from the acknowledgment that the neighbor node has received the packet. And the negative behavior indicates that the neighbor node did not receive the packet, and can be confirmed from the response that the neighbor node did not receive the packet.

For example, in a situation in which an evaluation node w, one of the communication nodes, transmits a packet to the evaluated node u, one of the communication nodes, the neighbor node reliability value may be calculated as shown in Equation 1 below. The evaluation node w may calculate the neighbor node confidence value and transmit it to the trust management node 107. When the number of times that the neighbor node receives the packet increases, the neighbor node reliability value for the node increases.

는 긍정적 행위의 횟수를 나타내며,

는 부정적 행위의 횟수를 나타낸다.here,

Indicates the number of positive actions,

Indicates the number of negative acts.

All communication nodes included in the wireless network become evaluation nodes and nodes under evaluation, and neighbor node reliability values are generated for all communication nodes.

Subjective Reputation (SR, Subjective Reputation)>

The subjective reputation value is a value obtained by evaluating the reputation of the node under evaluation from the viewpoint of the evaluation node, and is a relative evaluation value with respect to the adjacent node confidence value of the node under evaluation of another evaluation node.

The subjective reputation value may be calculated by reflecting the neighbor node reliability value of the evaluated node of the specific evaluation node by reflecting the neighbor node reliability value of the evaluated node of other evaluation nodes, for example, The subjective reputation value for the node under evaluation (u) may be calculated as shown in [Equation 2].

는 피평가 노드(u)에 대한 인접 노드 신뢰도값을 생성한 평가 노드들의 집합이며,

는 제1평가 노드(w)와 제2평가 노드(j)의 피평가 노드(u)에 대한 인접 노드 신뢰도값의 유사도를 나타낸다.

는 평가 노드의 계층값을 나타내며, 노드의 중요도에 따라 값이 달라진다. 계층값은 평가 노드가 신뢰 관리 노드일 경우 2, 신뢰 관리 노드가 아닐 경우 1로 할당된다.here,

Is a set of evaluating nodes that have generated adjacent node confidence values for the evaluated node u,

Denotes the similarity between neighbor node reliability values of the first evaluation node w and the second evaluation node j with the evaluated node u.

Represents the hierarchical value of the evaluation node, and the value varies depending on the importance of the node. The hierarchical value is assigned to 2 if the evaluation node is a trust management node and 1 if it is not a trust management node.

는 제1평가 노드(w)의 피평가 노드(u)에 대한 인접 노드 신뢰도값을 나타내며,

는 제2평가 노드(j)의 피평가 노드(u)에 대한 인접 노드 신뢰도값을 나타낸다.The similarity of the neighbor node reliability value may be a cosine similarity based on a cosine function, and may be calculated as shown in Equation 3 below. here,

Represents an adjacent node confidence value for the node under evaluation u of the first evaluation node w,

Represents an adjacent node confidence value for the node under evaluation u of the second evaluation node j.

The trust management node 107 calculates a subjective reputation value for not only the subjective reputation value for the evaluation node w of the evaluation node w, but also for other communicable evaluation nodes around the evaluation node w. The subjective reputation value of the evaluation node w calculated by the trust management node 107 may be expressed in a matrix as shown in [Equation 4].

Here, N corresponds to the number of nodes under test that can be communicated around the evaluation node w. For example, in FIG. 1, if there are three communicable evaluated nodes around the evaluation node 101, the trust management node 107 may generate an SR matrix consisting of three elements in total.

<Global Reputation (Global Reputation)>

Based on the reliability parameters described above, a global reputation value for the node under evaluation is calculated. The global reputation value is calculated based on the behavioral reputation value and the reliability reputation value, the behavioral reputation value indicates how other nodes evaluate the behavior of the node under evaluation, and the reliability reputation value is the neighbor node reliability generated by the node under evaluation. How reliable the value is.

The behavioral reputation value is calculated based on the subjective reputation value described above. The trust management node 107 may calculate the behavioral reputation value as shown in [Equation 5].

는 피평가 노드(u)에 대한 주관적 평판값 매트릭스(SR 매트릭스)를 나타내며, D는 신뢰 정족수(Trusted quorum)로서, 주관적 평판값에 기반하여 계산된다. 주관적 평판값은 복수의 평가 노드의 피평가 노드에 대한 인접 노드 신뢰도값이 반영되는데, 평가 노드 중 악의적인 노드가 존재한다면 주관적 평판값 매트릭스의 엘리먼트, 즉 주관적 평판값 사이에 편차가 크게 발생한다. 따라서, 차이가 크지 않은 주관적 평판값의 개수가 신뢰 정족수로 활용된다. here,

Denotes a subjective reputation value matrix (SR matrix) for the node under evaluation u, and D is a trusted quorum, which is calculated based on the subjective reputation value. The subjective reputation value reflects the neighbor node reliability value of the evaluated node of the plurality of evaluation nodes. If there is a malicious node among the evaluation nodes, a large deviation occurs between the elements of the subjective reputation value matrix, that is, the subjective reputation value. Therefore, the number of subjective reputation values with little difference is utilized as the confidence quorum.

The trust management node 107 groups subjective reputation values belonging to the SR matrix according to the difference in subjective reputation values for the node under evaluation u, wherein the number of subjective reputation values grouped is not less than half the number of elements in the SR matrix. Group subjective reputation values until The number of subjective reputation values belonging to the group created by the grouping process may be the trust quorum.

For example, as shown in FIG. 2, if the SR matrix includes a total of N subjective plate values SR ₁ to SR _N and the difference between the SR _{N -2} , SR _{N -1} , and SR _N values is the smallest, the confidence The management node 107 groups SR _{N- 2} , SR _{N- 1} , and SR _N into the first group 210. If the difference between the SR ₂ and SR ₃ values is next small, the trust management node 107 groups the SR ₂ and SR ₃ into another group, the second group 220. If the number of subjective reputation values included in the first group 210 is greater than or equal to N / 2, the trust management node 107 uses 3, which is the number of subjective reputation values included in the first group 210, as a trust quorum. do. If not, the trust management node 107 checks the difference in the subjective reputation value for the grouped result and performs grouping again. If the difference between the largest subjective reputation value of SR ₁ and the first group 210, and the difference between the largest subjective reputation value of the SR ₁ and the second group 220, the first and second groups (210, 220) If the maximum difference of the subjective reputation values belonging to) is small, the trust management node 107 groups the first and second groups 210 and 220 into the third group 230. If the number of subjective reputation values included in the third group 230 is greater than or equal to N / 2, 5 is used as the confidence quorum.

)의 신뢰도를 나타내는 신뢰성 평판값을 계산하며, 신뢰성 평판값을 [수학식 6]과 같이 계산할 수 있다. 또다른 노드들이 생성한 인접 노드(j)에 대한 인접 노드 신뢰도값이 높다면, 즉 인접 노드(j)에 대한 행동적 평판값(

)이 높다면 피평가 노드(u)에 대한 신뢰성 평판값은 높아진다.1, the trust management node 107 determines the neighbor node reliability value (generated by the node under evaluation u).

Reputation plate value indicating the reliability of) can be calculated, and the reliability plate value can be calculated as shown in [Equation 6]. If the neighbor node reliability value for the neighbor node j generated by other nodes is high, that is, the behavioral reputation value for the neighbor node j (

Is high, the reliability reputation value for the node under evaluation u is high.

는 실시예에 따라서 다양하게 결정되는 가중치이다.The trust management node 107 calculates the global reputation value for the node under evaluation u using Equation 7 using the behavioral reputation value and the reliability reputation value. here,

Is a weight that is variously determined according to an embodiment.

Since the evaluation node w also becomes the node to be evaluated for other evaluation nodes, the global reputation value for the evaluation node w may also be calculated through Equations 1 to 7.

The aforementioned neighbor node reliability value, subjective reputation value, behavioral reputation value, and reliability reputation value are global reputation values, which are proposed reliability parameters in the GlobalTrust technology, and the present invention additionally provides a directional trust value for establishing a routing path. In this paper, we propose a directional global trust and a routing path's trust for a routing path. Since the routing path is a concept including directionality, which is a direction in which data is transmitted between nodes, the present invention utilizes a reliability parameter proposed by GlobalTrust technology, and thus, the present invention uses a directional reliability value, a directional global reliability value, and a routing path reflecting the directionality between nodes. We propose a confidence value for.

<Directionality Confidence value >

The directional reliability value is calculated based on the subjective plate value. When the subjective reputation value for the node under evaluation of the evaluation node is calculated, the subjective reputation value of the evaluation node w is unreliable if the evaluation node w is malicious, so that the trust management node 107 determines the node under evaluation ( Considering the subjective reputation values of the other evaluation nodes for u), the directional reliability value from the evaluation node w to the evaluation node u is calculated.

)를 계산하고, [수학식 9]와 같이 가중치와 평가 노드(w)의 피평가 노드(u)에 대한 주관적 평판값을 곱하여 방향성 신뢰도값을 계산할 수 있다. 여기서,

는 피평가 노드(u)에 대한 주관적 평판값 전체의 평균을 나타내며,

는 피평가 노드(u)에 대한 주관적 평판값 전체의 표준 편차를 나타낸다.The trust management node 107 calculates the directional reliability value by using the subjective reputation value of the evaluation node of the evaluation node and the statistical value of the subjective reputation value, and as a statistical value, an average and a standard deviation may be used. As an example, the trust management node 107 may have a weight value as shown in Equation (8).

) Can be calculated, and the directional reliability value can be calculated by multiplying the weight by the subjective reputation value for the node (u) of the evaluation node (w) as shown in Equation (9). here,

Represents the average of all subjective reputation values for node (u),

Denotes the standard deviation of the total subjective reputation value for node u under evaluation.

According to Equations 8 and 9, the larger the difference between the subjective reputation value and the mean of the evaluated node u of the evaluation node w is, the smaller the directional reliability value becomes. It can be seen that the greater the difference between the subjective reputation value and the standard deviation for the node under evaluation u, the greater the directional reliability value.

That is, if the evaluation node w is malicious, for example, when the subjective reputation value of the evaluation node w with respect to the evaluated node u is modulated by a malicious attack or the like, the direction of the evaluated node from the evaluation node w It can be seen that the directional reliability value toward (u) is lowered.

<Directional global Confidence value For routing paths Confidence value >

The trust management node 107 calculates a directional global confidence value from the evaluation node to the evaluated node direction by reflecting the global reputation value for the evaluation node in the directional reliability value. Then, the reliability value for the routing path is calculated using the directional global reliability value.

)을 곱하여, 방향성 전역 신뢰도값을 계산할 수 있다. 그리고 [수학식 11]과 같이, 출발 노드에서 목적지 노드 사이에 위치한 평가 노드에 대한 방향성 전역 신뢰도값을 곱하여, 라우팅 경로에 대한 신뢰도값을 계산할 수 있다.The trust management node 107 is a directional reliability value and a global reputation value for the evaluation node (Equation 10).

), The directional global confidence value can be calculated. As shown in Equation 11, the reliability value for the routing path may be calculated by multiplying the directional global reliability values for the evaluation nodes located between the departure node and the destination node.

All communication nodes included in the wireless network become evaluation nodes and nodes under evaluation, and the trust management node according to the present invention calculates reliability parameters between nodes in the wireless network to establish a routing path. To summarize the following.

The trust management node according to the present invention receives a neighbor node reliability value calculated based on whether a packet transmitted between communication nodes is received. The subjective reputation value for the node under evaluation and the global reputation value for the evaluation node are calculated using the neighbor node reliability value. Then, using the statistical values of the subjective reputation value and the subjective reputation value, the directional reliability value from the evaluation node to the evaluated node direction is calculated. The directional global reliability value from the evaluation node to the evaluated node is generated by reflecting the global reputation value for the evaluation node in the directional reliability value. Then, the reliability value for the routing path is calculated using the directional global reliability value.

3 and 4 are diagrams for explaining a routing path establishment method in a wireless network according to an embodiment of the present invention.

The trust management node according to the present invention collects reliability information about the communication node based on whether packets transmitted between the communication nodes are received, and uses the reliability information to determine a routing path from the source node to the destination node. .

The trust management node receives neighbor node reliability values from communication nodes included in the wireless network as reliability information. As described above, the neighbor node reliability value is calculated based on whether or not a packet transmitted between communication nodes has been received. The trust management node calculates various reliability parameters using the neighbor node reliability value.

Referring to FIG. 3, the method for setting a routing path will be described in more detail. The trust management node uses the subjective reputation value and the subjective reputation value of the evaluated node of the evaluation node, and the evaluated node at the evaluation node. The direction reliability value in the direction is calculated (S310). At this time, the trust management node is inversely proportional to the difference between the average of the subjective reputation value and the subjective reputation value, calculates a weight proportional to the standard deviation of the subjective reputation value, multiplies the calculated weight and the subjective reputation value, Can be calculated.

The trust management node reflects the global reputation value for the evaluation node in the directional reliability value, thereby generating a directional global reliability value from the evaluation node toward the evaluated node (S320). At this time, the trust management node may generate a directional global confidence value by multiplying the directional reliability value by the global reputation value for the evaluation node.

The trust management node determines a final routing path according to the reliability value of the routing path from the starting node to the destination node, which is calculated from the directional global reliability value (S330).

There may be various routing paths from the departure node to the destination node, and the trust management node determines, among various routing paths, the routing path that has the highest reliability value for the routing path as the final routing path. The trust management node calculates the reliability value for the routing path by multiplying the directional global reliability values for the starting node and the communication node existing between the starting node and the destination node, for the various routing paths.

)과 제1통신 노드(102)에서 목적지 노드 방향으로의 방향성 전역 신뢰도값(

)을 곱하여, 제1라우팅 경로에 대한 신뢰도값을 산출할 수 있다. 또한 신로 관리 노드(107)는 출발 노드(101)에서 제2통신 노드(104) 방향으로의 방향성 전역 신뢰도값(

), 제2통신 노드(104)에서 제3통신 노드(103) 방향으로의 방향성 전역 신뢰도값(

) 및 제3통신 노드(103)에서 목적지 노드(105) 방향으로의 방향성 전역 신뢰도값(

)을 곱하여, 제2라우팅 경로에 대한 신뢰도값을 산출할 수 있다.For example, in FIG. 4, between the departure node 101 and the destination node 105, a first routing path through the first communication node 102, a second through the second and third communication nodes 103 and 104. There may be various routing paths such as routing paths. At this time, the trust management node 107 is a directional global reliability value (1) from the departure node 101 to the first communication node 102 with respect to the first routing path.

) And the directional global confidence value from the first communication node 102 to the destination node (

By multiplying), the reliability value for the first routing path may be calculated. In addition, the channel management node 107 has a directional global reliability value (from the departure node 101 toward the second communication node 104).

), The directional global reliability value (2) from the second communication node 104 to the third communication node 103.

And the directional global confidence value from the third communication node 103 toward the destination node 105 (

By multiplying), the reliability value for the second routing path can be calculated.

If the second communication node 104 is a malicious node and the directional global reliability value from the second communication node 104 toward the third communication node 103 is calculated to be very small, then the trust management node 107 The first routing path may be selected as the final routing path.

As a result, according to the present invention, it is possible to ensure a high data transmission success rate by selecting the most reliable optimal routing path based on the existing trust-based scheme.

In addition, according to the present invention, since malicious attack behavior is avoided in the routing selection process through the directional reliability, it is possible to maintain a higher data transmission success rate compared to other routing techniques, even for various network attacks.

According to an embodiment, the trust management node may calculate a reliability value for the routing path directly from the directional reliability value without generating the directional global confidence value. In this case, the trust management node may determine the final routing path according to the confidence value for the routing path from the departure node to the destination node, which is calculated from the directional reliability value.

FIG. 5 is a diagram illustrating a pseudo code of a routing path establishment method in a wireless network according to an embodiment of the present invention.

The water code of FIG. 5 is a water code based on the Dijkstra algorithm which is frequently used for routing path establishment. When the path between nodes is called an edge, the Dijkstra algorithm is an algorithm that selects a routing path whose minimum cost is the last routing path. Dijkstra algorithm uses the edge mitigation technique to accumulate the edge cost to establish the least cost routing path, whereas the routing path setting method according to the present invention multiplies the directional global reliability value, as described above, to determine the least cost routing path Set it.

That is, in the present invention, a routing path having a maximum reliability value for the routing path is set. In the Dijkstra algorithm, since the least cost routing path is determined, the present invention uses an inverse of the directional global reliability value in order to use the Dijkstra algorithm. Is used as the cost of the edge between nodes, and the cost is accumulated through the inverse product to establish the least cost routing path. As a result, a routing path can be established in which the directional global reliability is maximized.

Referring to FIG. 5, the method for setting a routing path will be described in detail. First, the trust management node receives a set node N, which contains all of the starting node s, the input graph G, and the nodes of the network. The input graph corresponds to a wireless network and contains the edge cost of the nodes between the nodes of the network. Here, the cost of the inter-node edge corresponds to the inverse of the directional global reliability value as described above, and the cost of the plurality of edges is calculated according to the product of the inverse.

c (u) is the minimum cost up to node u stored by the current algorithm. In the initialization process, since there is no information about all nodes except the starting node s, the minimum cost is set to infinity (∞). prev (u) is a temporary variable that designates the previous node of a node u, and gives the initial value null for all nodes. V is the set of nodes searched by the algorithm so far as the empty set, and the node is included in V whenever there is a node having all edge reductions. The moment V is equal to N ends the edge reduction for all nodes.

In the edge reduction operation, the trust management node selects u having the smallest value of c (u) for any node u that has not yet been searched, and performs edge reduction operation on all adjacent nodes v around the u. At the beginning of edge reduction, u is automatically selected as the starting node s. At this time, since c (u = s) = 0, the node around the starting node is updated with the edge cost l (u, v) (the reciprocal of the directional global confidence value). If the selected u node is not the starting node, the smaller value of c (v) and the newly obtained c (u) l (u, v) for the v node is updated with the new c (v). Each time an update is made, u is assigned a value of prev (v), which stores that u is the most suitable previous node of v. The trust management node performs an edge mitigation process for all nodes, and the shortest cost for each node v is stored in c (v).

The destination node t is selected during the return of the routing path. prev (t) returns the node just before the destination node t. The routing path can be found by repeating the previous node starting from the t node until the return node s is returned through the prev function.

In summary, the trust management node sequentially stores the communication nodes having the maximum confidence value for the routing path in memory, starting from the starting node. The previous node of the destination node is sequentially returned from the memory to generate the final routing path.

의 복잡도를 갖는다. On the other hand, the complexity of the routing path setting method according to the present invention is the same as the existing Dijkstra algorithm, when using the Big Oh function representing the computational complexity

Has the complexity of

Here, M represents the total number of edges, and N represents the total number of nodes. M, the number of edges, represents the number of significant connections between nodes. Thus M is equal to the number of non-null cost of sides.

이다. 네트워크는 랜덤함수로 분포되어있고 전체 노드의 개수가 N이므로, 특정 무선통신 반경 내에 포함되어있는 노드의 평균값은

이다. 이때 에지의 개수는 반경 내 자기자신을 제외한 다른 노드의 수와 같으므로,

이 된다. 이를 모든 노드 N개에 대하여 확장시키면, 유의미한 에지의 개수는

이다. 최종적으로 라우팅에 사용되는 최종 복잡도 비용은

으로 주어진다. In terms of one node, the number of edges matches the number of other nodes in its communication transmission radius. When the network radius is R and the radio radius of each node is r, the probability that a node is included in a specific radio radius is

to be. Since the network is distributed randomly and the total number of nodes is N, the average value of nodes included in a certain radio radius is

to be. In this case, the number of edges is equal to the number of nodes except itself within the radius.

Becomes If we expand this for all N nodes, the number of significant edges

to be. Finally, the final complexity cost for routing

Given by

값을 감소시켜야 한다. 노드의 수는 사용자에 따라 달라지므로

값을 줄이는 것으로 라우팅 복잡도를 사용 환경에 알맞게 줄일 수 있다.To reduce complexity, the number of nodes and

The value should be reduced. The number of nodes depends on the user

Reducing the value can reduce routing complexity to suit your environment.

6 and 7 are diagrams for explaining the performance of the routing path setting method according to an embodiment of the present invention, and shows a simulation result of the data transmission success rate for different network attacks.

6 and 7, CSR represents a routing algorithm according to the present invention, and SPR and ATR represent shortest path routing and ActiveTrust algorithms, respectively. The simulation parameters are shown in [Table 1].

The nodes in the network were randomly distributed in a circular space with a radius of 500M, and the nodes were set as stationary nodes. The total number of nodes distributed is 500, and the radio radius of each node is set to 120m. Each node assumes that nodes within a wireless communication radius can communicate with each other and can exchange information with nodes outside the radius through routing. Nodes are classified into normal nodes and malicious nodes, and it is assumed that a normal node has a wireless packet loss rate of 0.05 by default. The collection and calculation of reliability information of a trust management node is updated every 30 minutes. 10 routings were performed in one reliability information calculation. Routing performance was measured while changing the ratio of malicious nodes among the total 500 nodes.

6 shows the performance of three routing algorithms for a black hole attack (BHA) network attack. In a BHA attack, a malicious node is characterized by discarding all received packets, making the malicious behavior clear but not tampering with the trust itself.

Referring to Figure 6, it can be seen that the routing algorithm according to the present invention shows the best performance in the BHA attack situation than the other two algorithms. In the case of the SPR algorithm, since the reliability information is not collected, the performance is the lowest, and in the case of the ATR, the performance is lower than the routing algorithm according to the present invention because it is not the shortest path-based routing algorithm.

Figure 7 shows the performance of three routing algorithms for Conflicting behavior attack (CBA) network attack. In a CBA attack, a malicious node behaves like an honest node to half of the honest nodes, but performs an abnormal behavior (probably a packet drop of 0.5) to the other half honest nodes, and an honest node confidence value with the honest node. Is reported as 0 while malicious nodes are reported as having an adjacent node confidence value of 1, and so on. In addition, in case of CBA attack, it also performs malicious packet drop as well as tampering with trust information, which makes it difficult to determine the trust of nodes and causes routing failure.

In the case of the routing algorithm according to the present invention, it can be seen that the performance is higher than the other two routing algorithms until the ratio of malicious nodes reaches 45%. This is because the criterion for evaluating reliability is formed around many opinions, so if the majority of the network is a normal node, the reliability information of a few malicious nodes is excluded from the trust evaluation. On the other hand, in the case of ATR, since there is no means of detecting false trust information reporting, the performance of malicious node ratio is low in the entire interval. Since the situation where the proportion of malicious nodes is more than half is difficult to occur in reality, it can be said that the routing algorithm according to the present invention guarantees a high data transmission success rate even in an advanced network attack.

8 is a diagram illustrating an apparatus for setting a routing path in a wireless network according to an embodiment of the present invention.

The apparatus for setting a routing path according to the present invention may be included in a trust management node. Referring to FIG. 8, the apparatus for setting a routing path according to the present invention includes a communication unit 810, a reliability parameter calculator 820, and a routing path calculator 830.

The communication unit 820 receives a neighbor node reliability value calculated based on whether a packet transmitted between communication nodes is received.

The reliability parameter calculator 820 calculates reliability parameters between communication nodes by using neighbor node reliability values. More specifically, the subjective reputation value of the evaluation node of the evaluation node, the global reputation value of the evaluation node, the directional reliability value from the evaluation node to the evaluated node, and the directional global reliability value from the evaluation node to the evaluated node Calculate

The routing path calculator 830 determines the routing path from the source node to the destination node using the reliability parameter. More specifically, the final routing path is determined according to the confidence value for the routing path from the starting node to the destination node, which is calculated from the directional global confidence value.

9 illustrates a trust management node according to an embodiment of the present invention.

9, a trust management node according to the present invention includes a communication unit 910, a routing path setting unit 920, and a power supply device 930. The routing path setting unit 920 includes a reliability parameter calculator 921, a data storage unit 922, a controller 923, an input / output unit 924, and a routing path calculator 925.

The communication unit 910 communicates with other nodes based on various communication protocols.

The reliability parameter calculator 921 calculates various reliability parameters, and the data storage unit 922 stores the calculated reliability parameters or reliability parameters transmitted from the outside. The controller 923 controls the routing path setting unit 920, and the input / output unit 924 receives a user's control command or outputs a processing result. The routing path calculator 925 sets the routing path based on the reliability parameter and the routing path setting method according to the present invention.

The power supply device 930 supplies power to the communication unit 910 and the routing path setting unit 920.

In the case of a general communication node that is not a trust management node, it may include a communication unit 910, a reliability parameter calculator 921, and a power supply device 930, and in the case of the reliability parameter calculator 921, an adjacent node among reliability parameters. The confidence value can be calculated.

The technical contents described above may be embodied in the form of program instructions that may be executed by various computer means and may be recorded in a computer readable medium. The computer readable medium may include program instructions, data files, data structures, etc. alone or in combination. Program instructions recorded on the media may be those specially designed and constructed for the purposes of the embodiments, or they may be of the kind well-known and available to those having skill in the computer software arts. Examples of computer-readable recording media include magnetic media such as hard disks, floppy disks, and magnetic tape, optical media such as CD-ROMs, DVDs, and magnetic disks, such as floppy disks. Magneto-optical media, and hardware devices specifically configured to store and execute program instructions, such as ROM, RAM, flash memory, and the like. Examples of program instructions include not only machine code generated by a compiler, but also high-level language code that can be executed by a computer using an interpreter or the like. The hardware device may be configured to operate as one or more software modules to perform the operations of the embodiments, and vice versa.

As described above, the present invention has been described by specific embodiments such as specific components and the like, but the embodiments and the drawings are provided only to help a more general understanding of the present invention, and the present invention is not limited to the above embodiments. For those skilled in the art to which the present invention pertains, various modifications and variations are possible. Therefore, the spirit of the present invention should not be limited to the described embodiments, and all of the equivalents or equivalents of the claims as well as the claims to be described later belong to the scope of the present invention. .

Claims (11)

In the routing path setting method of the routing path setting device in a wireless network,
Collecting reliability information for the communication node based on whether a packet transmitted between the communication nodes is received; And
Using the reliability information, determining a routing path from a departure node to a destination node,
Determining the routing path
Calculating a directional reliability value from the evaluation node toward the evaluated node using the subjective reputation value for the node under evaluation and the statistical value of the subjective reputation value;
Generating a directional global confidence value from the evaluation node toward the evaluated node by reflecting a global reputation value for the evaluation node in the directional reliability value; And
Determining a final routing path according to a confidence value for the routing path from the source node to the destination node, calculated from the directional global confidence value,
Calculating the directional reliability value
Calculating a weight that is inversely proportional to a difference between the average of the subjective plate values and the subjective plate values and is proportional to a standard deviation of the subjective plate values; And
Calculating the directional reliability value by multiplying the weight by the subjective plate value.
Routing path setting method in a wireless network comprising a.
delete The method of claim 1,
Generating the directional global confidence value
Generating the directional global confidence value by multiplying the directional reliability value by the global reputation value for the evaluation node
How to set up routing paths on a wireless network.
The method of claim 1,
Determining the final routing path
Determining a routing path having a maximum confidence value for the routing path as the final routing path.
How to set up routing paths on a wireless network.
The method of claim 4, wherein
Determining the final routing path
Calculating a reliability value for the routing path by multiplying a directional global reliability value for the departure node and a communication node existing between the departure node and the destination node.
How to set up routing paths on a wireless network.
The method of claim 5,
Determining the final routing path
Storing communication nodes having a maximum confidence value for the routing path sequentially in a memory, using the starting node as a starting point; And
Sequentially returning previous nodes of the destination node from the memory to create the final routing path.
How to set up routing paths on a wireless network.
In the routing path setting method of the routing path setting device in a wireless network,
Collecting reliability information for the communication node based on whether a packet transmitted between the communication nodes is received; And
Using the reliability information, determining a routing path from a departure node to a destination node,
Determining the routing path
Calculating a directional reliability value from the evaluation node toward the evaluated node using the subjective reputation value for the node under evaluation and the statistical value of the subjective reputation value; And
Determining a final routing path according to a confidence value for the routing path from the source node to the destination node, calculated from the directional confidence value,
Calculating the directional reliability value
Calculating a weight that is inversely proportional to a difference between the average of the subjective plate values and the subjective plate values and is proportional to a standard deviation of the subjective plate values; And
Calculating the directional reliability value by multiplying the weight by the subjective plate value.
Routing path setting method in a wireless network comprising a.
A method for calculating reliability parameters between nodes in a wireless network of a trust management node,
Receiving a neighbor node reliability value calculated based on whether a packet transmitted between the communication nodes is received;
Calculating a subjective reputation value for the node under evaluation and a global reputation value for the communication node using the neighbor node confidence value;
Calculating a directional reliability value from the evaluation node toward the evaluated node using the subjective reputation value and the statistical value of the subjective reputation value;
Generating a directional global reliability value from the evaluation node toward the evaluated node by reflecting a global reputation value for the evaluation node in the directional reliability value; And
Calculating a confidence value for a routing path using the directional global confidence value,
Generating the directional global confidence value
Generating the directional global confidence value by multiplying the directional reliability value by the global reputation value for the evaluation node
A method of calculating reliability parameters between nodes in a wireless network.
The method of claim 8,
Calculating the directional reliability value
Calculating a weight that is inversely proportional to a difference between the average of the subjective plate values and the subjective plate values and is proportional to a standard deviation of the subjective plate values; And
Calculating the directional reliability value by multiplying the weight by the subjective plate value.
Method of calculating a reliability parameter between nodes in a wireless network comprising a.
delete delete

Images