KR20180076810A - Apparatus to build a distributed schedule for p2p in TSCH and AODV based Industrial IoT Networks - Google Patents

Abstract

The present invention is to provide a distributed scheduling apparatus which includes slot information to eliminate overhead required for scheduling and not to cause interference, when finding a path through an AODV routing protocol, and a method thereof. The distributed scheduling apparatus of the present invention comprises: a message transmission module; a message reception module; an RREQ message processing module; an RREP message processing module; and a slot management module.

Description

[0001] The present invention relates to an apparatus and method for distributed scheduling for p2p in an industrial IoT network based on TSCH and AODV,

The present invention relates to a distributed scheduling scheme for p2p communication in an industrial IOT network based on TSCH and AODV, and more particularly, to a scheduling scheme for eliminating overhead required for scheduling including slot information when searching for a path through an AODV routing protocol, To an apparatus and method for performing distributed scheduling.

IEEE 802.15.4e is a standard that improves the MAC layer to meet the IEEE 802.15.4 standard for industrial wireless sensor network environments. Time Slotted Channel Hopping (TSCH) is one of the modes of IEEE 802.15.4e, which shows high reliability and low power operation, and all nodes on the IEEE 802.15.4e network are synchronized.

In TSCH, time is divided into slots, and a slotframe is formed by a bundle of time slots. Every node repeats the scheduled slot frame and performs one of transmit, receive, and sleep in the time slot. The TSCH is reducing problems such as external interference and multi-path fading through channel hopping. The schedule is represented by a two-dimensional array of (slotOffset, channelOffset), and the elements of the array are referred to as "cells ". When a cell is scheduled for transmission or reception, it can communicate with a neighboring node in the corresponding cell. The IEEE 802.15.4e standard does not define a scheduling scheme.

The TSCH is used in conjunction with the RPL routing protocol, which usually forms the routing path of the tree structure. However, the RPL routing protocol is suitable for a convergecast architecture that collects data as a root node, but not for a p2p environment. In RPL, each node selects a parent node by its rank value calculated by its neighbor information and objective function, and all packets are transmitted to the parent node. Each node does not know the path to the p2p destination and sends the p2p packet to the parent node and then to the root node. Since the root node knows the entire tree structure, it can forward to the destination of the packet. In this way, p2p communication in RPL is not suitable for p2p environment because it has to go through the root node all the time.

In this p2p environment, an ad hoc AODV (On-demand Distance Vector) routing protocol, which is a reactive routing scheme, is suitable. AODV broadcasts the RREQ message to find the destination path. The nodes that received the RREQ message broadcast the RREQ message again including their own path. When the destination node receives the RREQ message, it transmits the RREQ message including the route of the RREQ message to the source node.

In the TSCH network, on-the-fly technique is a typical distributed scheduling technique. The on-the-fly scheme transmits the candidate cells to the neighboring node for slot allocation, and the neighboring node selects and transmits some of the candidate cells again. The on-the-fly method is not a scheduling method for finding a routing path but a scheduling through a control message. Therefore, there is a large overhead required for scheduling. In addition, since the slot offset and the channel offset are determined only at random, a collision may occur between the nodes.

Patent Registration No. 10-0955246 (registered on Apr. 21, 2010) Patent Registration No. 10-1001622 (Registration date 2010.12.09)

SUMMARY OF THE INVENTION Accordingly, the present invention has been made to solve the above-mentioned problems occurring in the prior art, and it is an object of the present invention to provide an apparatus and method for distributed scheduling in which no overhead is required for scheduling, The purpose of the method is to provide.

Other objects of the present invention are not limited to the above-mentioned objects, and other objects not mentioned can be clearly understood by those skilled in the art from the following description.

