KR101907798B1 - Routing Apparatus and Method for 2-Dimensional Multi-Tier Relay Network System - Google Patents

Abstract

Disclosed is a routing device and method in a two-dimensional multi-tier relay network system. The routing device finds a final node path and a final transmission rate from a transmission node in the two-dimensional multi-tier relay network system including a plurality of tiers composed of a plurality of nodes. The routing device comprises: a receiving unit receiving survival paths and energy efficiency values of the survival paths from nodes of a previous tier; a calculating unit calculating an energy efficiency value from the transmission node to the receiving unit based on the energy efficiency values of the survival paths of the nodes of the previous tier; a routing determining unit determining a final node path and a final transmission rate for maximizing the energy efficiency value from the transmission node to the receiving unit; and a transmitting unit transmitting the determined final node path and the final transmission rate to a node included in the final node path among the nodes of the previous tier. The survival path is a path that maximizes the energy efficiency value among the paths connecting the transmission node and itself. The nodes of all the tiers excluding the transmission node and the routing device receive the survival paths and the energy efficiency values of the survival paths from the node of the previous tier, calculate their survival paths and the energy efficiency values of the survival paths based on the received information, and transmit the same to nodes of a next tier. The node having received the determined final node path and the final transmission rate transmits the determined final node path and the final transmission rate to a node included in the determined final node path among the nodes of the previous tier. According to the present invention, energy efficiency can be maximized.

Description

[0001] The present invention relates to a routing apparatus and method for a two-dimensional multi-tier relay network system,

The present invention relates to a routing apparatus and method, and more particularly, to a routing apparatus and method in a two-dimensional multi-tier relay network system.

In a wireless communication network system, a small device such as a sensor node has a limited supply of energy, and therefore it is required to efficiently use energy consumed in communication. In recent years, a method of using a relay network that communicates by a relay method by dividing a long distance by a short distance connected to each node is proposed in order to minimize energy consumed in communication. Such a relay network can reduce energy consumption versus data throughput while maintaining communication quality, thus enabling efficient use of energy.

Routing that sets the relay path in the relay network and determining the transmission speed of each node have a great influence on the energy efficiency. Therefore, in a relay network system where the supply of energy is limited, the routing method is very important for efficient communication.

In order to solve the problems of the prior art as described above, the present invention provides a routing apparatus and method that can maximize energy efficiency.

According to an aspect of the present invention, there is provided a method for searching a final node path and a final transmission rate from a transmitting node in a two-dimensional multi-tier relay network system including a plurality of tiers composed of a plurality of nodes A routing apparatus, comprising: a receiver for receiving energy efficiency values of survival paths and survival paths from nodes of an earlier tier; An operation unit for calculating energy efficiency values from the transmitting node to the receiving unit based on energy efficiency values of surviving paths of the nodes of the previous tier; A routing decision unit for determining a final node path and a final transmission rate such that the energy efficiency value from the transmission node to the reception unit is maximized; And a transmitter for transmitting the determined final node path and the final transmission rate to a node included in the last node path of the nodes of the previous tier, wherein the survival path includes an energy efficiency value The nodes of all the tiers excluding the transmitting node and the routing device receive the energy efficiency value of the survival path and the survival path from the node of the previous tier, The node having received the determined final node path and the final transmission rate transmits the determined final node path and the final transmission rate to the determined final node among the nodes of the previous tier, And transmitting the result to a node included in the node path. The routing device according to the relay control network system is provided.

The operation unit includes a first operation unit for calculating an energy efficiency value between the receiving unit and the nodes of the previous tier; And a second computing unit for computing an energy efficiency value of the surviving paths of the nodes of the previous tier and an energy efficiency value from the transmitting node to the receiving unit by collecting energy efficiency values between the receiving unit and the nodes of the previous tier .

And the final transmission rate is a transmission rate of a node having the lowest maximum transmission rate among the nodes belonging to the final path.

And the energy efficiency value is calculated by the following equation.

은 경로

의 에너지 효율성 값이고,

은 전송 속도이며,

은 경로

의 최대 전송 속도이고,

은 경로

의 채널 파워 이득 및 거리에 기초한 상수이며,

는 경로

