KR100906303B1 - Wireless communicating method and system for obstacle avoidance between nodes - Google Patents

Abstract

A method and system for inter-node wireless communication for obstacle avoidance are disclosed. The node-to-node wireless communication method for obstacle avoidance according to the present invention comprises the steps of: determining whether a failure occurs in a communication path with a destination node; Acquiring channel state information (CSI) between the plurality of neighbor nodes and the destination node from a plurality of neighbor nodes when it is determined that a failure occurs in the communication path; Selecting one of the plurality of peripheral nodes as a relay node based on the obtained channel state information; And communicating with the destination node using the peripheral node selected as the relay node.

Obstacle Avoidance, Channel State Information, Peripheral Node, Relay Node, WiMedia Wireless Media Access Control

Description

Node-to-node wireless communication method and system for obstacle avoidance {WIRELESS COMMUNICATING METHOD AND SYSTEM FOR OBSTACLE AVOIDANCE BETWEEN NODES}

The present invention provides a line of view of two transceivers that may exhibit high data rates when the beam width is narrow and LOS is guaranteed due to channel characteristics, such as in multi-gigabit wireless communication using the 60 GHz frequency band. The present invention relates to a wireless communication method and system that can be applied when communication is difficult due to the presence of a person or obstacle on a line or a poor channel condition.

The invention of the Ministry of Information and Communication IT It is derived from the research conducted as part of the new growth engine core technology development project. [Task Management Number: 2005-S-002-01, Multi - Gigabit  Air interface technology].

