KR101761369B1 - System of duty-cycled wireless sensor network, node of duty-cycled wireless sensor network and method for transmission scheduling setting in duty-cycled wireless sensor network - Google Patents

Abstract

The present invention includes a base station and a plurality of nodes. Each node included in the plurality of nodes calculates a rank through message exchange with a neighbor node located within a predetermined transmission distance for each time slot according to a duty transfer protocol, sets its role based on the calculated rank, and determines whether to include a broadcast backbone based on its role when receiving a merge message corresponding to the base station. At this time, the role includes a dominator and a dominate, The dominator is a node which sends a message to a neighboring node in a specific time slot The dominate is a node which receives a message from the dominator in a specific time slot. The broadcast backbone is a network composed of a plurality of nodes which receive a message transmitted from the base station.

Description

TECHNICAL FIELD [0001] The present invention relates to a method and system for establishing transmission scheduling in a node and a duty-cycle wireless sensor network in a duty-cycle wireless sensor network, and a method of setting transmission scheduling in a duty-cycle wireless sensor network. BACKGROUND OF THE INVENTION TRANSMISSION SCHEDULING SETTING IN DUTY-CYCLED WIRELESS SENSOR NETWORK}

The present invention relates to a system in a duty-cycle wireless sensor network, a method for establishing transmission scheduling in a node and a duty-cycle wireless sensor network in a duty-cycle wireless sensor network.

With advances in wireless communications and electronics, it has become possible to develop wireless sensors that are small in size, capable of wireless local-area communication, and low-power, versatile and inexpensive. In particular, recently, an Internet of Thing (IoT) sensor has been widely used to connect to the Internet by incorporating sensors and communication functions in objects.

Wireless sensor networks (WSNs) can be composed of nodes such as various wireless sensors and object internet sensors. Wireless sensor networks can monitor and monitor various status and environment information such as temperature, humidity, illumination and pressure using nodes without configuring a separate wired network. Wireless sensor networks are currently used for monitoring environmental conditions, structures and buildings, monitoring sewage networks, chemical processes, and energy plant abnormalities.

In this wireless sensor network, nodes use limited resources. Therefore, the node is limited in the use of resources such as processing, storage and battery.

To solve this problem, a wireless sensor network technique using a duty-cycle has been proposed. In a duty cycle wireless sensor network, each node may periodically switch between an active mode and a deactivation mode according to a time slot. And the node can receive the data packet that the other node delivers to the active mode. At this time, the node can broadcast the data packet to another node connected to the node regardless of the time slot.

In this connection, Korean Patent Laid-Open Publication No. 10-2015-0086736 (entitled "Method of controlling topology of wireless sensor network in vehicle") constitutes a topology between base stations and sensor nodes constituting a wireless sensor network When the sensor node receives a specific control command from the base station, it detects the remaining battery power of its own and then checks whether the detected remaining battery power is less than the reference value. If the detected remaining battery power is less than the reference value, the sensor node uses the neighboring node Thereby reconfiguring the topology.

SUMMARY OF THE INVENTION The present invention has been made to solve the above problems of the prior art and it is an object of the present invention to provide a system in a duty cycle wireless sensor network in which a broadcast backbone is set according to a duty transfer protocol in a duty cycle wireless sensor network system, And a transmission scheduling setting method in a duty-cycle wireless sensor network.

It should be understood, however, that the technical scope of the present invention is not limited to the above-described technical problems, and other technical problems may exist.

According to a first aspect of the present invention, there is provided a duty cycle wireless sensor network system including a base station and a plurality of nodes, wherein each node included in the plurality of nodes includes a duty- A rank is calculated through a message exchange with a neighboring node located within a predetermined transmission distance for each time slot, and the mobile station sets its role based on the calculated rank, and upon receiving a merge message corresponding to the base station, Based on the role, determine whether to include the broadcast backbone. In this case, the role includes a propagator and a radio wave propagator, a propagator is a node that transmits a message to a neighboring node in a specific time slot, a radio wave receiver is a node that receives a message from a radio wave in a specific time slot, And transmits the message to the neighboring node.

