KR20080052034A - Method on beacon scheduling for wireless network with mesh functionality - Google Patents

Abstract

A method for avoiding beacon collision on a short wireless mesh network is provided to set a beacon transmission time among nodes differently for preventing the collision of beacons, thereby constructing a network configuration more stably. A beacon dedicated section is positioned in the front of a super frame capable of performing communication among all nodes. The size of the beacon dedicated section is variable. If a first sensor node receives the beacon of a coordinator to connect with a short wireless mesh network, the coordinator knows the existence of the first sensor node. The coordinator determines the beacon transmission time of the first sensor node avoiding its beacon transmission time and transmits the determined beacon transmission time to the first sensor node.

Description

Method for beacon collision avoidance for short-range wireless communication networks that support the mesh function {Method on beacon scheduling for wireless network with mesh functionality}

1 is an explanatory diagram showing a frame structure transmitted by a single node;

2 is an explanatory diagram showing a superframe positional relationship between parent and child nodes;

3 is an explanatory diagram showing a problem of data transmission according to the superframe position of FIG. 2;

4 is a configuration diagram showing a first wireless network environment;

5 is an explanatory diagram showing a beacon transmission time in FIG. 4 according to the prior art;

6 is a configuration diagram illustrating a second wireless network environment;

7 is an explanatory diagram showing a beacon transmission time in FIG. 6 according to the prior art;

8 is an explanatory diagram of a first embodiment showing a beacon collision avoidance method according to the present invention;

9 is an explanatory diagram of a second embodiment showing a beacon collision avoidance method according to the present invention;

10 is an explanatory diagram of a third embodiment showing a beacon collision avoidance method according to the present invention;

11 is an explanatory diagram of a fourth embodiment showing a beacon collision avoidance method according to the present invention;

12 is a configuration diagram illustrating a third wireless network environment having a deep location;

13 is an explanatory view of a fifth embodiment showing a beacon collision avoidance method according to the present invention.

* Explanation of symbols on the main parts of the drawing

10: sink node (coordinator) 11 ~ 19: sensor node

The present invention relates to a beacon collision avoidance method for a short range wireless communication network supporting a mesh function and a computer readable recording medium recording a program for realizing the method, and to a short range wireless communication supporting a mesh function. A new node by configuring a beacon dedicated section used for beacons and data transmission to prevent beacon collision between nodes in the network between the sink node (coordinator) and the sink node, between the sink node and the sensor node, and between the sensor node and the sensor node. The present invention relates to a beacon collision avoidance method that can prevent beacon collision between nodes that occur when a user wants to participate in a network, and a computer-readable recording medium that records a program for realizing the method.

Currently, as objects and physical objects scattered in the living environment are gradually expanded to information, Ubiquitous Computing provides various new and convenient services by organically connecting humans, computers, and objects. Attention is rising.

The ubiquitous computing environment starts from embedding computing, sensing, and communication functions in all things, and sensor network technology that performs sensing and control of the external environment of human beings is in the spotlight as a core technology.

In other words, Ubiquitous Sensor Network (USN) is to attach electronic tags to all things to recognize things and environment and to build and utilize real-time information through the network.

Sensor networks occupy an important place in the reality of the ubiquitous era. In particular, the construction of ubiquitous networking environment in the home is very important because the ubiquitous networking in the home will provide a great motive for building the national infrastructure.

Among the ubiquitous networking technologies, wireless communication technology is more suitable for the ubiquitous era than wired technology.

Short-range wireless communication network is one of the core technology for ubiquitous network where people, computers and things are connected together, and it plays a role of combining sensor network environment and physical real environment.

Short-range wireless communication can take charge of such technology, and the short-range wireless communication network has advantages such as a transmission range within 10m, low power consumption, and a small size enough to be mounted on a sensor.

1 is an explanatory diagram showing a frame structure transmitted by one node (frame structure of a single beacon wireless communication device), and shows a transmission interval 1a of a beacon sent by one node.

