JP2023150833A - Information terminal, communication system, and information processing method - Google Patents

Abstract

To provide an information terminal that can support setting work for constructing a hierarchical mesh network.SOLUTION: An information terminal 30 includes an information processing unit 34 for executing information processing to construct a hierarchical mesh network. The hierarchical mesh network includes a plurality of lower mesh networks, and an upper mesh network that is configured by management nodes belonging to the plurality of lower mesh networks. The information processing unit 34 acquires arrangement information indicating the arrangement of a plurality of nodes 20 each belonging to one of the plurality of lower mesh networks and determines a plurality of management nodes from among the plurality of nodes 20 on the basis of the acquired arrangement information.SELECTED DRAWING: Figure 1

Description

The present invention relates to an information terminal, a communication system, and an information processing method.

Patent Document 1 discloses a lighting control device that communicates with lighting equipment via a network.

JP 2017-59492 Publication

The present invention provides an information terminal and the like that can support setting work for constructing a hierarchical mesh network.

An information terminal according to an aspect of the present invention includes an information processing unit that executes information processing for constructing a hierarchical mesh network, and the hierarchical mesh network includes a plurality of first mesh networks and a plurality of first mesh networks. a second mesh network configured by management nodes belonging to each of the plurality of first mesh networks; information is acquired, and a plurality of management nodes are determined from among the plurality of nodes based on the acquired arrangement information.

A communication system according to one aspect of the present invention includes the information terminal and the plurality of nodes.

An information processing method according to one aspect of the present invention is an information processing method executed by a computer for constructing a hierarchical mesh network, wherein the hierarchical mesh network includes a plurality of first mesh networks, The information processing method includes a second mesh network configured of management nodes belonging to each of the plurality of first mesh networks, and the information processing method includes arranging a plurality of nodes, each of which belongs to one of the plurality of first mesh networks. The plurality of management nodes are determined from among the plurality of nodes based on the obtained arrangement information.

The information terminal and the like of the present invention can support setting work for constructing a hierarchical mesh network.

FIG. 1 is a block diagram showing the functional configuration of a communication system according to an embodiment. FIG. 2 is a diagram conceptually showing a hierarchical mesh network. FIG. 3 is a diagram showing an example of placement information. FIG. 4 is a flowchart illustrating an example of an initial setting procedure. FIG. 5 is a flowchart of the first embodiment. FIG. 6 is a diagram showing an example of a setting screen in the first embodiment. FIG. 7A is a first diagram showing a template in a modification of the first embodiment. FIG. 7B is a second diagram showing a template in a modification of the first embodiment. FIG. 7C is a diagram illustrating an example of template reduction (enlargement) in a modification of the first embodiment. FIG. 7D is a first diagram showing another example of the display range of the template in the first embodiment. FIG. 7E is a second diagram showing another example of the display range of the template in the first embodiment. FIG. 8 is a flowchart of the second embodiment. FIG. 9 is a diagram showing the positions of management nodes determined in the second embodiment. FIG. 10 is a diagram showing the newly determined position of the management node in the second embodiment. FIG. 11 is a flowchart of the first modification of the second embodiment. FIG. 12 is a diagram for explaining the arrangement of a plurality of lower mesh networks in the first modification of the second embodiment. FIG. 13 is a flowchart of the second modification of the second embodiment. FIG. 14 is a first diagram for explaining a method for determining a management node in the second modification of the second embodiment. FIG. 15 is a second diagram for explaining the management node determination method in the second modification of the second embodiment. FIG. 16 is a third diagram for explaining the management node determination method in the second modification of the second embodiment. FIG. 17 is a flowchart of the third embodiment. FIG. 18 is a diagram showing a first example of the association between control groups and lower mesh networks. FIG. 19 is a diagram showing a second example of the association between control groups and lower mesh networks. FIG. 20 is a flowchart of a modification of the third embodiment. FIG. 21 is a diagram illustrating an example of placement information including partition information. FIG. 22 is a flowchart showing the operation of the communication system in the fourth embodiment. FIG. 23 is an explanatory diagram of the first entry process by the information terminal in the fourth embodiment. FIG. 24 is an explanatory diagram of the second entry process by the management node in the fourth embodiment. FIG. 25 is an explanatory diagram of determination processing by the management node in the fourth embodiment. FIG. 26 is an explanatory diagram of the second entry process by the relay node in the fourth embodiment. FIG. 27 is an explanatory diagram of the operation of the communication system in a modification of the fourth embodiment. FIG. 28 is a diagram illustrating an example of area information in the fifth embodiment. FIG. 29 is a flowchart of the fifth embodiment. FIG. 30 is a diagram illustrating an example of the longest distance and an example of division processing in Example 5. FIG. 31 is a diagram illustrating another example of the division process in the fifth embodiment. FIG. 32 is a diagram illustrating still another example of the division process in the fifth embodiment. FIG. 33 is a diagram illustrating an example of correspondence between areas and lower mesh networks in the fifth embodiment. FIG. 34 is a flowchart showing the operation of the communication system in the sixth embodiment. FIG. 35 is a diagram showing the first process of search processing and determination processing in the sixth embodiment. FIG. 36 is a diagram showing the second process of search processing and determination processing in the sixth embodiment. FIG. 37 is a diagram showing the third process of search processing and determination processing in the sixth embodiment. FIG. 38 is a diagram showing the fourth process of search processing and determination processing in the sixth embodiment. FIG. 39 is a diagram showing an example of an output screen in a modification of the sixth embodiment.

Hereinafter, embodiments will be specifically described with reference to the drawings. Note that the embodiments described below are all inclusive or specific examples. The numerical values, shapes, materials, components, arrangement positions and connection forms of the components, steps, order of steps, etc. shown in the following embodiments are merely examples, and do not limit the present invention. Further, among the constituent elements in the following embodiments, constituent elements that are not described in the independent claims will be described as arbitrary constituent elements.

Note that each figure is a schematic diagram and is not necessarily strictly illustrated. Furthermore, in each figure, substantially the same configurations are denoted by the same reference numerals, and overlapping explanations may be omitted or simplified.

(Embodiment)
[composition]
First, the configuration of a communication system according to an embodiment will be described. FIG. 1 is a block diagram showing the functional configuration of a communication system according to an embodiment. As shown in FIG. 1, the communication system 10 includes a plurality of nodes 20 and an information terminal 30.

In the communication system 10, each of the plurality of nodes 20 has a wireless communication function, and the plurality of nodes 20 have completed initial setting work using the information terminal 30 by a user (hereinafter also referred to as a setter). Later, a hierarchical wireless mesh network (hereinafter simply referred to as a hierarchical mesh network) is configured. Note that constructing a hierarchical mesh network after the initial setting work is completed is only one example, and other methods such as constructing a mesh network from the configured nodes 20 are also possible.

FIG. 2 is a diagram conceptually showing a hierarchical mesh network. N1 or N2 in FIG. 2 corresponds to one node 20 in FIG. 1. A hierarchical mesh network includes a plurality of lower mesh networks and an upper mesh network. In the example of FIG. 2, each of the lower mesh networks is composed of a plurality of nodes (N1 and N2), and the upper mesh network is composed of a management node (N2) that belongs to each of the plurality of lower mesh networks. A management node can be referred to as a bridge node, a backbone node, a gateway node, or the like. Note that the number of lower mesh networks included in the hierarchical mesh network is not particularly limited. The number of layers in the hierarchical mesh network is also not particularly limited.

In a lower mesh network, when transmitting information from a node (also referred to as a first node) to another node (also referred to as a second node), the information is transmitted, for example, by a flooding method. .

Specifically, when the first node broadcasts information including the address information (destination information) of the second node, other nodes belonging to the same lower mesh network as the first communication node that received this information Each further broadcasts the received information. That is, each of the other nodes relays information. By repeating such information relay within the same lower mesh network, the above information transmitted by the first node is distributed to all nodes belonging to the same lower mesh network as the first node. Therefore, the second node can receive the information sent by the first node.

Note that the flooding method is an example of a method used for transmitting information within the lower mesh network. Other methods such as a routing method may be employed in transmitting information within the lower mesh network. For example, in at least some of the upper mesh networks and lower mesh networks, a method may be adopted in which only some of the nodes 20 are allowed to have the relay function.

When transmitting information from the first node to a third node belonging to another lower mesh network, the information is relayed by the management node. In other words, information is transmitted through the upper mesh network. For example, at least one management node is provided in one lower mesh network. The method used for transmitting information within the upper mesh network may be a flooding method, a routing method, or any other method.

If all nodes belong to the same mesh network, all nodes relay information when transmitting information, resulting in a large amount of communication per unit time. On the other hand, in a hierarchical mesh network, when information is transmitted within a certain lower mesh network, the information is not relayed in other lower mesh networks. In a hierarchical mesh network, information is transmitted from one subordinate mesh network to another via a management node only when necessary. Therefore, according to the hierarchical mesh network, by suppressing the amount of communication per unit time, it is possible to improve the robustness of the system.

Hereinafter, the node 20 and the information terminal 30 will be explained mainly with reference to FIG. First, the node 20 will be explained. In other words, the node 20 is a wireless communication device. Examples of the node 20 include a lighting fixture, a lighting remote controller, and an AC relay.

Note that the AC relay includes the following two types, a first AC relay and a second AC relay, but is not limited thereto. The first AC relay is a device that is attached to a wiring duct and can turn on and off one lighting fixture attached to the wiring duct by turning on and off AC power to the one lighting fixture. . The second AC relay is installed at the base of the wiring duct, and can turn on and off all the lighting equipment attached to the wiring duct by turning on and off the supply of AC power to the wiring duct. It is a device.

The node 20 may be a device not directly related to lighting, such as an air conditioner, a ventilation device, a camera, a human sensor, a speaker, or an environmental sensor. Note that the environmental sensors include a temperature sensor, a humidity sensor, a brightness sensor, a carbon dioxide concentration sensor, a PM (Particle Matter) sensor, and the like. Note that the device serving as the node 20 may be a device having two or more of the individual functions of each device described above, and the type of device serving as the node 20 is not particularly limited.

Note that in the case where a plurality of nodes 20 include lighting equipment, the information transmitted through the hierarchical mesh network may, for example, control the lighting equipment to turn on, turn off, dim, control color, control color, or control the lighting equipment. This is control information for controlling light distribution. Furthermore, in a case where a plurality of nodes 20 include environmental sensors, the measured values (sensing information) of the environmental sensors may be transmitted through a hierarchical mesh network. When multiple nodes 20 include cameras, speakers, or other devices, moving images, images, audio, other information, or control values may be transmitted.

The node 20 includes a wireless communication section 21. The wireless communication unit 21 is a wireless communication circuit for the node 20 to perform wireless communication (more specifically, radio communication) with other nodes 20 and the information terminal 30. After the node 20 joins the hierarchical mesh network, the wireless communication unit 21 performs communication through the above-described hierarchical mesh network. Furthermore, before the node 20 enters the hierarchical mesh network, for example, the wireless communication unit 21 periodically transmits a beacon signal (sometimes called an advertisement signal or the like), and transmits a beacon signal to an information terminal that has received the beacon signal. Performs wireless communication with 30. Specifically, the wireless communication unit 21 performs wireless communication according to a communication standard such as BLE (Bluetooth (registered trademark) Low Energy) or Wi-Fi (registered trademark), but the communication standard is not limited thereto.

Next, the information terminal 30 will be explained. The information terminal 30 is an information terminal used for initial setting work for allowing a plurality of nodes 20 to participate in the hierarchical mesh network. The information terminal 30 is, for example, a smartphone, a tablet terminal, or a mobile terminal such as a PDA (Personal Digital Assistant). Further, the information terminal 30 may be a dedicated remote controller used in the communication system 10. The information terminal 30 is used by a user (hereinafter also referred to as a configurator) who performs the initial setting work. Specifically, the information terminal 30 includes an operation reception section 31, a display section 32, a wireless communication section 33, an information processing section 34, and a storage section 35. It should be noted that the connection form of each component (~unit) included in the information terminal 30 shown in FIG. 1 is only an example, and the configuration is not limited to this.

The operation reception unit 31 receives an operation from a setter. Specifically, the operation reception unit 31 is realized by a touch panel or the like.

The display unit 32 displays images necessary for the above-mentioned initial setting work. The display unit 32 is realized by, for example, a display panel such as a liquid crystal panel or an organic EL (Electro-Luminescence) panel.

The wireless communication unit 33 is a wireless communication circuit for the information terminal 30 to perform wireless communication (more specifically, radio communication) with each of the plurality of nodes 20. Specifically, the wireless communication unit 33 performs wireless communication according to a communication standard such as BLE or Wi-Fi (registered trademark).

The information processing unit 34 performs information processing regarding the initial setting work in response to the setter's operation accepted by the operation reception unit 31. In other words, this information processing is information processing for constructing a hierarchical mesh network. The information processing unit 34 is implemented, for example, by a microcomputer, but may also be implemented by a processor or a dedicated circuit. The functions of the information processing section 34 are realized by hardware such as a microcomputer or processor constituting the information processing section 34 executing a computer program (software) stored in the storage section 35.

The storage unit 35 is a storage device that stores information necessary for information processing regarding initial setting work. Such information includes a computer program executed by the information processing unit 34. The storage unit 35 is realized by, for example, a semiconductor memory.

The storage unit 35 stores in advance placement information indicating the placement of a plurality of nodes 20. FIG. 3 is a diagram showing an example of placement information. The arrangement information is, for example, information indicating the arrangement of the plurality of nodes 20 (the two-dimensional coordinates of each of the plurality of nodes 20) in a plan view of the space in which the plurality of nodes 20 are installed, and FIG. 3 visualizes the arrangement information. This is what I did. In FIG. 3, circles indicate the positions of nodes 20 (virtual nodes to be described later). Note that the information terminal 30 can also read new placement information and create new placement information. Furthermore, the arrangement information stored in the storage unit 35 can be modified or deleted.

The arrangement of the plurality of nodes 20 is determined in advance by, for example, the designer of the space. When the plurality of nodes 20 are lighting equipment, the arrangement information can be stored in the storage unit 35 by using a lighting diagram or the like. In the following description of FIG. 4, nodes in the placement information are referred to as virtual nodes to distinguish them from the actual nodes 20.

[Initial setting procedure]
Next, the procedure for initial setting work for constructing a hierarchical mesh network will be explained. FIG. 4 is a flowchart illustrating an example of an initial setting procedure.

First, the setter performs the task of determining the lower mesh network to which each of the plurality of virtual nodes in the placement information belongs (S11). In addition, the setter performs, in each of the plurality of lower mesh networks, a task of determining a management node from among the virtual nodes belonging to the lower mesh network (S12). This work is performed, for example, by the configurator's operation on the operation reception unit 31 of the information terminal 30, but as described later, it may also be performed automatically or semi-automatically by the information processing unit 34.

As a result of the processing in step S11 and step S12, for each of the plurality of virtual nodes in the placement information, the storage unit stores the network ID of the lower mesh network to which the virtual node belongs and whether or not the virtual node is a management node. 35.

Next, the setter performs a task of associating the arrangement of the plurality of nodes 20 indicated by the arrangement information with the IDs of the plurality of actual nodes 20 (S13). In other words, the setter performs the task of associating the ID of the real node 20 with the virtual node in the placement information. For example, a MAC (Media Access Control) address is used as the node ID. This work is performed by the configurator's operation on the operation reception unit 31.

As a result of the process in step S13, which real node 20 is the virtual node in the placement information is specified. When the results of the processing in steps S11 to S13 are combined, the ID of the actual node 20, the network ID of the lower mesh network to which the node 20 with the ID belongs, and whether or not the node 20 with the ID is a management node. are associated with each other. Hereinafter, information indicating this correspondence relationship will be referred to as management information. The management information is stored in the storage unit 35.

Next, the configurator performs a task of storing, in each of the plurality of existing nodes 20, configuration information for allowing the node 20 to participate in the hierarchical mesh network (S14). The information terminal 30 transmits setting information to the node 20 by communicating with the node 20 by unicast based on the setting person's operation on the operation reception unit 31. The node 20 stores the received setting information in a storage unit (not shown) included in the node 20. Unicast here means that communication is performed by specifying a specific node 20 as the final destination, and there is no need for the information terminal 30 and the specific node 20 to communicate directly. In step S14, the information terminal 30 may perform unicast communication via an already functioning mesh network.

The setting information includes the network ID of the lower mesh network to which the node 20 belongs, and the address information (unicast address) of the node 20 used for communication within the hierarchical mesh network. The setting information may include, as necessary, a security passcode used for communication within the lower mesh network, information regarding the information terminal 30 (information regarding the device that manages the hierarchical mesh network), etc. . If the node 20 corresponds to the management node determined in step S12, the setting information includes information necessary for the node 20 to function as a management node. What setting information is to be sent to which node 20 can be specified using the management information.

The node 20 whose configuration information is stored in the storage unit can participate in the hierarchical mesh network. The node 20 that has joined the hierarchical mesh network stops periodically transmitting beacon signals that it had been performing before joining.

Here, various methods can be considered for the method of determining the lower mesh network in step S11 and the method of determining the management node in step S12. Below, examples of a method for determining a lower mesh network and a method for determining a management node will be described.

[Example 1]
In the first embodiment, a method of determining a lower mesh network and a management node using a template will be described. FIG. 5 is a flowchart of the first embodiment.

The information processing unit 34 of the information terminal 30 acquires placement information indicating the placement of the plurality of nodes 20 from the storage unit 35 (S21). The arrangement information is, for example, generated, read, or modified by the information processing unit 34 before step S21. The information processing unit 34 also acquires a template from the storage unit 35 (S22). Note that the template is created empirically or experimentally by, for example, a designer of the communication system 10, and is stored in advance in the storage unit 35.

Next, the information processing unit 34 displays a setting screen for determining a lower mesh network and a management node on the display unit 32 (S23). FIG. 6 is a diagram showing an example of a setting screen.

In the setting screen of FIG. 6, the template acquired in step S22 is superimposed on the layout information acquired in step S21. The template is composed of a first template in which squares (shown as rectangles with rounded corners in FIG. 6) are laid out in a staggered manner, and a second template in which equilateral triangles are laid out in a staggered manner.

The first template is an example of range information indicating a plurality of ranges for the arrangement of a plurality of nodes 20 indicated by the arrangement information. One square frame (corresponding to a range) in the first template corresponds to one lower mesh network. When the first template is superimposed on the placement information, the information processing unit 34 determines that the nodes 20 located within one square belong to the same one lower mesh network. In other words, when the first template is superimposed on the arrangement information, it is when the range indicated by the range information is applied to the arrangement of the plurality of nodes 20 indicated by the arrangement information.

The second template is an example of reference position information indicating a reference position in each of a plurality of ranges indicated by the range information. The position of the apex of the equilateral triangle in the second template (which can also be considered as an intersection point when looking at the second template as a whole) corresponds to the reference position. In other words, the plurality of reference positions indicated by the second template have a positional relationship corresponding to the vertices of an equilateral triangle. The second template is combined with the first template such that one reference position is located within one square of the first template.