에서 송신 전력 이외에 소모되는 파워이다.In the above equation,

Path

, ≪ / RTI >

Is the transmission rate,

Path

, ≪ / RTI >

Path

Lt; / RTI > is a constant based on the channel power gain and distance <

Path

Is the power consumed in addition to the transmission power.

All the nodes convert the energy efficiency values of the survival path and the survival path into a feature vector of the following equation and then transmit them.

는 노드

의

번째 생존 경로의 특징 벡터이고,

는 노드

의

번째 생존 경로의 채널 파워 이득 및 거리에 기초한 상수이며,

는 노드

의

번째 생존 경로에서 송신 전력 이외에 소모되는 파워이고,

는 노드

의

번째 생존 경로의 최대 전송 속도이다.In the above equation,

The node

of

The second survival path is a feature vector,

The node

of

Gt; is a constant based on the channel power gain and distance of the first survivor path,

The node

of

Lt; th > survivor path,

The node

of

Is the maximum transmission rate of the second survivor path.

According to another embodiment of the present invention, there is provided a routing method for finding a final node path and a final transmission rate from a transmitting node to a receiving node in a two-dimensional multi-tier relay network system including a plurality of tiers composed of a plurality of nodes (a) receiving energy efficiency values of survival paths and survival paths from nodes of a previous tier; (b) computing energy efficiency values from the transmitting node to the receiving unit based on energy efficiency values of surviving paths of the nodes of the previous tier; (c) determining a final node path and a final transmission rate such that the energy efficiency value from the transmitting node to the receiving unit is maximized; And (d) transmitting the determined final node path and the final transmission rate to a node included in the last node path of the nodes of the previous tier, wherein the surviving path includes energy The nodes of all the tiers excluding the transmitting node and the routing device receive the energy efficiency value of the surviving path and the surviving path from the node of the previous tier and receive the energy efficiency value of the surviving path and the surviving path based on the received information, The nodes that have received the determined final node path and the final transmission rate determine the final node path and the final transmission rate as nodes of the previous tier, To the node included in the determined final node path, A method of routing in a tiered relay network system is provided.

The present invention has the advantage of maximizing energy efficiency.

FIG. 1 is a diagram for explaining a two-dimensional multi-tier relay network system to which the present invention is applied.
2 illustrates a graph of the maximum energy efficiency values of the a, b, and c-th node paths for transmitting data from the transmitting node 111 to the receiving node 161.
3 is a structural diagram of a routing apparatus in a two-dimensional multi-tier relay network system according to a preferred embodiment of the present invention.
FIG. 4 is a flowchart illustrating a routing method in a two-dimensional multi-tier relay network system according to a preferred embodiment of the present invention with time.

While the invention is susceptible to various modifications and alternative forms, specific embodiments thereof are shown by way of example in the drawings and will herein be described in detail. It should be understood, however, that the invention is not intended to be limited to the particular embodiments, but includes all modifications, equivalents, and alternatives falling within the spirit and scope of the invention. Like reference numerals are used for like elements in describing each drawing.

The terms first, second, etc. may be used to describe various components, but the components should not be limited by the terms. The terms are used only for the purpose of distinguishing one component from another. For example, without departing from the scope of the present invention, the first component may be referred to as a second component, and similarly, the second component may also be referred to as a first component. Hereinafter, embodiments according to the present invention will be described in detail with reference to the accompanying drawings.

FIG. 1 is a diagram for explaining a two-dimensional multi-tier relay network system to which the present invention is applied.

개의 티어로 구성되고, 티어 1에는 송신 노드가 포함되며, 티어

에는 수신 노드 즉 본 발명의 라우팅 장치가 포함될 수 있다.Referring to FIG. 1, a two-dimensional multi-tier relay network system to which the present invention is applied

Tier < / RTI > comprises a transmitting node,

A receiving node, i.e., a routing apparatus of the present invention, may be included.

은 각

개의 노드를 포함할 수 있으며, 티어

의

번째 노드를

로 표시할 수 있다.Tier 2 to Tier

Each angle

Nodes, and the tier

of

Th node

As shown in FIG.

에서 송신하는 데이터가 각 티어의 노드를 거쳐 티어