One sensor node has a section 1b for transmitting and receiving data after transmitting a beacon, and then has an inactive section (sleep section) 1c to reduce power consumption. At this time, the interval is constant and is equally applied to the next beacon transmission, data transmission / reception, and inactivity section (sleep section). That is, the beacon transmission section 1a, the data transmission / reception section 1b, and the inactivity section 1c are repeated at regular intervals.

In the inactivity section 1c of this sensor node, data can be transmitted, but not received, and beacon transmission is required when connecting the sensor node below itself when the beacon transmission is at the end of the network configuration. In this case, the beacon transmission time is not required after a certain time.

FIG. 2 is an explanatory diagram illustrating a superframe positional relationship between parent and child nodes, and illustrates a beacon transmission situation occurring when beacon transmission between nodes. That is, the beacon transmission situation (parent-child superframe position relationship) between the two sensor nodes that occur when the beacon transmission between the sensor node 1 and the sensor node 2 is shown. The term 'super frame' refers to a large period in which communication between nodes is possible.

Sensor node 1 transmits beacons to sensor node 2, and sensor 2 receives the beacon transmission time of sensor node 1 based on the beacons of sensor 1 received. Calculate your beacon transmission time by adding a certain fixed value. At this time, the calculated beacon transmission time of the sensor node 2 is adjusted so as not to overlap with the transmission time of the sensor node 1.

That is, the sensor node 1 transmits a beacon to the sensor node 2 and transmits a time slot to the sensor node 2 until the next beacon is transmitted. In order to avoid the beacon transmission collision with the sensor node 1, the sensor node 2 receives its beacon at the beginning of the section not used by the sensor node 1.

When the beacon transmission time is configured and communicated in this manner (the beacon transmission method between the two sensor nodes in FIG. 2), if the depth between the sensor nodes becomes deep, the inefficiency of the data transmission shown in FIG. 3 appears.

That is, as shown in FIG. 3, in a network configuration in which the depth of the sensor node is 5, if the sensor node 5 attempts to transmit data to the sensor node 1, the sensor node 4 sends data sent by the sensor node 5. The data should be sent in a period that can be received. Since the data receivers of sensor node 4 have already passed, it is necessary to wait until the receivers of the sensor nodes 4 times come again. Since the data must be sent to the sensor node, the transmission time increases overall.

An example of a wireless network environment constructed based on the schemes of FIGS. 1 and 2 is shown in FIG. 4.

In FIG. 4, the coordinator (sink node) 10 has the sensor node 11 and the sensor node 12 in its communication range 4a within its communication range 4a, and the sensor node 11 has 3 Sensor nodes 13 and 14 are placed within their communication range 4b, and sensor node 12 has 5 and 6 sensor nodes 15 and 16 as its communication range 4c. In short, we constructed short-range wireless communication network environment.

In the network environment configured as described above, if the beacon transmission time is set in the manner as shown in FIG.

As shown in FIG. 5, when the first and second sensor nodes 11 and 12 receive the beacons sent by the coordinator (sink node) 10, the first and second sensor nodes 11 and 12 themselves. Since their communication ranges 4a and 4b are not visible to each other (nodes do not overlap), the beacon transmission time of the coordinator (sink node) 10 is spaced 5a by the same time, and then their beacons are transmitted. Looks like a form.

In this case, since the beacon transmission times of the first and second sensor nodes 11 and 12 are the same, since they are not within their own ranges 4b and 4c as described above (nodes do not overlap), 1 In the same beacon transmission time in sensor nodes 11 and 12, for connection and data transmission between sensor nodes 13 and 14 and sensor nodes 15 and 16, respectively. Sending a beacon is not a big problem. That is, even if the beacon transmission times of the first and second sensor nodes 11 and 12 are the same, since the communication ranges are different, the beacon transmission data does not collide with the beacon transmission.

However, as shown in FIG. 6, when the sensor node 17 appears to be newly connected, a collision problem of the beacon transmission data may occur.

In FIG. 6, sensor node 17 is within the range 4a of coordinator (sink node) 10, and sensor 1, 2, 4 and 5 are within range 6a of sensor node 7. Sensor nodes 11, 12, 14 and 15 are included. In the network environment configured as described above, if the beacon transmission time is set in the manner as shown in FIG.