In the related art, a method of performing communication using reflection or multi-path by using an array antenna in a transmitter and a receiver to change the direction of the beam to an obstacle free location, that is, beam steering ( There is a beam-steering method, but this can lead to signal attenuation of 20dB or more, and thus cannot guarantee a high data rate. In addition, since a control signal must be transmitted and received in advance so that the beam direction can be synchronized between the transmitter and the receiver, there is a problem in that a data transmission delay occurs.

As another method for avoiding such obstacles, there is a method using a relay node. In case of failure on the direct path to the destination, data is transmitted through the bypass path through the relay device, which has a relatively high data rate and low data delay compared to the obstacle avoidance technique by changing the beam direction. I can guarantee it.

However, the method of using the relay device has a disadvantage in that the installation cost is high because the relay device must be separately installed in addition to the devices to perform communication. In addition, the transmitting node and the receiving node need to know the position of the relay device in advance so that when a failure occurs, communication can be performed by using the relay device immediately. There is also a need for a mechanism for determining whether a direct path is available even during communication using a relay device.

Meanwhile, as another method, there is a method of relaying data to a destination by using other wireless nodes around without installing a separate relay device. This is a limitation that there must be other wireless nodes around and the surrounding nodes can be routed to their destinations. And even if the neighboring node can be set to the destination node, if the neighboring node is in wireless communication with other nodes, there is a disadvantage that processing of data for relaying is delayed or it is difficult to guarantee a transmission rate.

SUMMARY OF THE INVENTION The present invention has been made to improve the prior art as described above, and an object of the present invention is to perform data communication between a source node and a destination node by avoiding obstacles using neighbor nodes in WiMedia wireless media access control. The present invention provides a method and system for inter-node wireless communication for obstacle avoidance.

Another object of the present invention is to provide a method and system for inter-node wireless communication for obstacle avoidance that can transmit data through a node having the best channel condition among neighboring nodes.

Another object of the present invention is to obtain a CSI directly from the relay node without obtaining the transmission CSI (channel state information) from the relay node to the destination node, and thus an obstacle applicable to an application requiring delay-sensitive real-time. To provide a method and system for inter-node wireless communication for avoiding.

The object of the present invention is not limited to the above-mentioned objects, and other objects not mentioned will be clearly understood by those skilled in the art from the following description.

In order to achieve the above object and to solve the problems of the prior art, a method of inter-node wireless communication for obstacle avoidance according to an aspect of the present invention, determining whether a failure in the communication path with the destination node; Acquiring channel state information (CSI) between the plurality of neighbor nodes and the destination node from a plurality of neighbor nodes when it is determined that a failure occurs in the communication path; Selecting one of the plurality of peripheral nodes as a relay node based on the obtained channel state information; And communicating with the destination node using the peripheral node selected as the relay node.

The channel state information may include at least one of channel state information between each neighbor node and the destination node, or channel state information from the neighbor node to the source node.

The acquiring of channel state information may include transmitting a channel state information request message to the plurality of peripheral nodes; And receiving the channel state information from the plurality of neighbor nodes in response to the transmitted channel state information request message.

The step of transmitting a channel state information request message includes: including the channel state information request message in a beacon; And transmitting the beacons to the plurality of neighboring nodes in the beacon period of the super frame.

The selecting as a relay node may include analyzing the obtained channel state information; And selecting the neighboring node having the best channel state among the analyzed channel state information as the relay node.

In the node-to-node wireless communication method for obstacle avoidance according to an aspect of the present invention, the step of determining whether or not a failure occurs, whether the response (ACK) to the data transmitted to the destination node receives from the destination node; Confirming; And if it is determined that the response is not received, determining that a failure has occurred in the communication path with the destination node.

The inter-node wireless communication method for obstacle avoidance according to another aspect of the present invention includes: receiving a channel state information request message from a source node; Checking whether a channel state information request message includes information on the destination node in a neighbor list; And when it is determined that the information includes the destination node, transmitting channel state information with the destination node included in the neighbor list to the source node.

The transmitting of the source node to the source node may include comparing the channel state information update time included in the neighbor list with a predetermined threshold time; And when the channel state information update time exists within the threshold time as a result of the comparison, transmitting the channel state information to the source node.

The transmitting of the source node to the source node may include comparing the channel state information update time included in the neighbor list with a predetermined threshold time; Transmitting the channel state information request message to the destination node when the channel state information update time does not exist within the threshold time as a result of the comparison; Receiving the channel state information from the destination node in response to the transmitted channel state information request message; And transmitting the received channel state information to the source node.

Source node according to an aspect of the present invention, the failure determination unit for determining whether or not the failure of the communication path with the destination node; An information obtaining unit obtaining channel state information (CSI) between the plurality of neighbor nodes and the destination node from a plurality of neighbor nodes when it is determined that a failure occurs in the communication path; A node selector configured to select one of the plurality of peripheral nodes as a relay node based on the obtained channel state information; And a communication performing unit communicating with the destination node by using the peripheral node selected as the relay node.

The information acquisition unit may transmit a channel state information request message to the plurality of neighbor nodes, and receive the channel state information from the plurality of neighbor nodes in response to the transmitted channel state information request message.

The node selector may analyze the obtained channel state information and select a neighboring node having the best channel state among the analyzed channel state information as the relay node.

In accordance with an aspect of the present invention, a peripheral node includes: a receiver configured to receive a channel state information request message from a source node; A confirmation unit for confirming whether to include information about the destination node in a neighbor list when the channel state information request message is received; And a transmission unit transmitting channel state information with the destination node included in the neighbor list to the source node when it is determined that the information includes the destination node.

The neighboring node according to an aspect of the present invention further includes a comparison unit comparing the channel state information update time included in the neighbor list with a predetermined threshold time, and the transmission unit updates the channel state information as a result of the comparison. If the time exists within the threshold time, the channel state information may be transmitted to the source node.

The neighboring node according to an aspect of the present invention further includes a request unit for transmitting the channel state information request message to the destination node when the comparison result does not exist within the threshold time. The receiver may receive the channel state information from the destination node in response to the transmitted channel state information request message.

An inter-node wireless communication system for obstacle avoidance according to an aspect of the present invention includes a source node; A destination node in communication with the source node; And a plurality of peripheral nodes existing around the source node and the destination node, wherein the source node determines whether a communication path with the destination node has failed, and as a result of the determination, When a failure occurs, channel state information between the plurality of neighbor nodes and the destination node is obtained from the plurality of neighbor nodes, and one of the plurality of neighbor nodes is selected as a relay node based on the obtained channel state information. And using the peripheral node selected as the relay node, communicate with the destination node.

Each neighboring node compares the channel state information update time included in its neighbor list with a predetermined threshold time, and, as a result of the comparison, the channel state information update time exists within the threshold time. In this case, the channel state information included in the neighbor list may be transmitted to the source node.

Each neighboring node compares the channel state information update time included in its neighbor list with a predetermined threshold time, and as a result of the comparison, the channel state information update time does not exist within the threshold time. If not, the channel state information request message is transmitted to the destination node, and in response to the transmitted channel state request message, the channel state information is received from the destination node, and the received channel state information is received. Can be sent to the source node.

Specific details of other embodiments are included in the detailed description and the accompanying drawings.

Advantages and features of the present invention and methods for achieving them will be apparent with reference to the embodiments described below in detail with the accompanying drawings. However, the present invention is not limited to the embodiments disclosed below, but may be implemented in various different forms, only the present embodiments to make the disclosure of the present invention complete, and common knowledge in the art to which the present invention pertains. It is provided to fully inform the person having the scope of the invention, which is defined only by the scope of the claims. Like reference numerals refer to like elements throughout.

According to the present invention, data communication can be performed between a source node and a destination node by avoiding obstacles using neighboring nodes in WiMedia wireless media access control.

According to the present invention, data can be transmitted through a node having the best channel state among neighboring nodes.

According to the present invention, the relay node obtains CSI directly from the relay node without the process of acquiring the transmission CSI (channel state information) to the destination node, and thus can be applied to an application requiring delay-sensitive real-time.

Hereinafter, with reference to the accompanying drawings will be described an embodiment of the present invention;

Node-to-node wireless communication method and system for obstacle avoidance according to an embodiment of the present invention is based on the wireless media access control technology of WiMedia.

WiMedia's Distributed Medium Access Control For Wireless Networks (Release 1.0, Dec. 8, 2005) is basically fully distributed. Thus, unlike the IEEE 802.15.3 MAC, there is no central coordinator in the WiMedia wireless media access control.

There are two media access control schemes of the WiMedia wireless medium access control, Distributed Reservation Protocol (DRP) and Prioritized Contention Access (PCA). In the distributed reservation protocol (DRP) scheme, each device exchanges beacons in a beacon period (BP) to form a beacon group or a beacon group or an extended beacon group. Enable content-free reservation data communication. On the other hand, priority competitive access (PCA) performs an operation similar to that of the EDCA of IEEE 802.11e. Since the EDCA corresponds to a technique for the main office, a description thereof will be omitted.

The inter-node wireless communication method and system for obstacle avoidance according to an embodiment of the present invention may be based on a distributed reservation protocol (DRP) method among the two methods of the WiMedia wireless media access control. In the following description, a WiMedia wireless medium access control including the distributed reservation protocol (DRP) scheme will be described in detail before describing an embodiment of the present invention.

FIG. 1 illustrates the structure of a super frame of WiMedia wireless media access control, and FIG. 2 illustrates the superframe of FIG. 1 in detail.

1 and 2, the superframe 110 of the WiMedia wireless media access control has a fixed length of 65,536us, a beacon period 210 and a data period 220. ) The beacon section 210 may have a beacon slot 230 for reservation for each communication device.