의 수신 노드

즉 본 발명의 라우팅 장치에 수신된다. 따라서 데이터가 하나의 노드에서 다른 노드까지 전송되기 위해 거쳐가는 노드의 경로 수는 다양할 수 있으며, 본 명세서에서는 이러한 경로들을 노드 경로라고 한다.In the two-dimensional multi-tier relay network system to which the present invention is applied,

Lt; RTI ID = 0.0 > tier < / RTI &

Receiving node

That is, the routing apparatus of the present invention. Therefore, the number of paths of nodes through which data is transferred from one node to another may vary, and in the present specification, these paths are referred to as node paths.

과 티어

의 노드들은 채널 링크로 연결되며, 이를 하나의 브랜치로 정의할 수 있다. 그러므로 송신 노드에서 티어

의

번째 노드까지 가능한 모든 노드 경로의 개수는

개이며, 따라서 송신 노드에서 수신 노드 즉 본 발명의 라우팅 장치까지의 가능한 모든 노드 경로의 개수는

개이다.In a two-dimensional multi-tier relay network system to which the present invention is applied,

And tier

Nodes are connected by a channel link, which can be defined as one branch. Therefore,

of

The number of possible node paths up to the ith node is

And thus the number of all possible node paths from the transmitting node to the receiving node, i. E., The routing device of the present invention,

Dog.

개의 노드 경로를 모두 고려하여 가장 에너지 효율성이 뛰어난 최종 노드 경로를 찾는 중앙 처리 방식을 이용하였는데, 이러한 방법은 고려해야 하는 노드 경로의 수가 너무 많아 계산 과정이 너무 복잡하였다.Conventional routing devices use such

We used a central processing method that finds the most energy efficient end node path considering all of the node paths. This method is too complicated to calculate due to too many node paths to consider.

Since the routing device in the two-dimensional multi-tier relay network system of the present invention uses the distributed processing method of calculating the energy efficiency at each node of each tier and delivering the path of the last node path to the nodes of the next tier, The complexity can be greatly reduced.

Hereinafter, a process of calculating an energy efficiency value in a two-dimensional multi-tier relay network system to which the present invention is applied will be described in more detail with reference to FIG.

개의 브랜치로 구성되며, 모두

개가 존재한다. 송신 노드(111)에서 수신 노드(161)로 데이터를 전송하기 위한 모든 노드 경로 중

번째 노드 경로는

개의 노드

를 포함하고,

개의 브랜치

를 포함할 수 있다. 여기서 노드

은 티어

에 속한

번째 노드 경로의 노드이고, 브랜치

는 티어

과 티어

을 연결하는 채널 링크를 의미한다.Referring to FIG. 1, a node path for transmitting data from a transmitting node 111 to a receiving node 161 includes

Branches, and all

There are dogs. Among all the node paths for transmitting data from the transmitting node 111 to the receiving node 161

The second node path

Nodes

Lt; / RTI >

Branches

. ≪ / RTI > Here,

Silver tier

Belonging to

Th < / RTI > node path,

Tier

And tier

Quot; channel link "

번째 노드 경로의 에너지 효율성 값을 연산하기 위해 브랜치

의 데이터 전송 속도를 연산하면 하기 수학식과 같다.For transmitting data from the transmitting node 111 to the receiving node 161

To calculate the energy efficiency value of the ith node path,

The following equation is obtained.

은

의 데이터 전송 속도이고,

는

의 채널 파워 이득이며,

은

의 송신파워이고,

은 브랜치

의 거리이며,

는 거리 감쇄 지수이고,

는 노이즈 파워 스펙트럼 밀도이며,

이다.In Equation (1)

silver

Lt; / RTI >

The

Lt; RTI ID = 0.0 >

silver

Of the transmission power,

The branch

, ≪ / RTI &

Is the distance attenuation factor,

Is the noise power spectral density,

to be.

의 데이터 전송 속도는 노드

의 송신파워와 선형관계임을 알 수 있다.In Equation 1,

Lt; RTI ID = 0.0 >

And the transmission power of the mobile station is linear.

번째 노드 경로의 데이터 전송 속도는 하기 수학식과 같다.In addition, since all the node paths are connected in series, it is possible to transmit data from the transmitting node 111 to the receiving node 161

