KR101661879B1 - Method and apparatus for transmitting packet in the ad-hoc network - Google Patents

Method and apparatus for transmitting packet in the ad-hoc network Download PDF

Info

Publication number
KR101661879B1
KR101661879B1 KR1020160022596A KR20160022596A KR101661879B1 KR 101661879 B1 KR101661879 B1 KR 101661879B1 KR 1020160022596 A KR1020160022596 A KR 1020160022596A KR 20160022596 A KR20160022596 A KR 20160022596A KR 101661879 B1 KR101661879 B1 KR 101661879B1
Authority
KR
South Korea
Prior art keywords
node
neighboring
message
packet
nodes
Prior art date
Application number
KR1020160022596A
Other languages
Korean (ko)
Inventor
김기천
김우빈
진정하
Original Assignee
건국대학교 산학협력단
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 건국대학교 산학협력단 filed Critical 건국대학교 산학협력단
Priority to KR1020160022596A priority Critical patent/KR101661879B1/en
Application granted granted Critical
Publication of KR101661879B1 publication Critical patent/KR101661879B1/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/14—Routing performance; Theoretical aspects
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/127—Shortest path evaluation based on intermediate node capabilities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/26—Route discovery packet

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Provided are a method and an apparatus for transmitting a packet in an ad-hoc network. A node in the ad-hoc network sets a first adjacent node and a second adjacent node among adjacent nodes, and transmits a packet through the set first adjacent node or the set second adjacent node. The packet can be transmitted to a destination node from a source node through the first adjacent node or the second adjacent node set in each node.

Description

METHOD AND APPARATUS FOR TRANSMITTING PACKET IN THE AD-HOC NETWORK [0002]

The technical field relates to packet transmission technology, and more particularly, to a packet transmission technology in an ad-hoc network.

In a wireless ad-hoc network (MANET), a plurality of nodes form a network in the absence of a pre-established infrastructure. For example, a MANET may not have an access point (AP). The nodes of the MANET have restrictions on the available resources and should use this resource efficiently. Therefore, routing of an ad-hoc network using a plurality of nodes must be efficiently performed.

Korean Patent Laid-Open No. 10-2013-0083639 (published on Jul. 23, 2013) discloses a routing method in a wireless ad-hoc network. The present invention discloses a method for estimating a location of a destination node, the method comprising the steps of: (a) determining a location of a destination node by a transmitting node; (b) estimating a location of a destination node, (C) calculating a request area specifying a range to which the route request message is to be propagated so as to include the expected area, (d) including the coordinate information of the requested area in the route request message, (E) if the intermediate node that received the route request message is in the request area, it starts to add and retransmit its own address.

One embodiment provides a packet transmission apparatus and method.

One embodiment provides a routing protocol.

According to an aspect, a packet transmission method includes propagating an RREQ (Route REQuest) message from the source node to the destination node using one or more intermediate nodes, Propagating a RREP (Route REPlay) message to a node, and when the source node has received the RREP message, transmitting the packet via a path formed between the one or more intermediate nodes, The intermediate nodes include a first neighboring node forming a primary path of one or more neighboring nodes adjacent to each of the one or more intermediate nodes and a second neighboring node forming a back- Lt; RTI ID = 0.0 > a < / RTI > packet.

Wherein the step of propagating the RREQ message comprises the steps of: receiving the RREQ message from one of the one or more neighboring nodes adjacent to the intermediate node; and transmitting the RREQ message to neighboring nodes other than the previous node And transmitting the RREQ message.

The step of propagating the RREQ message may further include discarding the RREQ message if the intermediate node receives the RREQ message from another previous node after transmitting the RREQ message can do.

Wherein propagating the RREP message comprises the steps of: the intermediate node receiving the RREP message from one or more of the following one or more neighbor nodes adjacent to the intermediate node, wherein the intermediate node is based on the order in which the RREP message was received Establishing a first neighboring node and a second neighboring node of the next nodes, and the intermediate node transmitting the RREP message to neighboring nodes of the one or more neighboring nodes other than the first neighboring node . ≪ / RTI >