A node in the duty cycle wireless sensor network according to the second aspect of the present invention includes a communication module for exchanging data packets with a plurality of other nodes included in the duty cycle wireless sensor network, And a processor that executes the transmission protocol. At this time, according to the protocol, the processor calculates a rank by exchanging messages with a neighboring node located within a predetermined transmission distance for each time slot, sets its role based on the calculated rank, and transmits a merge message corresponding to the base station Upon receipt, based on its role, it determines whether to include a broadcast backbone, the role includes a propagator and a radio wave propagator, the propagator is a node that transmits a message to a neighboring node in a specific time slot, A broadcast backbone is a network composed of a plurality of nodes for receiving a message transmitted from a base station and delivering the message to a neighboring node.

According to a third aspect of the present invention, there is provided a method for establishing a transmission scheduling in a duty cycle wireless sensor network system, wherein each node included in a plurality of nodes is a neighboring node located within a predetermined transmission distance for each time slot according to a duty- Calculating a rank through a message exchange; Setting each node's role based on the calculated rank; And determining, when each node receives the merge message corresponding to the base station, whether or not to include a broadcast backbone based on its role, wherein the role includes a radio wave and a radio wave. In this case, the propagator is a node that transmits a message to a neighboring node in a specific time slot, the to-be-transmitted is a node that receives a message from a propagator in a specific time slot, and the broadcast backbone receives a message transmitted from the base station, And is a network composed of a plurality of nodes for communicating.

According to the duty transmission protocol, the present invention can perform data transmission around a node set as a propagator. Therefore, the present invention is effective in minimizing the total number of transmissions in a wireless sensor network system in which resources are limited.

1 is a block diagram of a duty cycle wireless sensor network system in accordance with an embodiment of the present invention.
2 is an exemplary diagram illustrating activation and deactivation of a node according to a time slot according to an embodiment of the present invention.
3 is an exemplary diagram of a duty cycle wireless sensor network according to an embodiment of the present invention.
4 is an illustration of a plurality of nodes included in a duty cycle wireless sensor network system according to an embodiment of the present invention.
5 is an illustration of a broadcast backbone of a duty cycle wireless sensor network system according to an embodiment of the present invention.
6 is a block diagram of a node in accordance with an embodiment of the present invention.
7 is a flowchart of a data packet exchange method in a duty cycle wireless sensor network system of the present invention.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings, which will be readily apparent to those skilled in the art. The present invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. In order to clearly illustrate the present invention, parts not related to the description are omitted, and similar parts are denoted by like reference characters throughout the specification.

Throughout the specification, when a part is referred to as being "connected" to another part, it includes not only "directly connected" but also "electrically connected" with another part in between . Also, when a part is referred to as "including " an element, it does not exclude other elements unless specifically stated otherwise.

1 to 6, a duty cycle wireless sensor network system 100 according to an embodiment of the present invention will be described.

1 is a block diagram of a duty cycle wireless sensor network system 100 according to an embodiment of the present invention.

The duty cycle wireless sensor network system 100 according to an exemplary embodiment of the present invention includes a plurality of nodes 110 for transmitting and receiving data packets. At this time, the node 110 may be a sensor and an Internet of Thing (IoT) sensor.

For example, the duty cycle wireless sensor network system 100 may be a matter-of-the-art Internet network including, but not limited to, a plurality of object Internet sensors 110.

The plurality of nodes 110 can transmit and receive data packets through a broadcast scheme. For example, the node 110 may receive a data packet broadcast by another connected node. In addition, node 110 may broadcast data packets to other connected nodes. At this time, the connected node may be a node within a predetermined transmission range.

Referring to FIG. 1, the duty cycle wireless sensor network system 100 can graphically represent a connection relationship E between a plurality of nodes 110 and each node 110 in an Euclidean plane. have.