Lt; th > node path is expressed by the following equation.

은 송신 노드(111)에서 수신 노드(161)로 데이터를 전송하기 위한

번째 노드 경로의 데이터 전송 속도이다. 또한 수학식 2는 송신 노드(111)에서 수신 노드(161)로 데이터를 전송하기 위한 m번째 노드 경로의 데이터 전송 속도가 가장 낮은 데이터 전송 속도를 갖는 브랜치에 의해 결정됨을 의미한다.In Equation (2)

For transmitting data from the transmitting node 111 to the receiving node 161

Lt; th > node path. Equation (2) means that the data transmission rate of the mth node path for transmitting data from the transmitting node 111 to the receiving node 161 is determined by the branch having the lowest data transmission rate.

번째 노드 경로의 에너지 효율성 값은 데이터 전송 속도

와 모든 노드에서 소모되는 파워의 비율로 정의될 수 있으며, 하기 수학식으로 표현될 수 있다. Now, for transmission of data from the transmitting node 111 to the receiving node 161

The energy efficiency value of the < RTI ID = 0.0 >

And the power consumed at all nodes, and can be expressed by the following equation.

은 송신 노드(111)에서 수신 노드(161)로 데이터를 전송하기 위한 m번째 노드 경로의 에너지 효율성 값이고,

은 송신 전력 이외에 노드에서 소모되는 파워이며,

이다.In Equation (3)

Is an energy efficiency value of the m-th node path for transmitting data from the transmitting node 111 to the receiving node 161,

Is the power consumed at the node in addition to the transmission power,

to be.

을

에 대한 함수로 정의하기 위해 수학식 1을 이용할 수 있다.Now, the energy efficiency value < RTI ID = 0.0 >

of

(1) < / RTI >

번째 노드 경로의 데이터 전송 속도의 최대값은 하기 수학식과 같다.In Equation (1), since the data transmission rate of each branch is linearly related to the transmission power of each node, it is necessary to transmit data from the transmission node 111 to the reception node 161

The maximum value of the data transmission rate of the ith node path is expressed by the following equation.

은 송신 노드(111)에서 수신 노드(161)로 데이터를 전송하기 위한

번째 노드 경로의 데이터 전송 속도의 최대값이고,

은 노드

의 최대 송신 파워이다.In Equation (4)

For transmitting data from the transmitting node 111 to the receiving node 161

Th node path is the maximum value of the data transmission rate,

The node

Is the maximum transmission power of the transmitter.

번째 노드 경로의 데이터 전송 속도의 최대값임을 의미한다.Equation (4) shows that the transmission speed of the lowest branch among the speeds of the respective branches when each node transmits at the maximum transmission power is used for transmitting data from the transmitting node 111 to the receiving node 161

Th node path is the maximum value of the data transmission rate.

로 데이터를 전송하게 된다.Therefore, in order to maximize the energy efficiency value of Equation (3), all nodes have the same data transmission rate

As shown in FIG.

는 하기 수학식으로 표현할 수 있다.Therefore, the transmission power of each node

Can be expressed by the following equation.

번째 노드 경로의 에너지 효율성 값을

에 관한 함수로 표현할 수 있으며, 하기 수학식과 같다.Substituting Equation (5) into Equation (3), it is possible to transfer data from the transmitting node (111) to the receiving node (161)

The energy efficiency value of the < RTI ID = 0.0 >

And can be expressed by the following equation.

은 송신 노드(111)에서 수신 노드(161)로 데이터를 전송하기 위한

번째 노드 경로의 에너지 효율성 값이고,

이며,

이다.In Equation (6)

For transmitting data from the transmitting node 111 to the receiving node 161

Lt; th > node path,

Lt;

to be.

의 에너지 효율성 값은 하기 수학식과 같다.On the other hand,

The energy efficiency value of < / RTI >

은 브랜치

의 에너지 효율성 값이다.In Equation (7)

The branch

Of energy efficiency.

을 하기 수학식과 같이 표현할 수 있다.Substituting Equation (7) into Equation (6)

Can be expressed by the following equation.

이고,

은