According to another aspect of the present invention, there is provided a distributed scheduling apparatus for a p2p in a TSCH and an AODV-based industrial IoT network, the apparatus including: a cell list (cell list) including a cell offset and a channel offset in a RREQ message field; A message transmission module for adding and broadcasting a next IP address to the RREP message field, and an RREQ message receiving module for receiving the RREQ message and the RREP message from the message transmission module, RREQ path information and cell list information are included in a routing table in the RREQ message detected by the message reception module, and when the destination is not the node itself, If a collision occurs or is not a blacklisted cell, insert the cell in the cell list A RREQ message processing module for broadcasting and transmitting an RREQ message; and a RREP message transmitting / receiving module for broadcasting / transmitting an RREP message only when the next IP address included in the RREP message is itself, If the destination node of the RREQ message and the RREP message transmitted from the RREQ message processing module and the RREP message processing module is itself, the RREP message processing module, the RREP message processing module, and the RREP message processing module, Stores the RREQ path and the RREP path, puts the RREQ path and the RREP path into the scheduling table if the slot offset of the cell in the cell list is not already allocated, or if the cell is not in the black list, And a slot management module for performing RREP message processing .

Preferably, the message transmission module includes an RREQ message transmitter for adding and broadcasting 8 bytes of cellList information including two cell information including a 1-byte slot offset and a 1-byte channel offset in an RREQ message field, And an RREP message transmitting unit for adding and broadcasting the next IP address to the field.

Preferably, the message receiving module includes an RREQ message receiver for receiving an RREQ message from a message transmission module and detecting whether a destination of the received message is a received node itself, a receiver for receiving a RREP message from the message transmission module, And a RREP message receiver for detecting whether the received node is the received node itself.

Preferably, the RREQ message processing module further includes a first routing processor for adding RREQ path information and cell list information to the detected RREQ message, if the destination is not the node itself, Includes a first scheduling processing unit for inserting a corresponding cell into a cell list when a collision with one of the cells occurs or is not a cell in a black list and broadcasts an RREQ message when four cell information is added to the cell list .

Preferably, the RREP message processing module includes a second routing processor for inserting the corresponding cell into the black list when the next IP address included in the detected RREP message is not itself, and updating the routing table if the next IP address is the self, And a second scheduling processor for allocating a cell in a case where the cell offset is not already allocated in the cell list stored in the routing table and the cell is not in the black list, inserting the cell into the RREP message, .

Preferably, the slot management module stores the RREQ path and the RREP path in the routing table, and when the slot offset of the cell in the cell list is not already allocated or the cell is not in the black list, And an active slot adding unit for allocating the corresponding cell and performing RREQ message and RREP message processing.

According to another aspect of the present invention, there is provided a method of performing distributed scheduling for p2p in a TSCH and an AODV-based industrial IoT network, comprising the steps of: (A) when path searching and scheduling are performed, Adding cell list (cellList) information including a cell offset and a channel offset to a RREQ message field and broadcasting and transmitting an RREQ message by designating the RREQ message field; and (B) (C) receiving a RREQ message and a RREP message from a neighboring node through a message receiving module, adding the next RREQ message to the received RREQ message, Detecting whether the destination of the received RREQ message is the received node itself, and (D) Adding RREQ path information and cell list information to the routing table, and randomly designating a cell when the destination is not the node itself; (E) colliding with cells already allocated by the designated cell Or a cell in a black list (blaclList), broadcasting the RREQ message through the first scheduling processing unit, and (F) receiving the RREP message through the message receiving module . If the next IP address in the received RREP message is not itself, the cell is inserted into the black list. If the next IP address is itself, the routing table is updated (designated next) and the cell in the RREP message (G) a first checking step of confirming whether a slot offset of a corresponding cell is already allocated in the cell list stored in the routing table, (H) A second checking step of checking whether the corresponding cell is a cell in the black list if the slot offset of the corresponding cell is not allocated as a result of the first checking; (J) storing the RREQ path and the RREP path in the routing table through the slot management module, allocating the corresponding cell, and transmitting the RREQ message and the RREP message And performing the steps of:

Preferably, in the step (A), the cell list includes four cell information, and the cell includes a 1-byte slot offset and a 1-byte channel offset.