Wherein the setting of the first neighboring node and the second neighboring node comprises: when the RREP message is first received from the first next node of the intermediate node, setting the first next node to the first neighboring node And setting the second next node to the second neighbor node when receiving the RREP message from the second next node of the intermediate node after receiving the RREP message from the first next node, .

The step of propagating the RREP message may further include discarding an RREP message received from another neighboring node when the first neighboring node and the second neighboring node are set in the intermediate node.

The step of transmitting the packet may include the step of the intermediate node transmitting the packet to the first neighboring node when the packet is transmitted through the intermediate node.

The transmitting of the packet may further include the step of the intermediate node transmitting the packet to the second neighboring node when the packet is not transmitted to the first neighboring node.

The step of transmitting the packet may further include, when the packet is not transmitted to the second neighboring node, transmitting the RERR (Route ERRor) message to the previous node to which the intermediate node has transmitted the packet to the intermediate node .

The step of transmitting the packet may comprise the step of the intermediate node transmitting the packet to the second neighboring node when the intermediate node receives the RERR message from the first neighboring node.

According to another aspect, a method of transmitting a packet performed by an intermediate node comprises receiving an RREQ (Route REQuest) message from a previous one of one or more neighboring nodes adjacent to the intermediate node, Transmitting the RREQ message to neighbor nodes other than the previous node, receiving an RREP (Route REPlay) message from one or more next nodes of the one or more neighbor nodes, Establishing a first neighboring node and a second neighboring node of the next nodes based on the first neighboring node, transmitting the RREP message to neighboring nodes other than the first neighboring node among the one or more neighboring nodes, When receiving the packet from any one of the one or more neighboring nodes, the first neighboring node and the second neighboring node And transmitting the packet to any one of the contact nodes.

The first neighboring node may form a primary path with the intermediate node and the second neighboring node may form a back-up path with the intermediate node.

According to another aspect, a node for transmitting a packet receives a RREQ (Route REQuest) message from a previous node, and transmits the RREQ message to nodes other than the previous node of one or more adjacent nodes adjacent to the intermediate node (RREP) message from at least one of the neighbor nodes, and a second neighboring node and a second neighboring node according to the order in which the RREP message is received among neighbor nodes that have transmitted the RREP message, And determining a neighboring node, wherein the communication unit transmits the packet to either the first neighboring node or the second neighboring node when the packet is received.

A packet transmission apparatus and method are provided.

A routing protocol is provided.

1 illustrates an ad-hoc network according to an example.
2 is a block diagram of a node according to an embodiment.
3 is a flowchart of a packet transmission method according to an embodiment.
FIG. 4 illustrates a method of propagating an RREQ message according to an example.
FIG. 5 illustrates an ad-hoc network in which an RREQ message according to an example is propagated.
FIG. 6 illustrates a method of propagating an RREP message according to an example.
FIG. 7 illustrates a method according to an example of how a node sets up a first neighbor node and a second neighbor node.
FIG. 8 illustrates an ad-hoc network in which an RREP message according to an example is propagated.
FIG. 9 illustrates a method of transmitting a packet through a path formed in an ad-hoc network according to an example.
10 shows a path formed in an ad-hoc network according to an example.
FIG. 11 illustrates a packet transmission path when a failure occurs in some nodes according to an example.
12 is a flowchart of a packet transmission method of a node according to an embodiment.

In the following, embodiments will be described in detail with reference to the accompanying drawings. However, the scope of the patent application is not limited or limited by these embodiments. Like reference symbols in the drawings denote like elements.

Various modifications may be made to the embodiments described below. It is to be understood that the embodiments described below are not intended to limit the embodiments, but include all modifications, equivalents, and alternatives to them.

The terms used in the examples are used only to illustrate specific embodiments and are not intended to limit the embodiments. The singular expressions include plural expressions unless the context clearly dictates otherwise. In this specification, the terms "comprises" or "having" and the like refer to the presence of stated features, integers, steps, operations, elements, components, or combinations thereof, But do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, or combinations thereof.

Unless defined otherwise, all terms used herein, including technical or scientific terms, have the same meaning as commonly understood by one of ordinary skill in the art to which this embodiment belongs. Terms such as those defined in commonly used dictionaries are to be interpreted as having a meaning consistent with the contextual meaning of the related art and are to be interpreted as either ideal or overly formal in the sense of the present application Do not.