이 증가할수록 증가하므로

의 최대값은 하기 수학식과 같다. In Equation (8)

ego,

silver

Increases,

Is expressed by the following equation.

번째 노드 경로의 에너지 효율성 값의 최대값

을 얻을 수 있으며, 이 때 각 노드

의 전송 속도는

임을 알 수 있다.(9) to transmit data from the transmitting node (111) to the receiving node (161)

The maximum value of the energy efficiency value of the ith node path

In this case, each node

The transmission speed of

.

중 가장 큰 값을 갖는 노드 경로를 구하여 최종 노드 경로로 라우팅하고, 최종 노드 경로에 속한 모든 노드들은

의 데이터 전송 속도를 내도록

의 송신 파워로 데이터를 전송하여 최대 에너지 효율을 낼 수 있다.Therefore, the two-dimensional multi-tier relay network system to which the present invention is applied is characterized in that the maximum value

And then routes all nodes belonging to the last node path to the last node path

The data rate of

It is possible to transmit the data with the transmission power of the maximum energy efficiency.

의 그래프를 예시한 것이다.2 shows the maximum value of the energy efficiency values of the a, b, and c-th node paths for transmitting data from the transmitting node 111 to the receiving node 161

As shown in FIG.

에서 최대값을 갖는다. 그러므로 도 2와 같은 경우에는 a번째 노드 경로를 최종 노드 경로로 설정하고, 최종 노드 경로에 속한 모든 노드는

의 데이터 전송 속도로 데이터를 전송하여 최대 에너지 효율을 낼 수 있다.Referring to FIG. 2, a node path having the largest value of the energy efficiency value among a, b, and c-th node paths is the a-th node path,

Lt; / RTI > Therefore, in the case of FIG. 2, the a-th node path is set as the final node path, and all nodes belonging to the last node path

The data can be transmitted at a data transmission rate of a maximum energy efficiency.

Now, the operation of each node in a two-dimensional multi-tier relay network system to which the present invention is applied will be described with reference to FIG.

번째 티어(130)에 속한

번째 노드

까지의 모든 경로

를 고려했을 때, 경로

의 에너지 효율성 함수

이 다른 경로

의 에너지 효율성 함수

보다 값이 큰

이 존재하면 경로

를 생존 경로라고 한다.Each node selects a survival path and transmits it to a node of the next tier. In this specification, the node from the transmitting node 111

Tier < RTI ID = 0.0 > 130 &

Th node

All paths up to

, The path

Energy efficiency function

This other path

Energy efficiency function

Greater than

Path exists

Is called a survival pathway.

의 모든 생존 경로의 집합을

라 하고

의 원소 중

번째 생존 경로를

라 하면,

의 에너지 효율성 값은 수학식 6을 이용하여 하기 수학식으로 표현된다.In addition,

A set of all survival paths of

And

Of the elements

Second survival path

In other words,

Is expressed by the following equation using Equation (6). &Quot; (6) "

번째 생존 경로에 대하여 하기 수학식으로 정의되는 특징 벡터를 생성하여 다음 티어의 노드들에 전송할 수 있다.On the other hand, each node uses Equation 10

A feature vector defined by the following equation for the first survivor path can be generated and transmitted to the nodes of the next tier.

이고,

이며,

이다.In Equation (11)

ego,

Lt;

to be.

는 자신의 최대 에너지 효율성 값을 하기 수학식으로 연산할 수 있다.In addition,

Can calculate its maximum energy efficiency value by the following equation.

That is, the maximum energy efficiency value means the energy efficiency value of the survival paths.

Now, the process of sequentially operating the nodes of each tier will be described.

는 하기 수학식을 이용하여 최대 에너지 효율성 값을 연산한다.First, each node of the tier 2 (120)

Calculates the maximum energy efficiency value using the following equation.

는

의 최대 에너지 효율성 값이고,

는

의 에너지 효율성 함수이며,

는 노드

로부터 노드

까지의 브랜치이다. 그러므로 티어 2(120)의 각 노드의 최대 에너지 효율성 값은 수학식 7의 각 브랜치의 에너지 효율성 값을 이용하여 하기 수학식과 같다.In Equation (13)

The

, ≪ / RTI >

