KR101363219B1 - Multi-hop wireless network using opportunistic routing scheme and communication method using the network - Google Patents

Abstract

Disclosed are a multi-hop wireless network using an opportunistic routing scheme and a communication method using the same. The present invention improves the throughput of the network by preventing the destination node from receiving data packets opportunistically and notifying the other nodes on the transmission path of the data packets to prevent unnecessary transmission of data packets that have already been transmitted. Provide technology.

Description

MULTI-HOP WIRELESS NETWORK USING OPPORTUNISTIC ROUTING SCHEME AND COMMUNICATION METHOD USING THE NETWORK}

The following embodiment relates to a multi-hop wireless network using an opportunistic routing scheme and a communication method using the same.

The opportunistic routing technique dynamically selects a receiver from among a plurality of nodes capable of fully receiving the transmitted packet. Typically this node is chosen as the closest node to the destination node. Thus, in contrast to the general multi-hop routing scheme, packets transmitted in opportunistic routing can be transmitted at greater distances towards the destination node for each transmission.

Embodiments of the present invention provide a technique in which a destination node receives a data packet opportunistically, and notifies other nodes on the transmission path of the data packet to prevent unnecessary transmission of a data packet that has already been transmitted. Can provide.

That is, a multi-hop wireless network using an opportunistic routing scheme according to an embodiment of the present invention may provide a technique for improving the throughput of the network compared to the typical routing scheme.

A destination node used in a multi-hop wireless network according to an embodiment of the present invention opportunistically receives a data packet transmitted from at least one of a source node and at least one relay node. A receiving unit; A determination unit determining whether the data packet has been received by the reception unit; And a response character transmitter configured to transmit a destination response character (ACK) to at least one of the source node and the at least one relay node according to the determination that the data packet has been received, wherein the at least one relay node includes the destination character. In response to the receipt of the response response character, the data packet received from the previous node is discarded.

In this case, the receiver may receive a data packet transmitted from a node corresponding to a previous node of the destination node of the source node or the at least one relay node.

In an exemplary embodiment of the present invention, a relay node used in a multi-hop wireless network may include a data packet receiver configured to receive a data packet transmitted from a previous node; A first response character receiver for receiving a destination response character transmitted from the destination node; A first determining unit determining whether the destination response character is received by the first response character receiving unit; A discarding unit discarding the data packet according to the determination that the destination response character has been received; And a data packet transmitter for transmitting the data packet to a next node according to the determination that the destination response character has not been received, wherein the destination node opportunistically receives the data packet transmitted to the next node. The destination response character is transmitted in response to the reception.

In this case, the relay node further includes a second determination unit determining whether the data packet has been received by the data packet receiving unit, and the first determination unit according to the determination of the second determination unit that the data packet has been received. It may be determined whether the destination response character has been received.

The relay node may further include a response character transmitter for transmitting the response character to the previous node according to the determination that the destination response character has not been received.

In addition, the relay node includes a second response character receiving unit for receiving a response character sent by the next node; And a third determining unit determining whether the response character has been received by the second response character receiving unit, wherein the data packet transmission unit determines that the response character is not received and the destination response. The data packet may be retransmitted to the next node according to the determination of the first determining unit that no text is received.

A source node used in a multi-hop wireless network according to an embodiment of the present invention includes a data packet preparation unit for preparing a data packet to be transmitted to a destination node; A response character receiver configured to receive a destination response character transmitted from the destination node and a response character transmitted from the next node; A determination unit which determines whether the destination response character has been received and whether the response character has been received; And a transmission unit configured to transmit the data packet to the next node according to the determination result, wherein the destination node opportunistically receives the data packet transmitted to the next node and responds to the reception. Send a text.

At this time, the transmitter may retransmit the data packet to the next node according to the determination that the response character and the destination response character have not been received.