The first communication device that starts data communication for the first time first searches for a peripheral device through device discovery. At this time, when the first communication device does not find any beacons, it sends a beacon to start the superframe for the first time. Thereafter, the second communication device joining the first communication device attaches its beacon to the superframe (Nth superframe) 110 that is already configured for synchronization with the first communication device. Match.

Here, if the second communication device listens in the beacon section 210 and checks for an empty beacon slot 230, the corresponding beacon slot of the next superframe (N + 1 th superframe) 110 is present. The beacon is sent to 230. In the beacon, a contention-free reservation period for each communication device is set. Accordingly, communication devices in the beacon group or the extended beacon group may not transmit data to the non-competitive reservation section of each other device, but may transmit data only to their non-competitive reservation section. Here, the beacon group refers to a group consisting of communication devices in the sphere of influence of the beacon.

3 is a diagram illustrating an example of beacon transmission and data transmission in the wireless medium access control of the distributed reservation protocol method.

In FIG. 3, device DEV A and device DEV B communicate with each other, and device DEV C and DEV D communicate with each other. As shown in FIG. 3, each of the devices DEV A, DEV B, DEV C, DEV D, and DEV E uses beacon slots different from each other in the beacon period 210. Pass 310. At this time, the distributed reservation is made by the delivered beacon 310. In addition, each device may transmit a data frame 320 in a data period 220, and receive an acknowledgment signal (ACK) 330 for the transmitted data frame 320.