The

Is an energy efficiency function of < RTI ID =

The node

From node

. Therefore, the maximum energy efficiency value of each node of the tier 2 120 is expressed by the following equation using the energy efficiency value of each branch of Equation (7).

는 하기 수학식으로 정의되는 자신의 특징 벡터를 티어 3의 각 노드에 전송한다. Next, each node of the tier 2 (120)

Transmits its own feature vector defined by the following equation to each node of the tier 3.

번째 티어에 속한 모든 노드는 이전 티어의 노드들로부터 수학식 11 및 수학식 15에 의해 정의된 특징 벡터를 전달 받는다.

All nodes belonging to the ith tier receive the feature vectors defined by Equations (11) and (15) from the nodes of the previous tier.

(130)에서 특징 벡터를 전달받은 노드

는 이전 티어에 속한 노드로부터 받은 특징 벡터

와 수학식 10 및 수학식 11을 이용하여

을 복원할 수 있다.tear

(130), the node

Lt; RTI ID = 0.0 > a < / RTI > feature vector

And Equation (10) and Equation (11)

Can be restored.

는

의 에너지 효율성 함수를 하기 수학식을 이용하여 계산할 수 있다.Also,

The

Can be calculated using the following equation.

는

와

를 이용하여 자신의 최대 에너지 효율성 값을 하기 수학식과 같이 연산한다.Now,

The

Wow

The maximum energy efficiency value of the user is calculated according to the following equation.

에서의

번째 생존 경로와 브랜치

를 연결함으로써 노드

의 특징 벡터

는 수학식 11을 이용하여 얻을 수 있다.Node

In

Second survival path and branch

Lt; RTI ID = 0.0 &

Feature vector

Can be obtained by using Equation (11).

는 자신의 특징 벡터

를 다음 티어인 티어

(140)에 속한 노드들

로 전송한다.Now,

Is a feature vector

Next Tier In Tier

Lt; RTI ID = 0.0 > 140 &

Lt; / RTI >

의 모든 노드들이 특징 벡터의 전송을 완료하면, 티어

의 수신 노드(161) 즉 본 발명의 라우팅 장치는 자신의 최대 에너지 효율성 값

을 수학식 17을 이용하여 연산하고,

을 최대가 되게 하는 최종 노드 경로 및 최종 전송 속도

를 결정한다.The nodes of all the tiers sequentially transmit the feature vectors,

When all the nodes of the node have completed transmission of the feature vector,

The receiving node 161 of the present invention, i.e., the routing apparatus of the present invention,

Lt; RTI ID = 0.0 > (17) < / RTI &

The final node path and the final transmission rate

.

을 전송한다.The receiving node 161, that is, the routing apparatus of the present invention, determines the final transmission rate calculated for the node included in the last node path among the nodes of the previous tier

Lt; / RTI >

을 이전 티어의 노드들 중 최종 노드 경로에 포함된 노드에게 전송하므로 송신 노드(111)를 포함한 최종 노드 경로에 포함된 모든 노드는 최종 전송 속도

을 전송받아 하기 수학식의 송신 파워를 결정할 수 있다.All the nodes included in the last node path are the last transmission rate

Is transmitted to the node included in the last node path among the nodes of the previous tier, all nodes included in the last node path including the transmitting node 111 are allowed to transmit the final transmission rate

The transmission power of the following equation can be determined.

Now, a structure of a routing apparatus in a two-dimensional multi-tier relay network system according to a preferred embodiment of the present invention will be described with reference to the drawings.

3 is a structural diagram of a routing apparatus in a two-dimensional multi-tier relay network system according to a preferred embodiment of the present invention.

3, a routing apparatus according to an exemplary embodiment of the present invention includes a receiving unit 310, a first calculating unit 320, a second calculating unit 330, a routing determining unit 340, and a transmitting unit 350 do.

The receiving unit 310 receives the feature vector from the nodes of the previous tier or tier L-1 shown in Fig. The feature vector is defined by Equation (11), and the feature vector may include the energy efficiency value of the survival path and the survival path of each node of the previous tier with reference to Equation (10).