Meanwhile, the duty cycle wireless sensor network system 100 may have a time slot in which each of the plurality of nodes 110 can receive a data packet. In this case, a time slot means an operation time and a non-operation time of a node set for each node. The time slot can be defined based on the fact that the execution time of the wireless network system is divided equally by the same interval. Also, the timeslot may be configured to be capable of transmitting and receiving data packets sufficiently.

For example, referring to FIG. 1, the size of a timeslot may be two. Therefore, the duty cycle of the time slot can be 50%.

2 is an exemplary diagram of activation and deactivation of a node 110 according to time slots according to an embodiment of the present invention. In FIG. 2, square brackets ('[', ']') denoted in each node 110 means a time slot allocated to each node.

Referring to FIG. 2 (a), in the time slot 0, the node 110 having the set time slot 0 is activated. The node 110 having the set time slot 1 can be deactivated. Thus, a node 110 with an activated time slot of zero can receive a data packet from another node to which it is connected.

Also, referring to FIG. 2B, when the time slot is changed to 1, the node 110 whose set time slot is 0 can be inactivated. And the node 110 having the set time slot of 1 can be activated. That is, the node 110 having the activated time slot 1 can receive the data packet from the connected other node.

On the other hand, any one of the plurality of nodes 110 may be a base station 120. The base station 120 may be a source node that transmits a data packet to another node among the plurality of nodes 110 or a target node that finally receives a data packet.

For example, if the base station 120 is the source node that initially forwards the data packet to another node 110, the base station 120 broadcasts a data packet to the connected other node 110 according to the network schedule . In addition, the node 110 receiving the data packet from the base station 120 may again broadcast the received data packet according to the network schedule. As described above, the wireless network sensor system can transmit data packets from the base station 120 to all the nodes 110 included in the wireless network sensor system through the network schedule. At this time, the network schedule may be a predetermined broadcast backbone with a transmission path set to minimize the total number of transmissions.

In order to set up the broadcast backbone, the node 110 calculates a rank through a message exchange with the neighbor node 110 by time slot according to a duty-transmission protocol. Then, the node 110 sets its role based on the calculated rank.

At this time, the role includes a dominator, a dominate, a candidate, and a connecter. Hereinafter, a node 110, which is a role propagator, is referred to as a propagator node, a node 110 to which a role is to be propagated as a recipient node, a node 110 to be a role candidate is referred to as a candidate node, Node.

A propagator node is a kind of message forwarder. Thus, the propagator node may be a node 110 that broadcasts a data packet to a neighboring node. Also, the to-be-propagated node is a node 110 that receives a data packet from a propagation node in a particular timeslot. The candidate is a node 110 in which a propagator or a radio wave is not set in the corresponding time slot, and the linker is a node 110 participating in a broadcast backbone among the to-be-transmitted nodes.

At this time, the propagation node can receive the data packet from another propagation node in a specific time slot. Therefore, the propagator node can be a propagator of another propagator node.

Once a role for each of the plurality of nodes 110 is established, the duty cycle wireless sensor network system 100 may generate a broadcast backbone for delivering data packets from the base station 120 to the plurality of nodes 110 have.

To this end, the base station 120 may broadcast a merge message. Upon receiving the merge message corresponding to the base station 120, the node 110 sets whether or not to include the broadcast backbone according to the role set in the corresponding node 110. The process of setting up the broadcast backbone will be described in detail with reference to FIG. 3 to FIG.

3 is an exemplary diagram of a duty cycle wireless sensor network according to an embodiment of the present invention.

The first to tenth nodes 305, 310, 315, 320, 325, 330, 335, 340, 345 and 350 excluding the base station 300 in the initial stage are candidates for their roles in all time slots Can be set. The first to tenth nodes 305, 310, 315, 320, 325, 330, 335, 340, 345, and 350 may determine their roles for each time slot.