Preferably, the RREP message of step (B) includes 4 bytes of next IP address and 2 bytes of cell information.

Preferably, in the step (E), when four cell information is inserted into the cell list, the RREQ message is broadcasted and transmitted.

Preferably, the step (J) further comprises a step of managing the cell in the scheduling table if the slot offset of the cell is not already allocated among the cells in the cell list or if the cell is not in the black list.

The apparatus and method for distributed scheduling for p2p in the TSCH and AODV-based industrial IoT networks according to the present invention as described above have the following effects.

First, it modifies the RREQ and RREP message fields of the existing AODV, so that there is no overhead required for scheduling.

Second, the RREP message transmission scheme is changed from unicasting to broadcasting transmission, and cell information of neighboring nodes is managed as a blacklist, so that no interference occurs between nodes.

Third, although the RREP message is changed to broadcast transmission, the number of control packets is not increased as compared with the conventional AODV.

Fourth, the disadvantage of the on-the-fly scheme, which is a typical TSCH distributed scheduling scheme (RPL routing is used, routing and scheduling are performed separately, so control packets necessary for scheduling are required. , Randomly allocating cells may cause interference).

1 is a block diagram showing a configuration of a distributed scheduling apparatus for p2p in an industrial IoT network based on TSCH and AODV according to an embodiment of the present invention;
2 is a flowchart illustrating a distributed scheduling method for p2p in an industrial IoT network based on TSCH and AODV according to an embodiment of the present invention.
FIG. 3 shows an RREQ message format
FIG. 4 shows a RREP message format showing the configuration of a modified RREP message field
5 is a diagram illustrating an example of RREQ message transmission according to the present invention;
6 is a diagram illustrating an example of RREP message transmission according to the present invention;
7 is a timing diagram of an RREQ message and an RREP message according to the present invention.

Other objects, features and advantages of the present invention will become apparent from the detailed description of the embodiments with reference to the accompanying drawings.

A preferred embodiment of an apparatus and method for distributed scheduling for p2p in a TSCH and an AODV-based industrial IoT network according to the present invention will be described with reference to the accompanying drawings. The present invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art. It is provided to let you know. Therefore, the embodiments described in the present specification and the configurations shown in the drawings are merely the most preferred embodiments of the present invention and are not intended to represent all of the technical ideas of the present invention. Therefore, various equivalents It should be understood that water and variations may be present.

1 is a block diagram illustrating a configuration of a distributed scheduling apparatus for p2p in an industrial IoT network based on TSCH and AODV according to an embodiment of the present invention.

As shown in FIG. 1, the distributed scheduling apparatus adds cell list (cellList) information including a cell offset and a channel offset to an RREQ message field, and adds a next IP address to the RREP message field A message receiving module 200 for receiving the RREQ message and the RREP message from the message transmitting module 100 and detecting whether the destination of the received message is the received node itself, RREQ path information and cell list information are inserted into the routing table in the RREQ message detected by the message reception module 200 and when a destination is not the node itself, a cell (slot offset, channel offset) is designated If a cell conflicts with already allocated cells or is not a cell in the black list (blaclList), the cell is inserted in the cell list, and the RREQ message A RREQ message processing module 300 that broadcasts and transmits an RREP message only when the next IP address included in the RREP message is itself in the message reception module 200, A RREP message processing module 400 for inserting cells in a RREP message into a black list and broadcasting the RREP message and a RREP message transmitted from the RREP message processing module 400; The RREQ path and the RREP path are stored in the routing table, and if the slot offset of the cell in the cell list is not already allocated or the cell is not in the black list, And a slot management module 500 that performs RREQ message processing and RREP message processing by allocating corresponding cells.

At this time, the message transmission module 100 adds an 8-byte cellList information including two cell information including a 1-byte slot offset and a 1-byte channel offset to the RREQ message field and broadcasts the RREQ message message And an RREP message transmission unit 120 for adding and broadcasting a next IP address to the RREP message field.