This approach (the Distributed Reservation Protocol approach) is more likely to use superframes inefficiently than central reservation, but is a bottleneck to the PNC compared to a PNC (PicoNet Coordinator) -dependent approach (e.g. IEEE 802.15.3). The transmission rate reduction due to the phenomenon can be avoided, and the power consumption of the PNC can be reduced. Therefore, in a situation in which there is no fixed separate PNC and all devices can be PNCs, the distributed reservation protocol scheme can be said to be efficient.

Hereinafter, a method of wireless communication between nodes for obstacle avoidance according to an embodiment of the present invention.

4 is a flowchart illustrating a method for inter-node wireless communication for obstacle avoidance according to an embodiment of the present invention.

Referring to FIG. 4, in step S410, a source node may determine whether a failure occurs in a communication path with a destination node. In this case, the source node may determine whether a response (ACK) for data transmission is received from the destination node. If the source node does not receive the response, the source node may determine that a communication path with the destination node has failed.

As a result of determining whether the failure occurs, as shown in FIG. 5, when there is no failure (water) in the direct communication path with the destination node 520, the source node 510 uses the direct communication path to perform the destination. Wireless communication with the node 520 may be performed. However, as a result of determining whether the failure occurs, as shown in FIG. 6, when the source node 510 has a failure (water) 610 in the direct communication path with the destination node 520, the peripheral node 530. ) May perform wireless communication with the destination node 520. Hereinafter, a process in which the source node 510 communicates with the destination node 520 using the peripheral node 530 will be described in detail.

First, when it is determined that a failure occurs in the communication path with the destination node, the source node performs a relay discovery procedure. To this end, the source node may first perform step S420.

That is, in step S420, the source node may obtain channel state information from a plurality of peripheral nodes. Here, the channel state information may include channel state information between each neighbor node and the destination node, channel state information from the neighbor node to the source node, and the like.

In detail, the source node may transmit a relay request information element (IE) for requesting the channel state information to the plurality of peripheral nodes. In this case, the relay request eye may indicate a channel state information request message. At this time, the source node adds the relay request IE to the reserved field 710 in the beacon information elements shown in FIG. 7, and adds the added information to the beacon. Can be included. The source node may transmit the beacons to the plurality of peripheral nodes in the beacon period of the super frame.

Herein, the relay request IE includes an element ID, a length, an address of the destination node DestinationAddr, and a channel state information update threshold as shown in FIG. CSI update threshold), and channel state information allowance (Rx CSI permitted) of the reception channel. In the relay request IE, the CSI update threshold is recorded in the upper 15 bits, and the Rx CSI permitted in the receiving channel is set in the lower 1 bit. Can be recorded. When the channel state information allowance (Rx CSI permitted) of the receiving channel is '1', the channel state information of the receive channel is allowed, and the channel state information allowance (Rx CSI permitted) of the receiving channel is '0'. The channel state information of the reception channel is not allowed.

Subsequently, as each neighbor node receives the relay request IE, the neighbor node may check whether its neighbor list includes information about the destination node. For example, each of the neighbor nodes may check whether the neighbor node includes the address of the destination node. For reference, when all nodes (source node, destination node, neighbor node) in the system model of the present invention receive a packet from neighbor nodes, information about the neighbor node (address, channel state information, regardless of destination) , Current time, etc.) can be recorded or updated in your neighbor list.

In this case, as shown in FIG. 9, the neighbor list includes a neighbor address, a channel state information update information (CSI TimeStamp), and reception channel state information (received by a receiver) of a neighbor node including the destination node. CSI value), transmission channel state information (CSI value measured at the receiving end of the neighbor node), and the like. For reference, the transmission channel state information has a more accurate value for data transmission among the channel state information. However, in order to obtain this, a delay may occur because the neighbor node has to send a control message to the neighbor node.