As shown in FIG. 7, the sensor node 17 receives the beacon of the coordinator (sink node) 10 and calculates its own beacon transmission time. Therefore, the beacon transmission time of the sensor node 17 of the seventh sensor 17 is calculated. 1 and 2 will be transmitted at the same time as the sensor nodes (11, 12). When configured in this way, the communication between the coordinator (sink node) 10 and the sensor nodes 11, 12, 17 of the first, second, and seven times only receives the beacon transmission time of the coordinator (sink node) 11. Therefore, there is no problem in communication.

However, if the sensor node 17 is generated in a network configured as shown in FIG. 4, a problem of beacon collision occurs and communication cannot be started.

Because, as shown in FIG. 6, the communication range 6a of the seventh sensor node 17 includes the fourth and fifth sensor nodes 14 and 15, and the beacon transmission time of the seventh sensor node 17 is Since the first and second sensor nodes 11 and 12 are the same, if the first, second and seven sensor nodes 11, 12 and 17 transmit beacons simultaneously (that is, the beacon transmission time is the same) When beacon transmission data is transmitted), beacon transmission data of sensor nodes 12 and 17 are transmitted to sensor node 14, and sensor nodes 2 and 7 are transmitted to sensor node 15, respectively. Since the beacon transmission data of (12, 17) are transmitted simultaneously, a collision occurs between the beacon transmission data. As a result, the already configured network is broken and there is a problem that communication is impossible.

The present invention has been proposed to solve the above problems, and to prevent the beacon collision between the nodes and the breakage of the network that occurs when a new node attempts to join the network in the established network, the beacon collision avoidance method and the It is an object of the present invention to provide a computer-readable recording medium having recorded thereon a program for realizing the method.

Other objects and advantages of the present invention can be understood by the following description, and will be more clearly understood by the embodiments of the present invention. Also, it will be readily appreciated that the objects and advantages of the present invention may be realized by the means and combinations thereof indicated in the claims.

In order to achieve the above object, the present invention provides a beacon collision avoidance method for a beacon collision avoidance method when a new node joins a network in a short-range wireless communication network supporting a mesh function. Beacon dedicated section configuration step of setting; A beacon transmission time allocating step of a sink node (coordinator) calculating a beacon transmission time of lower nodes currently connected to the beacon dedicated section and differently assigning a beacon transmission time for each node; And a beacon transmission time transmission step of transmitting, by the sink node (coordinator), the allocated beacon transmission time to the currently connected subordinate nodes.

In addition, the present invention is characterized by further comprising the step of returning the beacon transmission time of the node located at the outermost position on the network configuration.

The present invention may further include the step of the sink node (coordinator) deleting the beacon transmission time of the returned outermost node within the beacon dedicated section.

The present invention may further include assigning, by the sink node (coordinator), the beacon transmission time of the returned outermost node to a node requiring the beacon transmission time.

In addition, the present invention, if a beacon transmission time of the returned outermost node is not allocated to a node requiring the beacon transmission time for a predetermined time, the beacons remaining by the sink node (coordinator) rearranges the beacon dedicated section Characterized in that further comprises the step of reconfiguring without a dedicated time.

In addition, the present invention is characterized in that each node further comprises the step of transmitting the beacon transmission data based on the beacon transmission time set to it.

Meanwhile, the present invention provides a method for avoiding beacon collision when a new node joins a network in a short range wireless communication network supporting a mesh function, the method comprising: setting a beacon dedicated section in a period (superframe) in which all nodes can communicate. ; Storing, by a lower node, beacon transmission time information of an upper hop node connected with the lower node and its neighbor node in the beacon dedicated section; And determining, by the lower node, its beacon transmission time on the basis of the beacon transmission time information, and transmitting beacon transmission data.

