KR20140023840A - Apparatus and method for processing path management packet - Google Patents

Apparatus and method for processing path management packet Download PDF

Info

Publication number
KR20140023840A
KR20140023840A KR1020120133917A KR20120133917A KR20140023840A KR 20140023840 A KR20140023840 A KR 20140023840A KR 1020120133917 A KR1020120133917 A KR 1020120133917A KR 20120133917 A KR20120133917 A KR 20120133917A KR 20140023840 A KR20140023840 A KR 20140023840A
Authority
KR
South Korea
Prior art keywords
management packet
path management
node
routing
router
Prior art date
Application number
KR1020120133917A
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 US13/970,250 priority Critical patent/US9185029B2/en
Publication of KR20140023840A publication Critical patent/KR20140023840A/en

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/24Connectivity information management, e.g. connectivity discovery or connectivity update
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/02Power saving arrangements
    • H04W52/0203Power saving arrangements in the radio access network or backbone network of wireless communication networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/18Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

It is determined whether a router that processes the received path management packet is a storage node, and if the router is a storage node, control to store the path management packet in a routing table, or when the router is a non-storage node, the path management packet. An apparatus and a method for processing a path management packet to control the path management packet to be transmitted to the next node without storing the data in the routing table.

Description

Apparatus and method for processing path management packet {APPARATUS AND METHOD FOR PROCESSING PATH MANAGEMENT PACKET}

Embodiments of the present invention relate to an apparatus and method for processing a path management packet.

Recently, research and development on wireless ad-hoc networks using low power devices have been actively conducted. Typical applications of wireless ad hoc networks using low power devices include wireless sensor networks, smart energy services, and the like, which may periodically collect sensing values or power consumption of devices. A typical low power wireless ad hoc network mainly adopts a tree structured data processing method for data collection, and uses a tree routing technique for data collection and transmission.

In the low power wireless network, tree routing schemes can be classified into a method in which each router stores a routing table and then transfers data using the stored information, and a source routing method in which a routing path is assigned to a header.

In a low power wireless network, when routers using both methods are mixed in the same network, data transfer to a lower tree may not be performed normally. Low-power wireless networks typically use only one of two methods, and do not provide for the compatibility of both methods.

Two devices supporting each of the two methods cannot communicate with each other even if they implement the same standard, which can be difficult to construct a large network and to build a real environment.

The low power wireless network requires a compatibility method between the two routing methods in order to configure a different device and to normally exchange data between the devices using the routing table and the devices using the source routing method.

One embodiment of the present invention is a routing between a routing method using a routing table and a source routing method in a low power wireless ad-hoc network using a tree structure. The purpose is to provide compatibility.

One embodiment of the present invention aims to increase the standard low power tree network configuration and the range of utilization of the network.

An apparatus for processing a path management packet according to an embodiment of the present invention may include a receiver configured to receive a path management packet, a determiner configured to determine whether a router that processes the path management packet is a storage node, and the path when the router is a storage node. It may include a control unit for controlling to store the management packet in the routing table, and a transmission unit for transmitting the path management packet to the next node.

According to one aspect of the present invention, the storage node may be a router that supports a storage mode for the path management packet.

According to one aspect of the present invention, the determination unit may determine whether a routing header is required when the router is a storage node.

According to one aspect of the present invention, when the routing header is required, the controller may add a routing header to the route management packet and control the route management packet to which the routing header is added to the next node.

According to one aspect of the present invention, if the routing header is not needed, the controller may analyze the routing table to estimate the next node and control the route management packet to be transmitted to the estimated next node.

According to one aspect of the present invention, when the router is a non-storage node, the controller may control to transmit the path management packet to the next node without storing the path management packet in the routing table.

According to one aspect of the present invention, the non-storage node may support a non-storing mode for the path management packet.

According to one side of the present invention, when the router is a non-storage node, the determination unit may determine whether a routing header exists.

According to one aspect of the present invention, when the routing header is present, the controller may analyze the header information of the routing header to estimate the next node and control to transmit the route management packet to the estimated next node. have.

According to one side of the present invention, if the routing header does not exist, the controller may control to transmit the path management packet to a parent node.

The method for processing a path management packet according to an embodiment of the present invention may include receiving a path management packet, determining whether a router processing the path management packet is a storage node, and if the router is a storage node, managing the path. Controlling to store the packet in a routing table, and transmitting the path management packet to a next node.

According to an embodiment of the present invention, in a low power wireless ad-hoc network using a tree structure, a routing method using a routing table and a source routing method may be used. Can provide routing compatibility.

