KR100870471B1 - Method for performing address resolution protocol in source routing wireless ad-hoc network - Google Patents

Abstract

A method for performing an address resolution protocol in source routing wireless Ad-hoc network is provided to acquire 2 layer address efficiently even though wireless nodes such as network move and are changed Wireless nodes from time to time move. A topology table is referred to(S111). A route tree is produced based on the topology table(S112). An ARP inquiry packet is produced based on the route tree(S120). A frame including the ARP inquiry packet based on the route tree is produced. An address of the first neighboring repeating node Frame is written to the destination address of the frame based on the route tree. A multicast address is written to the destination address of the frame(S130).

Description

How to perform ARP on source routing wireless AD-HOC network {METHOD FOR PERFORMING ADDRESS RESOLUTION PROTOCOL IN SOURCE ROUTING WIRELESS AD-HOC NETWORK}

The present invention relates to a method for performing ARP in a source routing wireless Ad-Hoc network, and more particularly, to a method for improving reliability of performing ARP in a military wireless Ad-Hoc network environment.

IP (Internet Protocol) is a protocol corresponding to three layers in the OSI 7 Layer model. In this IP-based communication, the sender must know an address corresponding to layer 2 in order to transmit IP packet data to the receiver.

In order to know the addresses corresponding to the second layer, there is an address resolution protocol (hereinafter referred to as 'ARP') among the proposed protocols. The ARP is a method mainly applied to Ethernet technology in a wired LAN (Local Area Network), and is a protocol for converting an address of a second layer through an IP address corresponding to the third layer. The ARP scheme is as follows.

Before sending the IP packet data to the receiving side, the transmitting side checks whether the receiving layer 2 address exists in its ARP table. If it does not exist in its table, the sender broadcasts an ARP inquiry packet to obtain the layer 2 address of the receiver, and transmits it to all nodes on the same LAN.

Each node receiving the ARP inquiry packet checks whether its IP address matches the destination IP address in the ARP inquiry packet, and if so, includes its own layer 2 address in the ARP response packet, Deliver to the sender.

The transmitting side receives the ARP response packet and updates its ARP table according to the ARP response packet. Then, the IP packet is transmitted to the receiving side.

On the other hand, if the sender attempts to transmit IP packet data to another node outside of the network to which it belongs, whether the second layer address of the router that connects its own LAN and the external network exists in its ARP table. Check it. If not present, the sender broadcasts an ARP inquiry packet using the router's IP address to determine the layer 2 address, and the router includes its own layer 2 address in an ARP response packet to the sender. To pass.

On the other hand, such ARP is also used in military wireless communication, especially in military AD-Hoc communication protocol MIL-STD-188-220 is also recommended.

The above-described conventional ARP is a protocol applied to Ethernet, which is a wired environment, and is difficult to apply to a wireless environment. In particular, in the case of an Ad-Hoc network in which wireless nodes move from time to time and its topology is changed, there is a problem of instability and inferior reliability. Specifically, in the Ad-Hoc network, the first node was directly connected to the second node and the third node, but since the third node is moved, the direct connection with the first node is disconnected, and the second node is disconnected. If the first node can be connected only through the first node, since the first node cannot know the change of the topology, the conventional ARP cannot be applied. In addition, when the connection between the first node and the third node in the Ad-Hoc network is made through the second node, even if the first node broadcasts an ARP inquiry packet according to the prior art, only the second node is the ARP inquiry. There is a problem that only the packet can be received and the third node cannot receive the ARP inquiry packet.

Accordingly, an object of the present invention is to effectively obtain a two-layer address even when wireless nodes move from time to time, such as in an ad-hoc network, and their configuration is changed.

In addition, another object of the present invention is to ensure better stability and better reliability to be applied to MIL-STD-188-220, a military wireless Ad-Hoc communication protocol.

In order to achieve the above object, the present invention comprises the steps of referencing a topology table; Based on the topology table, the ARP performing method comprising the step of multicasting the ARP inquiry packet to the relay node and the end node of each path (multicasting).

In addition, in order to achieve the above object, the present invention comprises the steps of referencing a topology table; Generating a path tree based on the topology table; Generating an ARP inquiry packet based on the path tree; Generating a frame including the ARP inquiry packet based on the path tree; It provides a method for performing ARP comprising the step of transmitting the frame.

In addition, in order to achieve the above object, the present invention comprises the steps of referencing a topology table; Generating a path tree based on the topology table; Based on the route tree, writing information of the relay node in the “destination / relay status byte” column and the “destination / relay address” column of the ARP inquiry packet; Based on the path tree, writing information on at least one of end nodes of each path in the “destination / relay status byte” and “destination / relay address” fields of the ARP inquiry packet; Writing multicast information in the last " destination / relay status byte " and " destination / relay address " fields of the ARP inquiry packet; It provides an ARP performing method comprising the step of transmitting the ARP inquiry packet.