In addition, the present invention provides a method for avoiding beacon collision when a new node joins a network in a short range wireless communication network supporting a mesh function, the method comprising: setting a beacon dedicated section in a period (superframe) in which all nodes can communicate. ; A step in which a sink node (coordinator) calculates beacon transmission time of lower nodes currently connected to the beacon dedicated section and allocates beacon transmission time differently for each node; Transmitting, by the sink node (coordinator), the allocated beacon transmission time to the currently connected lower nodes; Returning a beacon transmission time of the node located at the outermost part of the network configuration; And deleting, by the sink node (coordinator), the beacon transmission time of the returned outermost node in the beacon dedicated section, reconfiguring the beacon transmission time of the beacon dedicated section, and transmitting the reconstructed beacon transmission time to the currently connected lower nodes. Characterized in that made.

On the other hand, the present invention, in the short-range wireless communication network supporting the mesh function, in order to avoid beacon collision avoidance when a new node joins the network, a period during which all nodes can communicate with the beacon collision avoidance apparatus having a processor (super A beacon dedicated section in a frame); A function of assigning a beacon transmission time differently for each node by calculating a beacon transmission time of lower nodes currently connected to the beacon dedicated section by a sink node (coordinator); And a computer-readable recording medium having recorded thereon a program for the sink node (coordinator) to realize the function of transmitting the allocated beacon transmission time to the currently connected lower nodes.

In addition, the present invention provides a beacon collision avoidance apparatus with a processor for avoiding beacon collision when a new node joins the network in a short-range wireless communication network supporting a mesh function. A beacon dedicated section; Storing beacon transmission time information of an upper hop node and a neighbor node of a lower node connected to the lower node in the beacon dedicated section; And a computer-readable recording medium having recorded thereon a program for realizing a function of transmitting beacon transmission data by determining a beacon transmission time of the lower node based on the beacon transmission time information.

The present invention aims to set and control the beacon transmission time of nodes transmitting beacons for smooth data transmission between nodes in a network.

To this end, the present invention establishes a beacon dedicated section (beacon management section) for transmitting only beacons in order to avoid the beacon collision in communication between each node in a personal wireless networking environment, each node is actively configured to each node By presenting a method for setting the time (beacon transmission time) for the transmission of these beacons, the stability of data transmission in wireless communication is achieved. In addition, using this beacon dedicated section, we propose a more stable and easy network extension when transmitting more than one hop between nodes and when transmitting data to a node within a range that the node cannot cover.

Therefore, in the present invention, a beacon dedicated section is provided at the very beginning of a large period (superframe) in which all nodes can communicate. The size of this beacon dedicated section is variable. In addition, when the beacon dedicated section is reduced, the beacon dedicated section is maintained until three repetitions. This beacon dedicated section handles the beacon transmission time of all nodes and avoids beacon collision.

The above objects, features and advantages will become more apparent from the following detailed description taken in conjunction with the accompanying drawings, whereby those skilled in the art may easily implement the technical idea of the present invention. There will be. In addition, in describing the present invention, when it is determined that the detailed description of the known technology related to the present invention may unnecessarily obscure the gist of the present invention, the detailed description thereof will be omitted. Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings.

First, assume that a network environment as shown in FIG. 6 is created. Hereinafter, each node 10 to 17 may be a short range wireless communication network device.

In FIG. 6, it is assumed that the order in which the sensor nodes 11 to 17 are connected to the coordinator (sink node) 10 is 'Arabic numeral order'.

First, the coordinator (sink node) 10 continuously transmits a beacon to know if there are sensor nodes 11 to 17 to be connected to it.

Here, referring to the setting (generation) process of the coordinator 10, the first sensor node 10 broadcasts a beacon and sequentially scans available frequency channels to find a sensor node to which it is connected. At this time, it is determined by the beacon received in each frequency channel. If it is determined that there is no connectable sensor node to which it is connected (i.e. no beacon is received for all frequency channels), then the original sensor node 10 will provide coordination for the new sensor network. (Network coordinator function). The coordinator (sink node) 10 selects its own address value (sensor ID), sets parameters for a new network, and broadcasts the corresponding network information including its own address value in a beacon. Here, a 16-bit address is used as the address value.

As such, the coordinator (sink node) 10 sets parameters for a new network, and then broadcasts the corresponding network information including its own address value in a beacon.