As a result of the check, when the neighbor list includes the information about the destination node, each neighbor node checks the channel state information update time (CSI TimeStamp) of the destination node of its neighbor list, The update time of the channel state information of the destination node may be compared with a specific threshold time determined by the relay request IE. As a result of the comparison, when the channel state information update time is present in the threshold, each neighbor node has a value of which Rx CSI permitted is a value of a channel state information of a reception channel in the relay request IE. You can check whether you have. As a result of the check, when the reception of the channel state information of the receiving channel has a value of '1', each neighboring node may transmit a relay response control message including the channel state information to the source node. have. Accordingly, the source node may obtain the channel state information from the neighbor node through the relay response control message.

Herein, the relay response control message may include channel state information, reception channel state information or transmission channel state information between the neighbor node and the destination node, as shown in FIG. 10. Channel state information to the source node. In the relay response control message, channel state information between the neighbor node and the destination node is recorded in the upper 7 bits, and whether the reception channel state information or the transmission channel state information is recorded in the lower 1 bit. Can be. When the reception channel status information or the transmission channel status information is '1', it indicates the reception channel status information. When the reception channel status information or the transmission channel status information is '0', it may indicate the transmission channel status information. have. In addition, in the relay response response message, channel state information from the peripheral node to the source node is recorded in the upper 7 bits, and the remaining 1 bit may be reserved for reservation.

On the other hand, as a result of the comparison, the channel state information update time does not exist in the threshold, or the channel state information allowance (Rx CSI permitted) of the receiving channel in the relay request IE is '0'. If the value has a value, each neighbor node may transmit a CSI request control message to the destination node for requesting channel state information in the PCA period. Here, the CSI request control message may indicate a channel state information request message. The CSI request control message requests channel state information (CSI) from a receiving side (destination node) only with a frame subtype without a payload. The CSI request control message may be defined using a reserved field in the control frame subtype of FIG. 11.

Thereafter, the destination node may transmit a CSI response control message including channel state information to each neighbor node in response thereto. Here, the CSI response control message may include channel state information from the destination node to the peripheral node, as shown in FIG. 12. In the CSI response control message, channel state information from the destination node to the peripheral node is recorded in the upper 7 bits, and the remaining 1 bit may be left for reservation. The CSI response control message may be defined using a reserve field in the control frame subtype of FIG. 11.

Subsequently, each neighbor node that receives the CSI response control message includes a relay response control message including its address and channel state information from itself to the destination node. May be transmitted to the source node. Accordingly, the source node may obtain the channel state information from the neighbor node through the relay response control message.

Meanwhile, when a specific threshold time determined by the relay request IE is infinite and the channel state information allowance of the reception channel is '1', each neighbor node has its own neighbor list. The relay response control message may be unconditionally transmitted to the source node regardless of the channel state information update time (CSI TimeStamp).

In operation S430, the source node may select one of the plurality of neighbor nodes as a relay node based on the obtained channel state information. That is, the source node uses the channel state information (CSI) included in the relay response control message received from each of the neighbor nodes, and the neighbor node having the best channel state among the plurality of neighbor nodes. Can be selected.

In other words, the source node obtains channel state information from the peripheral node to the source node and channel state information from the peripheral node to the destination node (or channel state information from the destination node to the peripheral node). The neighboring node having the best channel state can be selected from the plurality of neighboring nodes.

In step S440, the source node may communicate with the destination node by using the peripheral node selected as the relay node.

An inter-node wireless communication method for obstacle avoidance according to an embodiment of the present invention includes a computer-readable medium including program instructions for performing operations implemented by various computers. The computer readable medium may include program instructions, local data files, local data structures, or the like, alone or in combination. The media may be those specially designed and constructed for the purposes of the present invention, 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 recording media such as CD-ROMs, DVDs, magnetic-optical media such as floppy disks, and ROM, RAM, flash memory, and the like. Hardware devices specifically configured to store and execute the same program instructions are included. 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.

Hereinafter, a node-to-node wireless communication system for obstacle avoidance according to an embodiment of the present invention will be described in detail with reference to FIG. 5.

An inter-node wireless communication system for obstacle avoidance according to an embodiment of the present invention may include a source node 510, a destination node 520, and a plurality of peripheral nodes 530.