In a state where the second template is superimposed on the placement information, the information processing unit 34 selects the node 20 that is located closest to the reference position among the nodes 20 belonging to the same lower mesh network, and manages the node 20 of the lower mesh network. Decide on the node. In other words, the state in which the second template is superimposed on the arrangement information is a state in which the template (first template) has been applied to the arrangement information.

Note that the reason why the plurality of reference positions in the second template have a positional relationship corresponding to the vertices of an equilateral triangle is to ensure that one management node can communicate with at least three other management nodes. This means that the reference position provided at the end of the second template is connected to the other three reference positions by a line segment, and the reference position provided at the center of the second template is connected to the other six reference positions. It can be understood from the location and the fact that they are connected by line segments.

Further, as described below, the template can be enlarged and reduced. For example, the first template and the second template are enlarged or reduced together. That is, the first template is enlarged or reduced while maintaining the positional relationship between the first template and the second template.

Here, the length of one side of the equilateral triangle of the second template corresponds to the designed interval between the management nodes. The length of one side is determined to be a distance in which management nodes can reliably communicate with each other. When displaying the template superimposed on the layout information in step S23, the information processing unit 34 displays the template (second template) so that the design length of one side of the equilateral triangle of the second template matches the length in the layout information. Automatically enlarge or reduce the square (range) indicated by one template. That is, the information processing unit 34 determines the initial size of the template based on the arrangement information. Note that the information processing unit 34 may enlarge or reduce the template in stages until the setter determines that the conditions are met.

For example, if the designed length of one side of the equilateral triangle of the second template is 10 m, the information processing unit 34 may adjust the design so that the length of one side of the equilateral triangle of the second template matches the length of 10 m in the arrangement information. Automatically grow or shrink templates based on placement information.

After step S23, the operation reception unit 31 receives adjustment operations such as a template position change operation, a template enlargement operation, and a template reduction operation for the layout information from the setter (S24). The information processing unit 34 adjusts the display position of the template on the setting screen and the size of the template displayed on the setting screen in accordance with the adjustment operation (S25).

Here, as mentioned above, the length of one side of the equilateral triangle of the second template has a designed length based on the communication performance of the management node (more specifically, the node 20 determined to be the management node). If the template is expanded without limit, there is a concern that management nodes will not be able to communicate with each other. Therefore, an upper limit is set for template enlargement. This upper limit is determined based on the distance at which a management node can communicate with other management nodes. The upper limit is set such that, for example, if the length of one side of the second template displayed by default is equivalent to 10 m, the length of one side of the equilateral triangle of the second template can be expanded to the equivalent of 12 m.

Next, the operation reception unit 31 receives an operation to confirm the position and size of the template from the setter (S26). The information processing unit 34 determines that nodes 20 located within one square belong to the same lower mesh network in the positional relationship between the layout information and the template when the confirmation operation is performed (S27 ). Further, the information processing unit 34 determines the node 20 located closest to the reference position as the management node in the positional relationship between the layout information and the template when the confirmation operation is performed. (S28). Note that if there are multiple nodes 20 located closest to the reference position, any one of them may be determined as the management node.

The information processing unit 34 displays the determined position of the management node on the setting screen (S29). In other words, the display unit 32 displays the determined position of the management node in the arrangement of the plurality of nodes 20 indicated by the arrangement information. In the example of FIG. 6, management nodes are displayed in gray (with hatching), and normal nodes are displayed in white.

Note that in step S29, the display unit 32 may display not only the position of the management node but also the total number of lower mesh networks, the maximum number of nodes, the minimum number of nodes, and the like. The maximum number of nodes means the number of nodes in a lower mesh network that has the largest number of nodes 20 belonging to the mesh network among the plurality of lower mesh networks. The minimum number of nodes means the number of nodes in a lower mesh network that has the least number of nodes 20 belonging to the mesh network among a plurality of lower mesh networks.

As described above, the information terminal 30 receives placement information indicating the placement of a plurality of nodes 20, range information indicating a plurality of ranges for the placement of the plurality of nodes indicated by the placement information, and information on each of the plurality of ranges. Obtain reference position information indicating the reference position. The information terminal 30 determines which of the plurality of lower mesh networks each of the plurality of nodes 20 should belong to based on the obtained arrangement information and the obtained range information, and determines which of the plurality of lower mesh networks the obtained arrangement information, A plurality of management nodes are determined from among the plurality of nodes 20 based on the acquired range information and the acquired reference position information. Specifically, the information terminal 30 applies a plurality of ranges to the arrangement of the plurality of nodes 20 indicated by the acquired arrangement information, thereby determining which of the plurality of lower mesh networks each of the plurality of nodes 20 belongs to. After the fitting is performed, the node closest to the reference position among the nodes belonging to the same lower mesh network is determined as the management node.

Such an information terminal 30 can support a setter in determining a lower mesh network and a management node.

[Modification of Example 1]
In the first embodiment, a predetermined requirement (at least one of an upper limit value and a lower limit value) may be provided for at least one of the total number of lower mesh networks, the maximum number of nodes, and the minimum number of nodes. In this case, the configuration may be such that the confirmation operation is not accepted (not considered to be a valid operation) if predetermined requirements are not met. Thereby, the information terminal 30 can support the setter in constructing an appropriate hierarchical mesh network.

Note that in this configuration, the setter needs to perform the above adjustment operation until predetermined requirements are met. Therefore, when a requirement is set for the number of nodes belonging to the lower mesh network, the information processing unit 34 displays the lower mesh network that does not satisfy the requirement for the number of nodes on the setting screen when the adjustment operation in step S24 is performed. In other words, the square of the first template) may be visualized. For example, among the plurality of squares (ranges) indicated by the first template, the information processing unit 34 normally displays the squares that meet the node number requirement, and displays the squares that do not meet the node number requirement as a washout display (gray display). You may. That is, the information processing unit 34 may change the color within the frame indicated by the first template depending on whether or not the node number requirements are met. Thereby, the information terminal 30 can support the setting person's adjustment operation.

Further, the information processing unit 34 may change the thickness of the frame indicated by the first template depending on whether or not the requirement for the number of nodes is satisfied. For example, the information processing unit 34 may The frame may be displayed thicker than the frame that satisfies the numerical requirements. The information processing unit 34 may change the color of the frame indicated by the first template, or may cause the frame indicated by the first template to blink, depending on whether the requirement for the number of nodes is satisfied. In other words, the information processing unit 34 may notify by changing the display mode of the range (frame) indicated by the first template depending on whether or not the requirement for the number of nodes is satisfied.

When a plurality of nodes 20 are displayed in a list format, the information processing unit 34 determines the display mode of the frame (color within the frame, thickness of the frame) of the node 20 to which the lower mesh network that does not satisfy the node number requirement You may change the size, frame color, or ). That is, the above notification may be performed when a plurality of nodes 20 are displayed in a list format.

Further, the information processing unit 34 detects a first template that does not satisfy the requirements for the number of nodes, both when a layout diagram of a plurality of nodes 20 is displayed and when a plurality of nodes 20 are displayed as a list. In place of or in addition to the image, the presence of the vehicle may be notified by sound (alarm sound, etc.), wind pressure, smell, or the like. In this case, the information terminal 30 is equipped with a speaker, a blower fan, a smell generator, or the like, or is communicatively connected to a speaker, a blower fan, a smell generator, or the like.

Similarly, the information processing unit 34 also processes images, sounds, , wind pressure, smell, etc. This notification may also be made when a layout diagram of a plurality of nodes 20 is displayed, or may be made when a plurality of nodes 20 are displayed as a list.

Further, the template pattern used in Example 1 is only an example, and templates having other patterns may be used. 7A and 7B are diagrams showing templates in a modification of the first embodiment.

The templates shown in FIG. 7A include a first template in which squares (shown as squares with rounded corners in FIG. 7A to distinguish them from the second template) are laid out in a matrix, and a second template in which squares are laid out in a matrix. It is composed of a combination of two templates.

The first template is an example of range information indicating a plurality of ranges for the arrangement of a plurality of nodes 20 indicated by the arrangement information. The first template has a similar configuration to the template shown in FIG. 6, except for the arrangement of the plurality of squares.

The second template is an example of reference position information indicating a reference position in each of a plurality of ranges indicated by the range information. The position of the apex of the square in the second template corresponds to the reference position. In other words, the plurality of reference positions indicated by the second template have a positional relationship corresponding to the vertices of a square. The second template is combined with the first template such that one reference position is located within one square frame of the first template.

Further, the template shown in FIG. 7B is configured by a combination of a first template filled with regular hexagons and a second template filled with regular triangles.

The first template is an example of range information indicating a plurality of ranges for the arrangement of a plurality of nodes 20 indicated by the arrangement information.

The second template is an example of reference position information indicating a reference position in each of a plurality of ranges indicated by the range information. The second template shown in FIG. 7B has a similar configuration to the template shown in FIG. 6.

In this way, the template used in Example 1 is not particularly limited. For example, the range indicated by the first template may be a rectangle or another polygon. The shape of the second template is also not particularly limited.

Note that the template is generated to a size that can cover the entire space indicated by the placement information. For example, the template may be generated such that the area of the entire template is larger than the total area (total floor area) of the space indicated by the arrangement information.

Further, in the first embodiment, a part of the arrangement information may be masked. In other words, some of the plurality of nodes 20 may be excluded from the targets of lower mesh network determination and management node determination using templates. In other words, the information processing unit 34 may have a function of determining to which of the plurality of lower mesh networks only some of the plurality of nodes indicated by the arrangement information belong.

Which nodes 20 are to be excluded is determined, for example, by an operation performed by the setter to specify a range to be masked. Such an operation is performed when the arrangement of a plurality of nodes 20 is displayed on the display section 32. The excluded node 20 is treated as an unaffiliated node (does not participate in the mesh network), but may belong to any lower mesh network based on the manual operation of the configurator. Which node 20 to exclude may be determined by selecting a node 20 in the list when a plurality of nodes 20 are displayed in a list format. There are no particular limitations on the specific method of excluding nodes.

Such a masking function is useful, for example, when the total number of multiple nodes 20 included in the placement information exceeds the upper limit of the number of nodes that can be registered.

Furthermore, in the first embodiment, it has been explained that the first template and the second template are enlarged or reduced integrally, but only one of the first template and the second template may be enlarged or reduced. FIG. 7C is a diagram illustrating an example of reduction (enlargement) of the first template and the second template in a modified example.

In the example of FIG. 7C, the management node is illustrated when the second template is reduced around the center of gravity of all the nodes 20 included in the arrangement information (the average of the coordinates of all the nodes 20). The star in FIG. 7C indicates the center of gravity position. In FIG. 7C, the second template before reduction is shown by a broken line, and the second template after reduction is shown by a solid line. The process of reducing (or enlarging) the second template independently of the first template reduces the distance between the plurality of reference positions indicated by the second template, independent of the plurality of ranges indicated by the first template, and It can be said that this is a process of shortening (or lengthening) while maintaining the positional relationship between the plurality of reference positions indicated by the two templates. The purpose of reducing the second template independently of the first template is to ensure the quality of communication between management nodes.

In FIG. 7C, the management node before the second template is reduced is shown by hatching, and the management node after the second template is reduced is shown by black. In this way, if the second template is reduced around the center of gravity, the distance between the management nodes can be shortened by bringing the management nodes belonging to the outer lower mesh network closer to the inside.

Note that the first template and the second template are required to have only one vertex or intersection of the second template within one range of the first template (not 0, not 2 or more). . That is, enlargement or reduction of the first template (or second template) is permitted on the condition that only one reference position is located in each of the plurality of ranges indicated by the first template.

Furthermore, the template adjustment may be performed by the information processing unit 34 as an internal process, instead of as an adjustment operation by the setter. That is, the method of determining a lower mesh network and a management node using a template may be automated. In this case, the information processing unit 34 can omit information processing for receiving adjustment operations from the setter. For example, the information processing unit 34 can omit the process of superimposing the layout information and the template and displaying them on the display unit 32.

Further, as described above, when a lower mesh network is determined by applying a template and a lower mesh network that does not satisfy the node number requirement is generated, the information processing unit 34 automatically selects a plurality of lower mesh networks. The network may be divided into sub-mesh networks. In the simplest form, the information processing unit 34 divides one lower mesh network into two by vertically or horizontally dividing one range of the first template that defines a lower mesh network that does not satisfy the node number requirement. Split into lower mesh networks. Further, as a method for dividing one range (one lower mesh network) of the first template, a dividing method (algorithm) of Example 5 or a modification thereof, which will be described later, may be used.

By the way, in the setting screen of FIG. 6, the entire first template and second template are displayed on the display section 32, but only a part of the first template and the second template are cut out on the display section 32. may be displayed. 7D and FIG. 7E are diagrams showing other examples of display ranges of the first template and second template in Example 1, and the portion surrounded by thick lines corresponds to the range displayed on the display unit 32. As shown in FIGS. 7D and 7E, the first template and the second template are displayed, for example, cut out into a rectangular shape according to the screen shape of the display unit 32.

In this way, only the necessary parts of the first template and the second template may be displayed on the display unit 32.

[Summary of Example 1 and its modifications]
As explained above, the information terminal 30 includes the information processing unit 34 that executes information processing for constructing a hierarchical mesh network. The hierarchical mesh network includes a plurality of lower mesh networks and an upper mesh network configured by management nodes belonging to each of the plurality of lower mesh networks. The information processing unit 34 acquires placement information indicating the placement of the plurality of nodes 20, and determines which of the plurality of lower mesh networks each of the plurality of nodes 20 should belong to based on the obtained placement information. , determines a plurality of management nodes from among the plurality of nodes 20 based on the acquired arrangement information. The lower mesh network is an example of the first mesh network, and the upper mesh network is an example of the second mesh network.

Such an information terminal 30 can support a setter in determining a lower mesh network and a management node. In other words, the information terminal 30 can support the setting work for constructing a hierarchical mesh network.

For example, the information processing unit 34 further acquires range information indicating a plurality of ranges for the arrangement of the plurality of nodes 20 indicated by the arrangement information, and reference position information indicating a reference position in each of the plurality of ranges. , determine which of the plurality of lower mesh networks each of the plurality of nodes 20 should belong to based on the obtained arrangement information and the obtained range information, and determine the obtained arrangement information and the obtained range. A plurality of management nodes are determined from among the plurality of nodes 20 based on the information and the acquired reference position information.

Such an information terminal 30 can determine a lower mesh network and a management node using the arrangement information, range information, and reference position information.

For example, the information processing unit 34 selects the node 20 closest to the reference position as the management node among the nodes 20 belonging to the same lower mesh network determined based on the acquired arrangement information and the acquired range information. Determine as.

Such an information terminal 30 can determine a management node using placement information, range information, and reference position information.

Further, for example, the information processing unit 34 applies a plurality of ranges to the arrangement of the plurality of nodes 20 indicated by the acquired arrangement information, thereby determining which of the plurality of lower mesh networks each of the plurality of nodes 20 belongs to. In the state after the fitting is performed, the node 20 closest to the reference position among the nodes 20 belonging to the same lower mesh network is determined as the management node.

Such an information terminal 30 can determine a lower mesh network and a management node by applying range information (reference position information) to placement information.

Further, for example, each of the plurality of lower mesh networks has requirements regarding the number of nodes that can belong to the lower mesh network. The information processing unit 34 has a function of notifying that there is a lower mesh network that does not satisfy the requirements among the multiple lower mesh networks after the multiple ranges have been fitted.

Such an information terminal 30 can notify that there is a lower mesh network among the plurality of lower mesh networks that does not meet the requirements.

Further, for example, the information processing unit 34 provides notification by displaying a range indicating a lower mesh network that does not meet the requirements among the plurality of ranges in a manner different from other ranges.

Such an information terminal 30 can make a notification by visualizing a range indicating a lower mesh network that does not meet the requirements.

Further, for example, the information processing unit 34 has a function of notifying that there is a node 20 among the plurality of nodes 20 that does not belong to any of the plurality of ranges after the plurality of ranges have been fitted. have

Such an information terminal 30 can notify that there is a node 20 that does not belong to the lower mesh network.

Further, for example, each of the plurality of ranges is a square.

Such an information terminal 30 can determine a lower mesh network using range information indicating a plurality of square ranges.

Further, for example, each of the plurality of ranges is a hexagon.

Such an information terminal 30 can determine a lower mesh network using range information each indicating a plurality of hexagonal ranges.

Further, for example, the plurality of reference positions indicated by the reference position information have a positional relationship corresponding to the vertices of an equilateral triangle.

Such an information terminal 30 can determine a management node using reference position information indicating a plurality of reference positions having a positional relationship corresponding to the vertices of an equilateral triangle.

Further, for example, a plurality of reference positions indicated by the reference position information have a positional relationship corresponding to the vertices of a square.

Such an information terminal 30 can determine a management node using reference position information indicating a plurality of reference positions having a positional relationship corresponding to the vertices of a square.

Further, for example, the information processing unit 34 expands or reduces the plurality of ranges, and applies the enlarged or reduced ranges to the arrangement of the plurality of nodes 20 indicated by the acquired arrangement information. It is determined which of the plurality of lower mesh networks each of the plurality of nodes 20 should belong to.

Such an information terminal 30 can make adjustments regarding the determination of a lower mesh network and the determination of a management node.

Further, for example, in expanding a plurality of ranges, an upper limit is determined, and the upper limit is determined based on the distance at which a management node can communicate with other management nodes.

Such an information terminal 30 can make adjustments regarding the determination of a lower mesh network and the determination of a management node while ensuring communication performance between management nodes.

Further, for example, expansion or contraction of a plurality of ranges is automatically performed based on the acquired arrangement information.

Such an information terminal 30 can automatically make adjustments regarding the determination of a lower mesh network and the determination of a management node.

Further, for example, the expansion or contraction of the plurality of ranges is performed independently of the plurality of reference positions, and is permitted on the condition that only one reference position is located in each of the plurality of ranges.

Such an information terminal 30 can individually enlarge or reduce the first template.

Further, for example, the information processing unit 34 extends or shortens the distance between the plurality of reference positions independently of the plurality of ranges and while maintaining the positional relationship of the plurality of reference positions. Extending or shortening the distance between the plurality of reference positions is allowed with the requirement that only one reference position is located in each of the plurality of ranges.

Such an information terminal 30 can individually enlarge or reduce the second template.

Further, for example, expansion or reduction of the plurality of ranges is performed while maintaining the positional relationships between the plurality of ranges and the plurality of reference positions.

Such an information terminal 30 can enlarge or reduce the first template and the second template in conjunction with each other.

For example, the information terminal 30 further includes a display unit 32 that displays the arrangement of the plurality of nodes 20, the plurality of ranges, and the reference position indicated by the arrangement information.

Such an information terminal 30 can display the arrangement of a plurality of nodes 20, a plurality of ranges, and a reference position.

For example, the information terminal 30 further includes a display unit 32 that displays the determined position of the management node in the arrangement of the plurality of nodes 20 indicated by the arrangement information.

Such an information terminal 30 can display the location of the management node.

Further, for example, only a part of the plurality of ranges is displayed on the display section 32 according to the shape of the display section 32.

Such an information terminal 30 can display only necessary parts of the first template and the second template on the display unit 32.

Further, for example, the information processing unit 34 of the information terminal 30 has a function of determining which of the plurality of lower mesh networks only some of the plurality of nodes 20 should belong to.