At this time, the first to tenth nodes 305, 310, 315, 320, 325, 330, 335, 340, 345, and 350 may use the role message. For example, the role message may be a pair of "{Preamble message, Preemption message} ".

A propagator message is a message that notifies another node that a particular node has set itself as a propagator. In addition, the to-be-received message is a message that the node that has received the propagator message from the propagator sets itself as the to-be-transmitted and then transmits it to the other node.

Specifically, in a specific time slot, each candidate node can calculate its own rank. At this time, the rank can be calculated based on the number of activated neighbor candidates of each candidate node. Each candidate node can identify the role of the neighboring node through a beacon message exchange with the neighboring node.

For example, the rank of node v in any time slot i can be expressed as rank _i (v). Also, the number of neighbor nodes that are candidates of node v in any time slot i is represented by u _i (v), and a unique identifier of node v can be expressed by ID (v).

At this time, the node 110 can set itself as a propagation node if the number of neighboring candidate nodes connected thereto is close to that of the other node, and the distance from the base station 120 is close to that of the other node.

For example, if the relationship between the number of neighbor nodes of node v and node v is ( u _i (x) < u _i (v)), then the rank of node v may be set smaller than the rank of x node have. If the number of neighbor candidate nodes of node v and node x is the same ( u _i (x) = u _i (v)), the rank of the node with large identifier value can be set larger by comparing the identifier value of each node. At this time, the identifier of the node may be a distance from the base station.

When the rank of the node 110 is calculated, a candidate node having a rank of 0 among the nodes 110 can set its role of the corresponding timeslot as a propagator. And the node set as the propagator can broadcast the propagator message to the neighboring node.

The candidate node that has received the evoke message from another node can set its role of the corresponding timeslot as the propagated. And the node set as the to-be-transmitted can broadcast the to-be-transmitted message to the neighboring node. At this time, the to-be-evoked message may include the number of neighbor candidate nodes of the node set as the to-be-transmitted in the corresponding timeslot and the identifier of the node set as the to-be-transmitted.

The candidate node that has received the to-be-evolved message from the to-be-propagated node may update the rank based on the information contained in the message. And the candidate node can set its role based on the updated rank.

As such, the node 110 may set its role for all time slots until a propagator and a respondent are set.

Referring again to FIG. 3, the first to tenth nodes 305, 310, 315, 320, 325, 330, 335, 340, 345 and 350 may be candidate nodes in the initial stage.

In time slot 0, the second node 310 has the first node 305, the fifth node 325, and the sixth node 330 as neighboring candidate nodes. Also, the fourth node 320 has the first node 305, the second node 310, and the sixth node 330 as neighboring candidate nodes. At this time, u _i (second node) and u _i (fourth node) in time slot 0 can be 3. If the identifier value of the node closer to the base station 300 is smaller, the identifiers of the second node 310 and the fourth node 320 may be ID (second node) < ID (fourth node) . That is, the rank of the second node 310 may be smaller than that of the fourth node 320. Thus, the second node 310 may be a propagator node.

The second node 310 may set itself as a preamble in time slot 0 and broadcast a preamble message to the neighboring node. That is, the first node 305, the fifth node 325, and the sixth node 330 may receive a preamble message from the second node 310. Therefore, the first node 305, the fifth node 325, and the sixth node 330 may set their roles in the time slot 0 to the second node 310.

In addition, the seventh node 335 may set itself as a propagator in time slot 0 and broadcast a preamble message to the neighboring node. The ninth node 345, which has received the preamble message from the seventh node 335, may set its role in the time slot 0 as the propagator of the seventh node 335.

Through the same method, the first node 305 and the ninth node 345 in the time slot 1 can set themselves as a propagator. In addition, the neighboring candidate node receiving the propagation node of the first node 305 and the ninth node 345 may set its role as a propagator in the time slot 1.

4 is an illustration of a plurality of nodes 110 included in a duty cycle wireless sensor network system 100 according to an embodiment of the present invention.