The source node 510 may determine whether a failure occurs in the communication path with the destination node 520. As a result of determination, when a failure occurs in the communication path, the source node 510 obtains channel state information from the plurality of peripheral nodes 530, and based on the obtained channel state information, among the plurality of neighbor nodes 530. One can be selected as a relay node. The source node 510 may communicate with the destination node 520 using the peripheral node 530 selected as the relay node.

At this time, the source node 510 transmits a relay request IE requesting the channel state information to a plurality of peripheral nodes 530, and in response to the relay request IE, From each neighbor node 530 including information about destination node 520 in its neighbor list, a relay response control message including the channel state information may be received. The source node 510 may obtain the channel state information from the plurality of peripheral nodes 530 in this manner.

In this case, each peripheral node 530 may compare the channel state information update time included in the neighbor list with a predetermined threshold time. As a result of the comparison, when the channel state information update time exists within the threshold time, each neighbor node 530 transmits a relay response control message including channel state information to the source node. Can be.

Alternatively, each peripheral node 530 may compare the channel state information update time included in its neighbor list with a predetermined threshold time. As a result of comparison, when the channel state information update time does not exist within the threshold time, each peripheral node 530 requests CSI request control to the destination node 520. Message), and in response to the CSI request control message, a CSI response control message including the channel state information may be received from the destination node 520. . The peripheral node 530 receiving the CSI response control message may transmit a relay response control message including its address and the channel state information to the source node 510.

Accordingly, the source node 510 may obtain the channel state information from each peripheral node 530.

13 is a block diagram illustrating a source node included in a wireless communication system according to an embodiment of the present invention.

Referring to FIG. 13, the source node may include a failure determiner 1310, an information acquirer 1320, a node selector 1330, and a communication performer 1340.

The failure determiner 1310 may determine whether a failure occurs in the communication path between the source node and the destination node.

The information acquirer 1320 may obtain channel state information from a plurality of peripheral nodes when a failure occurs in the communication path. That is, the information acquisition unit 1320 transmits a channel state information request message (relay request eye) to a plurality of neighbor nodes, and receives the channel state information from the plurality of neighbor nodes in response to the channel state information request message. A relay response control message may be received.

The node selector 1330 may select one of the plurality of neighbor nodes as a relay node based on the obtained channel state information. That is, the node selector 1330 may analyze the channel state information obtained through the relay response control message, and select the neighboring node having the best channel state among the analyzed channel state information as the relay node.

The communication performing unit 1340 may communicate with the destination node by using the peripheral node selected as the relay node.

14 is a block diagram illustrating a peripheral node included in a wireless communication system according to an embodiment of the present invention.

Referring to FIG. 14, the peripheral node may include a receiver 1410, a checker 1420, a comparator 1430, a requester 1440, and a transmitter 1450.

The receiver 1410 may receive a request for channel state information from a source node. In detail, the receiver 1410 may receive a relay request IE (Information Element) requesting the channel state information from a source node.

The identification unit 1420 may determine whether information on the destination node is included in a neighbor list according to the request. In detail, as the reception unit 1420 receives the relay request IE, the identification unit 1420 may confirm whether the neighbor list includes information about the destination node, for example, an address of the destination node.

When the comparison unit 1430 includes the destination node information in the neighbor list, the comparison unit 1430 may compare the channel state information update time (CSI TimeStamp) included in the neighbor list with a predetermined threshold time. Can be. As a result of the comparison, when the channel state information update time exists within the threshold hold time, the transmitter 1450 may transmit the channel state information to the source node. That is, the transmitter 1450 may transmit a relay response control message including the channel state information to the source node.

The request unit 1440, if the channel state information update time does not exist within the threshold time, as a result of the comparison, a CSI request control message for requesting the channel state information to the destination node; Can be transmitted.

Accordingly, the receiver 1410 may receive a CSI response control message including the channel state information in response to the CSI request control message. In addition, when the transmitter 1450 receives the CSI response control message, a relay response control message including the address of the neighbor node and the channel state information is transmitted to the source node. Can be transmitted. The address of the neighbor node is to enable the source node to identify the neighbor node that transmitted the channel state information. The source node may select the neighbor node having the best channel state among channel state information through the address of the neighbor node.