Such an information terminal 30 can exclude some of the nodes 20 from being determined as a lower mesh network.

The communication system 10 also includes an information terminal 30 and a plurality of nodes 20.

Such a communication system 10 can support a setter in determining a lower mesh network and a management node. In other words, the communication system 10 can support the setting work for constructing a hierarchical mesh network.

Further, for example, the plurality of nodes 20 include lighting equipment.

Such a communication system 10 can function as a control system for lighting equipment.

Further, an information processing method for constructing a hierarchical mesh network, which is executed by a computer such as the information terminal 30, obtains arrangement information indicating the arrangement of a plurality of nodes 20, and based on the obtained arrangement information, It is determined which of the plurality of lower mesh networks each of the plurality of nodes 20 should belong to, and a plurality of management nodes are determined from among the plurality of nodes 20 based on the acquired arrangement information.

Such an information processing method can assist a setter in determining a lower mesh network and a management node. In other words, the information processing method can support configuration work for constructing a hierarchical mesh network.

[Example 2]
In the second embodiment, a method of determining a management node based on the center of gravity of the coordinates (arrangement) of a plurality of nodes 20 belonging to the same lower mesh network will be described. FIG. 8 is a flowchart of the second embodiment.

In the second embodiment, the explanation will be given on the assumption that the lower mesh networks to which each of the plurality of nodes 20 belongs have already been determined. In the second embodiment, the lower mesh network is determined by one of the methods described above or below, but may be arbitrarily determined by the configurator, or may be determined by other existing methods. Once the lower mesh networks are determined, affiliation information indicating which of the lower mesh networks the plurality of nodes 20 belong to is stored in the storage unit 35.

The information processing unit 34 of the information terminal 30 acquires placement information indicating the placement of the plurality of nodes 20 from the storage unit 35 (S31). The arrangement information is, for example, generated, read, or modified by the information processing unit 34 before step S31. The information processing unit 34 also acquires affiliation information from the storage unit 35 (S32).

Next, the information processing unit 34 calculates the center of gravity position of the node 20 belonging to the same lower mesh network among the plurality of nodes 20 based on the acquired arrangement information and the acquired affiliation information (S33 ). If the placement information indicates the placement of a plurality of nodes 20 using two-dimensional coordinates (xy coordinates), the x-coordinate of the center of gravity is the average value of the x-coordinates of the nodes 20 belonging to the same lower mesh network, and the center of gravity The y-coordinate of the position is a value obtained by averaging the y-coordinates of the nodes 20 belonging to the same lower mesh network. The center of gravity position is calculated for each of the plurality of lower mesh networks.

Next, based on the acquired placement information, the information processing unit 34 selects the node 20 located closest to the center of gravity in the lower mesh network among the nodes 20 belonging to the same lower mesh network to the lower mesh network. It is determined as a management node belonging to the network (S34). A management node is determined for each of the plurality of lower mesh networks. FIG. 9 is a diagram showing the determined position of the management node. FIG. 9 corresponds to a plan view of a space in which a plurality of nodes 20 are arranged, and one section in FIG. 9 is a section in which nodes 20 belonging to the same lower mesh network are arranged. In other words, the section in FIG. 9 corresponds to a lower mesh network. A circle located within each section indicates the management node of that section (lower mesh network). Note that if there are multiple nodes 20 located closest to the center of gravity, any one of them may be determined as the management node.

Next, the information processing unit 34 targets adjacent lower mesh networks (corresponding to the partitions in FIG. 9), and determines whether the distance between the management nodes (corresponding to the length of the bidirectional arrow in FIG. 9) is within a predetermined value. (S35). The predetermined value is determined based on the communication performance of the management nodes, and is, for example, a distance at which the management nodes can reliably communicate with each other.

If it is determined that all the distances between the management nodes are within the predetermined value (Yes in S35), the operation ends. On the other hand, if the information processing unit 34 determines that the distance between at least one management node exceeds the predetermined value (No in S35), it performs a process of re-determining the lower mesh network and the management node (S36).

The redetermination process will be explained below. For example, if it is determined that the distances at three locations D1 to D3 exceed a predetermined value in FIG. The processing unit 34 divides section A into two. Division division has the same meaning as dividing one lower mesh network into two lower mesh networks.

For example, the information processing unit 34 divides the section A into two sections A1 and A2 arranged in the vertical direction, and in each of the divided sections A1 and A2 (that is, each of the two lower mesh networks after the division). Determine the management node. The method for determining the management node is the same as in step S33 and step S34. FIG. 10 is a diagram showing the newly determined position of the management node.

Further, the information processing unit 34 performs the determination in step S35 for the newly determined management node. If it is determined that one or more of the distances between management nodes (D4 to D7 in FIG. 10) are within a predetermined value (for example, only D5 in FIG. 10 is within a predetermined value), the re-determination process is terminated. Become. Note that the section A may be divided into two sections arranged in the horizontal direction.

As described above, in the second embodiment, the information terminal 30 acquires placement information and affiliation information, and selects one of the nodes 20 based on the acquired placement information and affiliation information. The centroid positions of the nodes 20 belonging to the same lower mesh network are calculated, and among the nodes 20 belonging to the same lower mesh network, the node 20 located closest to the centroid position is designated as the management node belonging to the lower mesh network. Determine as.

Such an information terminal 30 can support a setter in determining a management node.

Note that in the re-determination process of the second embodiment, the partition may be divided based on a manual operation by the setter. Furthermore, in the re-determination process of the second embodiment, the management node is determined after dividing the partition, but after adding a management node to one partition, the information processing unit 34 adds the management node to each partition. It may be divided into a plurality of sections including only one section.

[Modification 1 of Example 2]
In Example 2 above, the management node was determined using the same method for all lower mesh networks, but the method for determining the management node was changed based on the position of the lower mesh network (the arrangement of multiple lower mesh networks). may be done. FIG. 11 is a flowchart of the first modification of the second embodiment.

The information processing unit 34 of the information terminal 30 acquires placement information indicating the placement of the plurality of nodes 20 from the storage unit 35 (S41). The arrangement information is, for example, generated, read, or modified by the information processing unit 34 before step S41. The information processing unit 34 also acquires affiliation information from the storage unit 35 (S42). The information processing unit 34 calculates the center of gravity of the nodes 20 belonging to the same lower mesh network among the plurality of nodes 20 based on the acquired arrangement information and the acquired affiliation information (S43). The processing from step S41 to step S43 is similar to step S31 to step S33. Note that the center of gravity position calculated in step S43 is also described as a first center of gravity position.

Next, the information processing unit 34 calculates the position of the center of gravity of the entire plurality of nodes 20 based on the acquired arrangement information (S44). If the arrangement information indicates the arrangement of a plurality of nodes 20 using two-dimensional coordinates (xy coordinates), the x-coordinate of the center of gravity is the average value of the x-coordinates of all the nodes 20 belonging to the hierarchical mesh network. The y-coordinate of the center of gravity is the value obtained by averaging the y-coordinates of all the nodes 20 belonging to the hierarchical mesh network. Note that the gravity center position calculated in step S44 is also described as a second double center position.

Next, the information processing unit 34 specifies the arrangement of the plurality of lower mesh networks based on the obtained arrangement information and the obtained affiliation information (S45). FIG. 12 is a diagram for explaining the arrangement of a plurality of lower mesh networks. FIG. 12 corresponds to a plan view of a space in which a plurality of nodes 20 are arranged, and one section in FIG. 12 is a section in which nodes 20 belonging to the same lower mesh network are arranged. In other words, the section in FIG. 12 corresponds to a lower mesh network. A circle located within each section indicates the management node of that section (lower mesh network).

The information processing unit 34 is configured, for example, in a lower mesh network located in the center (not located at an end) in the arrangement of a plurality of lower mesh networks (corresponding to a section without hatching in FIG. 12), and in a lower mesh network located at an end. The lower mesh network (corresponding to the hatched sections in FIG. 12) is identified (distinguished). In the example of FIG. 12, being located in the center means that all sides of the section indicating the lower mesh network are adjacent to other sections (lower mesh network). Being located at the edge means that at least one side of the section indicating the lower mesh network is not adjacent to another section (lower mesh network).

In the lower mesh network located in the center, the information processing unit 34 determines a management node based on the first center of gravity position of the lower mesh network (S46). The information processing unit 34 determines, as the management node, the node 20 that is located closest to the first center of gravity of the lower mesh network among the nodes 20 that belong to the lower mesh network located in the central part. In other words, the method for determining the management node in the lower mesh network that is not located at the edge is the same as in the second embodiment.

On the other hand, in the lower mesh network located at the end, the information processing unit 34 determines a management node based on the second double center position (S47). The information processing unit 34 determines the node 20 located closest to the second double center position among the nodes 20 belonging to the lower mesh network located at the end as the management node belonging to the lower mesh network. Note that if there are multiple nodes 20 located closest to the second double center position, any one of them may be determined as the management node.

In this manner, in the first modification of the second embodiment, the information terminal 30 determines the node 20 closer to the overall center position (second double center position) as the management node in the lower mesh network located at the edge. This makes it possible to suppress the occurrence of management nodes that are far away from other management nodes.

Note that also in the first modification of the second embodiment, the determination regarding the distance between management nodes and the re-determination process described in the second embodiment may be performed.

[Modification 2 of Example 2]
Furthermore, a management node may be determined for each of a plurality of lower mesh networks by using the first center of gravity position and the second center of gravity position described in the second modification of the second embodiment. FIG. 13 is a flowchart of a second modification of the second embodiment.

The information processing unit 34 of the information terminal 30 acquires placement information indicating the placement of the plurality of nodes 20 from the storage unit 35 (S51). The arrangement information is, for example, generated, read, or modified by the information processing unit 34 before step S51. The information processing unit 34 also acquires affiliation information from the storage unit 35 (S52). The information processing unit 34 calculates the first center of gravity position based on the acquired placement information and the acquired affiliation information (S53). The information processing unit 34 calculates the second double center position based on the acquired placement information (S54). The processing from step S51 to step S54 is similar to step S41 to step S44.

The information processing unit 34 determines a management node in each of the plurality of lower mesh networks based on the calculated first center of gravity position and the calculated second center of gravity position (S55). FIG. 14 is a diagram for explaining a method for determining a management node in the second modification of the second embodiment. FIG. 14 corresponds to a plan view of a space in which a plurality of nodes 20 are arranged, and one section in FIG. 14 is a section in which nodes 20 belonging to the same lower mesh network are arranged. In other words, the section in FIG. 14 corresponds to a lower mesh network. A circle located within each section indicates a node 20 that belongs to that section (lower mesh network).

In FIG. 14, the asterisk indicates the second double center position. Specifically, the information processing unit 34 divides the line segments connecting the first centroid position and the second double centroid position among the nodes 20 belonging to the same lower mesh network into 1:n (n is a positive number). The node 20 located closest to the dividing point (triangular mark in FIG. 14) is determined as the management node belonging to the lower mesh network. In FIG. 14, management nodes are indicated by hatched circles.

In the example of FIG. 14, n=1, but n may be another value greater than or equal to 1, such as 2, or may be a value less than 1. n may be appropriately determined empirically or experimentally. Further, n may be changed for each lower mesh network. Note that n is defined as, for example, a distance from the second double center position to the dividing point, assuming that the distance from the first gravity center position to the dividing point is 1.

If, among the nodes 20 belonging to the same lower mesh network, the node closest to the second double core position is determined as the management node, then multiple management nodes corresponding to multiple lower mesh networks will be located near the second double core position. There is a possibility that the management node of the lower mesh network located on the outside becomes separated from other management nodes located on the inside.

In contrast, in the second modification of the second embodiment, the information terminal 30 can prevent the plurality of management nodes from being too close to the second double center position.

Note that the second modification of the second embodiment can also be applied to a case where a plurality of nodes 20 are arranged as shown in FIGS. 15 and 16. 15 and 16 are other diagrams for explaining the management node determination method in the second modification of the second embodiment. Also, in the second modification of the second embodiment, the determination and re-determination processing regarding the distance between management nodes described in the second embodiment may be performed.

[Summary of Example 2 and its variations]
As explained above, the information terminal 30 includes the information processing unit 34 that executes information processing for constructing a hierarchical mesh network. The hierarchical mesh network includes a plurality of lower mesh networks and an upper mesh network configured by management nodes belonging to each of the plurality of lower mesh networks. The information processing unit 34 acquires placement information indicating the placement of a plurality of nodes 20, each of which belongs to one of a plurality of lower mesh networks, and selects a plurality of nodes 20 from among the plurality of nodes 20 based on the obtained placement information. Determine the management node. The lower mesh network is an example of the first mesh network, and the upper mesh network is an example of the second mesh network.

Such an information terminal 30 can support a setter in determining a management node. In other words, the information terminal 30 can support the setting work for constructing a hierarchical mesh network.

For example, the information processing unit 34 further acquires affiliation information indicating which of the multiple lower mesh networks the plurality of nodes 20 belong to, and based on the acquired arrangement information and the acquired affiliation information. to determine multiple management nodes.

Such an information terminal 30 can determine a management node using placement information and affiliation information.

Further, for example, the information processing unit 34 calculates the first centroid position of the node 20 that belongs to the same lower mesh network among the plurality of nodes 20 based on the acquired arrangement information and the acquired affiliation information. Then, based on the acquired placement information, the second double center positions of the plurality of nodes 20 are calculated, and a line connecting the first double center position and the second double center position among the nodes 20 belonging to the same lower mesh network is calculated. The node 20 located closest to the point where the number of minutes is divided into 1:n (n is a positive number) is determined as the management node belonging to the lower mesh network.

Such an information terminal 30 can determine a plurality of management nodes so that the plurality of management nodes do not come too close to the second double center position.

Further, for example, the information processing unit 34 changes the value of n and determines the management node for each lower mesh network.

Such an information terminal 30 can determine a management node based on different conditions for each lower mesh network.

Further, for example, the information processing unit 34 assigns, among the nodes 20 belonging to the same lower mesh network, the node 20 located closest to the point that divides the line segment 1:1 to the lower mesh network. Determine it as a management node.

Such an information terminal 30 can determine a plurality of management nodes so that the plurality of management nodes do not come too close to the second double center position.

Further, for example, the information processing unit 34 calculates the first centroid position of the node 20 that belongs to the same lower mesh network among the plurality of nodes 20 based on the acquired arrangement information and the acquired affiliation information. Then, among the nodes 20 belonging to the same lower mesh network, the node 20 located closest to the first centroid position is determined as the management node belonging to the lower mesh network.

Such an information terminal 30 can determine a node 20 located near the center of gravity of the coordinates (arrangement) of nodes 20 belonging to the same lower mesh network as the management node of the lower mesh network.

Further, for example, the information processing unit 34 calculates the second double center positions of the plurality of nodes 20 based on the acquired arrangement information, and calculates the second double center positions of the plurality of nodes 20 based on the obtained arrangement information and the obtained affiliation information. In a lower mesh network that is not located at an end in the arrangement of a plurality of lower mesh networks, a node 20 belonging to the lower mesh network is located closest to the first center of gravity position. A node 20 is determined as a management node belonging to the lower mesh network, and in a lower mesh network located at an end in the arrangement of a plurality of lower mesh networks, the second double center position among the nodes 20 belonging to the lower mesh network is determined. The node 20 located closest to is determined as the management node belonging to the lower mesh network.

Such an information terminal 30 can suppress the occurrence of a management node that is far away from other management nodes.

The information terminal 30 further includes a display unit 32 that displays the determined position of the management node in the arrangement of the plurality of nodes 20 indicated by the arrangement information.

Such an information terminal 30 can display the location of the management node.

The communication system 10 also includes an information terminal 30 and a plurality of nodes 20.

Such a communication system 10 can support a setter in determining a management node. In other words, the communication system 10 can support the setting work for constructing a hierarchical mesh network.

Further, for example, the plurality of nodes 20 include lighting equipment.

Such a communication system 10 can function as a control system for lighting equipment.

Further, the information processing method for constructing a hierarchical mesh network, which is executed by a computer such as the information terminal 30, uses placement information indicating the placement of a plurality of nodes 20, each of which belongs to one of a plurality of lower mesh networks. is acquired, and a plurality of management nodes are determined from among the plurality of nodes 20 based on the acquired arrangement information.

Such an information processing method can support a setter in determining a management node. In other words, the information processing method can support configuration work for constructing a hierarchical mesh network.

[Example 3]
In the third embodiment, a method of determining a lower mesh network to which each of a plurality of nodes 20 belongs based on a control group of a plurality of nodes 20 will be described.

First, the control group will be explained. For example, when each of the plurality of nodes 20 is a lighting fixture, each of the plurality of nodes 20 belongs to a control group whose light emission is collectively controlled at the same timing. This control group is designated as control group A. For example, a plurality of nodes 20 that turn on or off all at once when a wall switch provided in a space is pressed are a plurality of nodes 20 that belong to the same control group A. Note that the power systems of the plurality of nodes 20 belonging to the same control group A do not have to be the same, and the power systems of the plurality of nodes 20 belonging to the same control group A may be different.

The same control group A further includes one or more control groups B. Control group B is a group to which nodes 20 having the same dimming rate or color temperature settings belong. For example, control group B is, in other words, an operational group for lighting. Control group B is a group that emits light in daylight white color with a dimming rate of 80%, a group that emits light in bulb color with a dimming rate of 90%, and so on.For example, at least one of the set values of the dimming rate and color temperature is set. It is a unified group. Control group B belonging to the same control group A is collectively controlled to emit light at the same timing.

In the third embodiment, control group information indicating such a control group is stored (registered) in the storage unit 35 of the information terminal 30 in advance. Hereinafter, a method of determining a lower mesh network to which each of the plurality of nodes 20 belongs based on such control group information will be described. FIG. 17 is a flowchart of the third embodiment.

The information processing unit 34 of the information terminal 30 acquires control group information from the storage unit 35 (S61). The information processing unit 34 determines which of the plurality of lower mesh networks each of the plurality of nodes 20 should belong to based on the acquired control group information (S62). For example, the information processing unit 34 makes a control group correspond to a lower mesh network on a one-to-one basis, and causes nodes 20 belonging to the same control group among the plurality of nodes 20 to belong to the same lower mesh network. The control group here is the above-mentioned control group A, but may also be the above-mentioned control group B.

As described above, in a hierarchical mesh network, when information is transmitted within a certain lower mesh network, the information is not relayed in other lower mesh networks. Therefore, by creating a one-to-one correspondence between a control group and a lower mesh network, it is possible to suppress unnecessary communication in other lower mesh networks when controlling a plurality of nodes 20. can.

Thereafter, when the operation reception unit 31 receives an operation instructing to change the control group, the information processing unit 34 updates the control group information stored in the storage unit 35 (S63). Changing the control group includes changing the control group to which an existing node 20 belongs, adding a new node 20 to the control group, and canceling (deletion) the membership of the existing node 20 to the control group. It will be done.

In response to the update of the control group information, the information processing unit 34 re-determines which of the plurality of lower mesh networks each of the plurality of nodes 20 should belong to in accordance with the change in the control group (S64 ). For example, the information processing unit 34 makes a control group correspond to a lower mesh network on a one-to-one basis, and causes nodes 20 belonging to the same control group among the plurality of nodes 20 to belong to the same lower mesh network. That is, in response to a change in the control group, the lower mesh network to which the plurality of nodes 20 belong is automatically changed.