A method of operating a destination node used in a multi-hop wireless network according to an embodiment of the present invention includes opportunistically receiving a data packet transmitted from at least one of a source node and at least one relay node; Determining whether the data packet has been received by the receiving unit; And transmitting a destination response character to at least one of the source node and the at least one relay node according to the determination that the data packet has been received, wherein the at least one relay node receives the destination response character. Correspondingly, the data packet received from the previous node is discarded.

According to an embodiment of the present invention, a method for operating a relay node used in a multi-hop wireless network may include receiving a data packet transmitted from a previous node; Receiving a destination response character sent from the destination node; Determining whether the destination response character has been received; Discarding the data packet according to a determination that the destination response character has been received; And transmitting the data packet to a next node according to the determination that the destination response character has not been received, and transmitting the response character to the previous node, wherein the destination node transmits the data packet to the next node. Opportunistically receive and transmit the destination response text in response to the reception.

At this time, the operation method of the relay node further comprises the step of determining whether or not the data packet was received, and the step of determining whether the destination response character has been received is determined according to the determination that the data packet was received. It may be determined whether a destination response character has been received.

In addition, the operation method of the relay node comprises the steps of receiving a response character sent by the next node; And determining whether the response character has been received, and wherein transmitting the data packet comprises determining the response packet in response to determining that the response character has not been received and determining that the destination response character has not been received. Retransmitting to the next node.

A method of operating a source node used in a multi-hop wireless network according to an embodiment of the present invention includes preparing a data packet to be transmitted to a destination node; Receiving a destination response letter sent from the destination node and a response letter sent from a next node; Determining whether the destination response character has been received and whether the response character has been received; And transmitting the data packet to the next node according to the determination result, wherein the destination node opportunistically receives the data packet transmitted to the next node, and responds to the reception. Send a text.

In this case, the transmitting of the data packet may retransmit the data packet to the next node according to the determination that the response character and the destination response character have not been received.

1 is a view for explaining a hidden node problem according to an embodiment of the present invention.
2 is a diagram for describing a multi-hop wireless network using an opportunistic routing scheme according to an embodiment of the present invention.
3 through 5 illustrate throughput of a multi-hop wireless network using an opportunistic routing scheme in accordance with one embodiment of the present invention.
6 is a block diagram illustrating a source node, a relay node, and a destination node using an opportunistic routing technique in accordance with an embodiment of the present invention.

1. Precondition for calculating throughput of a multi-hop wireless network using an opportunistic routing scheme according to an embodiment of the present invention

Hereinafter, it is assumed that each node included in the multi-hop wireless network includes one transceiver. In other words, each node cannot simultaneously transmit and receive. In addition, each node may perform communication using a MAC layer RTS / CTS / ACK based communication technique.

Here, the data transmission rate for transmitting the data packet between adjacent nodes is C (bps), and the probability of correctly receiving the transmitted data packet is p. p _{i , j} is the probability that a packet sent at node i will be correctly received at node j. At this time, p _{i , j} reflects the effects of physical level interference, such as the topology of the network, the relative positions of nodes i and j, and the propagation conditions of the radio signal. p _{i , j} may be calculated using a radio propagation modeling tool, or may be measured in practice.

Since the average number of transmissions required for successful packet transmission between two neighboring nodes is 1 / p, the maximum throughput between two neighboring nodes is p · C. In the case of multi-hop paths (e.g., n-hop paths), the maximum throughput is reduced to p · C / n since the source node and the next node on the path cannot transmit at the same time. This is because only one node among three consecutive nodes in the transmission path of the data packet can transmit the data packet. This will be described in more detail with reference to FIG. 1.

1 is a view for explaining a hidden node problem (hidden terminal problem) according to an embodiment of the present invention.

Referring to FIG. 1, when node 2 130 transmits a data packet to node 3 140, node 2 130 may not receive the data packet transmitted by node 1 120. 120 may not transmit the data packet to node 2 130.