The message receiving module 200 includes an RREQ message receiving unit 210 receiving a RREQ message from the message transmitting module 100 and detecting whether the destination of the received message is the received node itself, And an RREP message receiver 220 for detecting whether the destination of the received message is the received node itself.

The RREQ message processing module 300 further includes a first routing processor 310 for adding RREQ path information and cell list information to the detected RREQ message, (Slot offset, channel offset), and if a collision occurs with already allocated cells or is not a cell in the black list, the corresponding cell is inserted into the cell list, and if four cell information is added to the cell list, the RREQ And a first scheduling processing unit 320 for broadcasting and transmitting the message.

The RREP message processing module 400 inserts the corresponding cell into the black list when the next IP address included in the detected RREP message is not itself, A processing unit 410 for allocating a cell in a case where the cell offset is not already allocated to a cell list stored in the routing table and is not in the black list, And a scheduling processing unit 420.

Also, the slot management module 500 stores the RREQ path and the RREP path in the routing table, and when the slot offset of the corresponding cell is not already allocated in the cell list, or when the corresponding cell is not in the black list, And an active slot adding unit 520 for allocating a corresponding cell and performing an RREQ message and an RREP message processing.

Hereinafter, the operation of the apparatus for performing distributed scheduling for p2p in the TSCH and the AODV-based industrial IoT network according to the present invention will be described in detail with reference to the accompanying drawings. Like reference numerals in FIG. 1 or FIG. 2 denote the same members performing the same function.

FIG. 2 is a flowchart illustrating a distributed scheduling method for p2p in a TSCH and an AODV-based industrial IoT network according to an embodiment of the present invention. Referring to FIG. 7, the present invention includes RREQ message processing, Processing There are two main processes.

Referring to FIG. 2, when route searching and scheduling are performed (S10), a cell is randomly designated through the message transmission module 100, and a cell list including a cell offset and a channel offset ) Information, and broadcasts the RREQ message (S20).

At this time, the message transmission module 100 has modified the RREQ message field to eliminate the overhead required for scheduling. FIG. 3 is a RREQ message format showing the configuration of the modified RREQ message field. The 8-byte cell list information is added to the existing RREQ message field so that scheduling can be performed without a separate scheduling message. At this time, the cell list includes 4 cell information, and the cell is composed of 1 byte slot offset and 1 byte channel offset total 2 bytes.

FIG. 5 is a diagram illustrating an example of RREQ message transmission according to the present invention. FIG. 5 is a diagram for performing route search and scheduling through RREQ messages from source Nos. 1 to 6. FIG.

When the destination node having received the RREQ message finishes processing the RREQ message, the message transmission module 100 adds a next IP address to the RREP message field and broadcasts the RREP message (S30).

At this time, the message transmission module 100 must create a black list in order to perform scheduling in which interference does not occur. Since the neighbor nodes need to receive the information necessary for black list generation, the RREP message is broadcasted. In order to prevent the flooding from occurring even in the broadcasting mode, the RREP message field includes the next IP address as shown in FIG. FIG. 4 is a RREP message format showing the configuration of the modified RREP message field. The 4-byte next IP address is added, and the 2-byte cell information is included.

FIG. 6 shows an example of RREP message transmission from destination # 6 to source # 1. When destination node # 6 broadcasts an RREP message, nodes # 3, # 4 and # 5 are received.

If the RREQ message and the RREP message are received from the neighboring node through the message receiving module 200 in step S40, it is determined in step S50 whether the destination of the received RREQ message is the received node itself.

If the destination of the detected RREQ message is not itself, RREQ path information and cell list information are added to the routing table in step S60. If the destination is not the node itself, the RREQ path information and cell list information are randomly added to the cell (slot offset, channel offset) (S70).

If the designated cell collides with the already allocated cells or is not a cell in the black list (S80), the corresponding cell is inserted into the cell list, and if four cell information is inserted into the cell list, And broadcasts the RREQ message through the RNC 320 (S90).