Note that if the maximum number of nodes 20 that belong to the same lower mesh network (in other words, an upper limit number or a predetermined number) is determined, the number of nodes 20 that belong to the same control group exceeds the maximum number of nodes. If the number exceeds the number, it is not possible to have a one-to-one correspondence between the control group and the lower mesh network. A method for determining a lower mesh network in such a case will be explained. FIG. 18 is a diagram showing a first example of the association between control groups and lower mesh networks.

In the example of FIG. 18, control group A includes 40 nodes 20. The 40 nodes 20 included in control group A further belong to one of a plurality of control groups B. The plurality of control groups B include a control group B1 made up of 10 nodes 20, a control group B2 made up of 10 nodes 20, and a control group B3 made up of 20 nodes 20. It will be done. The detailed configuration of such a group is indicated by the control group information described above.

Here, when the maximum number of nodes in one lower mesh network is 32, control group A includes 40 nodes 20, so all nodes 20 belonging to control group A belong to the same lower mesh network. I can't let you.

In such a case, the information processing unit 34 identifies the control group (control group B3) with the largest number of nodes 20 among the control groups B1 to B3, and determines that the number of nodes 20 in the identified control group B3 is the maximum number of nodes. Determine whether or not it exceeds. In the example of FIG. 18, the information processing unit 34 determines that the number of nodes 20 in the specified control group B3 is less than or equal to the maximum number of nodes, and causes all nodes 20 belonging to the control group B3 to belong to the lower mesh network C1. .

Regarding the remaining control groups B1 and B2, the information processing unit 34 determines whether the total of the number of nodes 20 belonging to control group B1 and the number of nodes 20 belonging to control group B2 exceeds the maximum number of nodes. Determine whether In the example of FIG. 18, the information processing unit 34 determines that the total number of nodes 20 is less than or equal to the maximum number of nodes, and all of the nodes 20 belonging to control group B1 and the nodes 20 belonging to control group B2 belongs to the lower mesh network C2.

As a result, as shown in FIG. 18, the lower mesh network C1 is associated with the control group B3, and the lower mesh network C2 is associated with the control group B1 and the control group B2.

As explained above, when the number of nodes 20 belonging to the same control group A is less than or equal to the maximum number of nodes (not shown), the information processing unit 34 causes the nodes 20 to belong to the same lower mesh network. let When the number of nodes 20 belonging to the same control group A is greater than the maximum number of nodes (in the example of FIG. 18), the information processing unit 34 controls the number of nodes 20 to be two or more (in the example of FIG. 18, 3) lower-level mesh networks.

Focusing on control group B, in the example of FIG. 18, if the number of nodes 20 belonging to the same control group B3 is less than or equal to the maximum number of nodes, the information processing unit 34 assigns the node 20 to the same lower mesh network. Belong to. The information processing unit 34 also selects a node 20 that belongs to control group B1 (an example of a first group) among the plurality of nodes 20, and a node 20 that belongs to control group B2 (an example of a second group) among the plurality of nodes 20. nodes 20 belonging to the same lower mesh network.

Further, FIG. 19 is a diagram showing a second example of the association between control groups and lower mesh networks. In the example of FIG. 19, control group A includes 80 nodes 20. The 80 nodes 20 included in control group A further belong to one of a plurality of control groups B. The plurality of control groups B include a control group B1 made up of 20 nodes 20, a control group B2 made up of 20 nodes 20, and a control group B3 made up of 40 nodes 20. It will be done. The detailed configuration of such a group is indicated by the control group information described above.

Here, when the maximum number of nodes in one lower mesh network is 32, control group A includes 80 nodes 20, so all nodes 20 belonging to control group A belong to the same lower mesh network. I can't let you.

In such a case, the information processing unit 34 identifies the control group (control group B3) with the largest number of nodes 20 among the control groups B1 to B3, and determines that the number of nodes 20 in the identified control group B3 is the maximum number of nodes. Determine whether or not it exceeds. In the example of FIG. 19, the information processing unit 34 determines that the number of nodes 20 in the specified control group B3 exceeds the maximum number of nodes, and further divides the nodes 20 belonging to the control group B3 into two groups, one of which is divided into two groups. The group belongs to the lower mesh network C1, and the other group belongs to the lower mesh network C2.

The information processing unit 34 also determines the number of nodes 20 belonging to the remaining control groups B1 and B2. In the example of FIG. 19, the information processing unit 34 determines that the total number of nodes 20 belonging to control group B1 and the number of nodes 20 belonging to control group B2 exceeds the maximum number of nodes, and that the number of nodes 20 belonging to control group B1 is It is determined that the number of nodes 20 belonging to the control group B2 and the number of nodes 20 belonging to the control group B2 are each equal to or less than the maximum number of nodes. The information processing unit 34 causes the node 20 belonging to the control group B1 to belong to the lower mesh network C3, and causes the node 20 belonging to the control group B2 to belong to the lower mesh network C4.

As a result, as shown in FIG. 19, a part of the control group B3 is associated with the lower mesh network C1, and another part of the control group B3 is associated with the lower mesh network C2. The lower mesh network C3 is associated with the control group B1, and the lower mesh network C4 is associated with the control group B2.

Focusing on control group B, in the example of FIG. 19, when the number of nodes 20 belonging to the same control group B1 (or control group B2) is equal to or less than the maximum number of nodes, belong to the same lower mesh network. Furthermore, when the number of nodes 20 belonging to the same control group B3 is greater than the maximum number of nodes, the information processing unit 34 divides the nodes 20 into two or more lower mesh networks and makes them belong.

In addition, when nodes 20 belonging to the same control group are divided into two or more lower mesh networks to belong to, how to divide the nodes 20 belonging to the same control group into two or more groups is as follows. , not particularly limited. For example, the information processing unit 34 acquires placement information indicating the placement of a plurality of nodes 20, and based on the acquired placement information, determines which nodes 20 belong to the same control group by considering the proximity of their positions (coordinates). can be divided into two or more groups.

Further, when the arrangement information includes partition information (described later), the information processing unit 34 determines whether the nodes 20 are installed in such a manner that nodes 20 installed in the same partition are placed in the same group preferentially. Nodes 20 belonging to the same control group can be divided into two or more groups in consideration of partitioning.

Furthermore, when nodes 20 belonging to n (n is a natural number from 2 to m) control groups out of m (m is a natural number from 3 to m) control groups belong to one lower mesh network, m There is also no particular limitation on the method of selecting n control groups from n control groups. For example, the information processing unit 34 assigns n control groups having close positions (coordinates) from among the m control groups to the same lower mesh network based on the acquired arrangement information. can be selected as

Further, when the arrangement information includes partition information (described later), the information processing unit 34 selects n control groups to belong to the same lower mesh network, taking into consideration whether or not they are installed in the same partition. may be selected.

As explained above, in the third embodiment, the information terminal 30 acquires control group information, and based on the acquired control group information, among the plurality of nodes 20, the nodes 20 belonging to the same group are Make it belong to the lower mesh network.

Such an information terminal 30 can support a setter in determining a lower mesh network.

[Modification of Example 3]
In a modification of the third embodiment, a method will be described in which a lower mesh network to which each of the plurality of nodes 20 belongs is determined based on the partition of the space in which the plurality of nodes 20 are installed. FIG. 20 is a flowchart of a modification of the third embodiment.

The information processing unit 34 of the information terminal 30 acquires placement information including partition information from the storage unit 35 (S71). The arrangement information is, for example, generated, read, or modified by the information processing unit 34 before step S71. FIG. 21 is a diagram illustrating an example of placement information including partition information. FIG. 21 is a visualization of the arrangement information and corresponds to a plan view of a space in which a plurality of nodes 20 are arranged.

In FIG. 21, circles indicate the positions of nodes 20. In the arrangement information including section information, the two-dimensional coordinates of each of the plurality of nodes 20 are associated with the section to which the node 20 belongs. Here, a division is, for example, a unit (i.e., a room) in which space is physically divided by a structure such as a wall or a door, but it is also a unit (in other words, a room) divided by purpose without a clear structure (for operational reasons). unit). In the example of FIG. 21, the space is divided into six sections A to F.

The information processing unit 34 determines which of the plurality of lower mesh networks each of the plurality of nodes 20 should belong to, based on the partition information included in the acquired arrangement information (S72). For example, the information processing unit 34 associates a partition and a lower mesh network on a one-to-one basis, and causes nodes 20 installed in the same partition among the plurality of nodes 20 to belong to the same lower mesh network.

As described above, in a hierarchical mesh network, when information is transmitted within a certain lower mesh network, the information is not relayed in other lower mesh networks. Further, nodes 20 installed in the same section are often controlled collectively (or in conjunction). Therefore, by creating a one-to-one correspondence between sections and lower mesh networks, it is possible to suppress unnecessary communications in other lower mesh networks when controlling a plurality of nodes 20. .

Thereafter, when the operation reception unit 31 receives an operation instructing to change the partition, the information processing unit 34 updates the partition information stored in the storage unit 35 (S73). Changing the partition includes changing the partition in which the existing node 20 is installed, adding a new node 20 to the partition, and erasing (deletion) the affiliation of the existing node 20 to the partition.

In response to the update of the partition information, the information processing unit 34 re-determines which of the plurality of lower mesh networks each of the plurality of nodes 20 should belong to in accordance with the change in the partition (S74). For example, the information processing unit 34 associates a partition and a lower mesh network on a one-to-one basis, and causes nodes 20 installed in the same partition among the plurality of nodes 20 to belong to the same lower mesh network. In other words, the lower mesh network to which the plurality of nodes 20 belong is automatically changed in accordance with the change of the partition.

In addition, if the maximum number of nodes 20 (in other words, an upper limit number or a predetermined number) of nodes 20 that belong to the same lower mesh network is determined, the number of nodes 20 installed in the same section does not exceed the maximum number of nodes. If the number exceeds the number, it is not possible to make one-to-one correspondence between the partitions and the lower mesh networks.

In such a case, the information processing unit 34 determines whether the number of nodes 20 installed in each section exceeds the maximum number of nodes, as in the third embodiment. For example, when the information processing unit 34 determines that the number of nodes 20 installed in the same section is less than or equal to the maximum number of nodes, the information processing unit 34 causes the nodes 20 to belong to the same lower mesh network. When the information processing unit 34 determines that the number of nodes 20 installed in the same section is greater than the maximum number of nodes, the information processing unit 34 divides the nodes 20 into two or more lower mesh networks and makes them belong.

Note that there is no particular limitation on how the nodes 20 installed in the same section are divided into two or more groups. For example, the information processing unit 34 can divide the nodes 20 installed in the same section into two or more groups based on the proximity of the positions (coordinates) based on the arrangement information. The information processing unit 34 acquires control group information in addition to placement information, and installs the nodes 20 in the same section in consideration of the control group, such as preferentially placing nodes 20 belonging to the same control group into the same group. The nodes 20 may be divided into two or more groups.

Further, as in the third embodiment, when the number of nodes 20 installed in each section is small, the information processing unit 34 makes the nodes 20 arranged in a plurality of sections belong to one lower mesh network. Good too. For example, the information processing unit 34 may place a node 20 installed in a first partition among the plurality of nodes 20, and a node 20 installed in a second partition different from the first partition among the plurality of nodes 20 into the same lower level. Belong to a mesh network.

Note that when nodes 20 installed in n (n is a natural number from 2 to m) out of m (m is a natural number from 2 to m) partitions belong to one lower mesh network, m There is no particular limitation on the method of selecting n pieces from the partitions. For example, the information processing unit 34 can select n sections having close positions (coordinates) from among the m sections based on the arrangement information as the n sections to belong to the same lower mesh network. . The information processing unit 34 acquires control group information in addition to placement information, and selects n sections to belong to the same lower mesh network by considering whether they belong to the same control group. good.

As explained above, in the third embodiment, the information terminal 30 acquires placement information including classification information, and based on the classification information, assigns nodes 20 belonging to the same group among the plurality of nodes 20 to the same lower level. Belong to a mesh network.

Such an information terminal 30 can support a setter in determining a lower mesh network.

[Summary of Example 3 and its variations]
As explained above, the information terminal 30 includes the information processing unit 34 that executes information processing for constructing a hierarchical mesh network. The hierarchical mesh network includes a plurality of lower mesh networks and an upper mesh network configured by management nodes belonging to each of the plurality of lower mesh networks. The information processing unit 34 acquires at least one of control group information indicating a group when the plurality of nodes 20 are controlled and arrangement information indicating the arrangement of the plurality of nodes 20, and Based on the information, it is determined which of the plurality of lower mesh networks each of the plurality of nodes 20 should belong to. The lower mesh network is an example of the first mesh network, and the upper mesh network is an example of the second mesh network.

Such an information terminal 30 can support a setter in determining a lower mesh network. In other words, the information terminal 30 can support the setting work for constructing a hierarchical mesh network.

Further, for example, the information processing unit 34 acquires control group information, and causes nodes 20 belonging to the same group among the plurality of nodes 20 to belong to the same lower mesh network based on the acquired control group information. .

Such an information terminal 30 can determine a lower mesh network so that unnecessary communication is suppressed from occurring when controlling a plurality of nodes 20.

Further, for example, when the number of nodes 20 belonging to the same group is less than or equal to a predetermined number, the information processing unit 34 causes the node 20 to belong to the same lower mesh network, and If the number of nodes 20 is greater than a predetermined number, the node 20 is divided into two or more lower mesh networks and made to belong.

Such an information terminal 30 is designed to be connected to a lower mesh network such that unnecessary communication is suppressed when controlling a plurality of nodes 20 while taking into account the limit on the number of nodes in the lower mesh network. can be determined.

Further, for example, the information processing unit 34 acquires placement information in addition to the control group information, and when the number of nodes 20 belonging to the same group is greater than a predetermined number, the information processing unit 34 The network is divided into two or more lower mesh networks based on the information.

Such an information terminal 30 improves the communication performance between the nodes 20 by considering the arrangement of the nodes 20 when dividing the nodes 20 belonging to the same group into two or more lower mesh networks. can be achieved.

Further, for example, the information processing unit 34 may select a node 20 belonging to a first group among the plurality of nodes 20 and a node 20 belonging to a second group different from the first group among the plurality of nodes 20 into the same subordinate group. Belong to a mesh network.

Such an information terminal 30 determines a lower mesh network in such a way as to reduce the total number of lower mesh networks and to suppress unnecessary communication from occurring when controlling a plurality of nodes 20. I can do it.

For example, the information processing unit 34 determines which of the plurality of lower mesh networks each of the plurality of nodes 20 should belong to and then changes the group when the plurality of nodes 20 are controlled. In response to the change, it is determined again which of the plurality of lower mesh networks each of the plurality of nodes 20 should belong to.

Such an information terminal 30 can automatically change the lower mesh network to which the plurality of nodes 20 belong in accordance with a change in group (control group).

Further, for example, the arrangement information includes partition information indicating the partition of the space in which the plurality of nodes 20 are installed. The information processing unit 34 acquires the placement information, and makes the nodes 20 installed in the same section among the plurality of nodes 20 belong to the same lower mesh network based on the section information included in the obtained placement information.

Such an information terminal 30 can determine a lower mesh network so that unnecessary communication is suppressed from occurring when controlling a plurality of nodes 20.

Further, for example, when the number of nodes 20 installed in the same division is less than or equal to a predetermined number, the information processing unit 34 makes the nodes 20 belong to the same lower mesh network, and makes the nodes 20 installed in the same division When the number of nodes 20 is greater than a predetermined number, the nodes 20 are divided and made to belong to two or more lower mesh networks.

Such an information terminal 30 is designed to be connected to a lower mesh network such that unnecessary communication is suppressed when controlling a plurality of nodes 20 while taking into account the limit on the number of nodes in the lower mesh network. can be determined.

For example, if the number of nodes 20 installed in the same section is greater than a predetermined number, the information processing unit 34 may assign the node 20 to two or more lower mesh networks based on the acquired arrangement information. to belong to.

Such an information terminal 30 improves the communication performance between the nodes 20 by considering the arrangement of the nodes 20 when dividing the nodes 20 arranged in the same partition into two or more lower mesh networks and making them belong. You can improve your performance.

Further, for example, the information processing unit 34 may configure the nodes 20 installed in a first section among the plurality of nodes 20 and the nodes 20 installed in a second section different from the first section among the plurality of nodes 20 to be the same. belong to the lower mesh network.

Such an information terminal 30 determines a lower mesh network in such a way as to reduce the total number of lower mesh networks and to suppress unnecessary communication from occurring when controlling a plurality of nodes 20. I can do it.

Further, for example, when the section in which the plurality of nodes 20 is installed is changed after determining which of the plurality of lower mesh networks each of the plurality of nodes 20 should belong to, the information processing unit 34 Depending on the change, it is determined again which of the plurality of lower mesh networks each of the plurality of nodes 20 should belong to.

Such an information terminal 30 can automatically change the lower mesh network to which the plurality of nodes 20 belong in accordance with a change in the partition.

The communication system 10 also includes an information terminal 30 and a plurality of nodes 20.

Such a communication system 10 can assist a setter in determining a subordinate mesh network. In other words, the communication system 10 can support the setting work for constructing a hierarchical mesh network.

Further, for example, the plurality of nodes 20 include lighting equipment.

Such a communication system 10 can function as a control system for lighting equipment.

Further, an information processing method for constructing a hierarchical mesh network executed by a computer such as the information terminal 30 includes control group information indicating a group when a plurality of nodes 20 are controlled, and control group information indicating a group when a plurality of nodes 20 are controlled. At least one piece of arrangement information indicating the arrangement of the nodes 20 is acquired, and based on the acquired at least one piece of information, it is determined which of the plurality of lower mesh networks each of the plurality of nodes 20 should belong to.

Such an information processing method can assist a setter in determining a subordinate mesh network. In other words, the information processing method can support configuration work for constructing a hierarchical mesh network.

[Example 4]
Embodiment 4, unlike Embodiments 1 to 3, describes a method for each of a plurality of nodes 20 to participate in a lower mesh network, and a method for causing a part of a plurality of nodes 20 to participate in a lower mesh network as a management node. do. In addition, in Example 4, unless otherwise specified, description will be made assuming that all nodes 20 do not participate in the hierarchical mesh network. Furthermore, in the fourth embodiment, "communicatable" means that direct communication is possible between the nodes 20 without going through other nodes 20.

FIG. 22 is a flowchart showing the operation (that is, the information processing method) of the communication system 10 in the fourth embodiment. FIG. 22(a) is a flowchart showing the operation of the information terminal 30. FIG. 22(b) is a flowchart showing the operation of the management node determined by the first entry process described later. FIG. 22C is a flowchart showing the operation of the relay node determined by the determination process described later.

First, when the operation reception unit 31 of the information terminal 30 receives a predetermined operation by the setter, the information processing unit 34 of the information terminal 30 executes a first entry process. The first entry process is a process of searching for a node 20 that can communicate with the information terminal 30 and causing the searched node 20 to enter one of a plurality of lower mesh networks (first mesh network) as a management node. "Searching for a node" here means searching for a node 20 among the plurality of nodes 20 whose wireless communication unit 33 of the information terminal 30 can receive a periodically transmitted beacon signal.