In addition, node 0 110 may not transmit data packets to node 1 120 to avoid hidden node problems while node 2 130 transmits data packets to node 3 140.

More specifically, the data packet transmitted by node 2 130 to node 3 140 is also transmitted to node 1 120 located within the same radius. Thus, if node 0 110 transmits the data packet to node 1 120 while node 2 130 transmits the data packet to node 3 140, the data packet transmitted by node 0 110 And a conflict between the data packets sent by node 2 130.

2. Multi-hop wireless network using opportunistic routing scheme according to an embodiment of the present invention

2 is a diagram for describing a multi-hop wireless network using an opportunistic routing scheme according to an embodiment of the present invention.

Referring to FIG. 2, node 0 250 is a destination node and node N 210 is a source node. When using typical routing, data packets are transmitted sequentially passing through nodes located on the path from the source node to the destination node. For example, a data packet sent by a source node is passed through node N-1, node N-2, ... node 3 220, node 2 230, and node 1 240 to the destination node. Delivered.

The destination node (node 0 250) according to an embodiment of the present invention may opportunistically receive a data packet transmitted by each of a plurality of nodes located on a typical routing path.

In this case, the destination node (node 0 250) according to an embodiment of the present invention receives a data packet (data packet transmitted from a node other than node 1 240 according to an opportunistic routing scheme). And a destination response character (ACK) on the transmission path of the data packet. Send to other nodes. That is, the destination response character (ACK) is a signal indicating that the destination node has successfully received the data packet transmitted by the source node.

In addition, the relay node (node i, 1 ≤ i ≤ N-1) according to an embodiment of the present invention, when receiving the destination response character (ACK), the data received from the previous node (node i + 1) Discard the packet. Here, the previous node refers to the previous node on the routing path that sequentially passes from the source node to the destination node.