The present invention enables ARP to be performed stably and reliably even when wireless nodes move from time to time, as in the ad-hoc network, and the topology is changed to be multi-hop.

In addition, the present invention makes it possible to perform ARP with better stability and better reliability in military wireless communication.

Before describing with reference to the drawings, a brief description of an embodiment of the present invention.

According to the present invention, the sender does not broadcast an ARP request packet, but refers to its topology table information and multicasts to all nodes on the topology table and neighboring nodes thereof. multicasting). To this end, the sender first generates a path tree composed of one of a relay node and end receiving nodes of each path by referring to a topology table. Then, referring to the path tree, a "destination / relay status byte" field of an ARP request packet intranet header is configured, and then "destination / relay address" fields are configured, and an intranet header Enter your Global Multicast address in the last “Destination / Relay Address” field. At this time, the sender does not require an end-to-end ACK (ETE ACK) when configuring the intranet header of the ARP inquiry packet. In addition, the sender configures an intranet header of the ARP inquiry packet and sets an ARP response timeout value when sending it down to the data link layer.

In the present invention, when the sender configures a layer 2 frame including the ARP inquiry packet, that is, a frame of a data link layer, the destination address field is a relay node within one hop and addresses of receiving nodes and a global multicast address. Be sure to enter At this time, the transmitting side requests the data link response of the receiving nodes which are relay nodes within one hop when constructing the frame.

Each node receiving the ARP inquiry packet checks whether a destination IP address of the ARP inquiry packet matches its own IP address, and if not, ignores the ARP inquiry packet. However, if there is a match, an ARP response packet having its own layer 2 address, that is, a link layer address, is transmitted to the sender using a reverse path extracted based on the intranet header of the ARP inquiry packet.

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

1 is a flowchart illustrating a method of performing ARP according to the present invention, FIG. 2 is a diagram illustrating a topology of a node A, FIG. 3 is a diagram illustrating a path tree according to the present invention, and FIG. 4 is a diagram of the present invention. 5 is an exemplary diagram illustrating an intranet header configuration of an ARP inquiry packet according to the present invention, FIG. 5 is an exemplary diagram illustrating a process of transmitting an ARP inquiry frame according to the present invention, and FIG. 6 is an intranet header configuration of an ARP response packet according to the present invention. FIG. 7 is an exemplary diagram illustrating a process of transmitting an ARP response frame according to the present invention. Hereinafter, with reference to FIG. 1, FIGS. 2, 3, 4, 5, 6, and 7 will be described with reference.

As can be seen with reference to Figure 2, the transmitting node A has a topology information consisting of a number of peripheral nodes in a 1-hop and multi-hop relationship, the circle indicated by a dotted line represents a range of 1 hop. Table 1 shows the link layer addresses of each node included in the topology information of node A.

Node A B C D E F G H K L M N Link layer address 2 4 5 6 7 8 9 10 11 12 13 14

Considering a case in which node A wants to transmit IP data to a specific node that knows an IP address in FIG. 2, the node A knows only the IP address of the specific node, that is, a layer 2 address corresponding to the IP address. It is assumed that the link layer address is not known, that is, the link layer address corresponding to the specific IP address is not written in the ARP table of the A node.

Therefore, when the A node constructs an ARP lookup packet to know the layer 2 address corresponding to the specific IP address, the present invention searches not only all nodes registered in the table by searching its topology table, but also around the node. The ARP inquiry packet can be delivered without causing excessive traffic to the existing nodes.

More specifically, referring to FIG. 1, the node A refers to its topology table information (S111) and generates a path tree (S112). Specifically, as can be seen through Figure 3, the node A refers to its topology table information (S111), the terminal node (C node, E node, G node, L node) and the termination reception of each path Select one of the nodes (N node, H node, M node, B node) (e.g., select H node, B node) and select the path tree (e.g. A node → C node → E node → G node → H). A node, an A node → L node → B node) is generated (S112).