As shown in FIG. 22(a), in the first entry process, the information processing unit 34 searches for the node 20 (S81). After searching for a node 20 that can receive a beacon signal, the information processing unit 34 of the information terminal 30 determines the searched node 20 as the management node (S82). That is, the information processing unit 34 of the information terminal 30 allows the searched node 20 to enter the lower mesh network, and determines the node 20 to be the management node of the lower mesh network. Note that if there are a plurality of searched nodes 20, the information processing unit 34 of the information terminal 30 determines each of the searched nodes 20 as a management node.

Further, the information processing unit 34 of the information terminal 30 does not decide all the searched nodes 20 as management nodes, but only if the strength of the radio waves of the beacon signal (for example, the RSSI (Received Signal Strength Indication) value) is greater than or equal to a predetermined value. Only the node 20 may be determined to be the management node. In this case, it becomes easier to ensure communication performance that allows reliable communication between the information terminal 30 and the management node.

It is also conceivable that too many management nodes will increase traffic and place a load on the system, or that the maximum number of management nodes that can be registered in the system will be exceeded. Therefore, the information processing unit 34 of the information terminal 30 may limit the number of management nodes to a predetermined number. For example, when the searched nodes 20 are arranged in order of the strength of the radio waves of the beacon signal, the information processing unit 34 of the information terminal 30 may determine only a predetermined number of nodes 20 from the highest to be management nodes. Further, for example, the information processing unit 34 of the information terminal 30 may randomly determine a predetermined number of management nodes from among the searched nodes 20.

Then, the information processing unit 34 of the information terminal 30 transmits determination information to the node 20 determined to be the management node (S83). The determination information includes the network ID of the lower mesh network to which the determined management node belongs, and the address information (unicast address) of the node 20 used for communication within the hierarchical mesh network. Further, the decision information includes information necessary for the node 20 to function as a management node. Note that the decision information includes, as necessary, a security passcode used for communication within the lower mesh network, information regarding the information terminal 30 (information regarding the device that manages the hierarchical mesh network), etc. Good too.

When the node 20 determined to be a management node acquires the determination information, the node 20 enters the lower mesh network as a management node.

Here, a specific example of the first entry process will be described using FIG. 23. FIG. 23 is an explanatory diagram of the first entry process by the information terminal 30 in the fourth embodiment. In FIG. 23, management nodes are represented by black circles, and nodes that have not joined the hierarchical mesh network are represented by white circles. Further, in FIG. 23, a bidirectional arrow between the information terminal 30 and a node indicates that communication is possible between the information terminal 30 and the node. The expression in FIG. 23 is also the same in FIGS. 24 to 27, which will be described later.

In the example shown in FIG. 23, the information processing unit 34 of the information terminal 30 searches for three nodes 20A, 20B, and 20C in the first entry process. Therefore, the information processing unit 34 of the information terminal 30 determines the three nodes 20A, 20B, and 20C as management nodes, and transmits determination information to the three nodes 20A, 20B, and 20C, respectively. Thereby, the nodes 20A, 20B, and 20C all function as management nodes by acquiring the decision information.

Next, the management node executes a second entry process and a determination process. The second entry process and the determination process are executed by an information processing unit (not shown) included in the node 20, which is a management node. The information processing section is realized by, for example, a microcomputer, but may also be realized by a processor or a dedicated circuit. The functions of the information processing unit are realized by hardware such as a microcomputer or processor that constitutes the information processing unit executing a computer program (software) stored in a storage unit (not shown) included in the management node. Ru. The second entry process and the decision process are automatically executed by the node 20 (management node) when the node 20 acquires the decision information and starts functioning as a management node.

The second entry process is a process of searching for a communicable node 20 and causing the searched node 20 to enter the lower mesh network (first mesh network) to which it (here, the management node) belongs. Here, "searching for a node" means searching for a node 20 among a plurality of nodes 20 whose wireless communication unit 21 of the management node can receive a regularly transmitted beacon signal. In addition, when there are multiple management nodes, the multiple management nodes may execute the second entry process in the order in which the information processing unit 34 of the information terminal 30 determines these multiple management nodes, or the management nodes and The second entry process may be performed in order of the signal strength with respect to the information terminal 30, or the second entry process may be performed randomly.

Note that "searching for a node" may also include, for example, broadcasting a search signal from the wireless communication unit 21 of the management node. In this case, the node 20 that has received the search signal enters the lower mesh network to which the management node that is the source of the search signal belongs. Here, when the node 20 receives search signals from multiple management nodes, it may enter the lower mesh network to which the management node that is the source of the search signal with the highest signal strength belongs. .

The determination process is a process of determining a relay node based on the strength of radio waves received by itself (here, the management node) in the lower mesh network (to which the management node belongs). In the fourth embodiment, the relay node is a new management node that belongs to a lower mesh network (first mesh network) different from the lower mesh network (first mesh network) to which the management node belongs. That is, the node 20 determined to be a relay node by the determination process leaves the lower mesh network to which the management node belongs, and functions as a new management node belonging to a new lower mesh network. Details of the determination process will be explained in step S93, which will be described later.

As shown in FIG. 22(b), in the second entry process, the information processing unit of the management node searches for the node 20 (S91). After searching for a node 20 that can receive a beacon signal, the information processing unit of the management node causes the searched node 20 to enter the lower mesh network to which the management node belongs (S92).

Here, the information processing unit of the management node transmits participation information to the node 20 that is desired to participate. The entry information includes the lower mesh network ID to which the management node belongs and the address information (unicast address) of the node 20 used for communication within the hierarchical mesh network. Note that the entry information includes, as necessary, a security passcode used for communication within the lower mesh network, information regarding the information terminal 30 (information regarding the device that manages the hierarchical mesh network), etc. Good too.

Note that the address information of the node 20 may be assigned to the node 20 by the information processing unit 34 of the information terminal 30 via a management node (or a relay node described later), or may be assigned to the node 20 by the information processing unit 34 of the information terminal 30 via a management node (or a relay node described later) ) may allocate the information to the node 20. In the latter case, the information processing unit of the management node (or relay node) allocates address information subordinate to the address information of the management node (or relay node) to the node 20, for example. Thereby, it is possible to avoid duplication with address information of nodes 20 belonging to other lower mesh networks.

When the node 20 acquires the entry information, the node 20 enters the lower mesh network to which the management node belongs. The node 20 that has joined the lower mesh network stops the regular transmission of beacon signals that it had been performing before joining.

Here, a specific example of the second entry process by the management node will be described using FIG. 24. FIG. 24 is an explanatory diagram of the second entry process by the management node in the fourth embodiment. In FIG. 24, nodes that have entered the lower mesh network are represented by dot-hatched circles. Further, in FIG. 24, bidirectional arrows between nodes indicate that communication is possible between the nodes. Further, in FIG. 24, a broken line frame indicates that a plurality of nodes surrounded by the frame belong to the same lower mesh network. The expression in FIG. 24 is also the same in FIGS. 25 to 27, which will be described later.

In the example shown in FIG. 24, the information processing units of three nodes 20A, 20B, and 20C, which are management nodes, each execute the second entry process. As a result, a plurality of nodes (four in this case) that can communicate with the node 20A enter the lower mesh network in which the node 20A is the management node (see the broken line frame at the upper left in FIG. 24). Further, a plurality of nodes (four in this case) that can communicate with the node 20B enter the lower mesh network in which the node 20B is the management node (see the broken line frame in the upper right corner of FIG. 24). Further, a plurality of nodes (three in this case) that can communicate with the node 20C enter the lower mesh network in which the node 20C is the management node (see the broken line frame at the bottom right in FIG. 24).

Next, as shown in FIG. 22(b), the information processing unit of the management node determines a relay node in a determination process (S93). In step S93, the information processing unit of the management node selects the node 20 with the lowest radio wave intensity among the one or more nodes 20 for which the radio wave intensity (here, RSSI value) of the received beacon signal is equal to or higher than the threshold value. Decided to be a relay node. The threshold value is appropriately set, for example, to a value that can ensure communication performance that allows reliable communication between the management node and the node 20.

That is, the information processing unit of the management node determines, as the relay node, the node 20 that is located farthest from the management node among the one or more nodes 20 that can reliably communicate with itself. This can reduce the possibility that the relay node will be too close to the management node and will not be able to search for nodes 20 that have not entered the hierarchical mesh network in the second entry process by the relay node, which will be described later. .

Note that the information processing unit of the management node does not execute the determination process when only one node 20 has joined the lower mesh network to which the management node belongs. This is because if the determination process is executed in such a case, only the management node will belong to the lower mesh network, and the unnecessary lower mesh network will remain in the hierarchical mesh network.

Then, the information processing unit of the management node transmits relay determination information to the node 20 determined to be the relay node (S94). The relay determination information includes the network ID of a new lower mesh network different from the lower mesh network to which the management node belongs. Further, the relay determination information includes information necessary for the node 20 to function as a new management node. Note that the relay determination information includes, as necessary, a security passcode used for communication within the new lower mesh network, information regarding the information terminal 30 (information regarding the device that manages the hierarchical mesh network), etc. May be included.

When the node 20 determined to be a relay node acquires the relay determination information, the node 20 functions as a relay node. Here, the node 20 leaves the lower mesh network to which the management node belongs and enters a new lower mesh network as a relay node (new management node).

Here, a specific example of the determination process by the management node will be described using FIG. 25. FIG. 25 is an explanatory diagram of determination processing by the management node in the fourth embodiment. In FIG. 25, a solid line frame indicates that the node surrounded by the frame has been changed to a relay node (here, a new management node).

In the example shown in FIG. 25, the information processing unit of node 20B, which is a management node, executes the determination process. Note that the information processing units of the nodes 20A and 20C, which are management nodes, also execute determination processing, but a description thereof will be omitted here. The information processing unit of the node 20B executes the determination process to select the node 20D, which is a node that can reliably communicate with the node 20B and is located at the farthest position from the node 20B, as a relay node (here Then, the node 20D is determined to be a new management node) and transmits relay determination information to the node 20D. Thereby, the node 20D functions as a relay node from now on by acquiring the relay determination information.

Next, the relay node executes the second entry process and the determination process similarly to the management node. In other words, the relay node executes the second entry process and the determination process as a new management node. The second entry process and the determination process are executed by an information processing unit (not shown) included in the node 20, which is a relay node. The second entry process and the determination process are automatically executed by the node 20 (relay node) when the node 20 acquires the relay determination information and starts functioning as a relay node.

The second entry process executed by the relay node is a process of searching for a node 20 with which it can communicate and causing the searched node 20 to enter the lower mesh network (first mesh network) to which it (here, the relay node) belongs. be. Here, "searching for a node" means searching for a node 20 among a plurality of nodes 20 whose wireless communication unit 21 of a relay node can receive a periodically transmitted beacon signal.

The decision process executed by a relay node is to determine a relay node (that is, a new relay node) based on the strength of the radio waves that it (in this case, the relay node) receives in the lower mesh network (to which the relay node belongs). This is the process of The node 20 determined to be a new relay node by the determination process leaves the lower mesh network to which the relay node belongs, and functions as a new management node belonging to the new lower mesh network.

Here, if the relay node cannot search for the node 20 in the second entry process, the relay node is returned to the lower mesh network (first mesh network) to which the management node belongs. In other words, if a relay node (new management node) cannot search for node 20, only the relay node will belong to the new lower mesh network, and an unnecessary lower mesh network will remain in the hierarchical mesh network. Become. Therefore, if the relay node cannot search for the node 20, it returns to the original lower mesh network to which it belonged in the past. This can prevent unnecessary lower mesh networks from remaining in the hierarchical mesh network.

As shown in FIG. 22(c), in the second entry process, the information processing unit of the relay node searches for the node 20 (S101). If there is a node 20 that can receive the beacon signal (Yes in S102), the information processing unit of the relay node causes the searched node 20 to enter the lower mesh network to which the relay node belongs (S103). From then on, the relay node officially functions as a new management node.

Here, the information processing unit of the relay node transmits entry information to the node 20 that is desired to enter. The entry information includes the lower mesh network ID to which the relay node belongs and the address information (unicast address) of the node 20 used for communication within the hierarchical mesh network. Note that the entry information includes, as necessary, a security passcode used for communication within the lower mesh network, information regarding the information terminal 30 (information regarding the device that manages the hierarchical mesh network), etc. Good too.

When the node 20 acquires the entry information, the node 20 enters the lower mesh network to which the relay node belongs.

Here, a specific example of the second entry process by the relay node will be described using FIG. 26. FIG. 26 is an explanatory diagram of the second entry process by the relay node in the fourth embodiment. In the example shown in FIG. 26, the information processing unit of node 20D, which is a relay node, executes the second entry process. As a result, the nodes that can communicate with the node 20D enter the lower mesh network in which the node 20D is the relay node (new management node) (see the broken line frame in the upper right corner of FIG. 26).

Next, as shown in FIG. 22C, the information processing unit of the relay node determines a relay node (that is, a new relay node) in a determination process (S104). In step S104, similarly to the determination process by the management node, the information processing unit of the relay node selects one or more nodes 20 whose radio wave intensity (here, RSSI value) of the received beacon signal is equal to or higher than a threshold value. The node 20 with the lowest radio wave intensity is determined as a new relay node. The threshold value is appropriately set, for example, to a value that can ensure communication performance that allows reliable communication between the relay node and the node 20.

In other words, the information processing unit of the relay node determines, as a new relay node, the node 20 located farthest from the relay node among the one or more nodes 20 that can reliably communicate with itself. This reduces the possibility that a new relay node will be too close to the relay node and will not be able to search for a node 20 that has not entered the hierarchical mesh network in the second entry process by the new relay node. I can do it.

Note that the information processing unit of the relay node does not perform the determination process when only one node 20 is participating in the lower mesh network to which the relay node belongs. This is because if the determination process is executed in such a case, only the relay node will belong to the lower mesh network, and the unnecessary lower mesh network will remain in the hierarchical mesh network.

In the example shown in FIG. 26, there is only one node 20 participating in the lower mesh network to which the relay node 20D belongs, so the information processing unit of the node 20D does not execute the determination process.

Then, as shown in FIG. 22(c), the information processing unit of the relay node transmits relay determination information to the node 20 determined as a new relay node (S105). The relay determination information includes a network ID of a new lower mesh network different from the lower mesh network to which the relay node belongs. Further, the relay determination information includes information necessary for the node 20 to function as a new management node. Note that the relay determination information includes, as necessary, a security passcode used for communication within the new lower mesh network, information regarding the information terminal 30 (information regarding the device that manages the hierarchical mesh network), etc. May be included.

When the node 20 determined to be a new relay node acquires the relay determination information, the node 20 functions as a new relay node. Here, the node 20 leaves the lower mesh network to which the management node belongs and enters the new lower mesh network as a new relay node (new management node).

On the other hand, if there is no node 20 that can receive the beacon signal (No in S102), the information processing unit of the relay node returns to the original lower mesh network to which it belonged in the past (S106). In this case, the relay node becomes a normal node 20 that is neither a management node nor a relay node in the original lower mesh network. Note that the relay node may maintain its status as a relay node, but preferably returns to the normal node 20. This is because unnecessary relay nodes can be prevented from remaining in the hierarchical mesh network.

Thereafter, the second entry process and decision process by subsequent relay nodes are continued until the information processing unit of the relay node is unable to search for the node 20 in the second entry process, or until the information processing unit of the relay node is unable to execute the decision process. is executed. Then, when the information processing unit of the relay node becomes unable to search for the node 20 in the second entry process, or when the information processing unit of the relay node becomes unable to execute the determination process, the process of searching for the series of nodes 20 described above is completed. .

The process of searching the series of nodes 20 described above is performed for each management node determined by the information terminal 30. As shown in FIG. 22(a), the information processing unit 34 of the information terminal 30 waits until the search for the nodes 20 is completed for all management nodes determined by the information terminal 30 (No in S84). Then, when the information processing unit 34 of the information terminal 30 completes the search for the nodes 20 for all the management nodes determined by the information terminal 30 (Yes in S84), the information processing unit 34 of the information terminal 30 generates registered information indicating the management node that has entered the hierarchical mesh network. (S85). For each management node that has entered the hierarchical mesh network, the registration information includes the network ID of the lower mesh network to which the management node belongs, and all nodes (including the management node) belonging to the lower mesh network. Contains address information and. The registration information also includes information indicating the relationship between two or more management nodes that can communicate with each other.

The information processing unit 34 of the information terminal 30 acquires registration information by receiving registration information transmitted from each management node. The timing at which each management node transmits the registration information is, for example, when each management node can no longer search for the node 20. That is, step S85 may be executed before the information terminal 30 completes the search for the nodes 20 for all the management nodes determined.

As explained above, in the fourth embodiment, the communication system 10 (information processing method) includes a first entry process by the information terminal 30, a second entry process and determination process by the management node, and a second entry process by the relay node. and determination processing.

Such a communication system 10 (information processing method) can automatically construct a hierarchical mesh network simply by a setter performing a predetermined operation on the information terminal 30. The effort required to build a network is reduced. In other words, such a communication system 10 (information processing method) can support setting work for constructing a hierarchical mesh network.

In addition, since such a communication system 10 (information processing method) constructs a hierarchical mesh network while actually communicating between the nodes 20, it is necessary to ensure that communication is possible between all nodes 20 belonging to the hierarchical mesh network. Easy to guarantee.

[Modification of Example 4]
FIG. 27 is an explanatory diagram of the operation (that is, the information processing method) of the communication system 10 in a modification of the fourth embodiment. In FIG. 27, all nodes except the two nodes surrounded by solid lines already belong to the hierarchical mesh network. In other words, since these two nodes do not belong to the hierarchical mesh network, they continue to periodically transmit beacon signals. Further, in FIG. 27, the beacon signals transmitted by these two nodes can be received by the node 20α that has already joined the hierarchical mesh network.

In such a case, the information processing unit of the node 20α transmits information indicating that there is a node 20 that has not joined the hierarchical mesh network to the information terminal 30. Upon acquiring the information, the information processing unit 34 of the information terminal 30 determines the node 20α, which is the source of the information, as the new management node. Then, the information processing unit 34 of the information terminal 30 transmits the decision information to the node 20α.

After acquiring the decision information, the information processing unit of the node 20α leaves the original lower mesh network and functions as a new management node. Then, by executing the second entry process, the information processing unit of the node 20α causes the two nodes that have not entered the hierarchical mesh network described above to enter the new lower mesh network to which the node 20α belongs.

As described above, in the modified example of the fourth embodiment, when a node 20 that has joined the hierarchical mesh network searches for a node 20 that has not joined the hierarchical mesh network, The current node 20 is determined to be the new management node, and the new management node is caused to execute the second entry process. Therefore, it is possible to reduce failure of nodes 20 to enter the hierarchical mesh network.

Further, in the fourth embodiment, the relay node functions as a new management node at the time of executing the second entry process, but the present invention is not limited to this. For example, the relay node may function as a new management node if it is able to search for the node 20 by executing the second entry process. In other words, if the relay node is able to search for node 20, the relay node searches for a new management node that belongs to a lower mesh network (first mesh network) that is different from the lower mesh network (first mesh network) to which the management node belongs. may be determined. Note that if the relay node cannot search for the node 20 by executing the second entry process, the relay node may maintain the status of the relay node or may return as the normal node 20; is preferred. This is because unnecessary relay nodes can be prevented from remaining in the hierarchical mesh network.