At this time, the relay node (node i, 1 ≤ i ≤ N-1) according to an embodiment of the present invention does not receive a response character (ACK) from the next node (node i-1), the destination node ( If the destination response character (ACK) is not received from node 0 (250), the data packet may be retransmitted. Here, the next node means the next node on the routing path that is sequentially passed from the source node to the destination node.

In addition, the relay node (node i, 1 ≤ i ≤ N-1) according to an embodiment of the present invention receives the data packet from the previous node (node i + 1), the destination node (node 0 (250) If the destination response character (ACK) is not received from the node, it is possible to prevent the previous node (node i + 1) from retransmitting the data packet by sending the response character (ACK) to the previous node (node i + 1). have. At this time, the relay node transmits the data packet to the next node (node i-1) on the transmission path of the data packet.

On the other hand, the destination node (node 0 250) according to an embodiment of the present invention by the source node (node N (210)) and each of the relay nodes (node i, 1 ≤ i ≤ N-1) Each time a data packet is transmitted, there is a probability of receiving each of the transmitted data packets opportunistically. As described above, when the destination node (node 0 250) according to an embodiment of the present invention receives a data packet, the destination node (node 0 250) transmits a destination response character (ACK) on the transmission path of the data packet. Other nodes may be notified that the reception has already been completed. That is, embodiments of the present invention are the destination node (node 0 250) receives the data packet opportunistically, and informs the other nodes on the transmission path of the data packet, the data has already been transmitted Unnecessary transmission of packets can be prevented.

3. Throughput in a Multi-hop Wireless Network Using Opportunistic Routing Techniques According to an Embodiment of the Invention

As shown in FIG. 2, the throughput at node i may be referred to as T _i . In this case, it is possible to eliminate the impact of retransmission in T _i. That is, the goodput (goodput) at a node i may be represented as T _i. In addition, T _{i , max} represent the maximum good foot at node i, and T _{i , j} represent the net good foot from node i to node j.

B _i represents the throughput including retransmission at node i, and p _{i , j} represent the probability that a packet sent by node i will be successfully received at node j.

In the performance analysis according to an embodiment of the present invention, the destination node (node 0 250) may receive a signal transmitted from a node in a closer position much more strongly than a signal transmitted from a node in a farther position. have. That is, if data packets are sent simultaneously from node i and node j (where i> j, i.e., node i is located farther away from destination node than node j), destination node (node 0 250) May receive a signal transmitted from node j with a probability of p _{j , 0} . At this time, the signal transmitted from the node i is lost.

Here, F _i represents the idle probability of the node i, and can be calculated as Fi = (C -B _i ) / C.

3 to 5 are diagrams for explaining throughput of a multi-hop wireless network using an opportunistic routing scheme according to an embodiment of the present invention.

(1) 1-hop path

Referring to FIG. 3, node 1 310 is a source node and node 0 320 is a destination node.

T ₁ = T _{1 , 0} and B ₁ = T ₁ / p _{1 , 0} in the 1-hop path. At this time, since 0 ≦ B ₁ ≦ C, T ₁ has a maximum value when B ₁ = C. That is, _{T 1, max = p 1,} 0 · C.

(2) two-hop path

Referring to FIG. 4, the destination node (node 0 430) successfully receives a data packet transmitted by the source node (node 2 410) with a probability of p _{2 , 0} . The probability that the destination node (node 0 430) does not receive a data packet, and that node 1 420 successfully receives it is (1 -p _{2 , 0} ) · p _{2 , 1} . In this case, the node 1 420 may transfer the received data packet to the destination node (node 0 430). Here, while the source node (node 2 410) transmits the packet, node 1 420 must remain idle.

이다.The probability that a data packet sent by the source node (node 2 410) will be successfully delivered to the destination node (node 0 430) is p _{2 , 0} + (1-p _{2 , 0} ) · p _{2 , 1,} so

to be.

The ratio between p _{2 , 0} and (1- p _{2 , 0} ) · p _{2 , 1} is the throughput from node 2 410 to node 0 430 and the throughput from node 2 410 to node 1 420. Since the ratio is the same, the following equations hold.

(Equation 1)

(Formula 2)

와 같이 표현 가능하다.Here, node 1 420 transfers all data packets received from node 2 410 to node 0 430, so T _{2 , 1} = T ₁ . Therefore, B ₂ by using T ₁

Can be expressed as:

이다.
Since _{further, 0 ≤ B 1 + B 2} ≤ C, T 2 has a maximum value when the B ₁ + B ₂ = C. In other words,

to be.

(3) 3-hop path

Referring to FIG. 5, the destination node (node 0 540) receives a data packet transmitted by the source node (node 3 510) with a probability of p _{3 , 0} . The probability that the destination node (node 0 540) does not receive the data packet and node 2 520 successfully receives the data packet is (1-p _{3 , 0} ) · p _{3 , 2} . In this case, the node 2 520 may deliver the received data packet to the destination node (node 0 540).

가 된다.At this point, while the source node (node 3 510) is transmitting a data packet, node 2 520 and node 1 530 remain idle to ensure reception of node 2 520. Should be. Since the probability that the data packet transmitted from the source node (node 3 510) is successfully delivered is p _{3 , 0} + (1-p _3,0 ) · p _{3 , 2} ,

.

The ratio between p _{3 , 0} and (1- p _{3 , 0} ) · p _{3 , 2} is the throughput from node 3 510 to node 0 540 and the throughput from node 3 510 to node 2 520. Since the ratio is the same, the following equations hold.

(Equation 3)

(Equation 4)

와 같이 표현 가능하다.Here, node 2 520 transmits all data packets received from node 3 510 to node 0 540, so T _{3 , 2} = T ₂ . Therefore, using B ₁ as T ₁

Can be expressed as:

Furthermore, T ₃ has a maximum value when B ₁ + B ₂ + B ₃ = C since 0 ≦ B ₁ + B ₂ + B ₃ ≦ C.

(4) more than 3-hop path

Referring back to FIG. 2, the probability that all nodes from node 1 to node N-3 are idle while the source node (node N) transmits a data packet. Q _n = F _{n -3} F _{n - 4} F ₁ The destination node (node 0) can correctly receive the data packet transmitted by the source node (node N) with a probability of p _{n , 0} · Q _n .

The probability that the destination node (node 0) does not receive the data packet, and that node N-1 correctly receives the data packet is (1 -p _{n , 0} Q _n ) p _{n , n-1} . In this case, node N-1 may forward the received data packet to node N-2.

At this time, while the source node (node N) transmits the data packet, the node N-1 and the node N-2 must remain idle so that the node N-1 can receive the data packet.

가 된다.Since the probability of successfully delivering a data packet from a source node (node N) is p _{n , 0 ·} Q _n + (1 -p _{n , 0 ·} Q _n ) _· p _{n , n-1} ,

.

The ratio between p _{n , 0} · Q _n and (1-p _{n , 0} · Q _n ) · p _{n , n-1} is the ratio between the throughput from node N to node 0 and the throughput from node N to node N-1. Since the ratio is the same, the following equations hold.

(Equation 5)

(Equation 6)

Here, since node N-1 transfers all data packets received from node N, T _{n , n-1} = T _{n -1} is established. In this case, B _n is a formula for T ₁ through the results of the 1-hop case, the 2-hop case, and the 3-hop case and an iterative procedure of n = 4, 5, ... It can be expressed as

For any n with 3 ≦ n ≦ N, 0 ≦ B _{n −2} + B _{n −1} + B _n ≦ C holds. A search algorithm can be used to find T ₁ , which maximizes the value of B _{n -2} + B _{n -1} + B _n . The value of T _N corresponding to T ₁ is T _{N , max, which} is the maximum throughput of node N.

4. Effects of a Multi-hop Wireless Network Using Opportunistic Routing Techniques According to an Embodiment of the Present Invention

[Table 1]

Referring to the PROP / TRAD column included in the Analytical Results column of Table 1, a multi-hop wireless network using an opportunistic routing scheme according to an embodiment of the present invention improves the throughput of the network compared to a typical routing scheme. You can. In particular, the effect of the present invention in the short-haul path can be noticeable.

Furthermore, Table 1 shows simulation results for each case (Pre-Arranged Node Selection) where the effects of the present invention can be maximized, and for each case (Random Node Selection) that can be regarded as the channel state of an actual multi-hop wireless network. Seems.

Here, assume a slotted operation (slotted operation) for the simulation. That is, all nodes having a data packet to be transmitted may start transmitting the data packet at a start time of a predetermined slot. Also assume that the source node always has a data packet to send.

(1) Cases in which the effects of the present invention can be maximized (Pre-Arranged Node Selection)

The case where the effects of the present invention can be maximized can be simulated as follows. At this time, it may be assumed that the source node always has a preset number of data packets (eg, 10 data packets).

1) Step 1: In each time slot, select the node having the most data packets to transmit among the first three nodes including the source node. The selected node sends a data packet in the corresponding time slot. Two nodes that are not selected among the three nodes are deactivated. For example, if node k + 1 is selected among node k, node k + 1, and node k + 2, node k and node k + 2 are deactivated. In this case, as described above, the node k may be a source node. Furthermore, the next two nodes of the selected node are also deactivated to avoid the hidden node problem. For example, if node k + 1 is selected, node k + 2 and node k + 3 are deactivated.

2) Step 2: Repeat Step 1 for the next three nodes of the last node deactivated in step 1 (for example, if node k + 1 is selected, the last node deactivated becomes node k + 3). do.