번째 티어에 속한 모든 노드는 이전 티어의 노드들로부터 특징 벡터를 전달 받으며, 각 노드는 동일한 방법으로 특징 벡터를 생성하여 전송한다.The feature vectors are sequentially generated from the nodes of the tier 2 shown in FIG. 1 and transmitted to the nodes of the next tier. As described above,

Every node in the tier receives the feature vector from the nodes in the previous tier, and each node generates and transmits the feature vector in the same way.

The first computing unit 320 computes an energy efficiency value between the nodes of the receiving unit and the previous tier using Equation (16).

The second calculation unit 330 restores the energy efficiency value of the surviving path of the previous tier using the feature vector received by the receiving unit 310 and calculates the energy efficiency value from the transmitting node to the receiving unit using Equation 17 .

The routing decision unit 340 can determine the final node path and the final transmission rate at which the energy efficiency value from the transmission node to the reception unit calculated in the second calculation unit becomes the maximum.

The transmission unit 350 transmits the final node path and the final transmission rate determined by the routing decision unit 340 to nodes included in the final node path determined among the nodes of the previous tier. The nodes included in the determined final node path are transmitted to the node included in the determined final node path among the nodes of the previous tier when the determined final node path and the final transmission rate are transmitted, .

As described above, the routing apparatus in the two-dimensional multi-tier relay network system according to the preferred embodiment of the present invention considers only the survival path to be transferred to the next tier except for the path that is not likely to be the optimal path in each node The computational complexity can be reduced and the large overhead of the conventional central processing method can be reduced.

FIG. 4 is a flowchart illustrating a routing method in a two-dimensional multi-tier relay network system according to a preferred embodiment of the present invention with time.

4, a routing method in a two-dimensional multi-tier relay network system according to an exemplary embodiment of the present invention includes a feature vector receiving step S410, a first calculating step S420, a second calculating step S430, A routing decision step S440, and a transmission step S450.

의 노드들로부터 특징 벡터를 수신하는 단계이다.The characteristic vector receiving step S410 is a step in which the receiving unit 310 receives the previous tier or tier

Lt; RTI ID = 0.0 > a < / RTI >

In the first calculation step S420, the first calculation unit 320 computes an energy efficiency value between the nodes of the receiving unit and the previous tier using Equation (16).

In the second calculation step S430, the second calculation unit 330 restores the energy efficiency value of the surviving path of the previous tier using the feature vector received by the receiving unit 310, Is calculated.

The routing decision step S440 is a step in which the routing decision unit 340 determines the final node path and the final transmission rate at which the energy efficiency value from the transmission node to the reception unit calculated in the second calculation unit becomes the maximum.

The transmitting step S450 is a step in which the transmitting unit 350 transmits the final node path and the final transmission rate determined by the routing decision unit 340 to nodes included in the final node path determined among the nodes of the previous tier.

As described above, the present invention has been described with reference to particular embodiments, such as specific elements, and specific embodiments and drawings. However, it should be understood that the present invention is not limited to the above- Those skilled in the art will appreciate that various modifications and changes may be made thereto without departing from the scope of the present invention. Accordingly, the spirit of the present invention should not be construed as being limited to the embodiments described, and all of the equivalents or equivalents of the claims, as well as the following claims, belong to the scope of the present invention .

310:
320: first operation section
330: second arithmetic section
340:
350:

Claims (10)