Furthermore, in the fourth embodiment, the communication system 10 (information processing method) only needs to execute at least the first entry process by the information terminal 30 and the second entry process by the management node, and the decision process by the management node and the relay node It is not necessary to perform the second entry process by the relay node and the determination process by the relay node.

[Summary of Example 4 and its modifications]
As explained above, the information processing method is an information processing method executed by a computer for constructing a hierarchical mesh network. The hierarchical mesh network includes a plurality of first mesh networks and a second mesh network configured by management nodes belonging to each of the plurality of first mesh networks. The information processing method searches for a node 20 that can communicate with the information terminal 30, and executes a first entry process in which the searched node 20 is made to enter one of a plurality of first mesh networks as a management node. The information processing method searches for a node 20 with which it can communicate, and causes the management node to execute a second entry process for allowing the searched node 20 to enter the first mesh network to which it belongs. The lower mesh network is an example of the first mesh network, and the upper mesh network is an example of the second mesh network.

With such an information processing method, a hierarchical mesh network can be automatically constructed simply by a configurator performing a predetermined operation on the information terminal 30, thereby eliminating the hassle of constructing a hierarchical mesh network by the configurator. is reduced. In other words, such an information processing method can support setting work for constructing a hierarchical mesh network.

Further, for example, the information processing method causes the management node to execute a determination process for determining a relay node based on the strength of radio waves received by the management node in a lower mesh network to which the management node belongs.

In such an information processing method, since relay nodes are automatically determined, the effort required by the setter to construct a hierarchical mesh network is further reduced.

Further, for example, the information processing method causes the relay node to execute the second entry process.

In such an information processing method, since the relay nodes automatically construct a hierarchical mesh network, the effort required by the setter to construct a hierarchical mesh network is further reduced.

Further, for example, the relay node is a new management node that belongs to a lower mesh network different from the lower mesh network to which the management node belongs. In the information processing method, when the relay node cannot search for the node 20 in the second entry process, the relay node is returned to the lower mesh network to which the management node belongs.

Such an information processing method can prevent unnecessary lower mesh networks from remaining in a hierarchical mesh network.

Further, for example, the information processing method may determine only one management node for the first time of the first entry process.

With such an information processing method, it is possible to reduce the possibility that the management node determined at the first time will not be able to search for the node 20 in the second entry process.

Further, for example, if the relay node is able to search for the node 20, the relay node is determined to be a new management node that belongs to a lower mesh network different from the lower mesh network to which the management node belongs.

Such an information processing method can prevent unnecessary lower mesh networks from remaining in a hierarchical mesh network.

Further, for example, in the information processing method, if the relay node cannot search for the node 20 in the second entry process, the relay node may be returned as the node 20 (ordinary node 20) of the first mesh network to which the management node belongs. good.

Such an information processing method can prevent unnecessary relay nodes from remaining in a hierarchical mesh network.

Further, for example, the information processing method causes the relay node to execute the determination process when the relay node is able to search for the node 20 in the second entry process.

In such an information processing method, the relay node automatically constructs a hierarchical mesh network, which further reduces the effort required by the setter to construct a hierarchical mesh network.

Furthermore, for example, in the determination process, the node 20 with the lowest radio wave intensity among the plurality of nodes 20 whose radio wave intensity is equal to or greater than a threshold value is determined to be the relay node.

In such an information processing method, if a new relay node is too close to the relay node, it may become impossible for the new relay node to search for nodes 20 that have not entered the hierarchical mesh network in the second entry process. It is possible to reduce the

Furthermore, for example, if a node 20 that has joined the hierarchical mesh network searches for a node 20 that has not joined the hierarchical mesh network, the node 20 that has joined the hierarchical mesh network becomes the new management node. Then, the new management node executes the second entry process.

With such an information processing method, it is possible to reduce failure of nodes 20 to enter the hierarchical mesh network.

Further, for example, the information processing method acquires registration information indicating a management node that has entered the hierarchical mesh network.

With such an information processing method, since management nodes can be automatically registered, the effort required by the setter to construct a hierarchical mesh network is further reduced.

The communication system 10 also includes an information terminal 30 that includes an information processing unit 34 that executes information processing for constructing a hierarchical mesh network, and a plurality of nodes 20. The hierarchical mesh network includes a plurality of lower mesh networks and an upper mesh network configured by management nodes belonging to each of the plurality of lower mesh networks. The information processing unit 34 searches a plurality of nodes 20 for a node 20 with which communication is possible, and executes a first entry process of causing the searched node 20 to enter one of the plurality of lower mesh networks as a management node. The management node among the plurality of nodes 20 searches for a node 20 with which it can communicate, and executes a second entry process to allow the searched node 20 to enter the lower mesh network to which it belongs.

In such a communication system 10, a hierarchical mesh network can be automatically constructed simply by a setter performing a predetermined operation on the information terminal 30, thereby eliminating the trouble of constructing a hierarchical mesh network by the setter. is reduced. In other words, such a communication system 10 can support setting work for constructing a hierarchical mesh network.

Further, for example, the plurality of nodes 20 include lighting equipment.

Such a communication system 10 can function as a control system for lighting equipment.

Further, the node 20 is a node used in the communication system 10 described above, and when it is a management node, executes the second entry process.

With such a node 20, a hierarchical mesh network can be automatically constructed simply by the configurator performing a predetermined operation on the information terminal 30, and the configurator does not have to take the trouble of constructing a hierarchical mesh network. Reduced. In other words, such a node 20 can support configuration work for constructing a hierarchical mesh network.

[Example 5]
In the fifth embodiment, each of the plurality of nodes 20 belongs based on area information indicating a plurality of areas divided into two or more nodes 20 in a space where the plurality of nodes 20 are installed. A method for determining a lower mesh network will be explained.

First, I will explain the area. The area is a unit divided by, for example, a setter or a space designer to include two or more nodes 20. For example, an area may be a unit that includes two or more nodes 20 that are collectively controlled at the same timing, or a space such as a conference room that is physically divided by a structure such as a wall or a door. It may also be a unit. Further, the area may be a unit divided according to the purpose, for example.

In the fifth embodiment, area information indicating such a plurality of areas is stored (registered) in advance in the storage unit 35 of the information terminal 30 by being set by a setter, a space designer, or the like.

Here, an example of area information will be explained using FIG. 28. FIG. 28 is a diagram illustrating an example of area information in the fifth embodiment. FIG. 28 visualizes area information and corresponds to a plan view of a space in which a plurality of nodes 20 are arranged. In FIG. 28, circles indicate the positions of nodes 20. In the area information, each two-dimensional coordinate of a plurality of nodes 20 is associated with an area to which the node 20 belongs. In the example shown in FIG. 28, the space is divided into seven areas, area Ar1 to area Ar7. Note that in the example shown in FIG. 28, the plurality of areas Ar1 to Ar7 are all rectangular, but the shape of each area is not limited to the rectangular shape, and may be other shapes such as a circular shape.

Hereinafter, a method of determining a lower mesh network to which each of the plurality of nodes 20 belongs will be described based on such area information. FIG. 29 is a flowchart of the fifth embodiment.

First, the information processing unit 34 of the information terminal 30 acquires area information from the storage unit 35 (S111). Then, the information processing unit 34 executes a determination process to determine whether the constraint conditions are satisfied for each area based on the acquired area information (S112). Here, the constraint condition is a condition imposed so that two or more nodes 20 belonging to the lower mesh network can communicate with each other. Therefore, if an area satisfies the constraint conditions, the area may be determined to be a lower mesh network, that is, two or more nodes 20 belonging to the area may belong to the same lower mesh network as is. It turns out. On the other hand, if the area does not satisfy the constraint conditions, the area must be divided so that the area after division satisfies the constraint conditions.

Here, the area is divided in order to determine the divided area as the lower mesh network, but the area is only virtually divided in the process of determining the lower mesh network. Therefore, even if an area is divided, the area information itself is not updated.

In the fifth embodiment, the constraint conditions include that the longest distance L1 (see FIG. 30, etc.) in the target area is less than or equal to the reference distance based on the communicable distance between the nodes 20. Here, the longest distance L1 in an area is the distance between two points farthest from each other in the area, or a distance equivalent to the distance.

Examples of the longest distance L1 will be listed below. FIG. 30 is a diagram illustrating an example of the longest distance L1 and an example of division processing in Example 5. FIG. 30(a) shows an example where the area Ar is rectangular. In the example shown in FIG. 30(a), the longest distance L1 corresponds to the length of the diagonal line of the area Ar.

(b) in FIG. 30 is an example where the area Ar is rectangular, but is tilted with respect to the horizontal direction (X-axis direction) and vertical direction (Y-axis direction) in the plan view of the space in the area information. shows. In the example shown in FIG. 30(b), the longest distance L1 corresponds to the length of a diagonal line of a rectangle Sq circumscribing the area Ar in a two-dimensional orthogonal coordinate system (XY coordinate system). Rectangle Sq is a rectangle having two horizontal sides parallel to the X-axis direction and two vertical sides parallel to the Y-axis direction.

FIG. 30(c) shows an example where the area Ar is not a simple rectangular shape but a complicated shape. In the example shown in FIG. 30(c), the longest distance L1 corresponds to the length of the diagonal of the rectangle Sq circumscribing the area Ar in the two-dimensional orthogonal coordinate system, as in the example shown in FIG. 30(b). do.

Moreover, the longest distance L1 may be the distance between the two nodes 20 that are farthest from each other among the two or more nodes 20 included in the area. In this case, the longest distance L1 corresponds to the length of a line segment connecting the two-dimensional coordinates of these two nodes. In the following, the longest distance L1 is assumed to be the length of the diagonal of the area Ar or the length of the diagonal of the rectangle Sq circumscribing the area Ar in the two-dimensional orthogonal coordinate system.

Furthermore, the communicable distance referred to here is the upper limit of the distance at which any node 20 can reliably communicate with another node 20 . Here, the communicable distance is defined as the distance that ensures communication between any node 20 and other nodes 20 when there are no obstacles (for example, walls, fixtures, etc.) that impede communication between these nodes 20. This is the upper limit of possible distances.

In reality, for example, there may be obstacles between the two nodes 20, or the diffraction properties (ease of wraparound) of radio waves may differ depending on the frequency of the radio waves used. The distance that is considered to be reliably communicable between 20 devices is shorter than the above-mentioned communicable distance depending on the communication environment. Therefore, in the fifth embodiment, in the comparison with the longest distance L1 in the determination process, a reference distance calculated by multiplying the communicable distance by a coefficient is used instead of the communicable distance described above.

The coefficient is a real number greater than 0 and less than or equal to 1, and is a constant set in advance in consideration of the above communication environment. The coefficient is 0.8 as an example. Note that the coefficient is not limited to a constant, but may be a variable that changes depending on the frequency of the radio waves used, for example. In this case, the coefficient is set such that, for example, the higher the frequency of the radio waves used is, the larger the coefficient is, and the coefficient is set so that the lower the frequency of the radio waves used is, the smaller the coefficient is.

Further, the coefficient may be changed depending on how to express the longest distance L1 described above. In other words, if the longest distance L1 is expressed by the length of the diagonal of the area Ar or rectangle Sq, and if the longest distance L1 is expressed by the distance between the two nodes 20 that are farthest from each other, the coefficients are different. You can also let

In the determination process, the information processing unit 34 calculates the longest distance L1 for each area based on the acquired area information. Then, the information processing unit 34 determines whether or not the constraint condition is satisfied by comparing the calculated longest distance L1 and the reference distance for each area.

As shown in FIG. 29, if the target area satisfies the constraint conditions (Yes in S113), that is, if the longest distance L1 is less than or equal to the reference distance, the information processing unit 34 determines the area as a lower mesh network. (S114). In other words, in the determination process, if the area satisfies the constraint conditions, the information processing unit 34 determines the area to be any one of the plurality of first mesh networks (lower mesh networks). Here, "determining an area as a lower mesh network" means that two or more nodes 20 included in the area are made to belong to the lower mesh network corresponding to the area.

On the other hand, if the target area does not satisfy the constraint conditions (No in S113), that is, if the longest distance L1 exceeds the reference distance, the information processing unit 34 executes a division process to divide the area (S115). Here, the division process is a process of dividing the target area into two or more areas. By dividing an area that does not satisfy the constraint conditions through the division process, the longest distance L1 in the area after division becomes shorter than the longest distance L1 in the area before division. Therefore, the area after division will more easily satisfy the constraint condition, and if the constraint condition is satisfied, the area after division will be determined as a lower mesh network.

Examples of division processing will be listed below. In the example shown in (a) of FIG. 30, in the division process, the information processing unit 34 divides the long side of the area Ar that does not satisfy the constraint condition into two equal parts (see the dashed-dotted line). In other words, the information processing unit 34 divides the area Ar into two equal parts in the longitudinal direction. In addition, in the examples shown in FIGS. 30(b) and 30(c), in the division process, the information processing unit 34 creates a rectangle circumscribing the area Ar that does not satisfy the constraint conditions in the two-dimensional orthogonal coordinate system (XY coordinate system). The area Ar is divided so that the long side of Sq is divided into two halves (see the dashed line). In the example shown in FIG. 30(c), since the rectangle Sq is a square, the information processing unit 34 may divide the sides along the X-axis direction into equal parts, or divide the sides along the Y-axis direction into equal parts. You can also divide the sides into equal parts.

FIG. 31 is a diagram illustrating another example of the division process in the fifth embodiment. FIG. 31 shows a case where the area Ar is rectangular and the longest distance L1 is longer than the longest distance L1 shown in FIG. In this way, when the longest distance L1 is relatively long, simply dividing the area Ar into two areas may not make the longest distance L1 of the divided area equal to or less than the reference distance. In such a case, in the division process, the information processing unit 34 divides the area Ar into three or more parts by dividing the long side of the area Ar that does not satisfy the constraint condition or the long side of the rectangle Sq into three or more parts. do. In the example shown in FIG. 31, the information processing unit 34 divides the long side of the area Ar into thirds (see the dashed line). In the division process, the number of divisions of the area Ar that does not satisfy the constraint conditions may be determined as appropriate depending on the length of the longest distance L1.

FIG. 32 is a diagram illustrating still another example of the division process in the fifth embodiment. FIG. 32 shows a case where the area Ar has a complicated shape and, like FIG. 31, the longest distance L1 is longer than the longest distance L1 shown in FIG. FIG. 32 shows an example in which the information processing unit 34 repeats the determination process and the division process until the area after division satisfies the constraint conditions while keeping the number of divisions of the area Ar constant (here, two divisions) in the division process. .

That is, as shown in FIG. 32(a), the information processing unit 34 first determines the length of a rectangle Sq circumscribing the area Ar that does not satisfy the constraint conditions in the two-dimensional orthogonal coordinate system (XY coordinate system) in the division process. The area Ar is divided so that the sides are divided into two halves (see the vertical dashed line). As a result, as shown in FIG. 32(b), area Ar is divided into two areas, area Ar01 and area Ar02.

Here, the information processing unit 34 further performs determination processing for each of the two areas Ar01 and Ar02 after the division. That is, the information processing unit 34 calculates the longest distance L01 of the area Ar01 and the longest distance L02 of the area Ar02, and compares each of the longest distances L01 and L02 with the reference distance. The longest distance L01 of area Ar01 corresponds to the length of the diagonal of rectangle Sq01 circumscribing area Ar01. The longest distance L02 of the area Ar02 corresponds to the length of the diagonal line of the rectangle Sq02 circumscribing the area Ar02.

In the example shown in FIG. 32, it is assumed that the longest distance L01 of area Ar01 exceeds the reference distance, while the longest distance L02 of area Ar02 is less than or equal to the reference distance. In this case, the information processing unit 34 determines area Ar02 as the lower mesh network, and further performs division processing on area Ar01. That is, in the division process again, the information processing unit 34 divides the area Ar01 so that the long side of the rectangle Sq01 circumscribing the area Ar01 is divided into two halves (see the horizontal dotted line).

As described above, in the division process, the information processing unit 34 appropriately changes the number of divisions according to the length of the longest distance L1, so that the area can be divided so that the area after division satisfies the constraint conditions. good. Further, the information processing unit 34 may repeat the determination process and the division process until the area after division satisfies the constraint conditions. In the flowchart shown in FIG. 29, the information processing unit 34 executes the latter algorithm.

In addition, in the division process, the information processing unit 34 does not divide the target area or a rectangle circumscribing the area into equal parts, but divides the target area so that the longest distance L1 of the divided area becomes the reference distance. The area may be divided. In this case, when the target area is divided into a plurality of areas, the longest distance L1 of at least one area among the plurality of areas becomes the reference distance or less than the reference distance. Note that if there is an area where the longest distance L1 exceeds the reference distance even after the division process is executed, the same division process may be executed again for the area.

In this manner, when dividing the target area in the division process, the information processing unit 34 does not divide the target area into equal parts, but divides the area so that the shapes of two or more areas after division are irregular. You may.

Here, the results when the information processing unit 34 executes the determination process and the division process based on the example of the area information shown in FIG. 28 will be described using FIG. 33. FIG. 33 is a diagram illustrating an example of correspondence between areas and lower mesh networks in the fifth embodiment. In FIG. 33, a broken line frame indicates that two or more nodes surrounded by the frame belong to the same lower mesh network.

In the example shown in FIG. 33, areas Ar1 to Ar4 are determined to be lower mesh networks without being divided. On the other hand, area Ar5 is divided into two areas, area Ar51 and Ar52, by the division process. Further, area Ar6 is divided into areas Ar61 and Ar62 by division processing. Furthermore, area Ar7 is divided into areas Ar71 and Ar72 by division processing. These areas Ar51, Ar52, Ar61, Ar62, Ar71, and Ar72 are determined to be lower mesh networks, respectively.

As described above, in the fifth embodiment, the information terminal 30 (information processing method) acquires area information indicating a plurality of areas, and determines whether the target area satisfies the constraint conditions. Such an information terminal 30 (information processing method) automatically determines whether or not the area is suitable for the first mesh network (lower mesh network) based on the area set by the configurator or space designer. Therefore, there is no need for determination by the person setting the space or the designer of the space. In other words, such an information terminal 30 (information processing method) can support setting work for constructing a hierarchical mesh network.

Further, in the fifth embodiment, the information terminal 30 (information processing method) determines the target area as a lower mesh network if the area satisfies the constraint in the determination process, and if the area does not satisfy the constraint. Execute division processing to divide the area. Such an information terminal 30 (information processing method) can automatically determine a plurality of areas, including the area after division, into a plurality of lower mesh networks, so that the work by a setter or a space designer, etc. is unnecessary. is not necessary.