Referring to the PROP / TRAD column included in the simulation result (Pre-Arranged Node Selection) column of Table 1, a multi-hop wireless network using an opportunistic routing scheme according to an embodiment of the present invention is more effective than a typical routing scheme. Throughput can be improved. In particular, the effect of the present invention in the short-hole path can be prominent, which is consistent with the analytical results described above.

(2) Random Node Selection, which can be regarded as the channel state of a real multi-hop wireless network.

The case that can be considered as the channel state of an actual multi-hop wireless network can be simulated as follows.

In each time slot, a node among the plurality of nodes having the data packet to be transmitted is randomly selected to transmit the data packet in the corresponding time slot. However, only one node may be selected among three consecutive nodes to avoid the hidden node problem.

Referring to the PROP / TRAD column included in the Random Node Selection column of Table 1, a multi-hop wireless network using an opportunistic routing scheme according to an embodiment of the present invention is capable of reducing the throughput of the network in comparison with a typical routing scheme. Can be improved. Likewise, the effect of the present invention in the short-hole path can be pronounced, which is consistent with the analytical results described above.

5. Source Node, Relay Node, and Destination Node Using Opportunistic Routing Techniques According to an Embodiment of the Present Invention

6 is a block diagram illustrating a source node, a relay node, and a destination node using an opportunistic routing technique according to an embodiment of the present invention.