Subsequently, the node A configures an intranet header of the ARP inquiry packet based on the path tree (S120). Specifically, a "DESTINATION / RELAY STATUS BYTE" column of the ARP inquiry packet is created with reference to the route tree (S121), and the "destination / relay of the ARP inquiry packet is referred to with reference to the route tree. An address "column is created (S122). Subsequently, the Global Multicast address is written at the end of the "Destination / Relay Address" column of the ARP inquiry packet. For example, when the node A configures the intranet header of the ARP inquiry packet, as shown in FIG. 4, the node A refers to the path of the node A → L node → B node in the path tree first, Enter the link address of node A in the "Address" column, enter the L node information in the "Destination / Relay Status Byte 1" and "Destination / Relay Address 1" columns, and the "Destination / Relay Status Byte 2" Enter the node B information in the "Destination / Relay Address 2" field. Next, as shown in FIG. 4, in consideration of the paths of node A → C node → E node → G node → H node, in the "destination / relay status byte 3" column and the "destination / relay address 3" column, The information of the C node is written, and the information of the E node is written in the "destination / relay status byte 4" column and the "destination / relay address 4" column. Then, enter the information of the G node in the "Destination / Relay Status Byte 5" column and the "Destination / Relay Address 5" column, and the H node in the "Destination / Relay Status Byte 6" column and the "Destination / Relay Address 6" column. Fill in the information. As shown in FIG. 4, Global Multicast address information is written in the last " destination / relay status byte 7 " and " destination / relay address 7 " columns.

As such, when the node A configures the intranet header of the ARP inquiry packet, the node A may not require a 3-layer end-to-end ACK (ETE ACK), and thus, the relay node and the end nodes may May not generate excessive traffic. The A node may set a timeout value of an ARP response packet with respect to the ARP inquiry packet. In this case, the timeout value is based on a method of setting an ETE ACK timer based on the maximum number of hops among nodes registered in the topology table of the A node. If the node A does not receive an ARP response packet for the ARP inquiry packet within the timeout time, the node A retransmits the ARP inquiry packet.

As described above, when the intranet header configuration of the ARP inquiry packet is completed, the node A sends down the ARP inquiry packet to the second layer, that is, the data link layer, and configures the second layer frame, that is, the data link frame (S130). . Specifically, when the node A configures the data link frame, the node A writes two-layer addresses of relay nodes (C node and L node) that are neighboring one hop in the destination address column of the data link frame (S131). The node A writes a global multicast address in the destination address column of the data link frame (S132). In this case, when the node A configures the data link frame, the node A may request a response of the data link layer from a relay node neighboring one hop.

When the configuration of the frame is completed, the node A transmits the frame (S140).

The frame configured as described above is not registered in the topology table around it marked with a question mark (?) As well as all nodes registered in the topology table of node A by the source routing relay method as shown in FIG. 5. It can also be passed to nodes. The solid arrow shown indicates the movement path of the ARP inquiry frame transmitted by the A node.

The process of relaying the ARP inquiry frame as described above will be described in more detail as follows. For example, if the G and L nodes of FIG. 5 receive the ARP inquiry frame and are not the node to which the ARP response frame is to be transmitted, the ARP inquiry frame is newly configured by constructing a data link frame in the data link layer. In this case, the addresses of the H and B nodes are written in the destination address of the frame, and the Global Multicast address is also written. At this time, when configuring the data link frame, it is set to request the response of the data link layer from the node H and the node B.

In this manner, when the ARP inquiry frame is transmitted, not only all nodes registered in the topology table of the node A, but also nodes not registered in the topology table around it, may receive the ARP inquiry frame. Participate in the ARP process. In addition, since a data link response is required at the data link layer, even if the ARP inquiry frame fails to be delivered within one hop, retransmission can be performed to improve reliability.

Meanwhile, each node that receives the ARP inquiry frame ignores the received ARP inquiry frame if the destination IP address of the ARP inquiry packet does not match its own IP address. Here, it is assumed that the destination IP address of the ARP inquiry packet transmitted by the node A matches the IP address of the N node. Accordingly, the N node extracts a reverse path based on the intranet header information of the received ARP inquiry packet, and uses the reverse path to send an ARP response including its own two layer address to the A node. Transmit (S150, S160).

Specifically, the N-node responds to the ARP response based on reverse path information (N node-> G node-> E node-> C node-> A node) extracted from the intranet header of the ARP inquiry packet received from the A node. After completing the intranet header configuration of the packet (S151), the N-node sends the ARP response packet down to the second layer, that is, the data link layer, to form a second layer frame, that is, the data link frame (S152). More specifically, when the N node configures the intranet header of the ARP response packet, as shown in FIG. 6, the reverse path information (N node-> G node-> E node-> C node-> A node) In consideration of this, enter the link address of the N node in the "sender address" field, the information of the G node in the "destination / relay status byte 1" column and the "destination / relay address 1" column, and the "destination / relay". Enter the information of the node E in the "Status byte 2" field and the "Destination / relay address 2" field, the information of the node C in the "Destination / relay status byte 3" field and the "Destination / relay address 3" field, The information of node A is written into the "destination / relay status byte 4" column and the "destination / relay address 4" column to complete the intranet header configuration of the ARP response packet (S151).

When the intranet header configuration of the ARP response packet is completed, the N node sends the ARP response packet down to the data link layer to form a data link frame, which is one-hop neighbor to the destination address field of the data link frame. The layer 2 address of the node (G node) is included (S152).