[Modification of Example 5]
In the fifth embodiment, the constraint conditions include that the longest distance L1 in the target area is equal to or less than the reference distance based on the communicable distance between the nodes 20, but the constraints are not limited to this. For example, the constraint condition may further include that the number of two or more nodes 20 in the target area is less than or equal to a reference number. Here, the reference number is, for example, the maximum number of nodes 20 that can belong to the lower mesh network. In this case, in the determination process, the information processing unit 34 determines that the constraint condition is satisfied only when the longest distance L1 in the target area is less than or equal to the reference distance and the number of nodes 20 is less than or equal to the reference number. do. On the other hand, in the determination process, even if the longest distance L1 in the target area is less than or equal to the reference distance, if the number of nodes 20 exceeds the reference number, the information processing unit 34 determines that the constraint condition is not satisfied, Execute division processing to divide the area.

Further, in the fifth embodiment, after determining the plurality of lower mesh networks, the information processing unit 34 uses the actual communication results between the plurality of nodes 20 to redetermine at least one or more lower mesh networks. You may. Specifically, if the communication status in any of the plurality of first mesh networks (lower mesh networks) does not satisfy a predetermined condition, the information processing unit 34 determines that at least the communication status does not satisfy the predetermined condition. For the area corresponding to the first mesh network, a division process may be performed to divide the area so as to satisfy stricter constraints than the above-mentioned constraints.

Here, when the communication status in the lower mesh network does not meet the predetermined conditions, it means that the communication status between the management node and the management nodes belonging to other lower mesh networks is interrupted, for example, and the communication status is relatively poor. This refers to the fact that there is one, or that there is only one node 20 belonging to the lower mesh network. In such a case, the information processing unit 34 executes the division process again for at least the area corresponding to the lower mesh network whose communication status does not satisfy the predetermined condition. At this time, the information processing unit 34 divides the area so as to satisfy a stricter constraint than the above-mentioned constraint, for example by reducing the coefficient, instead of the above-mentioned constraint.

Note that the re-division process may be performed not only for areas corresponding to lower mesh networks whose communication status does not satisfy a predetermined condition, but also for all areas. Further, the second division process may be performed for an area corresponding to a lower mesh network whose communication status does not satisfy a predetermined condition, and for areas surrounding the area.

In the fifth embodiment, the information processing unit 34 executes a division process of dividing an area that does not satisfy the constraint condition based on the execution result of the determination process, but the present invention is not limited to this. For example, the information processing unit 34 may display the execution result of the determination process on the display unit 32 and output it to the setter without executing the division process. In this case, the configurator can easily construct an appropriate lower mesh network by checking the execution results of the determination process and making corrections, such as by dividing areas that do not satisfy the constraint conditions.

[Summary of Example 5 and its variations]
As explained above, the information terminal 30 includes the information processing unit 34 that executes information processing for constructing a hierarchical mesh network. The hierarchical mesh network includes a plurality of first mesh networks and a second mesh network configured by management nodes belonging to each of the plurality of first mesh networks. The information processing unit 34 acquires area information indicating a plurality of areas in which the plurality of nodes 20 are each divided into two or more nodes 20 in a space where the plurality of nodes 20 are installed. The information processing unit 34 executes a determination process to determine whether or not a constraint condition including that the longest distance L1 in the area is equal to or less than a reference distance based on the communicable distance between the nodes 20 is satisfied. The lower mesh network is an example of the first mesh network, and the upper mesh network is an example of the second mesh network.

Such an information terminal 30 can automatically determine whether or not the area is suitable for a lower mesh network based on the area set by the configurator or the space designer. Alternatively, there is no need for judgment by a space designer or the like. In other words, such an information terminal 30 can support setting work for constructing a hierarchical mesh network. In addition, such an information terminal 30 can perform communication using the minimum number of packets during operation by treating the area set by the configurator or space designer, that is, the operational control unit and the mesh network, on the same level. There is also the advantage of becoming

For example, in the determination process, if the area satisfies the constraint conditions, the information processing unit 34 determines the area as one of the plurality of lower mesh networks, and if the area does not satisfy the constraint conditions, the information processing unit 34 determines the area to be one of the plurality of lower mesh networks. Execute the splitting process to split the . Further, the information processing unit 34 determines the divided area that satisfies the constraint condition as one of the plurality of lower mesh networks.

Since such an information terminal 30 can automatically determine a plurality of areas including the divided area into a plurality of lower mesh networks, there is no need for any work by a setter, a space designer, or the like.

Further, for example, in the division process, the information processing unit 34 divides the area that does not satisfy the constraint condition into equal parts in the longitudinal direction.

In such an information terminal 30, by dividing the area into equal parts, it becomes difficult to construct a lower mesh network with a complicated configuration.

Further, for example, in the division process, the information processing unit 34 divides the area so that the long side of a rectangle circumscribing the area that does not satisfy the constraint condition in the two-dimensional orthogonal coordinate system is equally divided.

In such an information terminal 30, by dividing the rectangle circumscribing the area into equal parts, it becomes difficult to construct a lower-level mesh network with a complicated configuration.

Further, for example, the longest distance L1 is the distance between two nodes 20 that are farthest from each other among two or more nodes 20 included in the area.

Such an information terminal 30 can easily determine whether an area satisfies the constraint conditions in the determination process.

For example, the constraint condition further includes that the number of two or more nodes 20 in the area is less than or equal to the reference number.

Such an information terminal 30 can more accurately determine whether an area is suitable for a lower mesh network by considering the number of nodes 20 that can belong to the lower mesh network.

Further, for example, if the communication status in any of the plurality of lower mesh networks does not satisfy the predetermined condition, the information processing unit 34 may at least , a division process is performed to divide the area so as to satisfy a stricter constraint than the constraint.

Such an information terminal 30 can automatically determine a plurality of areas including the divided area into a plurality of lower mesh networks, respectively, in accordance with the actual communication situation.

Furthermore, the communication system 10 includes the information terminal 30 described above and a plurality of nodes 20.

Such a communication system 10 can automatically determine whether or not the area is suitable for a lower mesh network based on the area set by the setter or the space designer. Alternatively, there is no need for judgment by a space designer or the like. In other words, such a communication system 10 can support setting work for constructing a hierarchical mesh network.

Further, for example, the plurality of nodes 20 include lighting equipment.

Such a communication system 10 can function as a control system for lighting equipment.

Further, the information processing method is an information processing method for constructing a hierarchical mesh network, which is executed by a computer. The hierarchical mesh network includes a plurality of lower mesh networks and an upper mesh network configured by management nodes belonging to each of the plurality of lower mesh networks. The information processing method acquires area information regarding a plurality of areas in which a plurality of nodes 20 are each divided into two or more nodes 20 in a space where a plurality of nodes 20 are installed. The information processing method executes a determination process that determines whether or not a constraint condition including that the longest distance L1 in the area is equal to or less than a reference distance based on the communicable distance between the nodes 20 is satisfied.

With such an information processing method, it is possible to automatically determine whether or not the area is suitable for a lower mesh network based on the area set by the configurator or space designer. Alternatively, there is no need for judgment by a space designer or the like. In other words, such an information processing method can support setting work for constructing a hierarchical mesh network.

Further, the program causes one or more processors to execute the above information processing method.

Such a program can automatically determine whether or not the area is suitable for a lower mesh network based on the area set by the configurator or space designer. There is no need for judgment by a designer, etc. In other words, such a program can assist in the configuration work for building a hierarchical mesh network.

[Example 6]
In a sixth embodiment, a method of determining a management node for each of a plurality of lower mesh networks will be described. In the sixth embodiment, the explanation will be given on the assumption that all nodes 20 belong to one of a plurality of lower mesh networks. Furthermore, in the sixth embodiment, "communicable" means that direct communication is possible between the nodes 20 without going through other nodes 20.

FIG. 34 is a flowchart showing the operation (that is, the information processing method) of the communication system 10 in the sixth embodiment. FIG. 34(a) is a flowchart showing the operation of the information terminal 30. FIG. 34(b) is a flowchart showing the operation of the first management node or the second management node, which will be described later.

As shown in FIG. 34(a), first, when the operation receiving unit 31 of the information terminal 30 receives a predetermined operation by the setter, the information processing unit 34 of the information terminal 30 selects one of the nodes 20. A first management node that is a management node of any one of the plurality of lower mesh networks (first mesh networks) is determined (S121). The first management node is a node that serves as the starting point for subsequent processing, and is also referred to as a "start node."

Specifically, the setter performs an operation to select a node 20 of an arbitrary lower mesh network while viewing the plurality of nodes 20 displayed on the display unit 32 of the information terminal 30. The information processing unit 34 of the information terminal 30 determines the node 20 selected by the operation as the first management node.

Note that it is preferable that the node 20 belonging to the lower mesh network located at the farthest end of the space among the plurality of lower mesh networks is determined as the first management node. Moreover, it is preferable to determine the node 20 closest to the center among the plurality of nodes 20 belonging to the lower mesh network as the first management node. In addition, the node 20 which is the lower mesh network closest to the center of the space among the plurality of lower mesh networks and which is closest to the center among the plurality of nodes 20 belonging to the lower mesh network is the first management node. may be determined. When the first management node is determined as described above, it can be expected that the time required for the process of determining the management nodes for all lower mesh networks will be shortened.

Next, the information processing unit 34 of the information terminal 30 transmits starting point determination information to the node 20 determined as the first management node (S122). The starting point determination information includes information necessary for the node 20 to function as a management node. The starting point determination information also includes a command for causing the node 20 to execute a search process and a determination process, which will be described later, as the first management node.

When the node 20 determined to be the first management node acquires the origin determination information, the node 20 becomes the management node of the lower mesh network to which the node 20 belongs, and also becomes the first management node. Function.

Next, the first management node executes a search process and a determination process. The search process and the decision process are executed by an information processing unit (not shown) included in the node 20, which is a management node (first management node). The information processing section is realized by, for example, a microcomputer, but may also be realized by a processor or a dedicated circuit. The functions of the information processing unit are realized by hardware such as a microcomputer or processor that constitutes the information processing unit executing a computer program (software) stored in a storage unit (not shown) included in the management node. Ru. The search process and the determination process are automatically executed by the node 20 (first management node) when the node 20 acquires the starting point determination information and starts functioning as the first management node.

The search process searches for one or more nodes 20 that belong to a lower mesh network different from the lower mesh network (first mesh network) to which the self (here, the first management node) belongs and are communicable. This is the process of Here, "searching for a node" means searching for a node 20 that returns a response signal by broadcasting a request signal requesting a response signal. Note that since one or more lower mesh networks adjacent to the lower mesh network to which the node 20 that executes the search process belongs is already known, the request signal can be multicast by specifying the network ID of one or more adjacent lower mesh networks. You can also send it. Further, if a management node candidate is determined in advance, the request signal may be unicast transmitted by specifying the address information of the candidate. The response signal includes a command to request the radio wave intensity (eg, RSSI value) of the received signal when the request signal is received.

If the strength of the radio waves of the received request signal is above a certain value, the node 20 belonging to another lower mesh network that has received the request signal executes a search process for a response signal that includes information indicating the strength of the radio waves. A reply is sent to the management node (here, the first management node). Furthermore, the node 20 that has received the request signal may send a response signal back to the management node that executes the search process, regardless of the strength of the radio wave of the received request signal.

The determination process is a process of determining a second management node that is a management node of another lower mesh network (first mesh network) from one or more nodes 20 searched in the search process based on the communication state. In other words, the determination process selects a node 20 that has a good communication state with the management node among the one or more nodes 20 that belong to other lower mesh networks and can communicate with the management node that executes the search process. , is a process of determining the management node (second management node) of another lower mesh network.

Here, the communication state refers to the state of communication between the management node that executes the search process and one or more nodes 20 searched for in the search process. In the sixth embodiment, the communication state is expressed by the strength of the radio waves (in this case, the RSSI value) of the signal (request signal) received by each of the one or more nodes 20 in the search process. In other words, the larger the RSSI value, the better the communication state, and the smaller the RSSI value, the worse the communication state.

In the sixth embodiment, in the determination process, the information processing unit of the management node determines the node 20 that has returned the RSSI value closest to the reference RSSI value as the management node of another lower mesh network. The reference RSSI value is an RSSI value obtained by adding a predetermined value to an RSSI value that can ensure communication performance that allows reliable communication between the management node and the node 20. By determining the management nodes of other lower mesh networks in this way, it is possible to prevent a plurality of management nodes from being too close to each other.

Note that, in the determination process, the information processing unit of the management node may determine, for example, the node 20 that has returned the largest RSSI value as the management node of another lower mesh network. Furthermore, in the determination process, the information processing unit of the management node may determine, as the management node, the node 20 closest to the center of the other lower mesh network, among the nodes 20 having an RSSI value equal to or greater than the reference RSSI value.

As shown in FIG. 34(b), in the search process, the information processing unit of the first management node searches for one or more nodes 20 of other lower mesh networks (S131). Then, the information processing unit of the first management node determines a management node (second management node) of another lower mesh network from among the searched one or more nodes 20 based on the communication state (S132).

Next, the information processing unit of the first management node transmits management node determination information to the node 20 determined to be the second management node (S133). The management node determination information includes information necessary for the node 20 to function as a management node. Furthermore, the management node determination information includes a command for causing the node 20 to execute a search process and a determination process as a second management node.

When the node 20 determined to be the second management node acquires the management node determination information, the node 20 becomes the management node of another lower mesh network to which the node 20 belongs, and is the second management node. Functions as a management node.

Thereafter, the information processing unit of the second management node determined by the determination process executes the search process and the determination process similarly to the first management node. That is, the information processing unit of the second management node executes steps S131 to S133 shown in FIG. 34(b). Then, the above series of processes is repeated until the management node (first management node or second management node) is determined for all the lower mesh networks.

Here, the information processing unit of the management node may search for a plurality of other lower mesh networks in the search process. In this case, the information processing unit of the management node determines the second management node for each of the other lower mesh networks in the determination process. When a plurality of second management nodes are determined in this manner, each of the plurality of second management nodes executes a search process in a predetermined order. In the sixth embodiment, when there are multiple other lower mesh networks (first mesh networks), in other words, when multiple second management nodes are determined, the second management node with a small number of hops from the first management node Search processing is executed in order from

Note that when a plurality of second management nodes are determined, the search process may be performed in order, for example, from the second management node with the highest radio wave intensity of the received request signal. Furthermore, when a plurality of second management nodes are determined, the search process may be performed in order from the second management node that received the response signal earlier, for example.

As shown in FIG. 34(a), the information processing unit 34 of the information terminal 30 waits until management nodes are determined for all lower mesh networks (No in S123). Note that the information processing unit 34 of the information terminal 30 may display the progress status and the like on the display unit 32 until the management node is determined. This allows the configurator to move around and work while checking the progress etc. until the management node is determined.

Then, when management nodes are determined for all lower mesh networks (Yes in S123), the information processing unit 34 of the information terminal 30 acquires registration information indicating the management nodes (S124). The registration information includes, for each of all the management nodes that have entered the hierarchical mesh network, the address information of the management node and the network ID of the lower mesh network to which the management node belongs. The registration information also includes information indicating the relationship between two or more management nodes that can communicate with each other.

The information processing unit 34 of the information terminal 30 acquires registration information by receiving registration information transmitted from each management node. The timing at which each management node transmits the registration information is, for example, the time when each management node starts operating as a management node. That is, step S124 may be executed before management nodes are determined for all lower mesh networks.

Here, a specific example of the process of determining a management node for each of a plurality of lower mesh networks will be described using FIGS. 35 to 38. FIG. 35 is a diagram showing the first process of search processing and determination processing in the sixth embodiment. FIG. 36 is a diagram showing the second process of search processing and determination processing in the sixth embodiment. FIG. 37 is a diagram showing the third process of search processing and determination processing in the sixth embodiment. FIG. 38 is a diagram showing the fourth process of search processing and determination processing in the sixth embodiment.

35 to 38 each correspond to a plan view of a space in which a plurality of nodes 20 are arranged. In FIGS. 35 to 38, white circles indicate the positions of the nodes 20, and black circles indicate the positions of management nodes. Furthermore, in FIGS. 35 to 38, the two-dimensional coordinates of each of the plurality of nodes 20 are associated with the lower mesh network to which the node 20 belongs. In the examples shown in FIGS. 35 to 38, each node 20 belongs to one of the eight lower mesh networks Nw1 to Nw8.

In the first process shown in FIG. 35, the information terminal 30 determines the node N21 of the lower mesh network Nw1 to be the first management node. Node N21 executes search processing and determination processing. In FIG. 35, a solid circle surrounding node N21 indicates that node N21 is the first management node. The solid curve in FIG. 35 represents the boundary between the communicable range and the non-communicable range of the node N21. Therefore, in the first process shown in FIG. 35, one or more nodes 20 are located closer to the node N21 than the solid curve in the lower mesh network Nw2, and one or more nodes 20 are located closer to the node N21 than the solid curve in the lower mesh network Nw3. One or more nodes 20 are searched by the search process of node N21.

In the first process shown in FIG. 35, the node N21, through the determination process, selects the node N22 as the second management node of the lower mesh network Nw2 among the one or more nodes 20 belonging to the lower mesh network Nw2 searched in the search process. It has been decided. In addition, the node N21 determines the node N23 as the second management node of the lower mesh network Nw3 among the one or more nodes 20 belonging to the lower mesh network Nw3 searched in the search process.

In the second process shown in FIG. 36, of the two second management nodes (node N22 and node N23), node N22 first executes the search process, and then node N23 executes the search process. In FIG. 36, the solid circle surrounding node N22 indicates that node N22 is the second management node that executes the search process first. Further, the solid curve in FIG. 36 represents the boundary between the communicable range and the non-communicable range of the node N22. Further, in FIG. 36, the dotted circle surrounding the node N23 indicates that the node N23 is the second management node that will execute the search process next. Moreover, the dotted curve in FIG. 36 represents the boundary between the communicable range and the non-communicable range of the node N23.

In the second process shown in FIG. 36, in each of the lower mesh networks Nw4, Nw5, and Nw6 whose management nodes are undetermined, one or more nodes 20 located closer to the node N22 than the solid curve perform a search process for the node N22. searched by. Then, in the second process shown in FIG. 36, the node N22 uses the determination process to select the node N24 from among the one or more nodes 20 belonging to the lower mesh network Nw4 searched for in the search process as the second management of the lower mesh network Nw4. The node has been decided. Further, through the determination process, the node N22 determines the node N25 to be the second management node of the lower mesh network Nw5 among the one or more nodes 20 belonging to the lower mesh network Nw5 searched in the search process. In addition, through the determination process, the node N22 determines the node N26 as the second management node of the lower mesh network Nw6 among the one or more nodes 20 belonging to the lower mesh network Nw6 searched in the search process.

Next, node N23 executes a search process. However, in the second process shown in FIG. 36, the node N23 cannot search for one or more nodes 20 belonging to a lower mesh network whose management node has not yet been determined. Therefore, node N23 will not execute the determination process.

In the third process shown in FIG. 37, among the three second management nodes (node N24, node N25, and node N26), node N25 first executes the search process, and then node N26 and node N24 execute the search process in this order. Search processing is running. In FIG. 37, the solid circle surrounding node N25 indicates that node N25 is the second management node that executes the search process first. Further, the solid curve in FIG. 37 represents the boundary between the communicable range and the non-communicable range of the node N25. Further, in FIG. 37, the dotted circle surrounding the node N26 indicates that the node N26 is the second management node that will execute the search process next. Moreover, the dotted curve in FIG. 37 represents the boundary between the communicable range and the non-communicable range of the node N26. Furthermore, in FIG. 37, the dot-dash circle surrounding the node N24 indicates that the node N24 is the second management node that executes the search process last. Moreover, the dashed-dotted curve in FIG. 37 represents the boundary between the communicable range and the non-communicable range of the node N24.