(1) Destination Node

Referring to FIG. 6, a destination node 630 used in a multi-hop wireless network according to an embodiment of the present invention includes a receiver 631, a determiner 632, and a response character transmitter 633. do.

The receiver 631 opportunistically receives a data packet transmitted from at least one of a source node and at least one relay node. In this case, the receiver 631 may receive a data packet transmitted from a node corresponding to the previous node of the destination node 630 among the source node or the at least one relay node.

In addition, the determination unit 632 determines whether the data packet has been received by the reception unit 631, and the response character transmitter 633 determines the source node and the at least one according to the determination that the data packet has been received. The destination response character (ACK) is transmitted to at least one of the relay nodes.

At this time, the at least one relay node discards the data packet received from the previous node in response to the reception of the destination response character.

(2) relay node

Referring to FIG. 6, a relay node 620 used in a multi-hop wireless network according to an embodiment of the present invention may include a data packet receiver 621, a first response character receiver 622, and a first determiner 623. ), A discarding unit 624, and a data packet transmitting unit 625.

The data packet receiver 621 receives the data packet transmitted from the previous node, the first response character receiver 622 receives the destination response character transmitted from the destination node, and the first determination unit 623 determines the above. The first response character receiver 622 determines whether the destination response character has been received. The discarding unit 624 discards the data packet according to the determination that the destination response character has been received, and the data packet transmitting unit 625 determines that the destination packet has been received by the next node. To send.

At this time, the destination node opportunistically receives the data packet transmitted to the next node, and transmits the destination response character in response to the reception.

(3) source node

6, a source node 610 used in a multi-hop wireless network according to an embodiment of the present invention includes a data packet preparation unit 611, a response character receiving unit 612, a determination unit 613, and And a transmission unit 614.

The data packet preparation unit 611 prepares a data packet to be transmitted to the destination node, and the response character receiving unit 612 receives the destination response character transmitted from the destination node and the response character transmitted from the next node, and determines The unit 613 determines whether the destination response character has been received and whether the response character has been received.

In addition, the transmitter 614 transmits the data packet to the next node according to the determination result. Here, the transmitter 614 may retransmit the data packet to the next node according to the determination that the response character and the destination response character have not been received.

At this time, the destination node opportunistically receives the data packet transmitted to the next node, and transmits the destination response character in response to the reception.

6. Operation method of each of the source node, relay node, and destination node using an opportunistic routing technique according to an embodiment of the present invention

(1) How the Destination Node Works

A method of operating a destination node used in a multi-hop wireless network according to an embodiment of the present invention includes opportunistically receiving a data packet transmitted from at least one of a source node and at least one relay node; Determining whether the data packet has been received by the receiving unit; And transmitting a destination response character to at least one of the source node and the at least one relay node according to the determination that the data packet has been received.