According to an embodiment of the present invention, a standard low power tree network configuration and a range of utilization of the network may be increased.

1 is a block diagram showing a configuration of a path management packet processing apparatus according to an embodiment of the present invention.
2 shows an example of a downlink data transfer technique through a storage mode.
3 shows an example of a downlink data transfer technique through a non-storage mode.
4 is a flowchart illustrating a method of processing a path management packet according to an embodiment of the present invention.
5 is a flowchart illustrating a detailed method of processing a path management packet according to an embodiment of the present invention.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings and accompanying drawings, but the present invention is not limited to or limited by the embodiments.

In the following description of the present invention, a detailed description of known functions and configurations incorporated herein will be omitted when it may make the subject matter of the present invention rather unclear. The terminology used herein is a term used for appropriately expressing an embodiment of the present invention, which may vary depending on the user, the intent of the operator, or the practice of the field to which the present invention belongs. Therefore, the definitions of the terms should be made based on the contents throughout the specification.

1 is a block diagram showing a configuration of a path management packet processing apparatus according to an embodiment of the present invention.

Referring to FIG. 1, the apparatus for processing a path management packet according to an embodiment of the present invention may include a receiver 110 that receives a path management packet, and a determiner that determines whether a router that processes the path management packet is a storage node ( 120, when the router is a storage node, the controller 130 may control to store the path management packet in the routing table 140 and a transmitter 150 transmitting the path management packet to a next node. .

According to one aspect of the invention, the storage node may correspond to a router supporting a storage mode (storing mode) for the path management packet, the non-storage node is a non-storage mode (non- It can correspond to a router that supports storing mode.

The determination unit 120 may determine whether a routing header is required when the router is a storage node. Here, when the routing header is needed, the controller 130 may add a routing header to the path management packet, and control to transmit the path management packet to which the routing header is added to the next node. In addition, when the routing header is not needed, the controller 130 may analyze the routing table to estimate the next node and control the path management packet to be transmitted to the estimated next node.

According to one side of the present invention, when the router is a non-storage node, the controller 130 may control to transmit the path management packet to the next node without storing the path management packet in the routing table 140. .

The determination unit 120 may determine whether a routing header exists when the router is a non-storage node. In this case, when the routing header exists, the controller 130 may analyze the header information of the routing header to estimate the next node and control the path management packet to be transmitted to the estimated next node. In addition, when the routing header does not exist, the controller 130 may control to transmit the path management packet to a parent node.

According to an aspect of the present invention, a method for processing a path management packet includes a storage mode supporting router that stores a routing table and delivers data in a low power wireless ad hoc network based on a tree structure and a non-storing mode using only source routing. -storing mode) It is possible to provide a compatible method between supporting routers.

For example, a tree-based low power wireless ad hoc network is represented by an IEEE 802.15.4 based IETF 6LoWPAN network. have.

The apparatus for processing a route management packet according to an aspect of the present invention stores a received route management packet in a routing table and delivers the data using the same, and delivers all the data to the top of the tree (RPL root) and the top node. Can optionally use a non-storage node that specifies all paths in the source routing header.

The path management packet processing apparatus may exchange data between different routers in which a storage node and a non-storage node are mixed, and may provide compatibility between a table-based routing method and a source routing method.

2 shows an example of a downlink data transfer technique through a storage mode.

Referring to FIG. 2, in a storage mode, each node forwards a path management packet to a parent node when a network is connected, and a parent node stores a path in its routing table and forwards the path management packet back to its parent node. Can be. In the storage mode, the path management packet can be delivered to the top node of the tree by repeating the above process.

All router nodes in storage mode store the information of nodes in their subtrees in the routing table. The routing table may not store all the route information, and may store only the address of the destination node of its subtree and the child node that is the next hop in the corresponding node direction.

In the storage mode, the data transfer node 210 may transfer data to its parent node 220 when there is no destination node 230 in its routing table. This process may be repeated until delivered to the same parent node 220 of data delivery node 210 and destination node 230. The common parent node 220 of the two nodes has the information of the destination node 230 in its routing table, and can transmit data to the child node.

3 shows an example of a downlink data transfer technique through a non-storage mode.

Referring to FIG. 3, in a non-storing mode, each node may transmit a path management packet to a parent node when accessing a network. Here, the path management packet in the non-storage mode may include the address of its parent node.

Since the non-storage node does not store the routing table, the packet may be forwarded directly from the data transfer node 310 to the top node, and the top node 320 may store the routing paths of all nodes connected to the network.

In the store mode, data is passed to the top node 320, which retrieves the destination node 330 of the data from its route table, and then source routes all routing paths to the destination node 330. In addition to the header, you can pass data along that path. The router receiving the packet including the source routing header may forward the data to the final destination node 330 using the path specified in the header.

Hereinafter, a path management packet processing method according to an embodiment of the present invention will be described.

4 is a flowchart illustrating a method of processing a path management packet according to an embodiment of the present invention.

The apparatus for processing a path management packet according to an embodiment of the present invention receives the path management packet (410), and determines whether the router processing the path management packet is a storage node (420).

When the router is a storage node, the path management packet processing apparatus may control to store the path management packet in a routing table (430), and transmit the path management packet to a next node (440).

When the router is a non-storage node, the path management packet processing apparatus may control the path management packet to be transmitted to the next node without storing the path management packet in the routing table.

For example, the path management packet processing apparatus stores the path information of the received path management packet in its routing table in the routing node, and forwards the packet to its parent node. You can pass it directly to the node.

5 is a flowchart illustrating a method of processing a data packet according to an embodiment of the present invention.

Referring to FIG. 5, the path management packet processing apparatus may receive a data packet (510) and determine whether the storage node is a storage node, or determine whether a routing header is required when the router is a storage node ( 520).

For example, each router determines if it is a storage node upon receipt of a data packet, if it is a storage node, retrieves whether the data destination is stored in its routing table, and if not, then passes the route management packet. Can pass to parent node. In addition, each router, if there is a destination in its routing table, first determines whether a routing header is required (530).

When the routing header is needed, the path management packet processing apparatus may add a routing header to the data packet and control to transmit the data packet including the routing header to the next node (540).

In addition, when the routing header is not needed, the path management packet processing apparatus may analyze the routing table to estimate the next node and control the data packet to be transmitted to the estimated next node (550).

For example, if the child node of the searched routing path is not a storage node, the path management packet processing apparatus may add a source routing header to the data packet and then deliver it to the next node.

Here, the source routing header may store a path to a next storage node or a final destination node existing in the path, and all storage nodes present in the path from the storage node receiving the packet to the destination node have their own routing. You can store the path of the destination node in a table.

That is, the source routing header for data delivery can be reconfigured at the corresponding storage node. When generating the source routing header, the storage node must store the routing path to the next storage node on the path. Saving.

The storage node can search all its routing tables to find the route information, and retrieves the route information for the data transfer from the routing table to the subtrees in the same way as the top node in the non-save mode for its subtree. You can add it to the source routing header.

When the storage node is a child node of the searched routing path, the storage node may forward the packet to the node of the routing table without adding the source routing header to the data packet.

In addition, when the router is a non-storage node, the path management packet processing apparatus may determine whether a routing header exists (560). Here, when the routing header is present, the path management packet processing apparatus may analyze the header information of the routing header to estimate the next node (570), and control to transmit a data packet to the estimated next node. (580).

If the routing header does not exist, the path management packet processing apparatus may control to transmit the path management packet to a parent node (511).

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.

Therefore, other implementations, other embodiments, and equivalents to the claims are also within the scope of the following claims.

110:
120:
130:
140: routing table
150: transmission unit

Claims (20)

A receiver for receiving a path management packet;
A determination unit determining whether a router for processing the path management packet is a storage node;
A control unit controlling to store the path management packet in a routing table when the router is a storage node; And
Transmitter for transmitting the path management packet to the next node
Path management packet processing apparatus comprising a.
The method of claim 1,
The storage node,
And a router supporting a storage mode for the path management packet.
The method of claim 1,
The determination unit,
And determining whether a routing header is required when the router is a storage node.
The method of claim 3,
The control unit,
And when the routing header is needed, adds a routing header to the route management packet, and controls to transmit the route management packet including the routing header to a next node.
The method of claim 3,
The control unit,
And when the routing header is not needed, analyzing the routing table to estimate the next node and to control the route management packet to be transmitted to the estimated next node.
The method of claim 1,
The control unit,
And managing the route management packet to be transmitted to the next node without storing the route management packet in the routing table when the router is a non-storage node.
The method according to claim 6,
The non-storage node,
And a router supporting a non-storing mode for the path management packet.
The method according to claim 6,
The determination unit,
And determining whether a routing header exists when the router is a non-storage node.
9. The method of claim 8,
The control unit,
And analyzing the header information of the routing header to estimate the next node and transmitting the path management packet to the estimated next node when the routing header exists.
9. The method of claim 8,
The control unit,
And transmit the path management packet to a parent node when the routing header does not exist.
Receiving a path management packet;
Determining whether a router processing the path management packet is a storage node;
Controlling the route management packet to be stored in a routing table when the router is a storage node; And
Transmitting the path management packet to a next node
Path management packet processing method comprising a.
12. The method of claim 11,
The storage node,
And a router supporting a storage mode for the path management packet.
12. The method of claim 11,
And determining whether a routing header is required if the router is a storage node.
14. The method of claim 13,
If the routing header is needed, adding a routing header to the path management packet; And
Controlling to transmit a route management packet including the routing header to a next node;
Path management packet processing method further comprising.
14. The method of claim 13,
If the routing header is not needed, analyzing the routing table to estimate the next node; And
Controlling the route management packet to be transmitted to the estimated next node
Path management packet processing method further comprising.
12. The method of claim 11,
Controlling the router to transmit the path management packet to the next node without storing the path management packet in the routing table when the router is a non-storage node.
Path management packet processing method further comprising.
17. The method of claim 16,
The non-storage node,
And a router supporting a non-storing mode for the path management packet.
17. The method of claim 16,
If the router is a non-storage node, determining whether a routing header exists
Path management packet processing method further comprising.
19. The method of claim 18,
If the routing header exists, estimating the next node by analyzing header information of the routing header; And
Controlling the route management packet to be transmitted to the estimated next node
Path management packet processing method further comprising.
19. The method of claim 18,
If the routing header does not exist, controlling the routing management packet to be transmitted to a parent node
Path management packet processing method further comprising.
KR1020120133917A 2012-08-17 2012-11-23 Apparatus and method for processing path management packet KR20140023840A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US13/970,250 US9185029B2 (en) 2012-08-17 2013-08-19 Apparatus and method for processing path management packet

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR20120089932 2012-08-17
KR1020120089932 2012-08-17

Publications (1)

Publication Number Publication Date
KR20140023840A true KR20140023840A (en) 2014-02-27

Family

ID=50269149

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020120133917A KR20140023840A (en) 2012-08-17 2012-11-23 Apparatus and method for processing path management packet

Country Status (1)

Country Link
KR (1) KR20140023840A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20170103248A (en) * 2016-03-03 2017-09-13 한국전자통신연구원 Network device and communication method of the same

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20170103248A (en) * 2016-03-03 2017-09-13 한국전자통신연구원 Network device and communication method of the same

Similar Documents

Publication Publication Date Title
US9800493B2 (en) Routing messages in a computer network using deterministic and probalistic source routes
US9014056B2 (en) Bridging network devices in a hybrid communication network
US9094324B2 (en) Diverse path forwarding through trial and error
US20200053000A1 (en) Method, Device and Node for Message Transmission, and Computer Storage Medium
US20160344616A1 (en) Multi-region source routed multicast using sub-tree identifiers
EP1819109B1 (en) Method and apparatus for transferring information on station in wireless mesh network
Carels et al. Support of multiple sinks via a virtual root for the RPL routing protocol
Zhang et al. An efficient hop count routing protocol for wireless ad hoc networks
US20110128962A1 (en) Method for routing of messages within a data network
EP2923463B1 (en) Establishing neighbor connection
CN108632777A (en) Mining wireless node carries out Point-to-Point Data Transmission method in MESH network
US9185029B2 (en) Apparatus and method for processing path management packet
KR20140023840A (en) Apparatus and method for processing path management packet
Sharma et al. Energy aware multipath routing protocol for wireless sensor networks
US9509559B2 (en) Bandwidth control apparatus, bandwidth control method, and bandwidth control program
CN1960325B (en) Data process method in a bridging network, and a bridging network
CN111464441A (en) Communication method and device
CN105207904A (en) Message processing method, device and router
CN102594680A (en) Message fragment processing system and processing method
Gumaste et al. Performance analysis of DSR protocol
Clausen et al. Path accumulation extensions for the LOADng routing protocol in sensor networks
Abid et al. Energy efficient routing in mobile ad-hoc networks for healthcare environments
Mittal et al. Performance Evaluation of Various Types of Nodes in Manet With Dsr Routing Protocols
CN104837170B (en) A kind of gradual physical topology localization methods of WSN based on 802.15.4 communication protocols
KR20120070957A (en) Routing method for end-device in wireless sensor network and end-device for the same

Legal Events

Date Code Title Description
WITN Withdrawal due to no request for examination