In the following description of the present invention with reference to the accompanying drawings, the same components are denoted by the same reference numerals regardless of the reference numerals, and redundant explanations thereof will be omitted. In the following description of the embodiments, a detailed description of related arts will be omitted if it is determined that the gist of the embodiments may be unnecessarily blurred.

1 illustrates an ad-hoc network according to an example.

Ad-hoc network 100 is a network formed through a plurality of nodes. An ad-hoc network does not have an access point (AP) and supports packet exchange between nodes using wireless communication. Because the ad-hoc network constitutes the topology through communication between the nodes, the topology can change dynamically. If the node is a mobile communication terminal and the node moves geographically, the topology formed may change.

The ad-hoc network 100 includes a source node 110, a destination node 120, and intermediate nodes 130. The source node 110 may utilize the intermediate nodes 130 to transmit data or packets to the destination node 120. [ The path formed through the intermediate nodes 130 for transmitting a packet is not fixed and may be changed using a routing table stored in each of the intermediate nodes 130 according to a changing situation. Hereinafter, a packet transmission method using the ad-hoc network 100 will be described in detail with reference to Figs. 2 to 12. Fig.

2 is a block diagram of a node according to an embodiment.

The node 200 includes a communication unit 210, a processor 220, and a memory 230. For example, the node 200 may be any one of the source node 110, the destination node 120, and the intermediate nodes 130 described above.

The communication unit 210 transmits / receives data to / from an external device. For example, when the node 200 is an intermediate node, the communication unit 210 can receive data from the source node 110 and transmit data to an adjacent node. The data includes messages and packets.

The processor 220 processes the data received by the communication unit 210 and the data stored in the memory 230.

The memory 230 stores data received by the communication unit 210 and data processed by the processor 220. [

The communication unit 210, the processor 220, and the memory 230 will be described in detail below with reference to FIG. 3 to FIG.

3 is a flowchart of a packet transmission method according to an embodiment.

The following steps 310 to 330 are performed by the ad-hoc network 100. That is, steps 310 to 330 may be performed by exchanging messages and packets between a plurality of nodes. The message may be one of RREQ (Route REQuest), RREP (Route REPlay) message and RERR (Route ERRor) message. The RREQ message is a message that is propagated to find the path from the source node to the destination node. The RREP message is a message that is propagated from the destination node to the source node to determine the priority of packet transmission between adjacent nodes. The RERR message is a message that the node sends to the previous node when it can not forward the packet to the next node. The message may contain the fields defined in [Table 1] below.

Message type Validity Sequence number Source node Destination node Previous node

The message type field indicates whether the message is an RREQ message, an RREP message, or a RERR message. The validity period field indicates the condition in which the message is valid. For example, the number of hops to which a message is to be transmitted may be displayed. The field of the source node displays the identifier of the source node. The field of the destination node displays the identifier of the destination node. The previous node displays the identifier of the node sending the message. When the node that received the message sends the message to the next node, it displays its identifier in the value of the field of the previous node.

At step 310, the RREQ message is propagated from the source node to the destination node. The source node transmits the RREQ message to one or more nodes adjacent to the source node. The node receiving the RREQ message transmits an RREQ message to its neighbor nodes. When the destination node receives the RREQ message, the propagation of the RREQ message may be terminated. A method of propagating the RREQ message is described in detail below with reference to Figures 4 and 5 below.

At step 320, the RREP message is propagated from the destination node to the source node. The destination node transmits the RREP message to one or more nodes adjacent to the destination node. The node receiving the RREP message transmits the RREP message to its neighboring nodes. When the source node receives the RREP message, the propagation of the RREP message may be terminated. A method of propagating an RREP message is described in detail below with reference to Figures 6 to 8 below.

At step 330, a packet is transmitted from the source node to the destination node via a path formed between the intermediate nodes between the source node and the destination node. A method for transmitting a packet will be described in detail with reference to Figs. 9 to 11 below.

FIG. 4 illustrates a method of propagating an RREQ message according to an example.

Step 310 described above with reference to FIG. 3 may include the following steps 410 - 430.

In step 410, the source node sends an RREQ message to one or more nodes adjacent to the source node. Except for the source node and the destination node, the node is named as the intermediate node. The intermediate node receives the RREQ message from the previous node adjacent to itself. The node with the lowest number of hops from the source node is the previous node.

In step 420, the intermediate node sends an RREQ message to one or more neighbor nodes adjacent to itself, except for the previous node that sent the RREQ message to itself.

In step 430, the intermediate node discards the received RREQ message when receiving the RREQ message from another previous node, except for the previous node that first transmitted the RREQ message to itself. That is, the RREQ message received from another previous node is no longer propagated.

FIG. 5 illustrates an ad-hoc network in which an RREQ message according to an example is propagated.

An RREQ message is transmitted between adjacent nodes, and an arrow indicates a direction in which the RREQ message is transmitted. The number displayed represents the hop from the source node. An x indicates an RREQ message to be discarded.

The source node 501 transmits an RREQ message to the first node 510 and the third node 530, which are intermediate nodes adjacent to the source node 501, respectively, in order to propagate the RREQ message to the destination node 590 . Each of the intermediate nodes 510 to 580 may transmit an RREQ message to its neighbor nodes. When the destination node 590 receives the RREQ message, the propagation of the RREQ message may be terminated.

FIG. 6 illustrates a method of propagating an RREP message according to an example.

Step 320 described above with reference to FIG. 3 may include the following steps 610 - 630.

In step 610, the destination node transmits an RREP message to one or more nodes adjacent to the destination node. The intermediate node receives the RREP message from the next node adjacent to itself. The next node is the next node with the highest number of hops from the source node. For example, the intermediate node may receive an RREP message from the next node adjacent to the intermediate node, respectively.

In step 620, the intermediate node establishes the first neighbor node and the second neighbor node based on the order in which the RREP message was received. The intermediate node may transmit the packet to the first neighboring node or the second neighboring node. Information about the first neighboring node and the second neighboring node may be stored in the routing table. A method of setting the first neighboring node and the second neighboring node will be described in detail below with reference to FIG.

The source node can also establish a first neighbor node and a second neighbor node for the source node using the same method as the intermediate node.

In step 630, the intermediate node sends an RREP message to neighboring nodes, except for the first neighboring node. For example, the intermediate node may send an RREP message to neighboring nodes even before the second neighboring node is established.

FIG. 7 illustrates a method according to an example of how a node sets up a first neighbor node and a second neighbor node.

Step 620 described above with reference to FIG. 6 may include the following steps 710 - 730.

In step 710, if the intermediate node first receives the RREP message from the first next node, it sets the first next node to the first neighbor node. The intermediate node and the first neighboring node may form a primary path.

In step 720, the intermediate node, after receiving the RREP message from the first next node, sets the second next node to the second neighbor node when receiving the RREP message from the second next node. The intermediate node and the second neighboring node may form a back-up path. If there is no second next node, the second neighbor node is not set.

According to an aspect, before step 720 is performed, step 630 described above may be performed to send an RREP message to neighboring nodes, except for the first neighboring node.

The routing table can be stored in the memory of the intermediate node. The routing table may store the flags, the first neighbor node, the second neighbor node, the destination node, and the sequence as shown in Table 2 below.

flag The first neighboring node The second neighboring node Destination node sequence 0 3 One D 3 One One 0 One 10 One 3 0 3 10

In Table 2, the flag is set to 1 for neighbor nodes. By storing the sequence, it can be determined whether or not the same packet is retransmitted.

In step 730, the intermediate node discards the RREP message received from another neighbor node if the first neighbor node and the second neighbor node are set.

FIG. 8 illustrates an ad-hoc network in which an RREP message according to an example is propagated.

An RREP message is transmitted between adjacent nodes, and an arrow indicates a direction in which the RREP message is transmitted. The displayed number represents the hop from the destination node. An x indicates an RREP message to be discarded.

The destination node 590 is a fifth node 550, a seventh node 570 and an eighth node 580 which are intermediate nodes adjacent to the destination node 590 to propagate the RREQ message to the source node 501. [ Lt; RTI ID = 0.0 > RREP < / RTI > Each of the intermediate nodes 510 to 580 may transmit an RREP message to its neighbor nodes. When the source node 501 receives the RREP message, the propagation of the RREP message may be terminated. As the RREP message is propagated, the source node 501 and the intermediate nodes 510 to 580 can update the routing table that sets up the first neighbor node and the second neighbor node, respectively. m (master) is the first neighbor node, and s (slave) is the second neighbor node.

FIG. 9 illustrates a method of transmitting a packet through a path formed in an ad-hoc network according to an example.

Step 330 described above with reference to FIG. 3 may include the following steps 910 - 930.

In step 910, the source node transmits the packet to the first neighbor node set in the source node. When the intermediate node receives the packet from the previous node, the intermediate node transmits the packet to the first neighbor node set for itself.

In step 920, the intermediate node transmits the packet to the second neighbor node set for itself if the packet is not transmitted to the first neighbor node. For example, when an RRER message is received from the first neighboring node, the intermediate node can determine that the packet is not transmitted to the first neighboring node. If the second neighbor node is not set for the intermediate node, step 920 is not performed.

In step 930, the intermediate node transmits an RRER message to a previous node that has transmitted the packet to itself, if the packet is not transmitted to the second neighboring node. For example, if an RRER message is received from the second neighboring node, the intermediate node can determine that the packet is not transmitted to the second neighboring node.

According to an aspect, if the second neighboring node is not set in the intermediate node and the packet is not transmitted to the first neighboring node, the intermediate node can transmit the RRER message to the previous node.

10 shows a path formed in an ad-hoc network according to an example.

The source node 501 and the intermediate nodes 510 to 590 transmit the packet using information on the first neighboring node and the second neighboring node, respectively. The first neighbor node of each node is indicated by a solid line, and the second neighbor node is indicated by a dotted line. Each node transmits a packet to a first neighboring node or a second neighboring node when the packet is transmitted to itself. When a packet is not transmitted to the first neighboring node and the second neighboring node, it transmits an RRER message to a previous node that has transmitted the packet to itself.

If the first neighboring node or the second neighboring node is lost, the packet may not be transmitted to the first neighboring node or the second neighboring node. For example, if the node is a mobile communication terminal and the geographical location is moved, the topology that was formed may change. As another example, a node may fail if a node fails. A method of transmitting a packet when a node is lost will be described in detail below with reference to FIG.

FIG. 11 illustrates a packet transmission path when a failure occurs in some nodes according to an example.

For example, it is assumed that the seventh node 570 and the eighth node 580 are lost. Since the seventh node 570 and the eighth node 580 have been lost, the path to the first neighbor node and the second neighbor node, respectively set to the seventh node 570 and the eighth node 580, Can not be used. Routes connected to the seventh node 570 and the eighth node 580 can not also be used for packet transmission. A route that necessarily uses the seventh node 570 or the eighth node 580 can not be used. In the illustrated ad-hoc network 500, a path through the source node 501, the first node 510, the second node 520, the fifth node 550 and the destination node 590 is used for packet transmission Can be used.

Even if the intermediate node is lost, the packet can be transmitted without resetting the entire path through the routing information stored in each intermediate node.

12 is a flowchart of a packet transmission method of a node according to an embodiment.

The following steps 1210 through 1260 are performed by the node 200. The node 200 may be either a source node, a destination node, or an intermediate node.

In step 1210, the communication unit 210 receives an RREQ message from a previous node of one or more neighboring nodes adjacent to the node 200. [ The description of step 410 of FIG. 4 described above may be replaced with the description of step 1210, so that detailed description is omitted.

In step 1220, the communication unit 210 transmits an RREQ message to neighboring nodes other than the previous node that has transmitted the RREQ message among one or more neighboring nodes adjacent to the node 200. [ The description of step 420 of FIG. 4 described above may be substituted for the description of step 1220, and thus a detailed description is omitted.

In step 1230, the communication unit 210 receives an RREP message from one or more of the following nodes adjacent to the node 200: The description of step 610 of FIG. 6 described above may be substituted for the description of step 1230, and thus a detailed description thereof will be omitted.

At step 1240, the processor 220 transmits the RREP message based on the order in which the RREP message was received, and then sets up the first neighbor node and the second neighbor node of the nodes. The description of step 620 of FIG. 6 and FIG. 7 described above can be substituted for the description of step 1240, and thus a detailed description thereof will be omitted.

In step 1250, the communication unit 210 transmits an RREP message to neighboring nodes, except for the first neighboring node among the one or more neighboring nodes adjacent to the node 200. [ The description of step 630 of FIG. 6 described above may be substituted for the description of step 1250, and thus detailed description is omitted.

In step 1260, the communication unit 210 transmits a packet to either the first neighboring node or the second neighboring node when receiving the packet from one of the one or more neighboring nodes adjacent to the apparatus 200. [ The description of step 330 of FIG. 3 and FIG. 9 described above can be substituted for the description of step 1260, and thus detailed description is omitted.

The apparatus described above may be implemented as a hardware component, a software component, and / or a combination of hardware components and software components. For example, the apparatus and components described in the embodiments may be implemented within a computer system, such as, for example, a processor, a controller, an arithmetic logic unit (ALU), a digital signal processor, a microcomputer, a field programmable array (FPA) A programmable logic unit (PLU), a microprocessor, or any other device capable of executing and responding to instructions. The processing device may execute an operating system (OS) and one or more software applications running on the operating system. The processing device may also access, store, manipulate, process, and generate data in response to execution of the software. For ease of understanding, the processing apparatus may be described as being used singly, but those skilled in the art will recognize that the processing apparatus may have a plurality of processing elements and / As shown in FIG. For example, the processing unit may comprise a plurality of processors or one processor and one controller. Other processing configurations are also possible, such as a parallel processor.

The method according to an embodiment may be implemented in the form of a program command 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 to be recorded on the medium may be those specially designed and configured for the embodiments or may be available to those skilled in the art of computer software. Examples of computer-readable media include magnetic media such as hard disks, floppy disks and magnetic tape; optical media such as CD-ROMs and DVDs; magnetic media such as floppy disks; Magneto-optical media, and hardware devices specifically configured to store and execute program instructions such as ROM, RAM, flash memory, and the like. Examples of program instructions include machine language code such as those produced by a compiler, as well as high-level language code that can be executed by a computer using an interpreter or the like. The hardware devices described above may be configured to operate as one or more software modules to perform the operations of the embodiments, and vice versa.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is to be understood that the invention is not limited to the disclosed exemplary embodiments. For example, it is to be understood that the techniques described may be performed in a different order than the described methods, and / or that components of the described systems, structures, devices, circuits, Lt; / RTI > or equivalents, even if it is replaced or replaced.

100: Ad-hoc network
200: node
210:
220: Processor
230: Memory

Claims (14)

A method for transmitting a packet from a source node to a destination node,
Propagating an RREQ (Route REQuest) message from the source node to the destination node using one or more intermediate nodes;
Propagating an RREP (Route REPlay) message from the destination node to the source node using the one or more intermediate nodes; And
When the source node receives the RREP message, transmitting the packet through a path formed between the one or more intermediate nodes
Lt; / RTI >
Wherein the one or more intermediate nodes comprise a first neighboring node forming a primary path of one or more neighboring nodes adjacent to each of the one or more intermediate nodes and a second neighboring node forming a back- 2 < / RTI > based on information about neighboring nodes,
Wherein the step of propagating the RREQ message comprises:
Receiving the RREQ message from a previous one of one or more neighbor nodes adjacent to the intermediate node; And
Transmitting the RREQ message to neighboring nodes other than the previous node among the one or more neighboring nodes
/ RTI >
Packet transmission method.
delete The method according to claim 1,
Wherein the step of propagating the RREQ message comprises:
The intermediate node discards the RREQ message if the RREQ message is received from another previous node after the intermediate node transmits the RREQ message,
≪ / RTI >
Packet transmission method.
The method according to claim 1,
Wherein the step of propagating the RREP message comprises:
The intermediate node receiving the RREP message from one or more of the following one or more neighbor nodes adjacent to the intermediate node;
Establishing a first neighboring node and a second neighboring node of the next nodes based on an order in which the intermediate node received the RREP message; And
Wherein the intermediate node transmits the RREP message to neighboring nodes other than the first neighboring node among the one or more neighboring nodes
/ RTI >
Packet transmission method.
5. The method of claim 4,
Wherein the setting of the first neighboring node and the second neighboring node comprises:
Setting the first next node to the first neighbor node when the RREP message is first received from the first next node of the intermediate node; And
Setting the second next node to the second neighbor node when receiving the RREP message from the second next node of the intermediate node after receiving the RREP message from the first next node
/ RTI >
Packet transmission method.
5. The method of claim 4,
Wherein the step of propagating the RREP message comprises:
Discarding an RREP message received from another neighboring node when the first neighboring node and the second neighboring node are set in the intermediate node
≪ / RTI >
Packet transmission method.
5. The method of claim 4,
Wherein the transmitting the packet comprises:
When the packet is transmitted through the intermediate node, the intermediate node transmits the packet to the first neighbor node
/ RTI >
Packet transmission method.
8. The method of claim 7,
Wherein the transmitting the packet comprises:
If the packet is not transmitted to the first neighboring node, the intermediate node transmits the packet to the second neighboring node
≪ / RTI >
Packet transmission method.
9. The method of claim 8,
Wherein the transmitting the packet comprises:
If the packet is not transmitted to the second neighboring node, the intermediate node transmits a RERR (Route ERRor) message to the previous node that has transmitted the packet to the intermediate node
≪ / RTI >
Packet transmission method.
5. The method of claim 4,
Wherein the transmitting the packet comprises:
When the intermediate node receives the RERR message from the first neighboring node, the intermediate node transmits the packet to the second neighboring node
/ RTI >
Packet transmission method.
A method of transmitting a packet performed by an intermediate node,
Receiving an RREQ (Route REQuest) message from a previous one of one or more neighboring nodes adjacent to the intermediate node;
Transmitting the RREQ message to neighboring nodes other than the previous node among the one or more neighboring nodes;
Receiving an RREP (Route REPlay) message from one or more of the following one or more neighbor nodes;
Setting a first neighboring node and a second neighboring node of the next nodes based on the order in which the RREP message was received;
Transmitting the RREP message to neighboring nodes other than the first neighboring node among the one or more neighboring nodes; And
Transmitting the packet to one of the first neighboring node and the second neighboring node when the packet is received from one of the one or more neighboring nodes
/ RTI >
Packet transmission method.
12. The method of claim 11,
Wherein the first neighboring node forms a primary path with the intermediate node,
Wherein the second neighboring node forms a back-up path with the intermediate node,
Packet transmission method.
A computer-readable recording medium containing a program for carrying out the method according to any one of claims 1 to 12.
An intermediate node for transmitting a packet,
Receiving an RREQ (Route REQuest) message from a previous node, transmitting the RREQ message to nodes other than the previous node among one or more neighboring nodes adjacent to the intermediate node, and transmitting RREP REPlay < / RTI >message; And
And determining a first neighboring node and a second neighboring node according to the order in which the RREP message was received among the neighboring nodes that transmitted the RREP message,
Lt; / RTI >
Wherein the communication unit transmits the packet to either the first neighboring node or the second neighboring node when the packet is received,
Node.
KR1020160022596A 2016-02-25 2016-02-25 Method and apparatus for transmitting packet in the ad-hoc network KR101661879B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1020160022596A KR101661879B1 (en) 2016-02-25 2016-02-25 Method and apparatus for transmitting packet in the ad-hoc network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1020160022596A KR101661879B1 (en) 2016-02-25 2016-02-25 Method and apparatus for transmitting packet in the ad-hoc network

Publications (1)

Publication Number Publication Date
KR101661879B1 true KR101661879B1 (en) 2016-09-30

Family

ID=57079688

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020160022596A KR101661879B1 (en) 2016-02-25 2016-02-25 Method and apparatus for transmitting packet in the ad-hoc network

Country Status (1)

Country Link
KR (1) KR101661879B1 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101972696B1 (en) * 2018-02-23 2019-04-25 건국대학교 산학협력단 Method and apparatus for transmitting packet in the ad-hoc sensor network in software defined networks (sdn) environment
KR20190049599A (en) * 2017-11-01 2019-05-09 (주)솔빛시스템 Method and apparatus for enhancing reliability transmission through adjacent node transmission on decentralized network using tree topology
KR20190103330A (en) * 2017-02-10 2019-09-04 소니 주식회사 Route Discovery in Wireless Networks with Directional Transmissions

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20100042512A (en) * 2008-10-16 2010-04-26 숭실대학교산학협력단 Method for establishing route path in a wireless multiple hop network
KR101474482B1 (en) * 2013-12-13 2014-12-22 경북대학교 산학협력단 METHOD OF DATA TRANSMISSION USING MULTI-ROUTING FOR 6LowPAN AND SYSTEM THEREOF

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20100042512A (en) * 2008-10-16 2010-04-26 숭실대학교산학협력단 Method for establishing route path in a wireless multiple hop network
KR101474482B1 (en) * 2013-12-13 2014-12-22 경북대학교 산학협력단 METHOD OF DATA TRANSMISSION USING MULTI-ROUTING FOR 6LowPAN AND SYSTEM THEREOF

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20190103330A (en) * 2017-02-10 2019-09-04 소니 주식회사 Route Discovery in Wireless Networks with Directional Transmissions
KR102212291B1 (en) 2017-02-10 2021-02-03 소니 주식회사 Route discovery in wireless networks with directional transmissions
KR20190049599A (en) * 2017-11-01 2019-05-09 (주)솔빛시스템 Method and apparatus for enhancing reliability transmission through adjacent node transmission on decentralized network using tree topology
KR102038882B1 (en) * 2017-11-01 2019-11-26 (주)솔빛시스템 Method and apparatus for enhancing reliability transmission through adjacent node transmission on decentralized network using tree topology
KR101972696B1 (en) * 2018-02-23 2019-04-25 건국대학교 산학협력단 Method and apparatus for transmitting packet in the ad-hoc sensor network in software defined networks (sdn) environment

Similar Documents

Publication Publication Date Title
RU2682930C2 (en) Route selection in wireless networks
US11411853B2 (en) Link-state advertisement LSA sending method, apparatus, and system
KR101075671B1 (en) Transmission of success and failure indications (ack_bitmap) in relay networks
JP5293744B2 (en) Network communication system, node device, routing method, and routing program
US7391741B2 (en) Link state synchronization method and apparatus on ad-hoc network, and data structure therefor
EP2425608B1 (en) Method and system to enable a hybrid routing protocol
JP5750973B2 (en) Communication method and communication apparatus
JP4229182B2 (en) Wireless communication system, wireless communication apparatus, wireless communication method, and program
US8213352B2 (en) Wireless communication system, wireless communication device, wireless communication method, and program
JP4918900B2 (en) Wireless multi-hop network, node, multicast routing method and program
JP2012095023A (en) Multi-hop network system, server, and path notification method
KR101661879B1 (en) Method and apparatus for transmitting packet in the ad-hoc network
JP5287622B2 (en) Communication system, node, communication control method, and program
JP2010157838A (en) Communication system including ad hoc network, mobile communication equipment for communication system, and communication method in communication system
CN107852366B (en) Method, relay node and computer-readable storage medium for reducing latency in a mesh network
JP5664768B2 (en) Node, link forming method and link forming program
JP5860135B2 (en) Communication device search method, communication device, communication device search program, and ad hoc network system
KR101972696B1 (en) Method and apparatus for transmitting packet in the ad-hoc sensor network in software defined networks (sdn) environment
Frey et al. Paving the way towards reactive planar spanner construction in wireless networks
CN114143249B (en) Method and device for determining routing information, electronic equipment and storage medium
JP6206105B2 (en) Communication system, communication method, and communication program
RU2405282C2 (en) Route selection in wireless networks
Jiang et al. Mobility control for achieving optimal configuration in wireless sensor networks
JPWO2007080773A1 (en) Ad hoc network system and its node equipment
JP2021190806A (en) Communication apparatus, communication system, communication method, and program

Legal Events

Date Code Title Description
E902 Notification of reason for refusal
E701 Decision to grant or registration of patent right
GRNT Written decision to grant
FPAY Annual fee payment

Payment date: 20190905

Year of fee payment: 4