At this time, the at least one relay node discards the data packet received from the previous node in response to the reception of the destination response character.

(2) Operation method of relay node

According to an embodiment of the present invention, a method for operating a relay node used in a multi-hop wireless network may include receiving a data packet transmitted from a previous node; Receiving a destination response character sent from the destination node; Determining whether the destination response character has been received; Discarding the data packet according to a determination that the destination response character has been received; And transmitting the data packet to a next node according to the determination that the destination response character has not been received, and transmitting the response character to the previous node.

At this time, the destination node opportunistically receives the data packet transmitted to the next node, and transmits the destination response character in response to the reception.

In addition, the method of operating the relay node according to an embodiment of the present invention may further include determining whether the data packet has been received.

At this time, the step of determining whether the destination response character has been received determines whether the destination response character has been received according to the determination that the data packet has been received.

In addition, the operation method of the relay node according to another embodiment of the present invention includes the steps of receiving a response character sent by the next node; And determining whether the response character has been received.

At this time, the step of transmitting the data packet includes retransmitting the data packet to the next node according to the determination that the response character is not received and the determination response character is not received.

(3) Operation method of source node

A method of operating a source node used in a multi-hop wireless network according to an embodiment of the present invention includes preparing a data packet to be transmitted to a destination node; Receiving a destination response letter sent from the destination node and a response letter sent from a next node; Determining whether the destination response character has been received and whether the response character has been received; And transmitting the data packet to the next node according to the determination result.

At this time, the destination node opportunistically receives the data packet transmitted to the next node, and transmits the destination response character in response to the reception.

The transmitting of the data packet may retransmit the data packet to the next node according to the determination that the response character and the destination response character have not been received.

The methods according to embodiments of the present invention may be implemented in the form of program instructions that can be executed through various computer means and recorded in a computer-readable medium. The computer-readable medium may include program instructions, data files, data structures, and the like, alone or in combination. The program instructions recorded on the medium may be those specially designed and constructed for the present invention or may be available to those skilled in the art of computer software.

As described above, the present invention has been described by way of limited embodiments and drawings, but the present invention is not limited to the above embodiments, and those skilled in the art to which the present invention pertains various modifications and variations from such descriptions. This is possible.

Therefore, the scope of the present invention should not be limited to the described embodiments, but should be determined by the equivalents of the claims, as well as the claims.

Claims (15)