Thereafter, the sensor nodes 11 to 17 also search (scan) whether there is a sensor node to which they are connected, and participate in the network through the connection with the coordinator (sink node) 10. At this time, participation in the network can be established by assigning a unique address value to the coordinator (sink node) 10 to the sensor nodes 11 to 17, and most sensors except the coordinator (sink node) 10. Nodes 11 and 12 are both child nodes and parent nodes (because the depth between sensor nodes can be deep in a short-range wireless communication network environment with hierarchical mesh structure). . However, the lowest nodes 13-17 do not have any child node.

As the sensor nodes 11 to 17 participating in the network increase vertically, the network tree also increases gradually. At this time, the size of the network is determined by the number of hops from the coordinator (sink node) 10 to the outermost sensor nodes 13 to 17, which is defined as the network depth level. For example, a sensor l node n hops away from the coordinator (sink node) 10 becomes a node having a depth level of "n". However, the coordinator (sink node) 10 has a depth level of "0" because it corresponds to the reference point.

The network configuration by the new sensor nodes 11 to 17 is made by assigning a unique address value to the corresponding sensor node through a connection connection process.

In this process, the present invention relates to the beacon transmission time between nodes.

To this end, a 'beacon dedicated section' is placed at the very beginning of a large period (superframe) in which all nodes can communicate. The size of this beacon dedicated section is variable. In addition, when the beacon dedicated section is reduced, the beacon dedicated section is maintained until three repetitions. This beacon dedicated section handles the beacon transmission time of all nodes and avoids beacon collision.

8 shows the beacon transmission time in the beacon dedicated section between the coordinator (sink node) 10 and the first sensor node 11.

As shown in FIG. 8, when the first sensor node 11 receives a beacon of the coordinator (sink node) 10 and is connected, the coordinator (sink node) 10 is connected to the first sensor node 11. The existence of the beacon is determined, and the beacon transmission time of the sensor node 11 is determined and transmitted to the node 1 by avoiding its beacon transmission time.

FIG. 9 illustrates that the coordinator (sink node) 10 allocates the beacon transmission time of each of the sensor nodes 11 to 14 to the beacon dedicated section up to the sensor node 14 as shown in FIG. 8.

That is, the coordinator (sink node) 10 checks each of the sensor nodes 11 to 14 that are sequentially (connected) sequentially so that the beacon transmission time of the sensor nodes 11 to 14 that are currently connected is different. It is set and transmitted to the sensor node. At this time, the beacon transmission time of each sensor node managed by the coordinator (sink node) 10 in the beacon dedicated section may manage the beacon transmission time of the sensor nodes connected in one hop, or two hops. It is also possible to manage the beacon transmission time of the sensor nodes over the above distance.

At this time, the sensor nodes 13 and 14 that are not included in the communication range 4a of the coordinator (sink node) 10 are connected to the sensor node 11 connected to the coordinator (sink node) 10. The beacon transmission time of the 13,14 is transmitted, and the sensor node 11 transmits the beacon transmission time to the sensor nodes 13 and 14 connected thereto. Therefore, the beacon transmission time can be set and transmitted also to the sensor nodes 13 and 14 which are not in the communication range 4a of the coordinator (sink node) 10. FIG.

However, as described above, since the beacon transmission time is not required in the sensor nodes (outermost sensor nodes) 13 and 14 at the far end, it is preferable that the outermost sensor nodes 13 and 14 return the beacon transmission time. Therefore, in FIG. 10, since the third sensor node 13 is connected before the fourth sensor node 14, the third sensor node 13 returns the beacon transmission time by sequential calculation.

After the beacon transmission time of the third sensor node 13 is returned, if the fifth sensor node 15 is generated (connected) as shown in FIG. 6, the coordinator (sink node) 10 is as shown in FIG. 10. As described above, the beacon transmission time of sensor no. 5 is allocated to beacon transmission time of sensor no.