While specific embodiments of the present invention have been described so far, various modifications are possible without departing from the scope of the present invention. Therefore, the scope of the present invention should not be limited to the described embodiments, but should be determined not only by the claims below, but also by the equivalents of the claims.

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-described embodiments, which can be variously modified and modified by those skilled in the art to which the present invention pertains. Modifications are possible. Accordingly, the spirit of the present invention should be understood only by the claims set forth below, and all equivalent or equivalent modifications thereof will belong to the scope of the present invention.

FIG. 1 illustrates the structure of a super frame of WiMedia wireless media access control, and FIG. 2 illustrates the superframe of FIG. 1 in detail.

3 is a diagram illustrating an example of beacon transmission and data transmission in the wireless medium access control of the distributed reservation protocol method.

4 is a flowchart illustrating a method for inter-node wireless communication for obstacle avoidance according to an embodiment of the present invention.

5 illustrates an example of data communication via a direct path between a source node and a destination node.

6 is a diagram illustrating an example of data communication through a peripheral node as a bypass path when a failure occurs.

FIG. 7 illustrates a beacon information element defined in the WiMedia Wireless Media Access Control Specification.

8 is a diagram illustrating a format of a relay request IE defined according to an embodiment of the present invention.

9 illustrates a format of a neighbor list according to an embodiment of the present invention.

FIG. 10 is a diagram illustrating a format of a payload of a relay response control message according to an embodiment of the present invention.

FIG. 11 illustrates a frame subtype field for a control frame of the WiMedia wireless media access control standard.

12 illustrates a payload format of a CSI response control message according to an embodiment of the present invention.

13 is a block diagram illustrating a source node included in a wireless communication system according to an embodiment of the present invention.

14 is a block diagram illustrating a peripheral node included in a wireless communication system according to an embodiment of the present invention.

<Explanation of symbols for the main parts of the drawings>

510: source node 520: destination node

530: peripheral node 1310: failure determination unit

1320: information acquisition unit 1330: node selection unit

1340: communication performing unit 1410: receiving unit

1420: verification unit 1430: comparison unit

1440: request unit 1450: transmission unit

Claims (15)

Determining whether a failure occurs in a communication path with the destination node; If it is determined that a failure occurs in the communication path, transmitting a beacon having a channel state information request message added to a reserved field in a beacon information element to a plurality of neighbor nodes in a beacon period of a super frame; Obtaining channel state information (CSI) between the plurality of neighbor nodes and the destination node from the plurality of neighbor nodes in response to the transmitted channel state information request message; Selecting one of the plurality of peripheral nodes as a relay node based on the obtained channel state information; And Communicating with the destination node using the peripheral node selected as the relay node; Node-to-node wireless communication method for obstacle avoidance, characterized in that it comprises a. The method of claim 1, The channel state information is And at least one of channel state information between each of the neighbor nodes and the destination node, or channel state information from the neighbor node to a source node. delete delete The method of claim 1, The step of selecting as a relay node, Analyzing the obtained channel state information; And Selecting the neighboring node having the best channel state among the analyzed channel state information as the relay node; Node-to-node wireless communication method for obstacle avoidance, characterized in that it comprises a. The method of claim 1, The step of determining whether a failure occurs, Checking whether an acknowledgment (ACK) for data transmitted to the destination node is received from the destination node; And If it is determined that the response has not been received, determining that a failure has occurred in the communication path with the destination node. Node-to-node wireless communication method for obstacle avoidance, characterized in that it comprises a. delete delete delete A failure determination unit that determines whether a failure occurs in a communication path with the destination node; If it is determined that a failure occurs in the communication path, a beacon having a channel state information request message added to a reserved field in a beacon information element is transmitted to a plurality of neighbor nodes in a beacon period of a super frame, and the transmitted channel state information An information obtaining unit obtaining channel state information (CSI) between the plurality of neighbor nodes and the destination node from the plurality of neighbor nodes in response to the request message; A node selector configured to select one of the plurality of peripheral nodes as a relay node based on the obtained channel state information; And A communication performing unit for communicating with the destination node using the peripheral node selected as the relay node. Source node comprising a. delete The method of claim 10, The node selector, And analyzing the acquired channel state information and selecting a neighbor node having the best channel state among the analyzed channel state information as the relay node. delete delete delete

Images