In a destination node used in a multi-hop wireless network,
A receiving unit for receiving a data packet from at least one of a plurality of nodes existing on a transmission path between a source node and the destination node except for the destination node;
A determination unit determining whether the data packet has been received; And
Response character transmission unit for transmitting a destination response character (ACK) to the remaining nodes in accordance with the determination that the data packet was received
Lt; / RTI >
The relay node included in the remaining nodes discards the data packet corresponding to the destination response character when receiving the destination response character, and short-hole path (short-when not receiving the destination response character). destination node, dynamically selecting a receiving node based on a predetermined number of hops for a haul path.
delete In a relay node used in a multi-hop wireless network,
A data packet receiver for receiving a data packet from a previous node existing on a transmission path between a source node and the relay node;
A first response character receiver for receiving a destination response character from a destination node;
A first determining unit determining whether the destination response character has been received;
A discarding unit discarding the data packet when the destination response character corresponds to the data packet according to the determination that the destination response character has been received; And
A data packet transmitter for dynamically selecting a next node based on a predetermined hop number for a short-hole path according to the determination that the destination response character has not been received, and transmitting the data packet to the next node
Lt; / RTI >
The destination node may include a destination response character corresponding to a data packet received from one of the remaining nodes except the destination node among the plurality of nodes existing on the transmission path between the source node and the destination node. The relay node, transmitting to the nodes.
The method of claim 3,
A second determination unit determining whether the data packet has been received by the data packet receiving unit;
Further comprising:
And the first determination unit determines whether the destination response character has been received according to the determination of the second determination unit that the data packet has been received.
The method of claim 3,
Response character transmitter for transmitting the response character to the previous node according to the determination that the destination response character has not been received.
Relay node further comprising. The method of claim 3,
A second response character receiver for receiving a response character sent by the next node; And
A third determination unit determining whether the response character has been received by the second response character receiver;
Further comprising:
And the data packet transmission unit retransmits the data packet to the next node according to the determination of the third determination unit that the response character has not been received and the determination of the first determination unit that the destination response character has not been received.
A source node used in a multi-hop wireless network,
A data packet preparation unit for preparing a data packet;
A response character receiver for receiving a destination response character transmitted from a destination node of the data packet and a response character transmitted from a relay node existing on a transmission path between the source node and the destination node;
A determination unit which determines whether the destination response character has been received and whether the response character has been received; And
A transmitter for dynamically selecting a next node based on a predetermined hop number for a short-hole path according to the determination result, and transmitting the data packet to the next node
Lt; / RTI >
The destination node transmits a destination response character corresponding to a data packet received from any one of the plurality of nodes existing on the transmission path except for the destination node to the remaining nodes. .
The method of claim 7, wherein
And the transmitting unit retransmits the data packet to the next node according to the determination that the response character and the destination response character have not been received.
A method of operating a destination node used in a multi-hop wireless network,
Receiving a data packet from at least one of a plurality of nodes existing on a transmission path between a source node and the destination node except for the destination node;
Determining whether the data packet has been received; And
Transmitting a destination response character to the remaining nodes according to the determination that the data packet has been received.
Lt; / RTI >
The relay node included in the remaining nodes discards the data packet corresponding to the destination response character when receiving the destination response character, and advances for the short-hole path in advance when the destination response character is not received. A method of operating a destination node, dynamically selecting a receiving node based on a set hop number.
In the operation method of a relay node used in a multi-hop wireless network,
Receiving a data packet from a previous node existing on a transmission path between a source node and the relay node;
Receiving a destination response character sent from the destination node;
Determining whether the destination response character has been received;
Discarding the data packet when the destination response character corresponds to the data packet according to the determination that the destination response character has been received; And
Dynamically selecting a next node based on a predetermined hop number for a short-hole path in accordance with determining that the destination response character has not been received, and transmitting the data packet to the next node.
Lt; / RTI >
The destination node may include a destination response character corresponding to a data packet received from one of the remaining nodes except the destination node among the plurality of nodes existing on the transmission path between the source node and the destination node. Method of operation of the relay node, transmitting to the nodes.
11. The method of claim 10,
Transmitting the response text to the previous node according to the determination that the destination response text was not received.
Operation method of the relay node further comprising.
11. The method of claim 10,
Receiving a response character sent by the next node; And
Determining whether the response text has been received
Further comprising:
The step of transmitting the data packet
Retransmitting the data packet to the next node according to the determination that the response character has not been received and the determination that the destination response character has not been received.
Method of operation of the relay node comprising a. A method of operating a source node used in a multi-hop wireless network,
Preparing a data packet;
Receiving a destination response character sent from a destination node of the data packet and a response letter sent from a relay node existing on a transmission path between the source node and the destination node;
Determining whether the destination response character has been received and whether the response character has been received; And
Dynamically selecting a next node based on a predetermined hop number for a short-hole path according to the determination result, and transmitting the data packet to the next node
Lt; / RTI >
The destination node transmits a destination response character corresponding to a data packet received from any one of the plurality of nodes existing on the transmission path except for the destination node to the remaining nodes. Method of operation.
14. The method of claim 13,
The step of transmitting the data packet
Retransmitting the data packet to the next node according to determining that the response character and the destination response character have not been received.
Method of operation of the source node comprising a.
A computer-readable recording medium having recorded thereon a program for executing the method of any one of claims 9 to 14.

Images