Referring to FIG. 4, after each node sets a role in the duty cycle wireless sensor network system 100, the first node 305, the second node 310, the seventh node 335, and the ninth node 345 ) Can be set to a propagator node. In addition, the third node 315, the fourth node 320, the fifth node 325, the sixth node 330, the eighth node 340, and the tenth node 350 are set as the to-be- .

When the role setting of each node is terminated, the base station 300 may transmit a broadcast backbone setting message to a node connected to the base station 300 to set a broadcast backbone.

At this time, the broadcast backbone establishment message may be a pair of " {merge message, accept message} ". The merge message may be a message for joining a propagator node that is not included in the broadcast backbone. The merge message is set to be transmitted more than a predetermined number of hops for the broadcast backbone configuration. The grant message may also be the response message of the propagator node participating in the backbone.

Specifically, the broadcast backbone may include the base station 300 as an initial value. The base station 300 may broadcast the merge message.

The node 110 may wait for a merge message during a predetermined waiting timer. The predetermined waiting timer may be set in proportion to the number of nodes 110 included in the duty cycle wireless sensor network system 100 or the number of neighboring nodes of the node 110 waiting for the merge message.

When the node 110 receives the merge message, it can perform one of the following three operations.

First, in the case of a node that has not received a merge message previously, the node that transmitted the merge message can be set as an anchor node. The node then sets a wait timer and waits until it receives a merge message from the corresponding propagator node for that node

Second, if the node that received the merge message is a propagator node and the propagator of the node that sent the merge message, the node that received the merge message can participate in the broadcast backbone. To this end, the node receiving the merge message may send a grant message to the node that transmitted the merge message.

On the contrary, if the node receiving the merge message is a propagator node, but is not a receiver of the node that transmitted the merge message, the node receiving the merge message can update the predetermined anchor node to the node that transmitted the merge message.

Then, after transmitting the permission message or updating the anchor node, the node receiving the merge message can terminate the wait timer set for the node and broadcast the merge message.

Thirdly, when the wait timer is finally ended at all the nodes, the propagator node included in the duty cycle wireless sensor network system 100 can transmit the permission message to its anchor node.

At this time, the anchored node may be included in the anchor node. That is, when the to-be-broadcasted node receives the permission message from another node, the corresponding to-be-broadcasted node can set itself as a connector node. And the corresponding propagated node can participate in the broadcast backbone as a linker.

In this manner, the node 110 can transmit and receive the grant message corresponding to the merge message and the merge message until the set wait timer is completed, respectively. The node 110 may then determine whether to join the broadcast backbone based on the merge message and the grant message. Once it is determined to participate in the broadcast backbone, the node 110 may send its status to the base station 120.

When all the propagation nodes participate in the broadcast backbone, the base station 120 can terminate the process of setting up the broadcast backbone.

5 is an illustration of a broadcast backbone of a duty cycle wireless sensor network system 100 in accordance with an embodiment of the present invention.