However, the beacon transmission time of the returned sensor node does not necessarily need to be assigned to the sensor node requiring the beacon transmission time. That is, the beacon transmission time of the returned sensor node is left as it is, and the beacon transmission time of the newly connected sensor node is continuously generated. However, in order to increase the efficiency of the beacon dedicated section, it would be more desirable to allocate the beacon transmission time vacated in the beacon dedicated section to the node requiring the beacon transmission time. Nevertheless, the coordinator (sink node) 10, if the beacon transmission time vacated in the beacon dedicated section has not been allocated to any sensor node for a certain time, the beacon transmission remaining by rearranging the beacon dedicated section for the efficiency of the beacon dedicated section. Rebuild without time.

According to this method, the 4th sensor node 14 which is the outermost sensor node also does not need a beacon transmission time, and the 4th sensor node 14 returns the beacon transmission time.

At this time, if the sixth sensor node 16 is generated (connected) as shown in FIG. 6, the coordinator (sink node) 10 returns the sixth sensor node 16 to the beacon transmission time of the fourth sensor node 14 returned. Beacon transmission time is allocated.

However, since the fifth sensor node 15 is located at the outermost part, the fifth sensor node 15 also does not need a beacon transmission time, and as shown in FIG. 11, the fifth sensor node 15 also has a beacon transmission time. Will be returned.

At this time, if node 7 is generated (connected) as shown in FIG. 6, the coordinator (sink node) 10 returns the beacon of the sensor node 17 to the beacon transmission time of the sensor node 15 that has returned 5. The transmission time is allocated and transmitted.

However, if sensor node 17 is assumed to have been created (connected) before sensor nodes 5 and 6, 15 and 16, return the beacon transmission time to coordinator (sink node) 10, then The coordinator (sink node) 10 will adjust so that the beacon transmission time of sensor node 17 is located behind sensor node 16.

As such, even when a node having a certain range is generated at a certain location by using a beacon dedicated section, the coordinator (sink node) 10 centrally manages the beacon transmission time of each sensor node 11 to 17 to beacon the beacon. It is possible to prevent collisions and thus to stabilize network configuration.

However, the deeper the depth from the coordinator (sink node) 10 to the outermost sensor node, which is not the low number of nodes in the case as shown in FIG. 6, from the coordinator (sink node) 10 to the outermost sensor node. In order to prevent transmission efficiency deterioration due to transmitting all beacon transmission times to all, it should be configured in conjunction with the network as shown in FIG.

As shown in FIG. 12, assuming that the state is sequentially configured in order from the coordinator (sink node) 10, sensors 4 and 8 according to generation of the 9th sensor node 19 using a beacon dedicated section. Without fear of beacon collisions with sensor nodes 13 and 17 with nodes 14 and 18, either sensor node 12 or sensor node 16 using beacon-only segments It will be connected to the 'node that sent the beacon to sensor node 19 first.'

However, for example, if all the sensor nodes that extend in a very deep position with a depth value of '10' are listed in the beacon dedicated section, it will not only take much time for the network to be connected through beacon collision avoidance, A situation may arise in which the interval for transmitting data is very small, which is very large.

Therefore, all sensor nodes have beacon transmission time information of beacon dedicated sections using beacon collision avoidance information of sensor nodes up to two hops connected to each other (that is, neighboring sensor nodes of each upper hop sensor node). .

That is, as shown in FIG. 13, each sensor node having a deep depth value stores, for example, beacon transmission time information of up to two hop nodes (i.e., each top hop node and its neighbor nodes) in a beacon dedicated section. To do it. This means that in FIG. 12, for example, the beacons of up to two hops (i.e., each top hop node and its neighbors) through the scanning process after the first sensor node 11 with a depth value of "10" are connected. After searching for the transmission time information, the second sensor node 12 having a depth value "11" connected to the first sensor node 11 is scanned to a higher node up to two hops including the first sensor node 11 through a scanning process. (I.e., beacon transmission time information of each upper hop node and its neighbors), and then the sensor node 13 of the depth value "12" connected to the second sensor node 12 is scanned through the scanning process. The beacon transmission time information of the first sensor node 11 and the second sensor node 12 is searched, and finally, the fourth sensor node 14 of the depth value “13” connected to the third sensor node 13 is scanned. Through the process, beacon transmission time information of sensor node 12 and sensor node 13 is searched for and stored in the beacon dedicated section. it means.