As such, the node randomly determines the slot offset and the channel offset. For example, if the slot frame length is 100 and the channel offset is 16, one of a total of 1600 cells is randomly selected. If the selected cell conflicts with cells that it has already allocated or is not a cell in the black list, it inserts it into the cell list. In this way, four cells are inserted into the cell list and included in the RREQ message for broadcast transmission. The reason for this process is to perform scheduling in which no interference occurs between the nodes.

On the other hand, if the RREP message is received through the message receiving module 200 (S40), if the next IP address in the received RREP message is not itself (S90), the corresponding cell is inserted into the black list (S100 ).

If the next IP address in the received RREP message is itself (S90), the routing table is updated (designated next) and the cell in the RREP message is allocated (S110).

In step S120, it is determined whether a slot offset of the corresponding cell is already allocated in the cell list stored in the routing table. That is, referring to FIG. 6, since the nodes 3 and 5 are not nodes on the route, they insert the corresponding cells 25 and 10 into the black list. Since node 4 is a node on the route, it updates the routing table, puts cells 25 and 10 into the scheduling table, and then allocates cells.

If it is determined that the corresponding cell is not included in the black list (S130), the corresponding cell is allocated to the cell in the black list, and if the cell offset is not allocated to the RREP message And broadcast transmission is performed (S140). That is, referring to FIG. 6, nodes 1, 2, 3, and 5 receive this message. Likewise, nodes 2, 3, and 5 are not nodes in the route, so they are blacklisted and terminated. Since node 1 is a node on the route, it updates the routing table and allocates the corresponding cell.

The RREQ path and the RREP path are stored in the routing table through the slot management module 500. If the slot offset of the cell in the cell list is not already allocated or the cell is not in the black list, The RREQ message and the RREP message are processed by allocating the corresponding cell (S150).

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. It will be apparent to those skilled in the art that various modifications may be made without departing from the scope of the present invention. Accordingly, the true scope of the present invention should be determined by the technical idea of the appended claims.

Claims (11)