For example, if the predetermined number of hops is three, the base station 300 may forward the merge message to the first node 305 and the second node 310. [ The first node 305 and the second node 310 may set the base station 300 as an anchor node and execute a wait timer.

In addition, the first node 305 receiving the merge message from the base station 300 may forward the merge message to the second node 310, the third node 315, and the fourth node 320, which are neighbor nodes . At this time, the second node 310 is a propagation node, and may be added to the broadcast backbone since it is a propagation node of the first node 305. Also, the second node 310 may send a grant message to the first node.

In this way, the first to tenth nodes 305, 310, 315, 320, 325, 330, 335, 340, 345, and 350 can determine whether to add to the broadcast backbone.

When the wait timer finally ends, the first node 305, the second node 310, the seventh node 335, and the ninth node 345, which are propagation nodes, can transmit the grant message to the anchor node. At this time, the fourth node 320, which is the anchor node of the seventh node 335, receives the permission message from the seventh node 335.

Since the fourth node 320 has received the grant message from the seventh node 335, which is a propagation node, it can set itself as a linker. And the fourth node 320 may be added to the broadcast backbone.

The first node 305, the second node 310, the seventh node 335, and the ninth node 345 and the fourth node 320 that is a connector are connected to the broadcast backbone according to the above- Can be added.

The finally generated broadcast backbone can be expressed in the form of a tree of nodes where the base station 300 is the root. Therefore, the base station 300 may be configured to transmit to all the nodes 305, 310, 315, 320, 325, 330, 335, 340, 345, 350 included in the duty cycle wireless sensor network system 100 based on the broadcast backbone Data packets can be transmitted.

On the other hand, if a broadcast backbone is configured in the duty cycle wireless sensor network system 100, the base station 120 may broadcast the data packet to the node 110 based on the configured broadcast backbone. In addition, the node 110 receiving the data packet corresponding to the base station may broadcast the data packet to the neighboring node based on the broadcast backbone.

6, a node 110 in a duty cycle wireless sensor network system 100 according to an embodiment of the present invention is described.

6 is a block diagram of a node 110 in accordance with one embodiment of the present invention.

The node 110 is included in the duty cycle wireless sensor network system 100 as described above with reference to FIG. At this time, the node 110 may be a sensor or a matter Internet sensor.

The node 110 includes a communication module 600, a memory 610, and a processor 620.

The communication module 600 may exchange data packets with a plurality of other nodes included in the duty cycle wireless sensor network 100.

The memory 610 stores a duty transfer protocol. At this time, the memory 610 collectively refers to a non-volatile storage device that keeps stored information even when power is not supplied, and a volatile storage device that requires power to maintain stored information.

The processor 620 calculates a rank by exchanging messages with neighboring nodes on a time slot basis according to a duty transfer protocol. At this time, the neighboring node is included in the predetermined transmission distance among the nodes included in the duty cycle wireless sensor network 100 and is connected.

The processor 620 sets its role based on the calculated rank. At this time, the role includes a spreader, a spreader, a candidate and a connector. A propagator is a node that transmits a message to a neighboring node in a specific time slot, and a to-be-transmitted is a node that receives a message from a propagator in a specific time slot.

Upon receiving the merge message corresponding to the base station 120, the processor 620 determines whether to include the broadcast backbone based on its role. At this time, the broadcast backbone is a network composed of a plurality of nodes for receiving a message transmitted from the base station 120 and delivering it to a neighboring node.

Referring to FIG. 7, a method of exchanging data packets in a duty cycle wireless sensor network system 100 according to an embodiment of the present invention will now be described.

7 is a flowchart of a data packet exchange method in the duty cycle wireless sensor network system 100 of the present invention.

Each node 110 included in a plurality of nodes included in the duty cycle wireless sensor network system 100 calculates a rank by exchanging messages with neighboring nodes according to a duty-to-transmission protocol in each time slot (S700). At this time, the neighboring node is another node included in the predetermined transmission distance with the node 110 that calculates the rank.

Then, the node 110 sets its role based on the calculated rank (S710). At this time, the role includes a spreader, a spreader, a candidate and a connector. A propagator is a node that transmits a message to a neighboring node in a specific time slot, and a to-be-transmitted is a node that receives a message from a propagator in a specific time slot.

Upon receiving the merge message corresponding to the base station 120, the node 110 determines whether to include the broadcast backbone based on the role (S720). At this time, the broadcast backbone is a network composed of a plurality of nodes for receiving a message transmitted from the base station 120 and delivering it to a neighboring node.

When the node 110 receives the message of the base station 120 from another node in a predetermined time slot after determining whether to include the broadcast backbone, the node 110 broadcasts the message of the base station to the neighboring node according to the broadcast backbone You can cast.

On the other hand, if the value of the rank calculated for a specific time slot is 0, the node 110 can set its role as a propagator. Also, the node 110 may broadcast a preamble message to the neighboring node.

In addition, the node 110 may set the role to be a participant when receiving a preamble message from a neighboring node. The node 110 may then broadcast a broadcast message to the neighboring node.

If the role of node 110 is to propagate and be a propagator of the node that delivered the merge message, You can decide to participate in the broadcast backbone. And the node 110 for which the broadcast backbone participation has been determined may broadcast the grant message corresponding to the merge message.

Alternatively, the node 110 can determine participation of the broadcast backbone as a linker when the role is self-propagating and receives the grant message corresponding to the merge message from the other node.

A method for establishing a transmission scheduling of a network system 100 in a duty cycle wireless sensor, a node 110 in a duty cycle wireless sensor, and a network system 100 in a wireless sensor according to an embodiment of the present invention, Accordingly, data can be transmitted around a node set as a propagator. Therefore, the transmission scheduling method of the network system 100 in the duty cycle wireless sensor, the node 110 in the duty cycle wireless sensor, and the network system 100 in the wireless sensor, Can be minimized.

One embodiment of the present invention may also be embodied in the form of a recording medium including instructions executable by a computer, such as program modules, being executed by a computer. Such a recording medium is a computer-readable medium, which may be any available medium that can be accessed by a computer, and includes both volatile and nonvolatile media, removable and non-removable media. The computer-readable medium may also include computer storage media, which may be volatile and / or non-volatile, implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, Nonvolatile, removable and non-removable media.

While the methods and systems of the present invention have been described in connection with specific embodiments, some or all of those elements or operations may be implemented using a computer system having a general purpose hardware architecture.

It will be understood by those skilled in the art that the foregoing description of the present invention is for illustrative purposes only and that those of ordinary skill in the art can readily understand that various changes and modifications may be made without departing from the spirit or essential characteristics of the present invention. will be. It is therefore to be understood that the above-described embodiments are illustrative in all aspects and not restrictive. For example, each component described as a single entity may be distributed and implemented, and components described as being distributed may also be implemented in a combined form.

The scope of the present invention is defined by the appended claims rather than the detailed description and all changes or modifications derived from the meaning and scope of the claims and their equivalents are to be construed as being included within the scope of the present invention do.

100: Duty Cycle Wireless Sensor Network System
110: node
120: Base station

Claims (15)

In a duty cycle wireless sensor network system,
Base station and
Comprising a plurality of nodes,
Each node included in the plurality of nodes calculates a rank through a message exchange with a neighbor node located within a predetermined transmission distance for each time slot according to a duty-
Sets its role based on the calculated rank,
Upon receiving a merge message corresponding to the base station, determining whether to include a broadcast backbone based on the role of the base station,
The rank of each node is calculated based on the identifier of each node and the number of neighboring nodes,
The identifier of each node is set based on the distance between each node and the base station,
Wherein the role includes a waveguide and a waveguide,
Wherein the propagator is a node that transmits a message to a neighboring node in a particular time slot,
Wherein the radio wave propagator is a node that receives the message from the propagator in the specific time slot,
Wherein the broadcast backbone is a network comprising a plurality of nodes for receiving a message transmitted from the base station and forwarding the message to the neighboring node. The method according to claim 1,
The role further comprises a candidate,
Wherein the candidate is a node that is not set to any one of the propagator and the to-be-transmitted in the specific time slot. The method according to claim 1,
Wherein each node is configured to set its role in the specific timeslot as a propagator and broadcast a preamble message to the neighboring node if the value of the rank computed for a particular timeslot is zero, system. The method according to claim 1,
Wherein each node, when receiving a preamble message from the neighboring node, sets its role as a to-be-propagated and broadcasts a to-be-broadcast message to the neighboring node. The method according to claim 1,
Each node determines its participation in the broadcast backbone if its role is to propagate and is a propagator of a node that has delivered the merge message,
And sends a grant message corresponding to the merge message to the node that delivered the merge message. 6. The method of claim 5,
Wherein the role further comprises a connector,
Wherein each of the nodes changes its role to a linker and determines participation of the broadcast backbone when the role of the node is determined to be a self-propagating radio wave and an authorization message corresponding to the merging message is received from another node, Sensor network system. The method according to claim 1,
Wherein each node broadcasts a message originating from the base station to the neighbor node according to the broadcast backbone upon receiving a message originating from the base station from another node in a predetermined time slot, system. A node in a duty cycle wireless sensor network,
A communication module for exchanging data packets with a plurality of other nodes included in the duty cycle wireless sensor network,
A memory for storing the duty transfer protocol; and
And a processor for executing the duty transfer protocol,
The processor calculates a rank by exchanging messages with a neighboring node located within a predetermined transmission distance for each time slot according to the protocol, sets its role based on the calculated rank,
Upon receiving a merge message corresponding to the base station, determining whether to include a broadcast backbone based on the role of the base station,
Wherein the rank is calculated based on an identifier and the number of neighboring nodes,
Wherein the identifier is set based on a distance from the base station,
Wherein the role includes a waveguide and a waveguide,
Wherein the propagator is a node that transmits a message to a neighboring node in a particular time slot,
Wherein the radio wave propagator is a node that receives the message from the propagator in the specific time slot,
Wherein the broadcast backbone is a network consisting of a plurality of nodes for receiving a message transmitted from the base station and forwarding the message to the neighboring node. A method for establishing transmission scheduling in a duty cycle wireless sensor network system,
Each node included in a plurality of nodes calculates a rank through a message exchange with a neighbor node located within a predetermined transmission distance for each time slot according to a duty-transfer protocol;
Setting each node's role based on the calculated rank; And
Determining whether to include a broadcast backbone based on its role when each node receives a merge message corresponding to the base station,
The rank of each node is calculated based on the identifier of each node and the number of neighboring nodes,
The identifier of each node is set based on the distance between each node and the base station,
Wherein the role includes a waveguide and a waveguide,
Wherein the propagator is a node that transmits a message to a neighboring node in a particular time slot,
Wherein the radio wave propagator is a node that receives the message from the propagator in the specific time slot,
Wherein the broadcast backbone is a network composed of a plurality of nodes for receiving a message transmitted from the base station and delivering the message to the neighboring node. 10. The method of claim 9,
Wherein the step of each node establishing a role based on the calculated rank comprises:
Setting a role of the node as a propagator in the specific time slot if the value of the rank calculated for each particular time slot is 0; And
Wherein the node having set its role as a propagator broadcasts a preamble message to the neighboring node. 10. The method of claim 9,
Wherein the step of each node establishing a role based on the calculated rank comprises:
Setting each of the nodes as a to-be-propagated when the node receives a preamble message from the neighboring node; And
Wherein the node having set its role as a to-be-propagated node broadcasts a to-be-broadcast message to the neighbor node. 10. The method of claim 9,
Wherein the determining whether to include the broadcast backbone comprises:
Determining whether to participate in the broadcast backbone if each node is a propagator of a node that has propagated its role and has delivered the merge message; And
Wherein the node having determined participation in the broadcast backbone transmits a grant message corresponding to the merge message to a node that has delivered the merge message. 13. The method of claim 12,
Wherein the role further comprises a connector,
Wherein the determining whether to include the broadcast backbone comprises:
Changing the role to a linker and determining participation of the broadcast backbone when each of the nodes plays the role of self-propagation and receives a grant message corresponding to the merge message from another node; How to set it up. 10. The method of claim 9,
The method of claim 1, further comprising: after each step of determining whether to include the broadcast backbone, when each node receives a message originating from the base station from another node in a predetermined time slot, Further comprising the step of broadcasting a message corresponding to the station. A computer-readable recording medium recording a program for performing the method according to any one of claims 9 to 14 on a computer.

Images