Assuming that the beacon transmission period up to two hops is known, it means that the sensor node 13 knows the beacon transmission time to the sensor node 11, and the sensor node 14 is This means that the beacon transmission time to the second sensor node 12 is known.

Therefore, if any sensor node with a deep depth value knows the beacon transmission time information of up to two hops (ie, each of the top hop nodes and their neighbors), the sensor node can determine the beacon transmission time of the higher nodes. By avoiding the transmission of beacon transmission data by determining its own beacon transmission time, collision of beacon transmission data can be avoided.

In the arrangement of sensor nodes as shown in FIG. 13, although the second and fourth sensor nodes 12 and 14 transmit data to the third node node 13, the beacon transmission time of a certain sensor node may be used. The beacon collision does not occur using the section, and even if the beacon is transmitted using different beacon dedicated sections as shown in the drawing, the beacon collision does not occur.

In addition, even if the generation of a sensor node of a deeper position or neighboring sensor nodes of the same depth of the sensor nodes are generated, this also can be used to avoid beacon collision by using a beacon dedicated section.

As described above, the method of the present invention may be implemented as a program and stored in a recording medium (CD-ROM, RAM, ROM, floppy disk, hard disk, magneto-optical disk, etc.) in a computer-readable form. Since this process can be easily implemented by those skilled in the art will not be described in detail any more.

The present invention described above is capable of various substitutions, modifications, and changes without departing from the technical spirit of the present invention for those skilled in the art to which the present invention pertains. It is not limited by the drawings.

In the present invention as described above, beacon dedicated section can be configured to avoid the beacon collision, in particular, only the beacon transmission time of each node up to its own two hops, if necessary to improve the transmission efficiency as the depth of the node deepens By doing so, the beacon transmission time between each node can be set differently, thereby preventing the beacon collision.

By doing so, the beacon collision does not occur, and there is an advantage that the network configuration can be more stably constructed.

Claims (19)