In this case, when the N node configures the data link frame, the N node requests a response of the data link layer from a neighboring node that is one hop, and if the ARP response frame fails to transmit within one hop, it is immediately recognized. In this way, by enabling retransmission, reliability can be improved.

When the configuration of the frame is completed, the N node transmits the frame (S160). The ARP response frame transmitted from the N node is transmitted to the A node by the source routing relay method as shown in FIG. 7. Here, the dotted line arrows indicate the movement path of the ARP response frame transmitted by the N node, and the solid arrows indicate the data link response to the ARP response frame.

On the other hand, when the node A receives the ARP response frame from the node N, it updates the layer 2 address of the node N in its ARP table, and then transmits IP data to the node N.

In the above description of the preferred embodiments of the present invention by way of example, the scope of the present invention is not limited only to these specific embodiments, the present invention is in various forms within the scope of the spirit and claims of the present invention Can be modified, changed, or improved.

1 is a flowchart illustrating a method of performing ARP according to the present invention.

2 is a diagram illustrating a topology of the node A. FIG.

3 is an exemplary view showing a path tree according to the present invention.

4 is an exemplary diagram illustrating an intranet header configuration of an ARP inquiry packet according to the present invention.

5 is an exemplary diagram illustrating a process of transmitting an ARP inquiry frame according to the present invention.

6 is an exemplary diagram illustrating an intranet header configuration of an ARP response packet according to the present invention.

7 is an exemplary view illustrating a process of transmitting an ARP response frame according to the present invention.

Claims (19)

delete delete delete A method in which a node in a source routing wireless ad-hoc network performs an address resolution protocol (ARP), Referencing a topology table; Generating a path tree based on the topology table; Generating an ARP inquiry packet based on the path tree; Generating a frame including the ARP inquiry packet based on the path tree; And Transmitting the frame; The generating of the frame may include writing an address of a relay node neighboring one hop in a destination address field of the frame based on the path tree, and writing a multicast address in a destination address field of the frame. ARP performance method characterized in that. The method of claim 4, wherein the generating the ARP inquiry packet Based on the route tree, writing information of the relay node in the “destination / relay status byte” column and the “destination / relay address” column of the ARP inquiry packet; Based on the route tree, writing information on at least one of end nodes of each path in the “destination / relay status byte” and “destination / relay address” columns of the ARP inquiry packet; And writing multicast information in the last "destination / relay status byte" and "destination / relay address" fields of the ARP inquiry packet. The method of claim 5, wherein the generation of the ARP inquiry packet ARP execution method characterized in that the end-to-end Ack of the receiving side for the ARP inquiry packet is not required The method of claim 5, wherein generating the ARP inquiry packet And setting a timeout value for the ARP inquiry packet. delete The method of claim 4, wherein generating the frame And setting a value for requesting a data link layer response of a receiving side. A method in which a node in a source routing wireless ad-hoc network performs an address resolution protocol (ARP), Referencing a topology table; Generating a path tree based on the topology table; Based on the route tree, writing information of the relay node in the “destination / relay status byte” column and the “destination / relay address” column of the ARP inquiry packet; Based on the route tree, writing information on at least one of end nodes of each path in the “destination / relay status byte” and “destination / relay address” columns of the ARP inquiry packet; Writing multicast information in the last “destination / relay status byte” and “destination / relay address” fields of the ARP inquiry packet; ARP performing method comprising the step of transmitting the ARP inquiry packet. The method of claim 10, ARP execution method characterized in that the end-to-end Ack of the receiving side for the ARP inquiry packet is not required The method of claim 10, And setting a timeout value for the ARP inquiry packet. The method of claim 10, wherein transmitting the ARP inquiry packet Generating a layer 2 frame including the ARP inquiry packet; And transmitting the frame. The method of claim 13, wherein generating the frame Writing an address of a one-hop neighboring relay node in a destination address field of the frame based on the path tree; And writing a multicast address in a destination address field of the frame. 15. The method of claim 14, wherein generating the frame And setting a value for requesting a data link layer response of a receiving side. The method of claim 10, Receiving the ARP inquiry packet; Identifying a reverse path based on addresses written in a “destination / relay address” column of the ARP inquiry packet; Generating an ARP response packet based on the identified reverse path; Writing its own layer address in the ARP response packet; And transmitting the ARP response packet. 17. The method of claim 16, wherein transmitting the ARP response packet Generating a layer 2 frame including the ARP response packet; And transmitting the frame. 18. The method of claim 17, wherein generating the frame And based on the reverse path, writing an address of a one-hop neighboring relay node in a destination address field of the frame. 19. The method of claim 18, wherein generating the frame And setting a value for requesting a data link layer response of a receiving side.

Images