In the third process shown in FIG. 37, in the lower mesh network Nw7 whose management node has not yet been determined, one or more nodes 20 located closer to the node N25 than the solid curve are searched for by the search process of the node N25. Then, in the third process shown in FIG. 37, the node N25 uses the determination process to assign the node N27 to the second management of the lower mesh network Nw7 among the one or more nodes 20 belonging to the lower mesh network Nw7 searched in the search process. The node has been decided.

Next, node N26 and node N24 execute the search process in this order. However, in the second process shown in FIG. 37, neither node N26 nor node N24 can search for one or more nodes 20 belonging to a lower mesh network whose management node has not yet been determined. Therefore, neither node N26 nor node N24 executes the determination process.

In the fourth process shown in FIG. 38, node N27, which is the second management node, is executing the search process. In FIG. 38, the solid circle surrounding the node N27 indicates that the node N27 is the second management node that executes the search process. Further, the solid curve in FIG. 38 represents the boundary between the communicable range and the non-communicable range of the node N27.

In the fourth process shown in FIG. 38, in the lower mesh network Nw8 whose management node has not yet been determined, one or more nodes 20 located closer to the node N27 than the solid curve are searched for by the search process of the node N27. Then, in the fourth process shown in FIG. 38, the node N27, through the determination process, assigns the node N28 to the second management of the lower mesh network Nw8 among the one or more nodes 20 belonging to the lower mesh network Nw8 searched in the search process. The node has been decided. Through the above series of processes, management nodes (nodes N21 to N28) are determined for all lower mesh networks Nw1 to Nw8.

As described above, in the sixth embodiment, the communication system 10 (information processing method) executes the search process and decision process by the first management node, and the search process and decision process by the second management node.

Such a communication system 10 (information processing method) can automatically determine the management node of each lower mesh network simply by a setter performing a predetermined operation on the information terminal 30. The effort required to determine the management node of each lower mesh network is reduced. In other words, such a communication system 10 (information processing method) can support setting work for constructing a hierarchical mesh network.

Furthermore, since such a communication system 10 (information processing method) determines the management node of each lower mesh network while actually communicating between the nodes 20, it is easy to guarantee that communication can be performed between the management nodes.

[Modification of Example 6]
In the sixth embodiment, the information processing unit of the management node (the first management node or the second management node) calculates the RSSI value of the signal (request signal) received by each of the one or more nodes 20 in the search process in the determination process. Although only the communication state is referred to as the communication state, it is not limited to this. For example, the information processing unit of the management node may further refer to the RSSI value estimated from the distance between the management node and one or more searched nodes 20 as the communication state.

Specifically, in the determination process, the difference between the radio wave intensity (RSSI value) and the radio wave intensity (RSSI value) estimated from the distance between the nodes is greater than or equal to a predetermined value among one or more nodes 20. The node 20 may not be determined as the second management node. Here, the RSSI value estimated from the distance between nodes is not the RSSI value of the signal actually received by the node 20, but the RSSI value estimated from the distance between the management node and the node 20. This corresponds to the ideal RSSI value in the case where no Therefore, if the above-mentioned difference is more than a predetermined value, it is considered that the communication condition is not very good due to the presence of an obstacle etc. between the management node and the node 20, and such a communication condition is considered to be inappropriate. The node 20 can be excluded from the candidates for the second management node.

Further, for example, the information processing unit of the management node may refer to the distance between the management node and one or more searched nodes 20 as the communication state in the determination process. Specifically, the communication state is the distance between the management node and each of the one or more nodes 20. In the determination process, the node 20 whose distance is closest to a reference distance based on the communicable distance between nodes (see Example 5) among the one or more nodes 20 may be determined as the second management node. . In this case, the node 20 that has an appropriate communication state with the management node can be determined as the second management node.

Further, in the sixth embodiment, the second management node may temporarily function as the second management node at the time of determination, and then be officially determined as the second management node when the conditions are met. Hereinafter, a first example and a second example of such a method for determining the second management node will be described.

In the first example, after determining the second management node, if a node 20 with better communication status than the second management node is searched for in the lower mesh network (first mesh network) to which the second management node belongs, The node 20 is updated to be the management node of the lower mesh network.

A specific example will be described below using FIG. 36. Here, in the first example, unlike the sixth embodiment, the second management node executes the determination process regardless of whether a management node has already been determined in the lower mesh network searched in the search process. shall be. In FIG. 36, it is assumed that after the node N22 determines the node N24 as the second management node of the lower mesh network Nw4 through the determination process, the node N23 executes the search process and the determination process. Here, it is assumed that the node N23 has determined a node 20 other than the node N24 as the second management node of the lower mesh network Nw4 through the determination process. In this case, if the communication state of the node 20 is better than that of the node N24 (for example, the RSSI value is larger), the node 20 will be updated to the second management node of the lower mesh network Nw4. Become. In this case, in any lower mesh network, a node 20 that has an appropriate communication state with management nodes of other lower mesh networks can be determined as the management node of the lower mesh network.

In the second example, when multiple management nodes corresponding to each of multiple lower mesh networks (first mesh network) are determined (that is, management nodes of all lower mesh networks are determined), information including communication status is determined. Output the determination results of multiple management nodes. The determination result is output to the display unit 32 of the information terminal 30 and presented to the setter.

A specific example will be described below using FIG. 39. FIG. 39 is a diagram showing an example of an output screen in a modification of the sixth embodiment. In the output screen of FIG. 39, a plan view of a space in which a plurality of nodes 20 are arranged is displayed. The white circle indicates the position of the node 20, and the black circle indicates the position of the management node. Furthermore, in the output screen of FIG. 39, a rectangular frame indicates that two or more nodes 20 surrounded by the frame belong to the same lower mesh network.

Furthermore, in the output screen of FIG. 39, bidirectional arrows indicate the communication status between management nodes. In the example shown in FIG. 39, solid line arrows indicate that the communication status between management nodes is good (RSSI value is relatively large), and dashed line arrows indicate that communication status between management nodes is poor (RSSI value is relatively large). This shows that the target is small. In addition to being shown by the line type of the arrow, the communication state may also be shown by the shading of the arrow. Moreover, the communication state may be indicated numerically.

The configurator checks the determination results displayed on the output screen, and if there are no problems, performs an operation to officially determine each management node. On the other hand, if the setter determines that there is a problem in the communication state between some management nodes, he or she performs an operation to update other nodes 20 to management nodes. In this way, in the second example, the setter can optimize the communication state between each management node by appropriately changing the management node while checking the determination result.

Note that the determination result is not limited to a plan view as shown in FIG. 39, but may be displayed on the display unit 32 of the information terminal 30, for example, as a matrix table showing RSSI values between each management node.

Further, in the sixth embodiment, both the first management node and the second management node autonomously execute the search process and the determination process, but the present invention is not limited to this. For example, both the first management node and the second management node may execute the search process and the determination process according to instructions from the information terminal 30.

[Summary of Example 6 and its modifications]
As explained above, the information processing method is an information processing method executed by a computer for constructing a hierarchical mesh network. The hierarchical mesh network includes a plurality of first mesh networks and a second mesh network configured by management nodes belonging to each of the plurality of first mesh networks. The information processing method causes a first management node that is a management node of any one of the plurality of first mesh networks among the plurality of nodes 20 to execute a search process and a determination process. . The search process is a process of searching for one or more nodes 20 that belong to a first mesh network different from the first mesh network and are communicable. The determination process is a process of determining a second management node, which is a management node of another first mesh network, from among the one or more searched nodes 20 based on the communication state. The information processing method causes the second management node to execute search processing and determination processing. The lower mesh network is an example of the first mesh network, and the upper mesh network is an example of the second mesh network.

In such an information processing method, the configurator can automatically determine the management node of each lower mesh network simply by performing a predetermined operation on the information terminal 30, and the configurator can automatically determine the management node of each lower mesh network. The effort required to determine a management node is reduced. In other words, such an information processing method can support setting work for constructing a hierarchical mesh network.

Further, for example, the communication state is the strength of the radio wave of the signal received by each of the one or more nodes 20 in the search process.

In such an information processing method, a node 20 that has an appropriate communication state with the management node that executes the search process can be determined as the second management node of another lower mesh network.

For example, in the determination process, among the one or more nodes 20, a node for which the difference between the radio wave intensity and the radio wave intensity estimated from the distance between the nodes 20 is a predetermined value or more is selected as the second management node. Not decided.

In such an information processing method, a node 20 whose communication state with the management node executing the search process is inappropriate, for example due to the presence of an obstacle, is selected as a candidate for the second management node of another lower mesh network. can be excluded from.

Further, for example, the communication state is the distance between each of the one or more nodes 20. In the determination process, among the one or more nodes 20, the node 20 whose distance is closest to the reference distance based on the communicable distance between the nodes 20 is determined as the second management node.

In such an information processing method, a node 20 that has an appropriate communication state with the management node that executes the search process can be determined as the second management node of another lower mesh network.

Further, for example, if there are a plurality of other lower mesh networks, the search process is performed in order from the second management node with the smallest number of hops from the first management node.

With such an information processing method, it is easy to efficiently perform processing for determining management nodes for all lower-level mesh networks.

For example, after determining the second management node, if a node 20 with a better communication state than the second management node is searched for in the lower mesh network to which the second management node belongs, the node 20 is Update to the network's management node.

In such an information processing method, in any lower mesh network, a node 20 that has an appropriate communication state with management nodes of other lower mesh networks can be determined as the management node of the lower mesh network.

Further, for example, when a plurality of management nodes corresponding to each of a plurality of lower mesh networks is determined, the determination result of the plurality of management nodes including the communication state is output. Here, outputting the decision result includes both presenting (displaying) the decision result and outputting the decision result as data.

In such an information processing method, for example, a setter can optimize the communication state between each management node by appropriately changing the management node while checking the determination result.

Further, the program causes one or more processors to execute the above information processing method.

Such a program allows the configurator to automatically determine the management node of each lower mesh network by simply performing a predetermined operation on the information terminal 30, and the configurator can automatically determine the management node of each lower mesh network. This reduces the effort required to decide. In other words, such a program can assist in the configuration work for building a hierarchical mesh network.

The communication system 10 also includes an information terminal 30 that includes an information processing unit 34 that executes information processing for constructing a hierarchical mesh network, and a plurality of nodes 20. The hierarchical mesh network includes a plurality of lower mesh networks and an upper mesh network configured by management nodes belonging to each of the plurality of lower mesh networks. The information processing unit 34 determines a first management node that is a management node of any one of the plurality of lower mesh networks among the plurality of nodes 20. The first management node among the plurality of nodes 20 executes a search process and a determination process. The search process is a process of searching for one or more nodes 20 that belong to another lower mesh network different from the lower mesh network and are communicable. The determination process is a process of determining a second management node, which is a management node of another lower mesh network, from among the searched one or more nodes 20 based on the communication state. The second management node among the plurality of nodes 20 executes search processing and determination processing.

Such a communication system 10 can automatically determine the management node of each lower mesh network simply by the setter performing a predetermined operation on the information terminal 30, and the setter can automatically determine the management node of each lower mesh network. The effort required to determine a management node is reduced. In other words, such a communication system 10 can support setting work for constructing a hierarchical mesh network.

Further, for example, the plurality of nodes 20 include lighting equipment.

Such a communication system 10 can function as a control system for lighting equipment.

Further, the node 20 is a node used in the communication system 10 described above, and executes a search process and a determination process when it is a first management node or a second management node.

In such a node 20, the configurator can automatically determine the management node of each lower mesh network simply by performing a predetermined operation on the information terminal 30, and the configurator can manage each lower mesh network. The effort required to determine nodes is reduced. In other words, such a node 20 can support setting work for constructing a hierarchical mesh network.

(Other embodiments)
Although the embodiments have been described above, the present invention is not limited to the above embodiments.

Examples 1 to 6 of the above embodiments should be recognized not as independent examples but as examples related to each other, and the present invention includes the embodiments described in Examples 1 to 6. This invention includes inventions that can be realized by arbitrarily combining the contents described above. For example, the processing related to the display of the lower mesh network and the management node described in the first embodiment (such as the processing of highlighting the management node on the display screen) may be combined with the second to sixth embodiments.

Further, the present invention may be realized as an information terminal that executes only part of the lower mesh network determination method and management node determination method described in the above embodiments. In this case, the lower mesh network determining method and the management node determining method described in the above embodiments may be combined in any manner.

Furthermore, the present invention may be realized as an information terminal that executes all of the lower mesh network determination method and management node determination method described in the above embodiments. In this case, the method of determining the lower mesh network and the method of determining the management node to be adopted is determined, for example, by the operation of the configurator.

In addition, a priority is set for each of the multiple lower mesh network determination methods, and the information terminal sequentially executes the lower mesh network determination methods according to the priority order until the determined lower mesh network satisfies predetermined requirements. You may. Similarly, a priority is set for each of the multiple management node determination methods, and the information terminal sequentially executes the management node determination methods according to the priority until the determined management node satisfies predetermined requirements. Good too. In this case, the priority order is determined, for example, by the operation of the setter, but may be determined in advance by the designer.

Further, in the above embodiment, a communication system has been described on the assumption that one lower mesh network includes only one management node, but one lower mesh network may include multiple management nodes. .

Furthermore, in the above embodiment, it has been explained that a node before joining the mesh network periodically transmits a beacon signal. However, the communication system may adopt a configuration in which only a node that receives a wireless communication signal from an information terminal transmits a signal corresponding to a beacon signal. That is, the communication system is not limited to a system in which nodes automatically transmit beacon signals.

Further, in the above embodiment, one information terminal is used to construct the hierarchical mesh network, but a plurality of information terminals may be used together.

Further, the communication method between devices described in the above embodiment is an example. There are no particular limitations on the method of communication between devices.

Further, in the above embodiments, the processing executed by a specific processing unit may be executed by another processing unit. Further, the order of the plurality of processes may be changed, or the plurality of processes may be executed in parallel. Furthermore, some of the processes included in the flowcharts of the above embodiments may be omitted, or new processes may be added to the flowcharts of the above embodiments.

Furthermore, in the embodiments described above, each component may be realized by executing a software program suitable for each component. Each component may be realized by a program execution unit such as a CPU or a processor reading and executing a software program recorded on a recording medium such as a hard disk or a semiconductor memory.

Moreover, each component may be realized by hardware. For example, each component may be a circuit (or integrated circuit). These circuits may constitute one circuit as a whole, or may be separate circuits. Further, each of these circuits may be a general-purpose circuit or a dedicated circuit. Each component may be realized by a logic circuit such as an FPGA (Field-Programmable Gate Array).

Further, general or specific aspects of the present invention may be implemented in a system, apparatus, method, integrated circuit, computer program, or computer readable storage medium such as a CD-ROM. Further, the present invention may be realized by any combination of a system, an apparatus, a method, an integrated circuit, a computer program, and a recording medium.

For example, the present invention may be realized as the communication system or information terminal of the above embodiments, or may be realized as an information processing method executed by a computer such as an information terminal. The present invention may be realized as a program for causing a computer to execute such an information processing method, or may be realized as a non-temporary recording medium on which such a program is recorded. Such programs include application programs for causing a computer such as a general-purpose information terminal to function as the information terminal of the above embodiment.

Other embodiments may be obtained by making various modifications to each embodiment that a person skilled in the art would think of, or may be realized by arbitrarily combining the components and functions of each embodiment without departing from the spirit of the present invention. The present invention also includes such forms.

10 communication system 20 node 21 wireless communication unit 30 information terminal 31 operation reception unit 32 display unit 33 wireless communication unit 34 information processing unit 35 storage unit

Claims (11)

Equipped with an information processing unit that executes information processing to construct a hierarchical mesh network,
The hierarchical mesh network includes a plurality of first mesh networks and a second mesh network configured by a management node belonging to each of the plurality of first mesh networks,
The information processing unit includes:
obtaining placement information indicating the placement of a plurality of nodes, each of which belongs to one of the plurality of first mesh networks;
An information terminal that determines a plurality of management nodes from among the plurality of nodes based on the acquired arrangement information. The information processing unit includes:
further obtaining affiliation information indicating which of the plurality of first mesh networks the plurality of nodes belong to;
The information terminal according to claim 1, wherein the plurality of management nodes are determined based on the acquired arrangement information and the acquired affiliation information. The information processing unit includes:
Based on the acquired placement information and the acquired affiliation information, calculate a first centroid position of a node belonging to the same first mesh network among the plurality of nodes;
Calculating second double center positions of the plurality of nodes based on the acquired placement information,
Among the nodes belonging to the same first mesh network, located closest to a point that divides a line segment connecting the first center of gravity position and the second double center position into a ratio of 1:n (n is a positive number). The information terminal according to claim 2, wherein the node that belongs to the first mesh network is determined as the management node. The information terminal according to claim 3, wherein the information processing unit determines the management node by changing the value of n for each of the first mesh networks. The information processing unit selects, among nodes belonging to the same first mesh network, a node located closest to a point that divides the line segment 1:1 as the management node belonging to the first mesh network. The information terminal according to claim 3 or 4. The information processing unit includes:
Based on the acquired placement information and the acquired affiliation information, calculate a first centroid position of a node belonging to the same first mesh network among the plurality of nodes;
The information terminal according to claim 2, wherein among the nodes belonging to the same first mesh network, a node located closest to the first center of gravity is determined as the management node belonging to the first mesh network. The information processing unit includes:
Based on the acquired placement information and the acquired affiliation information, calculate a first centroid position of a node belonging to the same first mesh network among the plurality of nodes;
Calculating second double center positions of the plurality of nodes based on the acquired placement information,
identifying the arrangement of the plurality of first mesh networks based on the obtained arrangement information and the obtained affiliation information;
In a first mesh network that is not located at an end in the arrangement of the plurality of first mesh networks, the first centroid position of the node belonging to the first mesh network among the nodes belonging to the first mesh network. determining the closest node as the management node belonging to the first mesh network;
In a first mesh network located at an end in the arrangement of the plurality of first mesh networks, a node located closest to the second double center position among the nodes belonging to the first mesh network is assigned to the first mesh network. The information terminal according to claim 2, wherein the information terminal is determined as the management node belonging to a network. The information terminal according to any one of claims 1 to 7, further comprising a display unit that displays the determined position of the management node in the arrangement of the plurality of nodes indicated by the arrangement information. The information terminal according to any one of claims 1 to 8,
A communication system comprising: the plurality of nodes. The communication system according to claim 9, wherein the plurality of nodes include lighting equipment. An information processing method for constructing a hierarchical mesh network executed by a computer, the method comprising:
The hierarchical mesh network includes a plurality of first mesh networks and a second mesh network configured by a management node belonging to each of the plurality of first mesh networks,
The information processing method includes:
obtaining placement information indicating the placement of a plurality of nodes, each of which belongs to one of the plurality of first mesh networks;
An information processing method, wherein a plurality of the management nodes are determined from among the plurality of nodes based on the acquired arrangement information.

Images