A message transmission module for adding cell list (cellList) information including a cell offset and a channel offset to an RREQ message field, adding a next IP address to an RREP message field, and broadcasting and transmitting the next IP address,
A message receiving module for receiving the RREQ message and the RREP message from the message transmission module and detecting whether the destination of the received message is the received node itself;
If the destination is not the node itself, the RREQ path information and the cell list information are inserted into the routing table in the RREQ message detected by the message reception module. If the destination is not the node itself, A RREQ message processing module for inserting a corresponding cell into a cell list and broadcasting an RREQ message;
The RREP message is broadcasting only if the next IP address included in the RREP message is itself, and if not, the cell in the RREP message is inserted into the black list and broadcasted Not with the RREP message handling module,
If the destination node of the RREQ message and the RREP message transmitted from the RREQ message processing module and the RREP message processing module is itself, the RREQ path and the RREP path are stored in the routing table, and if the slot offset of the corresponding cell And a slot management module for storing the RREQ message and the RREP message when the corresponding cell is not allocated in the black list, allocating the corresponding cell to the scheduling table, and performing RREQ message and RREP message processing. An apparatus for distributed scheduling for p2p in an IoT network. The method of claim 1, wherein the message transmission module
An RREQ message transmitter for adding and broadcasting 8 bytes of cellList information including two cell information including a 1-byte slot offset and a 1-byte channel offset in an RREQ message field,
And an RREP message transmission unit for adding and broadcasting the next IP address to the RREP message field. The apparatus for distributed scheduling for p2p in an industrial IoT network based on TSCH and AODV. The apparatus of claim 1, wherein the message receiving module
An RREQ message receiver for receiving the RREQ message from the message transmission module and detecting whether the destination of the received message is the received node itself;
And a RREP message receiving unit for receiving the RREP message from the message transmission module and detecting whether the destination of the received message is the received node itself. The distributed scheduling for p2p in the TSCH and AODV-based industrial IoT network . The method of claim 1, wherein the RREQ message processing module
A first routing processor for adding RREQ path information and cell list information to a routing table in the detected RREQ message,
If the destination is not the node itself, designate the cell at random and insert the cell into the cell list if it conflicts with already allocated cells or is not a cell in the black list (blaclList) And a first scheduling processor for broadcasting and transmitting an RREQ message if it is added. The apparatus for distributed scheduling for p2p in an industrial IoT network based on TSCH and AODV. The method of claim 1, wherein the RREP message processing module
A second routing processor for inserting the corresponding cell into the black list if the next IP address included in the detected RREP message is not itself and updating the routing table if the next IP address is self,
And a second scheduling processing unit for allocating a cell in a case where the cell offset is not already allocated in the cell list stored in the routing table and is not in the black list, inserting the cell in the RREP message, And a distributed scheduling for p2p in a TSCH and AODV based industrial IoT network. The apparatus of claim 1, wherein the slot management module
Storing a RREQ path and a RREP path in a routing table, managing a scheduling table management unit in which a slot offset of a cell in a cell list is not already allocated or a corresponding cell is not in a black list,
And an active slot adding unit for performing RREQ message processing and RREP message processing by allocating the corresponding cells. The apparatus for performing distributed scheduling for p2p in an industrial IoT network based on TSCH and AODV. (A) When path finding and scheduling is performed, a cell is randomly designated through a message transmission module, cell list (cellList) information including a cell offset and a channel offset is added to an RREQ message field, and a RREQ message is broadcast , ≪ / RTI &
(B) adding a next IP address to the RREP message field and broadcasting and transmitting the RREP message when the destination node that has received the RREQ message ends the RREQ message processing;
(C) if the RREQ message and the RREP message are received from the neighboring node through the message receiving module, detecting whether the destination of the received RREQ message is the received node itself;
(D) adding RREQ path information and cell list information to the routing table when the detected destination of the RREQ message is not itself, and randomly designating a cell when the destination is not the node itself,
(E) inserting a corresponding cell into the cell list when the designated cell conflicts with cells already allocated or is not a cell in a black list (blaclList), broadcasting and transmitting an RREQ message through the first scheduling processor Wow,
(F) When the RREP message is received through the message receiving module, if the next IP address in the received RREP message is not itself, the corresponding cell is inserted into the black list. If the next IP address is itself Updating the routing table (next designation) and allocating a cell in the RREP message,
(G) a first checking step of checking whether a slot offset of the cell is already allocated in the cell list stored in the routing table,
(H) checking whether the corresponding cell is a cell in the black list if the slot offset of the corresponding cell is not allocated as a result of the first checking;
(I) assigning a corresponding cell when the cell is not in the black list as a result of the second check, inserting the corresponding cell in the RREP message and broadcasting the cell,
(J) storing the RREQ path and the RREP path in the routing table through the slot management module, and performing RREQ message and RREP message processing by allocating the corresponding cell. A method for performing distributed scheduling for p2p. 8. The method of claim 7,
In the step (A), the cell list includes four cell information, and the cell is composed of a 1-byte slot offset and a 1-byte channel offset total of 2 bytes. In the TSCH and AODV-based industrial IOT networks, A method for performing distributed scheduling. 8. The method of claim 7,
Wherein the RREP message in the step (B) includes 4 bytes of next IP address and 1 cell information of 2 bytes. 2. The method of claim 1, 8. The method of claim 7,
Wherein the step (E) broadcasts an RREQ message when four cell information is inserted into the cell list, and transmits the RREQ message to the TSCH and the AODV-based industrial IoT network. 8. The method of claim 7,
Wherein the step (J) further comprises the step of managing the cell in the scheduling table if the slot offset of the cell in the cell list is not already allocated or the cell is not in the black list. A method for distributed scheduling for p2p in an industrial - based IoT network.

Images