A beacon collision avoidance method when a new node joins a network in a short range wireless communication network supporting a mesh function, A beacon dedicated section construction step of setting a beacon dedicated section in a period (superframe) in which all nodes can communicate; A beacon transmission time allocating step of a sink node (coordinator) calculating a beacon transmission time of lower nodes currently connected to the beacon dedicated section and differently assigning a beacon transmission time for each node; And Beacon transmission time transmission step of the sink node (coordinator) transmits each of the allocated beacon transmission time to the currently connected lower nodes Beacon collision avoidance method for a short-range wireless communication network supporting a mesh function including a. The method of claim 1, The beacon transmission section, A beacon collision avoidance method for a short range wireless communication network supporting a mesh function, characterized in that the size is variable. The method of claim 1, When the beacon transmission section is reduced, A beacon collision avoidance method for a short range wireless communication network supporting a mesh function, characterized in that it is maintained until three iterations. The method of claim 1, The sink node (coordinator), A beacon collision avoidance method for a short range wireless communication network supporting a mesh function, characterized in that the beacon transmission time of the nodes connected within one hop is managed in the beacon dedicated section. The method of claim 1, The sink node (coordinator), A beacon collision avoidance method for a short range wireless communication network supporting a mesh function, characterized in that the beacon transmission time of the nodes having a distance of more than two hops within the beacon dedicated section. The method of claim 5, wherein The beacon transmission time transmission step, Each of the allocated beacons is transmitted in such a manner that the sink node (coordinator) transmits the allocated beacon transmission time to the first sub-node connected to it, and transmits the allocated beacon transmission time to the second sub-node connected to the first sub-node. A beacon collision avoidance method for a short range wireless communication network supporting a mesh function, characterized in that the transmission time transmission. The method according to any one of claims 1 to 6, Returning the beacon transmission time of the node located at the outermost part of the network configuration Beacon collision avoidance method for a short-range wireless communication network supporting a mesh function further comprising. The method of claim 7, wherein The sink node (coordinator) deleting the beacon transmission time of the returned outermost node in the beacon dedicated section; Beacon collision avoidance method for a short-range wireless communication network supporting a mesh function further comprising. The method of claim 8, Assigning, by the sink node (coordinator), the beacon transmission time of the returned outermost node to a node requiring the beacon transmission time Beacon collision avoidance method for a short-range wireless communication network supporting a mesh function further comprising. The method of claim 9, For a predetermined time, if the beacon transmission time of the returned outermost node is not allocated to the node requiring the beacon transmission time, the sink node (coordinator) reorganizes the beacon dedicated period to reconfigure so that there is no remaining beacon dedicated time. step Beacon collision avoidance method for a short-range wireless communication network supporting a mesh function further comprising. The method of claim 10, Transmitting each beacon transmission data based on the beacon transmission time set for each node Beacon collision avoidance method for a short-range wireless communication network supporting a mesh function further comprising. The method according to any one of claims 1 to 6, Sub-nodes of the second sub-node, For a short-range wireless communication network supporting a mesh function, the beacon transmission time information of the upper node (that is, each upper hop node and its neighbor node) up to a predetermined hop connected to the memory is stored in the beacon dedicated section. Beacon Collision Avoidance. The method of claim 12, The predetermined hop, A beacon collision avoidance method for a short range wireless communication network supporting a mesh function, characterized in that it is at least two hops. The method of claim 13, Sub-nodes of the second sub-node, Sending beacon transmission data at the beacon transmission time by determining the beacon transmission time by avoiding the beacon transmission time information of the upper node (that is, each upper hop node and its neighbor node) up to a predetermined hop connected to the self. A beacon collision avoidance method for a short range wireless communication network supporting a mesh function. A beacon collision avoidance method when a new node joins a network in a short range wireless communication network supporting a mesh function, Setting a beacon dedicated section in a period (superframe) in which all nodes can communicate; Storing, by a lower node, beacon transmission time information of an upper hop node connected with the lower node and its neighbor node in the beacon dedicated section; And Transmitting, by the lower node, beacon transmission data by determining its beacon transmission time based on the beacon transmission time information; Beacon collision avoidance method for a short-range wireless communication network supporting a mesh function including a. The method of claim 15, The beacon transmission time information, A beacon collision avoidance method for a short range wireless communication network supporting a mesh function, characterized in that the lower node is beacon transmission time information of the upper node up to two hops connected to it. A beacon collision avoidance method when a new node joins a network in a short range wireless communication network supporting a mesh function, Setting a beacon dedicated section in a period (superframe) in which all nodes can communicate; A step in which a sink node (coordinator) calculates beacon transmission time of lower nodes currently connected to the beacon dedicated section and allocates beacon transmission time differently for each node; Transmitting, by the sink node (coordinator), the allocated beacon transmission time to the currently connected lower nodes; Returning a beacon transmission time of the node located at the outermost part of the network configuration; And The sink node (coordinator) deleting the beacon transmission time of the returned outermost node in the beacon dedicated section, reconfiguring the beacon transmission time of the beacon dedicated section, and transmitting to the currently connected lower nodes Beacon collision avoidance method for a short-range wireless communication network supporting a mesh function including a. In a beacon collision avoidance apparatus having a processor for avoiding beacon collision when a new node joins a network in a short range wireless communication network supporting a mesh function, A function of setting a beacon dedicated section in a period (superframe) in which all nodes can communicate; A function of assigning a beacon transmission time differently for each node by calculating a beacon transmission time of lower nodes currently connected to the beacon dedicated section by a sink node (coordinator); And The sink node (coordinator) transmits the allocated beacon transmission time to the currently connected lower nodes A computer-readable recording medium having recorded thereon a program for realizing this. In a beacon collision avoidance device having a processor for avoiding beacon collision when a new node joins a network in a short range wireless communication network supporting a mesh function, A function of setting a beacon dedicated section in a period (superframe) in which all nodes can communicate; Storing beacon transmission time information of an upper hop node and a neighbor node of a lower node connected to the lower node in the beacon dedicated section; And The lower node transmits beacon transmission data by determining its beacon transmission time based on the beacon transmission time information. A computer-readable recording medium having recorded thereon a program for realizing this.

Images