1. A routing apparatus for searching for a final node path and a final transmission rate from a transmitting node in a two-dimensional multi-tier relay network system including a plurality of tiers composed of a plurality of nodes,
A receiving unit for receiving the energy efficiency values of the survival path and the survival paths from the nodes of the previous tier;
An operation unit for calculating energy efficiency values from the transmitting node to the receiving unit based on energy efficiency values of surviving paths of the nodes of the previous tier;
A routing decision unit for determining a final node path and a final transmission rate such that the energy efficiency value from the transmission node to the reception unit is maximized; And
And a transmitting unit for transmitting the determined final node path and the final transmission rate to nodes included in the last node path among the nodes of the previous tier,
The survival path is a path that maximizes the energy efficiency value among the paths connecting the transmission node and itself,
The nodes of all the tiers excluding the transmitting node and the routing device receive the energy efficiency value of the survival path and the survival path from the node of the previous tier and calculate the energy efficiency value of their survival path and survival path based on the received information To the next tier's nodes,
Wherein the node having received the determined final node path and the final transmission rate transmits the determined final node path and the final transmission rate to the node included in the determined final node path among the nodes of the previous tier. A routing device in a network system. The method according to claim 1,
The operation unit,
A first computing unit for computing an energy efficiency value between the receiving unit and the nodes of the previous tier; And
And a second computing unit for computing an energy efficiency value of the surviving paths of the nodes of the previous tier and an energy efficiency value from the transmitting node to the receiving unit by collecting energy efficiency values between the receiving unit and the nodes of the previous tier Wherein the routing device is a two-dimensional multi-tier relay network system. The method according to claim 1,
Wherein the final transmission rate is a transmission rate of a node having the lowest maximum transmission rate among the nodes belonging to the last node route. The method according to claim 1,
Wherein the energy efficiency value is calculated by the following equation. ≪ EMI ID = 4.0 >

In the above equation,

Path

, ≪ / RTI >

Is the transmission rate,

Path

, ≪ / RTI >

Path

Lt; / RTI > is a constant based on the channel power gain and distance <

Path

Is the power consumed in addition to the transmission power. The method according to claim 1,
Wherein all the nodes convert the energy efficiency values of the survival path and the survival paths into a feature vector of the following equation, and then transmit the energy vector values to the routing vectors in the two-dimensional multi-tier relay network system.

In the above equation,

The node

of

The second survival path is a feature vector,

The node

of

Gt; is a constant based on the channel power gain and distance of the first survivor path,

The node

of

Lt; th > survivor path,

The node

of

The maximum transmission rate of the first survivor path. A routing method of a routing apparatus for searching for a final node path and a final transmission rate from a transmitting node to a receiving unit in a two-dimensional multi-tier relay network system including a plurality of tiers composed of a plurality of nodes,
(a) receiving energy efficiency values of survival paths and survival paths from nodes of a previous tier;
(b) computing energy efficiency values from the transmitting node to the receiving unit based on energy efficiency values of surviving paths of the nodes of the previous tier;
(c) determining a final node path and a final transmission rate such that the energy efficiency value from the transmitting node to the receiving unit is maximized; And
(d) transmitting the determined final node path and the final transmission rate to a node included in the last node path of the nodes of the previous tier,
The survival path is a path that maximizes the energy efficiency value among the paths connecting the transmission node and itself,
The nodes of all the tiers excluding the transmitting node and the routing device receive the energy efficiency value of the survival path and the survival path from the node of the previous tier and calculate the energy efficiency value of their survival path and survival path based on the received information To the next tier's nodes,
Wherein the node having received the determined final node path and the final transmission rate transmits the determined final node path and the final transmission rate to the node included in the determined final node path among the nodes of the previous tier. A routing method in a network system. The method according to claim 6,
The step (b)
(b1) computing energy efficiency values between the receiving unit and the nodes of the previous tier; And
(b2) calculating energy efficiency values from the transmitting node to the receiving unit by collecting the energy efficiency values of the surviving paths of the nodes of the previous tier and the energy efficiency values between the nodes of the previous tier and the receiving unit A method for routing in a two - dimensional multi - tier relay network system. The method according to claim 6,
Wherein the final transmission rate is a transmission rate of a node having the lowest maximum transmission rate among the nodes belonging to the last node route. The method according to claim 6,
Wherein the energy efficiency value is calculated by the following equation. ≪ EMI ID = 17.0 >

In the above equation,

Path

, ≪ / RTI >

Is the transmission rate,

Path

, ≪ / RTI >

Path

Lt; / RTI > is a constant based on the channel power gain and distance <

Path

Is the power consumed in addition to the transmission power. The method according to claim 6,
Wherein all the nodes convert the energy efficiency values of the survival path and the survival paths into a feature vector of the following equation and transmit the energy vectors.

In the above equation,

The node

of

The second survival path is a feature vector,

The node

of

Gt; is a constant based on the channel power gain and distance of the first survivor path,

The node

of

Lt; th > survivor path,

The node

of

The maximum transmission rate of the first survivor path.

Images