Information terminal, communication system, and information processing method

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

[Technical Field]

[0001] The present invention relates to an information terminal, a communication system, and an information processing method. [Background technology]

[0002] Patent Document 1 discloses a lighting control device that communicates with lighting devices via a network. [Prior art documents] [Patent documents]

[0003] [Patent Document 1] Japanese Patent Application Laid-Open No. 2017-59492 Summary of the Invention [Problem to be solved by the invention]

[0004] The present invention provides an information terminal or the like that can support the setting work for constructing a hierarchical mesh network. [Means for solving the problem]

[0005] An information terminal according to one aspect of the present invention includes an information processing unit that performs information processing for constructing a hierarchical mesh network, the hierarchical mesh network including 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 acquires placement information indicating the placement of a plurality of nodes each belonging to one of the plurality of first mesh networks, and determines a plurality of the management nodes from among the plurality of nodes based on the acquired placement information.

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

[0007] 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 and a second mesh network constituted by a management node belonging to each of the plurality of first mesh networks, and the information processing method acquires placement information indicating the placement of a plurality of nodes each belonging to one of the plurality of first mesh networks, and determines a plurality of the management nodes from among the plurality of nodes based on the acquired placement information. [Effects of the Invention]

[0008] The information terminal etc. of the present invention can assist in the setting work for constructing a hierarchical mesh network. [Brief explanation of the drawings]

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

[0010] Hereinafter, the embodiments will be described in detail with reference to the drawings. Note that the embodiments described below are all comprehensive or specific examples. The numerical values, shapes, materials, components, component placement and connection forms, steps, and step order shown in the following embodiments are merely examples and are not intended to limit the present invention. Furthermore, among the components in the following embodiments, components not recited in independent claims will be described as optional components.

[0011] It should be noted that the drawings are schematic diagrams and are not necessarily strict illustrations. In addition, in the drawings, substantially the same components are denoted by the same reference numerals, and overlapping descriptions may be omitted or simplified.

[0012] (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, a communication system 10 includes a plurality of nodes 20 and an information terminal 30.

[0013] In the communication system 10, each of the plurality of nodes 20 has a wireless communication function, and the plurality of nodes 20 configure a hierarchical wireless mesh network (hereinafter simply referred to as a hierarchical mesh network) after a user (hereinafter also referred to as a configurator) has completed an initial setup operation using an information terminal 30. Note that constructing a hierarchical mesh network after completing an initial setup operation is merely an example, and other methods, such as constructing a mesh network from configured nodes 20, are also possible.

[0014] FIG. 2 is a diagram conceptually illustrating a hierarchical mesh network. N1 or N2 in FIG. 2 corresponds to one node 20 in FIG. 1. The hierarchical mesh network includes multiple lower mesh networks and an upper mesh network. In the example of FIG. 2, each lower mesh network is made up of multiple nodes (N1 and N2), and the upper mesh network is made up of a management node (N2) belonging to each of the multiple lower mesh networks. The management node can also be called a bridge node, a backbone node, or a gateway node. 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.

[0015] In a lower mesh network, when information is transmitted from one 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.

[0016] Specifically, when the first node broadcasts information including the address information (destination information) of the second node, each of the other nodes belonging to the same lower mesh network as the first communication node that received the information further broadcasts the received information. In other words, each of the other nodes relays the information. By repeating this relaying of information within the same lower mesh network, the information transmitted by the first node reaches all of the nodes belonging to the same lower mesh network as the first node. Therefore, the second node can receive the information transmitted by the first node.

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

[0018] When transmitting information from a first node to a third node belonging to another lower mesh network, the information is relayed by a management node. That is, information is transmitted through the upper mesh network. For example, at least one management node is provided for each 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.

[0019] If all nodes belong to the same mesh network, all nodes relay information when transmitting it, resulting in a large amount of communication traffic per unit time. In contrast, in a hierarchical mesh network, when information is transmitted within a lower-level mesh network, the information is not relayed in other lower-level mesh networks. In a hierarchical mesh network, information is transmitted from one lower-level mesh network to another lower-level mesh network via a management node only when necessary. Therefore, a hierarchical mesh network can improve the robustness of the system by reducing the amount of communication traffic per unit time.

[0020] The node 20 and the information terminal 30 will be described below, mainly with reference to Fig. 1. First, the node 20 will be described. 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.

[0021] Note that AC relays include, but are not limited to, the following two types: a first AC relay and a second AC relay. The first AC relay is a device attached to a wiring duct that can turn on and off a single lighting fixture attached to the wiring duct by turning on and off the AC power to that lighting fixture. The second AC relay is a device attached to the base of the wiring duct that can turn on and off all lighting fixtures attached to the wiring duct by turning on and off the supply of AC power to that wiring duct.

[0022] Node 20 may be a device not directly related to lighting, such as an air conditioner, a ventilation device, a camera, a motion sensor, a speaker, or an environmental sensor. Environmental sensors include a temperature sensor, a humidity sensor, a brightness sensor, a carbon dioxide concentration sensor, and a PM (Particle Matter) sensor. A device that becomes node 20 may have two or more of the functions of each of the above-mentioned individual devices, and the type of device that becomes node 20 is not particularly limited.

[0023] When the plurality of nodes 20 includes a lighting fixture, the information transmitted through the hierarchical mesh network may be, for example, control information for controlling the lighting fixture to turn on, turn off, dim, adjust color, or control the light distribution. When the plurality of nodes 20 includes an environmental sensor, the measurement value (sensing information) of the environmental sensor may be transmitted through the hierarchical mesh network. When the plurality of nodes 20 includes a camera, speaker, or other device, video, image, audio, other information, or control values ​​may be transmitted.

[0024] The node 20 includes a wireless communication unit 21. The wireless communication unit 21 is a wireless communication circuit that enables the node 20 to perform wireless communication (more specifically, radio wave 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 hierarchical mesh network. Before the node 20 joins the hierarchical mesh network, for example, the wireless communication unit 21 periodically transmits a beacon signal (also referred to as an advertisement signal) and performs wireless communication with the information terminal 30 that receives the beacon signal. Specifically, the wireless communication unit 21 performs wireless communication in accordance with a communication standard such as BLE (Blutooth (registered trademark) Low Energy) or Wi-Fi (registered trademark), but the communication standard is not limited to these.

[0025] Next, the information terminal 30 will be described. The information terminal 30 is an information terminal used for initial setup work to allow multiple nodes 20 to join the hierarchical mesh network. The information terminal 30 is, for example, a mobile terminal such as a smartphone, a tablet terminal, or a PDA (Personal Digital Assistant). The information terminal 30 may also 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 setup work. Specifically, the information terminal 30 includes an operation reception unit 31, a display unit 32, a wireless communication unit 33, an information processing unit 34, and a storage unit 35. Note that the connection configuration of the components (units) included in the information terminal 30 shown in FIG. 1 is merely an example and is not limited to this configuration.

[0026] The operation reception unit 31 receives operations from a setting person. Specifically, the operation reception unit 31 is realized by a touch panel or the like.

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

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

[0029] The information processing unit 34 performs information processing related to the initial setup work in response to the operation of the setter accepted by the operation accepting unit 31. In other words, this information processing is information processing for constructing a hierarchical mesh network. The information processing unit 34 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 34 are realized by hardware such as a microcomputer or processor constituting the information processing unit 34 executing a computer program (software) stored in the storage unit 35.

[0030] The storage unit 35 is a storage device that stores information necessary for information processing related to the 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.

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

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

[0033] [Initial Setup Procedure] Next, the procedure for initial setup work to build a hierarchical mesh network will be described below. Fig. 4 is a flowchart showing an example of the procedure for initial setup work.

[0034] First, the configurator determines the lower mesh network to which each of the plurality of virtual nodes in the placement information belongs (S11). Then, the configurator determines the management node for each of the plurality of lower mesh networks from among the virtual nodes belonging to that lower mesh network (S12). This operation is performed, for example, by operating the operation reception unit 31 of the configurator's information terminal 30, but may also be performed automatically or semi-automatically by the information processing unit 34, as described below.

[0035] As a result of the processing of steps S11 and S12, for each of the multiple virtual nodes in the placement information, 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 are stored in the storage unit 35.

[0036] Next, the setter performs the 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 IDs of the actual nodes 20 with the virtual nodes in the arrangement information. As the node IDs, for example, MAC (Media Access Control) addresses are used. This task is performed by the setter operating the operation reception unit 31.

[0037] As a result of the processing in step S13, it is identified which real node 20 corresponds to the virtual node in the placement information. By combining the results of the processing in steps S11 to S13, the ID of the real node 20, the network ID of the lower mesh network to which the node 20 having that ID belongs, and whether or not the node 20 having that ID is a management node are associated. Hereinafter, information indicating this association will be referred to as management information. The management information is stored in the storage unit 35.

[0038] Next, the configurator stores, in each of the multiple existing nodes 20, configuration information for allowing the node 20 to participate in the hierarchical mesh network (S14). The information terminal 30 transmits the configuration information to the node 20 by unicast communication with the node 20 based on the configurator's operation on the operation reception unit 31. The node 20 stores the received configuration information in a storage unit (not shown) provided in the node 20. Here, unicast means that communication is performed by specifying a specific node 20 as the final destination, and direct communication between the information terminal 30 and the specific node 20 is not necessary. In step S14, the information terminal 30 may perform unicast communication via an already functioning mesh network.

[0039] The setting information includes the network ID of the lower mesh network to which the node 20 belongs, and address information (unicast address) of the node 20 used for communication within the hierarchical mesh network. The setting information may also include, as necessary, a security passcode used for communication within the lower mesh network, information about the information terminal 30 (information about 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 the management node. The type of setting information to be sent to which node 20 can be specified by the management information.

[0040] The node 20, whose setting information is stored in the storage unit, can join the hierarchical mesh network. The node 20 that has joined the hierarchical mesh network stops the periodic transmission of beacon signals that it had been performing before joining.

[0041] Here, various methods can be considered for determining the lower mesh network in step S11 and determining the management node in step S12. Below, an example of the method for determining the lower mesh network and the method for determining the management node will be described.

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

[0043] The information processing unit 34 of the information terminal 30 acquires placement information indicating the placement of a plurality of nodes 20 from the storage unit 35 (S21). The placement information is, for example, information that has been 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, for example, empirically or experimentally created by a designer of the communication system 10 or the like, and is stored in the storage unit 35 in advance.

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

[0045] 6, the template acquired in step S22 is superimposed on the arrangement information acquired in step S21. The template is configured by combining a first template in which squares (shown as rectangles with rounded corners in FIG. 6) are laid out in a staggered pattern and a second template in which equilateral triangles are laid out.

[0046] The first template is an example of range information that indicates multiple ranges for the arrangement of multiple 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 information processing unit 34 overlays the first template on the arrangement information, it determines that the nodes 20 located within one square belong to the same lower mesh network. When the first template is overlaid on the arrangement information, in other words, it is when the range indicated by the range information is applied to the arrangement of multiple nodes 20 indicated by the arrangement information.

[0047] The second template is an example of reference position information that indicates the reference position in each of the multiple ranges indicated by the range information. The positions of the vertices of an equilateral triangle in the second template (which can also be considered as intersections when viewed as the second template as a whole) correspond to the reference positions. In other words, the multiple reference positions indicated by the second template are in a positional relationship that corresponds to the vertices of an equilateral triangle. The second template is combined with the first template so that one reference position is located within one square of the first template.

[0048] With the second template superimposed on the placement information, the information processing unit 34 determines the node 20 that is located closest to the reference position among the nodes 20 belonging to the same lower mesh network as the manager node of that lower mesh network. In other words, the state in which the second template is superimposed on the placement information is the state in which the template (first template) has been applied to the placement information.

[0049] The reason why the multiple reference positions in the second template correspond to the vertices of an equilateral triangle is to ensure that one management node can communicate with at least three other management nodes. This can be seen from the fact that the reference position provided at the edge of the second template is connected to the other three reference positions by line segments, and that the reference position provided in the center of the second template is connected to the other six reference positions by line segments.

[0050] As will be described later, the templates can be enlarged or 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.

[0051] Here, the length of one side of the equilateral triangle of the second template corresponds to the designed distance between the management nodes. The designed length of this side is set to the distance over which the management nodes can reliably communicate with each other. When the template is displayed superimposed on the placement information in step S23, the information processing unit 34 automatically enlarges or reduces the template (the square (area) indicated by the first template) so that the designed length of one side of the equilateral triangle of the second template matches the length in the placement information. In other words, the information processing unit 34 determines the initial size of the template based on the placement information. Note that the information processing unit 34 may enlarge or reduce the template in stages until the user determines that the conditions are met.

[0052] For example, if the design length of one side of the equilateral triangle of the second template is 10 m, the information processing unit 34 automatically enlarges or reduces the template based on the placement information so that the length of one side of the equilateral triangle of the second template matches the length of 10 m in the placement information.

[0053] After step S23, the operation receiving unit 31 receives adjustment operations from the user, such as an operation to change the position of the template relative to the placement information, an operation to enlarge the template, and an operation to reduce the size of the template (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 response to the adjustment operations (S25).

[0054] As described above, the length of one side of the equilateral triangle of the second template is determined by design based on the communication performance of the management node (more specifically, node 20 to be determined as the management node). If the template were expanded without limit, there is a concern that communication between management nodes might become impossible. Therefore, an upper limit is set for the expansion of the template. This upper limit is set based on the distance over which a management node can communicate with other management nodes. 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 equivalent to 12 m.

[0055] Next, the operation receiving unit 31 receives a confirmation operation for the position and size of the template from the user (S26). The information processing unit 34 determines that the nodes 20 located within one square in the positional relationship between the placement information and the template at the time the confirmation operation was performed belong to the same lower mesh network (S27). Furthermore, the information processing unit 34 determines the node 20 located closest to the reference position in the positional relationship between the placement information and the template at the time the confirmation operation was performed as the management node (S28). Note that if there are multiple nodes 20 located closest to the reference position, any one of them may be determined to be the management node.

[0056] The information processing unit 34 displays the position of the determined manager node on the setting screen (S29). In other words, the display unit 32 displays the position of the determined manager node in the arrangement of the plurality of nodes 20 indicated by the arrangement information. In the example of Fig. 6, the manager node is displayed in gray (hatched), and the normal node is displayed in white.

[0057] 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, and the minimum number of nodes. The maximum number of nodes means the number of nodes in the lower mesh network having the most nodes 20 belonging to that mesh network among multiple lower mesh networks. The minimum number of nodes means the number of nodes in the lower mesh network having the fewest nodes 20 belonging to that mesh network among multiple lower mesh networks.

[0058] As described above, the information terminal 30 acquires placement information indicating the placement of the 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 reference position information indicating a reference position in each of the plurality of ranges. The information terminal 30 determines to which of a plurality of lower mesh networks each of the plurality of nodes 20 should belong based on the acquired placement information and the acquired range information, and determines a plurality of management nodes from among the plurality of nodes 20 based on the acquired placement information, the acquired range information, and the acquired reference position information. Specifically, the information terminal 30 determines to which of a plurality of lower mesh networks each of the plurality of nodes 20 should belong by applying a plurality of ranges to the placement of the plurality of nodes 20 indicated by the acquired placement information, and in the state after the application, determines the node closest to the reference position among the nodes belonging to the same lower mesh network as the management node.

[0059] Such an information terminal 30 can assist the setter in determining the lower mesh network and the management node.

[0060] [Modification of Example 1] In the first embodiment, a predetermined requirement (at least one of an upper limit and a lower limit) may be set 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, if the predetermined requirement is not met, the confirmation operation may not be accepted (it is not considered to be a valid operation). This allows the information terminal 30 to support the user in constructing an appropriate hierarchical mesh network.

[0061] In this configuration, the user must perform the adjustment operation described above until the specified requirements are met. Therefore, if a requirement is set for the number of nodes belonging to a lower mesh network, the information processing unit 34 may visualize lower mesh networks that do not meet the node count requirement (i.e., the squares in the first template) on the configuration screen when the adjustment operation in step S24 is performed. For example, the information processing unit 34 may display, in a normal manner, the squares (ranges) indicated by the first template that meet the node count requirement, and display the squares that do not meet the node count requirement in a washed-out manner (grayed-out manner). In other words, the information processing unit 34 may change the color of the frame indicated by the first template depending on whether the node count requirement is met. This allows the information terminal 30 to support the user in performing the adjustment operation.

[0062] Furthermore, the information processing unit 34 may change the thickness of the frame indicated by the first template depending on whether the node number requirement is satisfied. For example, the information processing unit 34 may display a frame that does not satisfy the node number requirement thicker than a frame that satisfies the node number requirement. 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 node number requirement is satisfied. In other words, the information processing unit 34 may perform notification by changing the display mode of the range (frame) indicated by the first template depending on whether the node number requirement is satisfied.

[0063] When a plurality of nodes 20 are displayed in a list format, the information processing unit 34 may change the display mode (color inside the frame, thickness of the frame, color of the frame, or the like) of the frame of a node 20 that belongs to a lower mesh network that does not satisfy the node number requirement. In other words, the above notification may be made when a plurality of nodes 20 are displayed in a list format.

[0064] Furthermore, the information processing unit 34 may notify the presence of a first template that does not satisfy the node number requirement by using sound (such as an alarm sound), wind pressure, or smell instead of or in addition to an image, both when a layout diagram of the plurality of nodes 20 is displayed and when the plurality of nodes 20 are displayed in a list. In this case, the information terminal 30 may include a speaker, a blower fan, a smell generator, or the like, or be communicatively connected to a speaker, a blower fan, a smell generator, or the like.

[0065] Similarly, the information processing unit 34 may notify the user of the existence of a node 20 that does not belong to any lower mesh network (the existence of a node 20 that is not located within the frame of the first template) by using an image, sound, wind pressure, smell, etc. This notification may also be made when a layout diagram of the plurality of nodes 20 is displayed, or when the plurality of nodes 20 are displayed in a list.

[0066] Furthermore, the template patterns used in the first embodiment are merely examples, and templates having other patterns may be used. Figures 7A and 7B are diagrams showing templates in a modified example of the first embodiment.

[0067] The template shown in Figure 7A is composed of a first template in which squares (shown in Figure 7A as squares with rounded corners 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.

[0068] The first template is an example of range information that indicates multiple ranges for the arrangement of multiple nodes 20 indicated by the arrangement information. The first template has a configuration similar to the template shown in Fig. 6, except for the arrangement of multiple squares.

[0069] The second template is an example of reference position information that indicates the reference positions in each of the multiple ranges indicated by the range information. The positions of the vertices of the squares in the second template correspond to the reference positions. In other words, the multiple reference positions indicated by the second template are in a positional relationship that corresponds to the vertices of the squares. The second template is combined with the first template so that one reference position is located within one square frame of the first template.

[0070] The template shown in FIG. 7B is configured by combining a first template in which regular hexagons are laid out and a second template in which regular triangles are laid out.

[0071] The first template is an example of range information that indicates a plurality of ranges for the arrangement of a plurality of nodes 20 indicated by the arrangement information.

[0072] The second template is an example of reference position information that indicates the reference position in each of the multiple ranges indicated by the range information. The second template shown in Fig. 7B has the same configuration as the template shown in Fig. 6.

[0073] As described above, the templates used in Example 1 are not particularly limited. For example, the range indicated by the first template may be rectangular or may be another polygon. The shape of the second template is also not particularly limited.

[0074] The template is generated to a size that can cover the entire space indicated by the location information. For example, the template may be generated so that the area of ​​the entire template is larger than the total area (total floor area) of the space indicated by the location information.

[0075] In addition, in the first embodiment, a part of the placement information may be masked. That is, a part of the plurality of nodes 20 may be excluded from the determination of the lower mesh network and the determination of the management node using the template. In other words, the information processing unit 34 may have a function of determining to which of the plurality of lower mesh networks only a part of the plurality of nodes indicated by the placement information should belong.

[0076] Which node 20 to exclude is determined, for example, by an operation by the setter to specify a range to be masked. Such an operation is performed when the arrangement of multiple nodes 20 is displayed on the display unit 32. The excluded node 20 is treated as an independent node (not participating in the mesh network), but may belong to any lower mesh network based on a manual operation by the setter. Which node 20 to exclude may also be determined by an operation to select a node 20 in a list when multiple nodes 20 are displayed in list format. There are no particular limitations on the specific method for excluding a node.

[0077] Such a mask function is useful, for example, when the total number of the plurality of nodes 20 included in the placement information exceeds the upper limit of the number of nodes that can be registered.

[0078] In addition, in the first embodiment, the first template and the second template are described as being enlarged or reduced together, but only one of the first template and the second template may be enlarged or reduced. Fig. 7C is a diagram showing an example of reduction (enlargement) of the first template and the second template in a modified example.

[0079] The example of FIG. 7C illustrates the management node when the second template is reduced around the center of gravity of all nodes 20 included in the placement information (the average of the coordinates of all nodes 20). The star in FIG. 7C indicates the center of gravity. In FIG. 7C, the second template before reduction is indicated by a dashed line, and the second template after reduction is indicated by a solid line. The process of reducing (or enlarging) the second template independently of the first template can be said to be a process of shortening (or lengthening) the distance between multiple reference positions indicated by the second template, independent of the multiple ranges indicated by the first template, while maintaining the positional relationship between the multiple reference positions indicated by the second template. The purpose of reducing the second template independently of the first template is expected to be to ensure the quality of communication between management nodes.

[0080] In Figure 7C, the management nodes before the second template is reduced are shown in hatching, and the management nodes after the second template is reduced are shown in black. In this way, if the second template is reduced around the center of gravity, the management nodes belonging to the outer lower mesh network can be moved closer to the inside, thereby shortening the distance between the management nodes.

[0081] Note that the first and second templates require that there is only one vertex or intersection of the second template within one range of the first template (neither zero nor two or more). In other words, enlarging or reducing the first template (or second template) is permitted as long as there is only one reference position within each of the multiple ranges indicated by the first template.

[0082] Furthermore, the adjustment of the template may be performed as an internal process by the information processing unit 34, rather than by the setting person's adjustment operation. In other words, the method of determining the lower mesh network and the management node using the template may be automated. In this case, the information processing unit 34 can omit the information processing for accepting the setting person's adjustment operation. For example, the information processing unit 34 can omit the process of superimposing the placement information and the template and displaying them on the display unit 32.

[0083] Furthermore, as described above, when a lower mesh network that does not satisfy the node number requirement is generated when determining a lower mesh network by applying a template, the information processing unit 34 may automatically divide the lower mesh network into multiple lower mesh networks. In the simplest case, the information processing unit 34 divides one lower mesh network into two lower mesh networks by vertically or horizontally dividing one range of the first template that defines the lower mesh network that does not satisfy the node number requirement. Furthermore, as a method of dividing one range of the first template (one lower mesh network), a division method (algorithm) of Example 5 or a modified example thereof described later may be used.

[0084] 6, the entire first template and the second template are displayed on the display unit 32, but only a portion of the first template and the second template may be cropped and displayed on the display unit 32. FIGS. 7D and 7E are diagrams showing another example of the display range of the first template and the second template in the first embodiment, and the portion surrounded by the thick line 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 cropped into a rectangle to fit the screen shape of the display unit 32, for example, and displayed.

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

[0086] [Summary of Example 1 and its Modifications] As described above, the information terminal 30 includes an 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, determines to which of the plurality of lower mesh networks each of the plurality of nodes 20 should belong based on the acquired placement information, and determines a plurality of management nodes from among the plurality of nodes 20 based on the acquired placement information. The lower mesh network is an example of a first mesh network, and the upper mesh network is an example of a second mesh network.

[0087] Such an information terminal 30 can assist the setting person in determining the lower mesh network and the management node. In other words, the information terminal 30 can assist the setting work for constructing a hierarchical mesh network.

[0088] Furthermore, for example, the information processing unit 34 further acquires range information indicating multiple ranges for the arrangement of the multiple nodes 20 indicated by the arrangement information, and reference position information indicating the reference position in each of the multiple ranges, and determines to which of the multiple lower mesh networks each of the multiple nodes 20 should belong based on the acquired arrangement information and the acquired range information, and determines multiple management nodes from among the multiple nodes 20 based on the acquired arrangement information, the acquired range information, and the acquired reference position information.

[0089] Such an information terminal 30 can determine the lower mesh network and the management node using the location information, range information, and reference position information.

[0090] Also, for example, the information processing unit 34 determines the node 20 that is closest to the reference position as the management node among the nodes 20 that belong to the same lower mesh network determined based on the acquired placement information and the acquired range information.

[0091] Such an information terminal 30 can determine the management node using the location information, range information, and reference position information.

[0092] Furthermore, for example, the information processing unit 34 determines to which of multiple lower mesh networks each of the multiple nodes 20 should belong by applying multiple ranges to the placement of the multiple nodes 20 indicated by the acquired placement information, and in the state after the application, determines the node 20 that is closest to the reference position among the nodes 20 that belong to the same lower mesh network as the management node.

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

[0094] In addition, for example, each of the plurality of lower mesh networks has a requirement regarding the number of nodes that can belong to that lower mesh network. After the application of the plurality of ranges is performed, the information processing unit 34 has a function of notifying that there is a lower mesh network among the plurality of lower mesh networks that does not satisfy the requirement.

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

[0096] Also, for example, the information processing unit 34 notifies the user by displaying the range indicating the lower mesh network that does not satisfy the requirements among the multiple ranges in a different manner from the other ranges.

[0097] Such an information terminal 30 can notify the user by visualizing the range showing the lower mesh networks that do not satisfy the requirements.

[0098] Furthermore, for example, the information processing unit 34 has a function of notifying that, after the application of multiple ranges has been performed, there is a node 20 among the multiple nodes 20 that does not belong to any of the multiple ranges.

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

[0100] Also, for example, each of the multiple ranges is a square.

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

[0102] Also, for example, each of the multiple ranges is a hexagon.

[0103] Such an information terminal 30 can determine the lower mesh network using range information indicating a plurality of hexagonal ranges.

[0104] Furthermore, 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.

[0105] Such an information terminal 30 can determine the manager node using reference position information indicating a plurality of reference positions that have positional relationships corresponding to the vertices of an equilateral triangle.

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

[0107] Such an information terminal 30 can determine the manager node using reference position information indicating a plurality of reference positions that have positional relationships corresponding to the vertices of a square.

[0108] Also, for example, the information processing unit 34 expands or reduces multiple ranges and applies the expanded or reduced multiple ranges to the arrangement of the multiple nodes 20 indicated by the acquired arrangement information, thereby determining to which of the multiple lower mesh networks each of the multiple nodes 20 should belong.

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

[0110] Furthermore, for example, in expanding the ranges, an upper limit is set, and the upper limit is set based on the distance over which a management node can communicate with other management nodes.

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

[0112] Also, for example, the expansion or contraction of the multiple ranges is performed automatically based on the acquired arrangement information.

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

[0114] Also, for example, the expansion or contraction of the multiple ranges is performed independently of the multiple reference positions, and is permitted as long as there is only one reference position in each of the multiple ranges.

[0115] Such an information terminal 30 can individually enlarge or reduce the first templates.

[0116] Furthermore, for example, the information processing unit 34 may extend or shorten the distance between the multiple reference positions independently of the multiple ranges while maintaining the positional relationship between the multiple reference positions. The extension or shortening of the distance between the multiple reference positions is permitted on the condition that only one reference position is located in each of the multiple ranges.

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

[0118] Furthermore, for example, the expansion or contraction of the multiple ranges is performed while maintaining the positional relationship between the multiple ranges and the multiple reference positions.

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

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

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

[0122] Furthermore, for example, the information terminal 30 further includes a display unit 32 that displays the position of the determined manager node in the arrangement of the plurality of nodes 20 indicated by the arrangement information.

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

[0124] Also, for example, only a part of the multiple ranges is displayed on the display unit 32 in accordance with the shape of the display unit 32.

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

[0126] Furthermore, for example, the information processing unit 34 of the information terminal 30 has a function of determining to which of a plurality of lower mesh networks only a portion of the plurality of nodes 20 should belong.

[0127] Such an information terminal 30 can exclude other parts of the plurality of nodes 20 from the determination of the lower mesh network.

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

[0129] The communication system 10 can assist a user in determining the lower mesh network and the management node, i.e., the communication system 10 can assist the user in the configuration work for building a hierarchical mesh network.

[0130] Furthermore, for example, the plurality of nodes 20 includes lighting fixtures.

[0131] Such a communication system 10 can function as a control system for lighting fixtures.

[0132] In addition, an information processing method for constructing a hierarchical mesh network, which is executed by a computer such as an information terminal 30, acquires placement information indicating the placement of multiple nodes 20, determines to which of multiple lower mesh networks each of the multiple nodes 20 should belong based on the acquired placement information, and determines multiple management nodes from among the multiple nodes 20 based on the acquired placement information.

[0133] Such an information processing method can assist a configuration person in determining a lower mesh network and a management node, i.e., the information processing method can assist a configuration work for constructing a hierarchical mesh network.

[0134] [Example 2] In the second embodiment, a method for 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.

[0135] In the second embodiment, it is assumed that the lower mesh networks to which the plurality of nodes 20 belong have already been determined. In the second embodiment, the lower mesh networks are determined by either the method described above or the method described below, but may be arbitrarily determined by a setter or by another existing method. When the lower mesh networks are determined, the memory unit 35 stores affiliation information indicating to which of the plurality of lower mesh networks the plurality of nodes 20 belong.

[0136] The information processing unit 34 of the information terminal 30 acquires placement information indicating the placement of a plurality of nodes 20 from the storage unit 35 (S31). The placement information is, for example, information that has been 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).

[0137] Next, the information processing unit 34 calculates the center of gravity position of the nodes 20 belonging to the same lower mesh network among the plurality of nodes 20 based on the acquired placement information and the acquired affiliation information (S33). If the placement information indicates the placement of the plurality of nodes 20 using two-dimensional coordinates (x and y coordinates), the x coordinate of the center of gravity position is the value obtained by averaging the x coordinates of the nodes 20 belonging to the same lower mesh network, and the y coordinate of the center of gravity position is the 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.

[0138] Next, based on the acquired placement information, the information processing unit 34 determines, among the nodes 20 belonging to the same lower mesh network, the node 20 located closest to the center of gravity of the lower mesh network as the management node belonging to the lower mesh network (S34). A management node is determined for each of a plurality of lower mesh networks. FIG. 9 is a diagram showing the position of the determined 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 in each section indicates the management node of the section (lower mesh network). Note that if there are a plurality of nodes 20 located closest to the center of gravity, any one of them may be determined as the management node.

[0139] Next, the information processing unit 34 determines whether the distance between the management nodes (corresponding to the length of the two-way arrow in FIG. 9) of the adjacent lower mesh networks (corresponding to the sections 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.

[0140] If it is determined that the distances between all 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).

[0141] The redetermination process will be explained below. For example, in Fig. 9, when it is determined that the distances of three points D1 to D3 exceed a predetermined value, since D1 to D3 are all distances between the management node and other management nodes within section A, the information processing unit 34 divides section A into two. Dividing sections has the same meaning as dividing one lower mesh network into two lower mesh networks.

[0142] The information processing unit 34, for example, divides the section A into two sections A1 and A2 arranged vertically, and determines a management node in each of the divided sections A1 and A2 (i.e., each of the two lower mesh networks after division). The method of determining the management node is the same as in steps S33 and S34. Figure 10 is a diagram showing the position of the newly determined management node.

[0143] Furthermore, the information processing unit 34 performs the determination in step S35 for the newly determined manager node. If it is determined that one or more of the distances between the manager nodes (D4 to D7 in FIG. 10) is within a predetermined value (for example, only D5 in FIG. 10 is within the predetermined value), the redetermining process ends. Note that section A may be divided into two sections aligned horizontally.

[0144] As described above, in the second embodiment, the information terminal 30 acquires the placement information and the affiliation information, calculates the center of gravity position of the nodes 20 belonging to the same lower mesh network among the plurality of nodes 20 based on the acquired placement information and the acquired affiliation information, and determines the node 20 located closest to the center of gravity position among the nodes 20 belonging to the same lower mesh network as the management node belonging to the lower mesh network.

[0145] Such an information terminal 30 can assist the settlor in determining the management node.

[0146] In the redetermination process of Example 2, the partition may be divided based on a manual operation by a setter. Also, in the redetermination process of Example 2, the management node is determined after the partition is divided, but the information processing unit 34 may add a management node to one partition and then divide the partition into multiple partitions each including only one management node.

[0147] [Modification 1 of Example 2] In the above-mentioned embodiment 2, the same method is used to determine the management node for all lower mesh networks, but the method of determining the management node may be changed based on the location of the lower mesh network (the arrangement of multiple lower mesh networks). Figure 11 is a flowchart of such a first modification of embodiment 2.

[0148] 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 placement information is, for example, information that has been 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 positions of the nodes 20 that belong to the same lower mesh network among the plurality of nodes 20 based on the acquired placement information and the acquired affiliation information (S43). The processing of steps S41 to S43 is the same as steps S31 to S33. The center of gravity position calculated in step S43 is also referred to as the first center of gravity position.

[0149] Next, the information processing unit 34 calculates the overall center of gravity position of the plurality of nodes 20 based on the acquired placement information (S44). If the placement information indicates the placement of the plurality of nodes 20 using two-dimensional coordinates (x and y coordinates), the x coordinate of the center of gravity position is the arithmetic average of the x coordinates of all of the plurality of nodes 20 belonging to the hierarchical mesh network, and the y coordinate of the center of gravity position is the arithmetic average of the y coordinates of all of the plurality of nodes 20 belonging to the hierarchical mesh network. The center of gravity position calculated in step S44 is also referred to as the second center of gravity position.

[0150] Next, the information processing unit 34 identifies the arrangement of a plurality of lower mesh networks based on the acquired arrangement information and the acquired belonging information (S45). Figure 12 is a diagram for explaining the arrangement of a plurality of lower mesh networks. Figure 12 corresponds to a plan view of a space in which a plurality of nodes 20 are arranged, and one section in Figure 12 is a section in which nodes 20 belonging to the same lower mesh network are arranged. In other words, the section in Figure 12 corresponds to a lower mesh network. The circle located in each section indicates the management node of the section (lower mesh network).

[0151] The information processing unit 34, for example, identifies (distinguishes) a lower mesh network located in the center (not located at the edge) in the arrangement of a plurality of lower mesh networks (corresponding to the section without hatching in FIG. 12) and a lower mesh network located at the edge (corresponding to the section with hatching in FIG. 12). In the example of FIG. 12, being located in the center means that all sides of the section representing the lower mesh network are adjacent to other sections (lower mesh networks). Being located at the edge means that at least one side of the section representing the lower mesh network is not adjacent to other sections (lower mesh networks).

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

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

[0154] In this way, in variant example 1 of embodiment 2, the information terminal 30 determines the node 20 closest to the overall central position (second central position) as the management node in a lower mesh network located at the edge, thereby preventing the occurrence of management nodes that are far away from other management nodes.

[0155] In the first modification of the second embodiment, the determination and redetermining process regarding the distance between the manager nodes described in the second embodiment may also be performed.

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

[0157] The information processing unit 34 of the information terminal 30 acquires placement information indicating the placement of a plurality of nodes 20 from the storage unit 35 (S51). The placement information is, for example, information that has been 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 a first centroid position based on the acquired placement information and the acquired affiliation information (S53). The information processing unit 34 calculates a second centroid position based on the acquired placement information (S54). The processes of steps S51 to S54 are the same as those of steps S41 to S44.

[0158] 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). Figure 14 is a diagram for explaining a method for determining a management node in the second modification of the second embodiment. Figure 14 corresponds to a plan view of a space in which a plurality of nodes 20 are arranged, and one section in Figure 14 is a section in which nodes 20 belonging to the same lower mesh network are arranged. In other words, the section in Figure 14 corresponds to a lower mesh network. The circle located in each section indicates the node 20 belonging to the section (lower mesh network).

[0159] In Fig. 14, a star indicates the first center of gravity position. Specifically, the information processing unit 34 determines the node 20 that is located closest to the point (triangle mark in Fig. 14) that divides the line segment connecting the first center of gravity position and the second center of gravity position into 1:n (n is a positive number) among the nodes 20 that belong to the same lower mesh network as the management node that belongs to the lower mesh network. In Fig. 14, the management node is indicated by a hatched circle.

[0160] In the example of FIG. 14, n=1, but n may be another value equal to or greater than 1, such as 2, or may be a value less than 1. n may be determined empirically or experimentally as appropriate. n may also be changed for each lower mesh network. Note that n is defined as the distance from the first centroid position to the dividing point when the distance from the first centroid position to the dividing point is 1, for example.

[0161] If the node 20 belonging to the same lower mesh network that is closest to the second center position is determined to be the management node, multiple management nodes corresponding to multiple lower mesh networks may end up being too close to the second center position, and the management node of a lower mesh network located on the outside may end up being far away from other management nodes located on the inside.

[0162] In contrast to this, in the second modification of the second embodiment, the information terminal 30 can prevent the plurality of management nodes from moving too close to the second center position.

[0163] 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 Fig. 15 and Fig. 16. Fig. 15 and Fig. 16 are other diagrams for explaining a method for determining a management node in the second modification of the second embodiment. Also in the second modification of the second embodiment, the determination and redetermining process regarding the distance between the management nodes described in the second embodiment may be performed.

[0164] [Summary of Example 2 and its Modifications] As described above, the information terminal 30 includes an 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 belonging to one of the plurality of lower mesh networks, and determines a plurality of management nodes from among the plurality of nodes 20 based on the acquired placement information. The lower mesh network is an example of a first mesh network, and the upper mesh network is an example of a second mesh network.

[0165] Such an information terminal 30 can assist the person setting up the network to determine the management node. In other words, the information terminal 30 can assist the setting up work for building a hierarchical mesh network.

[0166] Also, for example, the information processing unit 34 further acquires affiliation information indicating to which of multiple lower mesh networks the multiple nodes 20 belong, and determines multiple management nodes based on the acquired placement information and the acquired affiliation information.

[0167] Such an information terminal 30 can determine the management node using the placement information and affiliation information.

[0168] Furthermore, for example, the information processing unit 34 calculates the first center of gravity positions of the nodes 20 belonging to the same lower mesh network among the multiple nodes 20 based on the acquired placement information and the acquired affiliation information, calculates the second center of gravity positions of the multiple nodes 20 based on the acquired placement information, and determines the node 20 among the nodes 20 belonging to the same lower mesh network that is located closest to the point dividing the line segment connecting the first center of gravity positions and the second center of gravity positions into 1:n (n is a positive number) as the management node belonging to the lower mesh network.

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

[0170] Also, for example, the information processing unit 34 changes the value of n for each lower mesh network to determine the management node.

[0171] Such an information terminal 30 can determine the management node under different conditions for each lower mesh network.

[0172] Also, for example, the information processing unit 34 determines the node 20 that is located closest to the point that divides the line segment 1:1 among the nodes 20 that belong to the same lower mesh network as the management node that belongs to that lower mesh network.

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

[0174] Furthermore, for example, the information processing unit 34 calculates the first center of gravity position of the nodes 20 belonging to the same lower mesh network among the multiple nodes 20 based on the acquired placement information and the acquired affiliation information, and determines the node 20 located closest to the first center of gravity position among the nodes 20 belonging to the same lower mesh network as the management node belonging to that lower mesh network.

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

[0176] Further, for example, the information processing unit 34 calculates the first center of gravity positions of the plurality of nodes 20 based on the acquired placement information, identifies the placement of the plurality of lower mesh networks based on the acquired placement information and the acquired affiliation information, and in a lower mesh network that is not located at an end in the placement of the plurality of lower mesh networks, determines the node 20 that is located closest to the first center of gravity position among the nodes 20 belonging to the lower mesh network as the management node belonging to the lower mesh network, and in a lower mesh network that is located at an end in the placement of the plurality of lower mesh networks, determines the node 20 that is located closest to the first center of gravity position among the nodes 20 belonging to the lower mesh network as the management node belonging to the lower mesh network.

[0177] Such an information terminal 30 can prevent the occurrence of a manager node that is far away from other manager nodes.

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

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

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

[0181] Such a communication system 10 can assist a setting person in determining a management node, that is, the communication system 10 can assist a setting person in configuring a hierarchical mesh network.

[0182] Furthermore, for example, the plurality of nodes 20 includes lighting fixtures.

[0183] Such a communication system 10 can function as a control system for lighting fixtures.

[0184] In addition, an information processing method for constructing a hierarchical mesh network, which is executed by a computer such as an information terminal 30, acquires placement information indicating the placement of multiple nodes 20, each of which belongs to one of multiple lower mesh networks, and determines multiple management nodes from among the multiple nodes 20 based on the acquired placement information.

[0185] Such an information processing method can assist a setting person in determining a management node, that is, the information processing method can assist a setting person in setting up a hierarchical mesh network.

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

[0187] First, a description will be given of control groups. For example, if each of the multiple nodes 20 is a lighting fixture, each of the multiple nodes 20 belongs to a control group in which light emission is collectively controlled at the same time. This control group is referred to as control group A. For example, multiple nodes 20 that turn on or off simultaneously when a wall switch installed in a space is pressed are multiple nodes 20 that belong to the same control group A. Note that the power supply systems of the multiple nodes 20 that belong to the same control group A do not necessarily need to be the same, and the power supply systems of the multiple nodes 20 that belong to the same control group A may be different.

[0188] The same control group A further includes one or more control groups B. A control group B is a group to which nodes 20 with the same dimming rate or color temperature setting value belong. In other words, for example, the control group B is a group in terms of lighting operation. The control group B is a group in which at least one of the dimming rate and color temperature setting values ​​is unified, for example, a group that emits light in daylight white with a dimming rate of 80% and a group that emits light in warm white with a dimming rate of 90%. The control groups B that belong to the same control group A are collectively controlled to emit light at the same timing.

[0189] In the third embodiment, control group information indicating such a control group is stored (registered) in advance in the storage unit 35 of the information terminal 30. Hereinafter, a method for determining the 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.

[0190] The information processing unit 34 of the information terminal 30 acquires control group information from the storage unit 35 (S61). Based on the acquired control group information, the information processing unit 34 determines to which of a plurality of lower mesh networks each of the plurality of nodes 20 should belong (S62). For example, the information processing unit 34 associates the control groups with the lower mesh networks on a one-to-one basis, and assigns nodes 20 of the plurality of nodes 20 that belong to the same control group to the same lower mesh network. The control group here is the control group A described above, but it may also be the control group B described above.

[0191] As described above, in a hierarchical mesh network, when information is transmitted within a lower mesh network, the information is not relayed in other lower mesh networks. Therefore, by having a one-to-one correspondence between a control group and a lower mesh network, it is possible to prevent unnecessary communication in other lower mesh networks when controlling multiple nodes 20.

[0192] Thereafter, when the operation receiving unit 31 receives an operation to instruct a change of the control group, the information processing unit 34 updates the control group information stored in the storage unit 35 (S63). Changes of the control group include changing the control group to which an existing node 20 belongs, adding a new node 20 to a control group, and deleting (deleting) an existing node 20 from a control group.

[0193] When the control group information is updated, the information processing unit 34 determines again to which of the plurality of lower mesh networks each of the plurality of nodes 20 should belong in accordance with the change in the control group (S64). For example, the information processing unit 34 associates the control group with the lower mesh network on a one-to-one basis, and causes the nodes 20 belonging to the same control group 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 in the control group.

[0194] In addition, when the maximum number of nodes 20 belonging to the same lower mesh network (in other words, the upper limit number or a predetermined number) is set, if the number of nodes 20 belonging to the same control group exceeds the maximum number of nodes, it is not possible to make 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 described. Figure 18 is a diagram showing a first example of correspondence between a control group and a lower mesh network.

[0195] 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 multiple control groups B. The multiple control groups B include control group B1 made up of 10 nodes 20, control group B2 made up of 10 nodes 20, and control group B3 made up of 20 nodes 20. The detailed configuration of such groups is indicated by the control group information described above.

[0196] Here, when the maximum number of nodes in one lower mesh network is 32, since control group A includes 40 nodes 20, it is not possible for all nodes 20 belonging to control group A to belong to the same lower mesh network.

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

[0198] Furthermore, for the remaining control groups B1 and B2, the information processing unit 34 determines whether the total number of nodes 20 belonging to the control group B1 and the control group B2 exceeds the maximum number of nodes. In the example of Fig. 18, the information processing unit 34 determines that the total number of nodes 20 is equal to or less than the maximum number of nodes, and causes all of the nodes 20 belonging to the control group B1 and the nodes 20 belonging to the control group B2 to belong to the lower mesh network C2.

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

[0200] As described above, when the number of nodes 20 belonging to the same control group A is equal to or less than the maximum number of nodes (not shown), the information processing unit 34 assigns the nodes 20 to the same lower mesh network. 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 assigns the nodes 20 to two or more lower mesh networks (three in the example of FIG. 18) by dividing them into the lower mesh networks.

[0201] 18, when the number of nodes 20 belonging to the same control group B3 is equal to or less than the maximum number of nodes, the information processing unit 34 assigns the nodes 20 to the same lower mesh network. Also, the information processing unit 34 assigns the nodes 20 belonging to the control group B1 (an example of a first group) among the plurality of nodes 20 and the nodes 20 belonging to the control group B2 (an example of a second group) among the plurality of nodes 20 to the same lower mesh network.

[0202] 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 multiple control groups B. The multiple control groups B include control group B1 consisting of 20 nodes 20, control group B2 consisting of 20 nodes 20, and control group B3 consisting of 40 nodes 20. The detailed configuration of such groups is indicated by the above-mentioned control group information.

[0203] Here, when the maximum number of nodes in one lower mesh network is 32, control group A includes 80 nodes 20, so it is not possible for all nodes 20 belonging to control group A to belong to the same lower mesh network.

[0204] In such a case, the information processing unit 34 identifies the control group (control group B3) that has the largest number of nodes 20 among the control groups B1 to B3, and determines whether the number of nodes 20 in the identified control group B3 exceeds the maximum number of nodes. In the example of Fig. 19, the information processing unit 34 determines that the number of nodes 20 in the identified control group B3 exceeds the maximum number of nodes, and further divides the nodes 20 belonging to the control group B3 into two groups, and assigns one group to the lower mesh network C1 and the other group to the lower mesh network C2.

[0205] 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 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, and that the number of nodes 20 belonging to control group B1 and the number of nodes 20 belonging to control group B2 are each equal to or less than the maximum number of nodes. The information processing unit 34 assigns the nodes 20 belonging to control group B1 to lower mesh network C3, and assigns the nodes 20 belonging to control group B2 to lower mesh network C4.

[0206] As a result, as shown in Figure 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 control group B1 is associated with the lower mesh network C3, and the control group B2 is associated with the lower mesh network C4.

[0207] 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, the information processing unit 34 assigns the nodes 20 to the same lower mesh network. Also, 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 assigns the nodes 20 to two or more lower mesh networks.

[0208] When the nodes 20 belonging to the same control group are divided into two or more lower mesh networks, there are no particular limitations on how the nodes 20 belonging to the same control group are divided into two or more groups. For example, the information processing unit 34 can acquire placement information indicating the placement of the plurality of nodes 20, and based on the acquired placement information, can divide the nodes 20 belonging to the same control group into two or more groups taking into account the proximity of their positions (coordinates).

[0209] Furthermore, if the placement information includes partition information (described later), the information processing unit 34 can divide the nodes 20 belonging to the same control group into two or more groups, taking into account the partition in which the nodes 20 are installed, such as preferentially placing nodes 20 installed in the same partition in the same group.

[0210] Furthermore, when nodes 20 belonging to n control groups (n is a natural number between 2 and m) out of m control groups (m is a natural number between 3 and 3) are to belong to one lower mesh network, the method of selecting n control groups from m control groups is not particularly limited. For example, the information processing unit 34 can select n control groups that are close in position (coordinates) from among the m control groups based on the acquired placement information as the n control groups to belong to the same lower mesh network.

[0211] In addition, if the placement information includes section information (described later), the information processing unit 34 may select n control groups to belong to the same lower mesh network, taking into account whether they are installed in the same section.

[0212] As described above, in the third embodiment, the information terminal 30 acquires control group information, and based on the acquired control group information, assigns the nodes 20 belonging to the same group among the multiple nodes 20 to the same lower mesh network.

[0213] Such an information terminal 30 can assist the setter in determining the lower mesh network.

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

[0215] The information processing unit 34 of the information terminal 30 acquires placement information including block information from the storage unit 35 (S71). The placement information is, for example, generated, read, or modified by the information processing unit 34 before step S71. Fig. 21 is a diagram showing an example of placement information including block information. Fig. 21 visualizes the placement information and corresponds to a plan view of a space in which multiple nodes 20 are placed.

[0216] 21, circles indicate the positions of nodes 20. In placement information including partition information, the two-dimensional coordinates of each of multiple nodes 20 are associated with the partition to which the node 20 belongs. Here, a partition is, for example, a unit (i.e., a room) obtained by physically dividing a space by structures such as walls or doors, but it may also be a unit (operational unit) divided by use or the like without any clear structure. In the example of FIG. 21, the space is divided into six partitions, partitions A to F.

[0217] 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 section information included in the acquired placement information (S72). For example, the information processing unit 34 associates the section with the lower mesh network on a one-to-one basis, and assigns the nodes 20 installed in the same section among the plurality of nodes 20 to the same lower mesh network.

[0218] 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. Furthermore, nodes 20 installed in the same section are often controlled collectively (or in conjunction with each other). Therefore, by associating a section with a lower mesh network on a one-to-one basis, it is possible to prevent unnecessary communication in other lower mesh networks when controlling multiple nodes 20.

[0219] Thereafter, when the operation receiving unit 31 receives an operation instructing a change of the partition, the information processing unit 34 updates the partition information stored in the storage unit 35 (S73). The change of the partition includes changing the partition in which the existing node 20 is installed, adding a new node 20 to the partition, and deleting (deleting) the existing node 20 from the partition.

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

[0221] In addition, if a maximum number of nodes 20 (in other words, an upper limit or a predetermined number) that can belong to the same lower mesh network is set, if the number of nodes 20 installed in the same section exceeds the maximum number of nodes, it will not be possible to have a one-to-one correspondence between the section and the lower mesh network.

[0222] 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, if the information processing unit 34 determines that the number of nodes 20 installed in the same section is equal to or less than the maximum number of nodes, the information processing unit 34 assigns the nodes 20 to the same lower mesh network. If 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 assigns the nodes 20 to two or more lower mesh networks.

[0223] There is no particular limitation on how to divide the nodes 20 installed in the same section 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 their positions (coordinates) based on the placement information. The information processing unit 34 may also acquire control group information in addition to the placement information and divide the nodes 20 installed in the same section into two or more groups taking the control groups into consideration, such as preferentially placing nodes 20 belonging to the same control group in the same group.

[0224] Furthermore, similarly to the third embodiment, when the number of nodes 20 installed in each section is small, the information processing unit 34 may cause the nodes 20 installed in multiple sections to belong to one lower mesh network. For example, the information processing unit 34 causes the node 20 installed in a first section among the multiple nodes 20 and the node 20 installed in a second section different from the first section among the multiple nodes 20 to belong to the same lower mesh network.

[0225] When nodes 20 installed in n (n is a natural number between 2 and m) sections out of m (m is a natural number between 3 and 3) sections are to belong to one lower mesh network, the method of selecting n from m sections is not particularly limited. For example, the information processing unit 34 can select n sections that are close in position (coordinates) from among the m sections based on the placement information as the n sections to belong to the same lower mesh network. The information processing unit 34 may also acquire control group information in addition to the placement information, and select the n sections to belong to the same lower mesh network by considering whether or not they belong to the same control group.

[0226] As described above, in the third embodiment, the information terminal 30 acquires placement information including classification information, and, based on the classification information, assigns the nodes 20 belonging to the same group among the multiple nodes 20 to the same lower mesh network.

[0227] Such an information terminal 30 can assist the setter in determining the lower mesh network.

[0228] [Summary of Example 3 and its Modifications] As described above, the information terminal 30 includes an 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 placement information indicating the placement of the plurality of nodes 20, and determines to which of the plurality of lower mesh networks each of the plurality of nodes 20 should belong based on the acquired at least one of the pieces of information. The lower mesh network is an example of a first mesh network, and the upper mesh network is an example of a second mesh network.

[0229] Such an information terminal 30 can assist the person setting up the network to determine the lower mesh network. In other words, the information terminal 30 can assist the setting work for building a hierarchical mesh network.

[0230] Furthermore, for example, the information processing unit 34 acquires control group information, and, based on the acquired control group information, assigns the nodes 20 belonging to the same group among the plurality of nodes 20 to the same lower mesh network.

[0231] Such an information terminal 30 can determine a lower mesh network so as to prevent unnecessary communication from occurring when controlling a plurality of nodes 20.

[0232] Also, for example, if the number of nodes 20 belonging to the same group is less than or equal to a predetermined number, the information processing unit 34 assigns the nodes 20 to the same lower mesh network, and if the number of nodes 20 belonging to the same group is greater than the predetermined number, the information processing unit 34 assigns the nodes 20 to two or more lower mesh networks.

[0233] Such an information terminal 30 can determine the lower mesh network in a manner that takes into account the limit on the number of nodes in the lower mesh network and suppresses the occurrence of unnecessary communication when controlling multiple nodes 20.

[0234] Furthermore, for example, the information processing unit 34 acquires placement information in addition to control group information, and if the number of nodes 20 belonging to the same group is greater than a predetermined number, the node 20 is divided into two or more lower mesh networks based on the acquired placement information and assigned to each of the nodes 20.

[0235] Such an information terminal 30 can improve communication performance between nodes 20 by taking into consideration the placement of the nodes 20 when dividing the nodes 20 belonging to the same group into two or more lower-level mesh networks.

[0236] Also, for example, the information processing unit 34 causes 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 to belong to the same lower mesh network.

[0237] Such an information terminal 30 can determine the lower mesh networks so as to reduce the total number of lower mesh networks and prevent unnecessary communications from occurring when controlling a plurality of nodes 20.

[0238] Also, for example, after the information processing unit 34 determines to which of the multiple lower mesh networks each of the multiple nodes 20 should belong, when a change is made to the group when the multiple nodes 20 are controlled, the information processing unit 34 again determines to which of the multiple lower mesh networks each of the multiple nodes 20 should belong in accordance with the change.

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

[0240] Furthermore, for example, the placement information includes partition information indicating a partition of a space in which the plurality of nodes 20 are installed. The information processing unit 34 acquires the placement information, and, based on the partition information included in the acquired placement information, assigns the nodes 20 installed in the same partition among the plurality of nodes 20 to the same lower mesh network.

[0241] Such an information terminal 30 can determine a lower mesh network so as to prevent unnecessary communication from occurring when controlling a plurality of nodes 20.

[0242] Also, for example, if the number of nodes 20 installed in the same section is less than or equal to a predetermined number, the information processing unit 34 assigns the nodes 20 to the same lower mesh network, and if the number of nodes 20 installed in the same section is greater than the predetermined number, the information processing unit 34 assigns the nodes 20 to two or more lower mesh networks.

[0243] Such an information terminal 30 can determine the lower mesh network in a manner that takes into account the limit on the number of nodes in the lower mesh network and suppresses the occurrence of unnecessary communication when controlling multiple nodes 20.

[0244] Also, for example, when the number of nodes 20 installed in the same section is greater than a predetermined number, the information processing unit 34 divides the nodes 20 into two or more lower mesh networks based on the acquired placement information and assigns them to those networks.

[0245] Such an information terminal 30 can improve communication performance between nodes 20 by taking into consideration the placement of the nodes 20 when dividing the nodes 20 located in the same section into two or more lower-level mesh networks.

[0246] Also, for example, the information processing unit 34 causes a node 20 among the plurality of nodes 20 that is installed in a first section and a node 20 among the plurality of nodes 20 that is installed in a second section different from the first section to belong to the same lower mesh network.

[0247] Such an information terminal 30 can determine the lower mesh networks so as to reduce the total number of lower mesh networks and prevent unnecessary communications from occurring when controlling a plurality of nodes 20.

[0248] Also, for example, after the information processing unit 34 has determined to which of the multiple lower mesh networks each of the multiple nodes 20 should belong, if a change is made to the section in which the multiple nodes 20 are installed, the information processing unit 34 again determines to which of the multiple lower mesh networks each of the multiple nodes 20 should belong in accordance with the change.

[0249] 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 section.

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

[0251] Such a communication system 10 can assist a setter in determining a lower mesh network, that is, the communication system 10 can assist a setter in setting up a hierarchical mesh network.

[0252] Furthermore, for example, the plurality of nodes 20 includes lighting fixtures.

[0253] Such a communication system 10 can function as a control system for lighting fixtures.

[0254] In addition, an information processing method for constructing a hierarchical mesh network, which is executed by a computer such as an information terminal 30, acquires at least one of control group information indicating the group when multiple nodes 20 are controlled and placement information indicating the placement of multiple nodes 20, and determines to which of multiple lower mesh networks each of the multiple nodes 20 should belong based on the acquired at least one of the pieces of information.

[0255] Such an information processing method can assist a setting person in determining a lower mesh network, that is, the information processing method can assist a setting person in the setting work for constructing a hierarchical mesh network.

[0256] [Example 4] In the fourth embodiment, unlike the first to third embodiments, a method for making each of the plurality of nodes 20 participate in a lower mesh network and a method for making some of the plurality of nodes 20 participate in the lower mesh network as management nodes will be described. In the fourth embodiment, unless otherwise specified, the description will be given assuming that not all of the nodes 20 participate in the hierarchical mesh network. In the fourth embodiment, "communicable" means that the nodes 20 can communicate directly with each other without going through other nodes 20.

[0257] Fig. 22 is a flowchart showing the operation of the communication system 10 (i.e., the information processing method) in the fourth embodiment. (a) of Fig. 22 is a flowchart showing the operation of the information terminal 30. (b) of Fig. 22 is a flowchart showing the operation of the management node determined by the first entry process described later. (c) of Fig. 22 is a flowchart showing the operation of the relay node determined by the determination process described later.

[0258] First, when the operation reception unit 31 of the information terminal 30 receives a predetermined operation by a 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 having the found node 20 enter one of a plurality of lower mesh networks (first mesh network) as a manager node. Here, "searching for a node" means searching for a node 20 among the plurality of nodes 20 that can receive a periodically transmitted beacon signal by the wireless communication unit 33 of the information terminal 30.

[0259] As shown in (a) of Figure 22, in the first joining process, the information processing unit 34 searches for a 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 found node 20 as a manager node (S82). That is, the information processing unit 34 of the information terminal 30 causes the found node 20 to join the lower mesh network, and determines the node 20 as a manager node of the lower mesh network. Note that if there are multiple found nodes 20, the information processing unit 34 of the information terminal 30 determines each of the found nodes 20 as a manager node.

[0260] Furthermore, the information processing unit 34 of the information terminal 30 may not determine all of the discovered nodes 20 as manager nodes, but may determine only the nodes 20 whose radio wave strength of the beacon signal (for example, a received signal strength indication (RSSI) value) is equal to or greater than a predetermined value as manager nodes. In this case, it becomes easier to ensure communication performance that enables reliable communication between the information terminal 30 and the manager node.

[0261] In addition, it is conceivable that an excessive number of manager nodes may increase traffic and place a load on the system, or exceed the upper limit of the number of manager nodes that can be registered in the system. For this reason, the information processing unit 34 of the information terminal 30 may limit the number of manager nodes to a predetermined number. For example, when the searched nodes 20 are sorted in order of the radio wave strength of the beacon signal, the information processing unit 34 of the information terminal 30 may determine only the top predetermined number of nodes 20 as manager nodes. Also, for example, the information processing unit 34 of the information terminal 30 may randomly determine a predetermined number of manager nodes from the searched nodes 20.

[0262] 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 address information (unicast address) of the node 20 used for communication within the hierarchical mesh network. The determination information also includes information necessary for the node 20 to function as the management node. Note that the determination information may also include, as necessary, a security passcode used for communication within the lower mesh network, information about the information terminal 30 (information about the device that manages the hierarchical mesh network), and the like.

[0263] When the node 20 determined to be the management node acquires the determination information, the node 20 participates in the lower mesh network as the management node.

[0264] Here, a specific example of the first joining process will be described with reference to Fig. 23. Fig. 23 is an explanatory diagram of the first joining 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. Also, 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 expressions in Fig. 23 are the same as those in Figs. 24 to 27 described later.

[0265] 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 to be manager nodes, respectively, and transmits decision information to the three nodes 20A, 20B, and 20C. As a result, the nodes 20A, 20B, and 20C each acquire the decision information and thereafter function as a manager node.

[0266] 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 node 20, which is the management node. The information processing unit is realized, for example, by 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. The second entry process and the determination process are automatically executed by node 20 (management node) when node 20 acquires the determination information and begins to function as a management node.

[0267] The second entry process is a process of searching for a node 20 with which communication is possible and allowing the found node 20 to enter the lower mesh network (first mesh network) to which the node 20 itself (here, the manager node) belongs. Here, "searching for a node" means searching for a node 20 among the plurality of nodes 20 that can receive a periodically transmitted beacon signal by the wireless communication unit 21 of the manager node. Note that, when there are a plurality of manager nodes, the plurality of manager nodes may execute the second entry process in the order in which the information processing unit 34 of the information terminal 30 determines these plurality of manager nodes, or may execute the second entry process in the order of highest signal strength between the manager node and the information terminal 30, or may execute the second entry process randomly.

[0268] 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 receives the search signal joins the lower mesh network to which the management node that is the sender of the search signal belongs. Here, when the node 20 receives search signals from multiple management nodes, it may join the lower mesh network to which the management node that is the sender of the search signal with the strongest signal belongs.

[0269] The determination process is a process of determining a relay node in a lower mesh network (to which the management node belongs) based on the strength of radio waves received by the node itself (here, the management node). 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. In other words, the node 20 determined as 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 that belongs to the new lower mesh network. The details of the determination process will be explained in step S93 below.

[0270] 22(b), in the second joining process, the information processing unit of the management node searches for a node 20 (S91). When a node 20 capable of receiving a beacon signal is found, the information processing unit of the management node causes the found node 20 to join the lower mesh network to which the management node belongs (S92).

[0271] Here, the information processing unit of the management node transmits entry information to the node 20 that is desired to join. The entry information includes the ID of the lower mesh network to which the management node belongs, and address information (unicast address) of the node 20 used for communication within the hierarchical mesh network. Note that the entry information may also include, as necessary, a security passcode used for communication within the lower mesh network, information about the information terminal 30 (information about the device that manages the hierarchical mesh network), and the like.

[0272] 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, which will be described later), or may be assigned to the node 20 by the information processing unit of the management node (or relay node). In the latter case, the information processing unit of the management node (or relay node) assigns address information subordinate to the address information of the management node (or relay node) to the node 20. This makes it possible to avoid duplication with address information of nodes 20 belonging to other lower mesh networks.

[0273] 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 entered the lower mesh network stops the periodic transmission of beacon signals that it had been performing before entering the lower mesh network.

[0274] Here, a specific example of the second entry process by the management node will be described with reference to 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. Also in Fig. 24, bidirectional arrows between nodes indicate that communication is possible between the nodes. Also in Fig. 24, dashed frames indicate that multiple nodes enclosed in the frame belong to the same lower mesh network. The expressions in Fig. 24 are the same in Figs. 25 to 27 described later.

[0275] In the example shown in Fig. 24, the information processing units of the 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 node 20A enter the lower mesh network that uses node 20A as the management node (see the dashed box in the upper left of Fig. 24). Furthermore, a plurality of nodes (four in this case) that can communicate with node 20B enter the lower mesh network that uses node 20B as the management node (see the dashed box in the upper right of Fig. 24). Furthermore, a plurality of nodes (three in this case) that can communicate with node 20C enter the lower mesh network that uses node 20C as the management node (see the dashed box in the lower right of Fig. 24).

[0276] 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 determines the node 20 with the lowest radio wave strength among one or more nodes 20 whose radio wave strength (here, RSSI value) of the received beacon signal is equal to or greater than a threshold, as the relay node. The threshold is set appropriately to a value that can ensure communication performance such that reliable communication can be achieved between the management node and the node 20, for example.

[0277] That is, the information processing unit of the management node determines the node 20 located farthest from the management node as the relay node among one or more nodes 20 that can reliably communicate with the management node. This reduces the possibility that the relay node will be too close to the management node, making it impossible to search for nodes 20 that have not joined the hierarchical mesh network in the second joining process by the relay node, which will be described later.

[0278] If the information processing unit of the management node has only one node 20 participating in the lower mesh network to which it belongs, the information processing unit of the management node does not execute the determination process. If the determination process is executed in this case, only the management node will belong to the lower mesh network, and an unnecessary lower mesh network will remain in the hierarchical mesh network.

[0279] 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 a network ID of a new lower mesh network that is different from the lower mesh network to which the management node belongs. The relay determination information also includes information necessary for the node 20 to function as a new management node. Note that the relay determination information may also include, as necessary, a security passcode used for communication within the new lower mesh network, information about the information terminal 30 (information about the device that manages the hierarchical mesh network), and the like.

[0280] The node 20 determined to be a relay node acquires the relay determination information, and functions as a relay node. Here, the node 20 leaves the lower mesh network to which the management node belongs, and joins the new lower mesh network as a relay node (new management node).

[0281] A specific example of the decision process by the management node will now be described with reference to Fig. 25. Fig. 25 is an explanatory diagram of the decision process by the management node in Example 4. In Fig. 25, a solid-line frame indicates that the node enclosed by the frame has been changed to a relay node (here, a new management node).

[0282] In the example shown in Fig. 25, the information processing unit of node 20B, which is the management node, executes the determination process. Note that the information processing units of nodes 20A and 20C, which are management nodes, also execute the determination process, but their explanations will be omitted here. By executing the determination process, the information processing unit of node 20B determines node 20D, which is a node that can reliably communicate with node 20B and is located farthest from node 20B, to be a relay node (here, a new management node), and transmits relay determination information to node 20D. As a result, node 20D, having obtained the relay determination information, thereafter functions as a relay node.

[0283] Next, the relay node executes the second entry process and the determination process in the same way as 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) of node 20, which is a relay node. When node 20 acquires relay determination information and begins to function as a relay node, the second entry process and the determination process are automatically executed by node 20 (relay node).

[0284] The second joining process executed by the relay node is a process of searching for a node 20 with which it can communicate and allowing the found node 20 to join the lower mesh network (first mesh network) to which it (here, the relay node) belongs. "Searching for a node" here means searching for a node 20 among the multiple nodes 20 that can receive a periodically transmitted beacon signal by the wireless communication unit 21 of the relay node.

[0285] The determination process executed by the relay node is a process of determining a relay node (i.e., a new relay node) based on the strength of the radio waves received by itself (here, the relay node) in the lower mesh network (to which the relay node belongs). The node 20 determined as 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.

[0286] Here, if the relay node cannot find node 20 in the second joining process, the relay node is returned to the lower mesh network (first mesh network) to which the management node belongs. In other words, if the relay node (new management node) cannot find 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. Therefore, if the relay node cannot find node 20, it returns to the original lower mesh network to which it previously belonged. This makes it possible to prevent an unnecessary lower mesh network from remaining in the hierarchical mesh network.

[0287] As shown in (c) of Figure 22, in the second joining process, the information processing unit of the relay node searches for a node 20 (S101). If there is a node 20 that can receive a beacon signal (Yes in S102), the information processing unit of the relay node allows the discovered node 20 to join the lower mesh network to which the relay node belongs (S103). Then, the relay node will officially function as a new management node from now on.

[0288] Here, the information processing unit of the relay node transmits entry information to the node 20 that is desired to join. The entry information includes the ID of the lower mesh network to which the relay node belongs, and address information (unicast address) of the node 20 used for communication within the hierarchical mesh network. Note that the entry information may also include, as necessary, a security passcode used for communication within the lower mesh network, information about the information terminal 30 (information about the device that manages the hierarchical mesh network), and the like.

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

[0290] Here, a specific example of the second entry process by a relay node will be described with reference to Fig. 26. Fig. 26 is an explanatory diagram of the second entry process by a 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, nodes that can communicate with node 20D enter the lower mesh network with node 20D as a relay node (new management node) (see the dashed frame in the upper right corner of Fig. 26).

[0291] 22(c), the information processing unit of the relay node determines a relay node (i.e., a new relay node) in a determination process (S104). In step S104, similar to the determination process by the management node, the information processing unit of the relay node determines the node 20 with the lowest radio wave strength among one or more nodes 20 whose radio wave strength (here, RSSI value) of the received beacon signal is equal to or greater than a threshold, as the new relay node. The threshold is set appropriately to a value that can ensure communication performance such that reliable communication can be achieved between the relay node and the node 20, for example.

[0292] That is, the information processing unit of the relay node determines the node 20 located farthest from the relay node among one or more nodes 20 that can reliably communicate with the relay node as the new relay node. This reduces the possibility that the new relay node will be too close to the relay node and will be unable to search for nodes 20 that have not joined the hierarchical mesh network in the second joining process by the new relay node.

[0293] If the information processing unit of the relay node has only one node 20 participating in the lower mesh network to which it belongs, the information processing unit of the relay node does not execute the determination process. If the determination process is executed in this case, only the relay node will belong to the lower mesh network, and an unnecessary lower mesh network will remain in the hierarchical mesh network.

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

[0295] Then, as shown in (c) of FIG. 22, the information processing unit of the relay node transmits relay determination information to the node 20 determined to be the new relay node (S105). The relay determination information includes a network ID of a new lower mesh network that is different from the lower mesh network to which the relay node belongs. The relay determination information also includes information necessary for the node 20 to function as a new management node. Note that the relay determination information may include, as necessary, a security passcode used for communication within the new lower mesh network, information about the information terminal 30 (information about the device that manages the hierarchical mesh network), and the like.

[0296] The node 20 determined to be the new relay node acquires the relay determination information, and functions as a new relay node. Here, the node 20 leaves the lower mesh network to which the management node belongs, and joins the new lower mesh network as a new relay node (new management node).

[0297] 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 previously belonged (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 state as a relay node, but it is preferable for it to return to being a normal node 20. This is because it is possible to prevent unnecessary relay nodes from remaining in the hierarchical mesh network.

[0298] Thereafter, the second entry process and the determination process are executed by the subsequent relay node until the information processing unit of the relay node becomes unable to search for the node 20 in the second entry process or until the information processing unit of the relay node becomes unable to execute the determination process. Then, when the information processing unit of the relay node becomes unable to search for the node 20 in the second entry process or until the information processing unit of the relay node becomes unable to execute the determination process, the above-mentioned series of processes for searching for the node 20 is completed.

[0299] The above-described series of processes for searching for nodes 20 are performed for each manager node determined by the information terminal 30. As shown in (a) of FIG. 22, the information processing unit 34 of the information terminal 30 waits until the search for nodes 20 is completed for all manager nodes determined by the information terminal 30 (No in S84). Then, when the search for nodes 20 is completed for all manager nodes determined by the information terminal 30 (Yes in S84), the information processing unit 34 of the information terminal 30 acquires registration information indicating the manager nodes that have joined the hierarchical mesh network (S85). The registration information includes, for each of all manager nodes that have joined the hierarchical mesh network, the network ID of the lower mesh network to which the manager node belongs and address information of all nodes (including the manager node) that belong to the lower mesh network. The registration information also includes information indicating the relationship between two or more manager nodes that can communicate with each other.

[0300] The information processing unit 34 of the information terminal 30 acquires the registration information by receiving the registration information transmitted from each manager node. The timing at which each manager node transmits the registration information is, for example, the point in time when each manager node can no longer search for the node 20. In other words, step S85 may be executed before the information terminal 30 has completed searching for the node 20 for all manager nodes determined by the information terminal 30.

[0301] As described above, in Example 4, the communication system 10 (information processing method) executes a first entry process by the information terminal 30, a second entry process and a determination process by the management node, and a second entry process and a determination process by the relay node.

[0302] Such a communication system 10 (information processing method) can automatically construct a hierarchical mesh network by a setter simply performing a predetermined operation on the information terminal 30, thereby reducing the time and effort required of a setter to construct a hierarchical mesh network. In other words, such a communication system 10 (information processing method) can support the setting work for constructing a hierarchical mesh network.

[0303] Furthermore, such a communication system 10 (information processing method) constructs a hierarchical mesh network while actually communicating between the nodes 20, and therefore it is easy to guarantee that communication is possible between all the nodes 20 belonging to the hierarchical mesh network.

[0304] [Modification of Example 4] FIG. 27 is an explanatory diagram of the operation (i.e., information processing method) of the communication system 10 in a modified example of the fourth embodiment. In FIG. 27, all nodes except for two nodes enclosed by a solid line frame already belong to the hierarchical mesh network. In other words, these two nodes do not belong to the hierarchical mesh network and therefore continue to periodically transmit beacon signals. Also, in FIG. 27, the beacon signals transmitted by these two nodes can be received by node 20α, which has already joined the hierarchical mesh network.

[0305] In such a case, the information processing unit of node 20α transmits information indicating that there is a node 20 that has not joined the hierarchical mesh network to the information terminal 30. When the information processing unit 34 of the information terminal 30 acquires the information, it determines that node 20α, which is the sender of the information, will be the new manager node. Then, the information processing unit 34 of the information terminal 30 transmits the determination information to node 20α.

[0306] 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, the information processing unit of the node 20α executes a second joining process to make the two nodes that have not joined the hierarchical mesh network join the new lower mesh network to which it belongs.

[0307] As described above, in the modification 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 node 20 that has joined the hierarchical mesh network is determined to be a new manager node, and the new manager node is made to execute the second joining process. This makes it possible to reduce the number of nodes 20 that fail to join the hierarchical mesh network.

[0308] In the fourth embodiment, the relay node functions as a new manager node at the time of executing the second entry process, but this is not limited thereto. For example, the relay node may function as a new manager node when it executes the second entry process and is able to search for the node 20. In other words, when the relay node is able to search for the node 20, the relay node may be determined as a new manager node belonging to a lower mesh network (first mesh network) different from the lower mesh network (first mesh network) to which the manager node belongs. Note that when the relay node executes the second entry process and is unable to search for the node 20, it may maintain the state of the relay node or return to being a normal node 20, but the latter is preferable. This is because it is possible to prevent unnecessary relay nodes from remaining in the hierarchical mesh network.

[0309] Furthermore, in Example 4, the communication system 10 (information processing method) is only required to execute at least the first entry processing by the information terminal 30 and the second entry processing by the management node, and does not have to execute the decision processing by the management node, the second entry processing by the relay node, and the decision processing by the relay node.

[0310] [Summary of Example 4 and its Modifications] As described 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 a management node belonging to each of the plurality of first mesh networks. The information processing method searches for a node 20 that can communicate with an information terminal 30, and executes a first joining process to allow the found node 20 to join one of the plurality of first mesh networks as a management node. The information processing method causes the management node to execute a second joining process to search for a node 20 that can communicate with the information terminal 30, and allow the found node 20 to join the first mesh network to which the node 20 belongs. The lower mesh network is an example of a first mesh network, and the upper mesh network is an example of a second mesh network.

[0311] In this information processing method, a hierarchical mesh network can be automatically constructed by a setter simply by performing a predetermined operation on the information terminal 30, thereby reducing the time and effort required for the setter to construct the hierarchical mesh network. In other words, this information processing method can support the setting work for constructing a hierarchical mesh network.

[0312] Furthermore, 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.

[0313] In such an information processing method, relay nodes are automatically determined, further reducing the time and effort required of the person configuring the hierarchical mesh network.

[0314] Also, for example, the information processing method causes a relay node to execute a second entry process.

[0315] In such an information processing method, the relay nodes automatically construct a hierarchical mesh network, further reducing the time and effort required for the person configuring the hierarchical mesh network.

[0316] Also, 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, if the relay node cannot search for the node 20 in the second joining process, the relay node is returned to the lower mesh network to which the management node belongs.

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

[0318] Also, for example, the information processing method may determine only one manager node for the first time in the first entry process.

[0319] In such an information processing method, it is possible to reduce the possibility that the manager node determined the first time will not be able to search for the node 20 in the second entry process.

[0320] Also, for example, if the relay node can find 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.

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

[0322] Furthermore, for example, in the information processing method, if the relay node cannot find the node 20 in the second entry process, the relay node may be restored as a node 20 (normal node 20) of the first mesh network to which the manager node belongs.

[0323] Such an information processing method can prevent unnecessary relay nodes from remaining in the hierarchical mesh network.

[0324] Furthermore, 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.

[0325] In such an information processing method, the relay nodes automatically construct a hierarchical mesh network, further reducing the time and effort required of the person configuring the hierarchical mesh network.

[0326] Also, for example, in the determination process, the node 20 with the weakest radio wave strength among the plurality of nodes 20 with radio wave strength equal to or greater than the threshold is determined as the relay node.

[0327] This information processing method reduces the possibility that the new relay node will be too close to the relay node, making it impossible for the new relay node to search for nodes 20 that have not joined the hierarchical mesh network during the second joining process.

[0328] Also, for example, 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 node 20 that has joined the hierarchical mesh network is determined to be a new management node, and the new management node is made to execute a second joining process.

[0329] Such an information processing method can reduce the number of nodes 20 that fail to join the hierarchical mesh network.

[0330] Also, for example, the information processing method acquires registration information indicating a management node that has joined the hierarchical mesh network.

[0331] In such an information processing method, the management node can be automatically registered, further reducing the time and effort required for the person configuring the hierarchical mesh network.

[0332] The communication system 10 also includes an information terminal 30 having 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 executes a first joining process in which the plurality of nodes 20 search for a node 20 with which they can communicate, and causes the found node 20 to join one of the plurality of lower mesh networks as a management node. The management node among the plurality of nodes 20 executes a second joining process in which the management node searches for a node 20 with which they can communicate, and causes the found node 20 to join the lower mesh network to which it belongs.

[0333] In such a communication system 10, a hierarchical mesh network can be automatically constructed by a configurator simply by performing a predetermined operation on the information terminal 30, thereby reducing the time and effort required for the configurator to construct the hierarchical mesh network. In other words, such a communication system 10 can support the configuration work for constructing a hierarchical mesh network.

[0334] Furthermore, for example, the plurality of nodes 20 includes lighting fixtures.

[0335] Such a communication system 10 can function as a control system for lighting fixtures.

[0336] Furthermore, when the node 20 is a node used in the above-described communication system 10 and is a management node, it executes the second entry process.

[0337] With such a node 20, a hierarchical mesh network can be automatically constructed by a setter simply by performing a predetermined operation on the information terminal 30, thereby reducing the time and effort required for the setter to construct the hierarchical mesh network. In other words, such a node 20 can support the setting work for constructing a hierarchical mesh network.

[0338] [Example 5] In Example 5, a method is described for determining the lower mesh network to which each of the plurality of nodes 20 belongs based on area information indicating a plurality of areas in which the plurality of nodes 20 are divided into two or more nodes 20 in a space in which the plurality of nodes 20 are installed.

[0339] First, an area will be described. An area is a unit divided by, for example, a setter or a space designer so as to include two or more nodes 20. An area may be a unit including, for example, two or more nodes 20 that are collectively controlled at the same timing, or may be a unit in which a space such as a conference room is physically divided by structures such as walls or doors. An area may also be a unit divided according to, for example, purpose.

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

[0341] An example of area information will now be described with reference to FIG. 28. FIG. 28 is a diagram illustrating an example of area information in the fifth embodiment. FIG. 28 visualizes the 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 the nodes 20. In the area information, the two-dimensional coordinates of each of the plurality of nodes 20 are associated with the area to which the node 20 belongs. In the example illustrated in FIG. 28, the space is divided into seven areas, area Ar1 to area Ar7. Note that in the example illustrated in FIG. 28, the plurality of areas Ar1 to area Ar7 are all rectangular, but the shape of each area is not limited to a rectangular shape and may be another shape, such as a circular shape.

[0342] A method for determining the lower mesh network to which each of the plurality of nodes 20 belongs based on such area information will be described below. Fig. 29 is a flowchart of the fifth embodiment.

[0343] 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 for determining whether or not the constraint conditions are satisfied for each area based on the acquired area information (S112). Here, the constraint conditions are conditions imposed so that two or more nodes 20 belonging to a 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 be allowed to belong to the same lower mesh network as they are. On the other hand, if the area does not satisfy the constraint conditions, the area must be divided so that the divided areas satisfy the constraint conditions.

[0344] Here, the area is divided to determine the area after division as a lower mesh network, but the area is only divided virtually in the process of determining the lower mesh network. Therefore, just because the area is divided does not mean that the area information itself is updated.

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

[0346] Examples of the longest distance L1 are listed below. Fig. 30 is a diagram showing an example of the longest distance L1 and an example of the division process in the fifth embodiment. 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 of the area Ar.

[0347] Figure 30(b) shows an example in which the area Ar is rectangular but tilted relative to the horizontal direction (X-axis direction) and vertical direction (Y-axis direction) in the plan view of the space in the area information. In the example shown in Figure 30(b), the longest distance L1 corresponds to the length of the diagonal of a rectangle Sq that circumscribes the area Ar in a two-dimensional Cartesian coordinate system (XY coordinate system). The rectangle Sq has two horizontal sides parallel to the X-axis direction and two vertical sides parallel to the Y-axis direction.

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

[0349] Furthermore, the longest distance L1 may be the distance between the two nodes 20 that are farthest from each other among 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. Hereinafter, the longest distance L1 is defined as the length of the diagonal of the area Ar or the length of the diagonal of a rectangle Sq that circumscribes the area Ar in a two-dimensional Cartesian coordinate system.

[0350] The communicable distance here is the upper limit of the distance over which any node 20 is considered to be able to reliably communicate with another node 20. Here, the communicable distance is the upper limit of the distance over which any node 20 is considered to be able to reliably communicate with another node 20 when there are no obstacles (for example, walls or furniture) that prevent communication between these nodes 20.

[0351] In reality, for example, an obstacle may exist between the two nodes 20, or the diffraction of radio waves (ease of propagation) may differ depending on the frequency of the radio waves used, so the distance over which communication between the two nodes 20 is considered to be reliably possible may be shorter than the above-mentioned communicable distance depending on the communication environment. Therefore, in the fifth embodiment, a reference distance calculated by multiplying the communicable distance by a coefficient is used in comparison with the longest distance L1 in the determination process, instead of the above-mentioned communicable distance.

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

[0353] The coefficient may be changed depending on how the above-described longest distance L1 is expressed. That is, the coefficient may be different when the longest distance L1 is expressed as the length of the diagonal of the area Ar or the rectangle Sq from when the longest distance L1 is expressed as the distance between the two nodes 20 that are farthest from each other.

[0354] 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 compares the calculated longest distance L1 with a reference distance for each area to determine whether the constraint condition is satisfied.

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

[0356] 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 divided area becomes shorter than the longest distance L1 in the area before division. Therefore, the divided area is more likely to satisfy the constraint conditions, and if the constraint conditions are satisfied, the divided area is determined to be a lower mesh network.

[0357] Examples of the division process are listed below. In the example shown in (a) of FIG. 30, the information processing unit 34 divides the long side of the area Ar that does not satisfy the constraint conditions into two equal parts in the division process (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 the examples shown in (b) and (c) of FIG. 30, the information processing unit 34 divides the area Ar into two equal parts in the division process (see the dashed-dotted line) by dividing the long side of a rectangle Sq that circumscribes the area Ar that does not satisfy the constraint conditions in a two-dimensional orthogonal coordinate system (XY coordinate system). In the example shown in (c) of FIG. 30, since the rectangle Sq is a square, the information processing unit 34 may divide the side along the X-axis direction into equal parts, or may divide the side along the Y-axis direction into equal parts.

[0358] FIG. 31 is a diagram illustrating another example of the division process in the fifth embodiment. FIG. 31 illustrates a case where the area Ar is rectangular and the longest distance L1 is longer than the longest distance L1 illustrated in FIG. 30. In this manner, 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 areas equal to or shorter than the reference distance. In such a case, the information processing unit 34 divides the long side of the area Ar that does not satisfy the constraint conditions or the long side of the rectangle Sq into three or more parts in the division process. In the example illustrated in FIG. 31, the information processing unit 34 divides the long side of the area Ar into three equal parts (see the dashed dotted lines). The number of divisions into which the area Ar that does not satisfy the constraint conditions is divided in the division process may be determined appropriately depending on the length of the longest distance L1.

[0359] Fig. 32 is a diagram showing yet another example of the division process in Example 5. Fig. 32 shows a case where the area Ar has a complex shape and, similar to Fig. 31, the longest distance L1 is longer than the longest distance L1 shown in Fig. 30. Fig. 32 shows an example in which the information processing unit 34 repeats the determination process and the division process until the divided area satisfies the constraint condition, while keeping the number of divisions of the area Ar in the division process constant (here, two divisions).

[0360] That is, in the division process, the information processing unit 34 first divides the area Ar that does not satisfy the constraints in a two-dimensional orthogonal coordinate system (XY coordinate system) by dividing the long side of the rectangle Sq that circumscribes the area Ar (see the vertical dashed dotted line) into two equal parts, as shown in (a) of Fig. 32. As a result, the area Ar is divided into two areas, area Ar01 and area Ar02, as shown in (b) of Fig. 32.

[0361] Here, the information processing unit 34 further executes a determination process for each of the two divided areas Ar01 and Ar02. That is, the information processing unit 34 calculates the longest distance L01 for area Ar01 and the longest distance L02 for area Ar02, and compares each of the longest distances L01 and L02 with a reference distance. The longest distance L01 for area Ar01 corresponds to the length of the diagonal of a rectangle Sq01 circumscribing area Ar01. The longest distance L02 for area Ar02 corresponds to the length of the diagonal of a rectangle Sq02 circumscribing area Ar02.

[0362] In the example shown in Figure 32, the longest distance L01 of area Ar01 exceeds the reference distance, while the longest distance L02 of area Ar02 is equal to or less than the reference distance. In this case, the information processing unit 34 determines area Ar02 as a lower mesh network, and performs further division processing on area Ar01. That is, in the second division processing, the information processing unit 34 divides area Ar01 so as to divide the long side of a rectangle Sq01 circumscribing area Ar01 into two equal parts (see the horizontal dashed line).

[0363] As described above, in the division process, the information processing unit 34 may divide the area so that the divided areas satisfy the constraint conditions by appropriately changing the number of divisions depending on the length of the longest distance L1. Furthermore, the information processing unit 34 may repeat the determination process and the division process until the divided areas satisfy the constraint conditions. In the flowchart shown in Fig. 29, the information processing unit 34 executes the latter algorithm.

[0364] Alternatively, in the division process, the information processing unit 34 may divide the target area or a rectangle circumscribing the target area into equal parts, but may divide the area so that the longest distance L1 of the divided areas is the reference distance. In this case, when the target area is divided into multiple areas, the longest distance L1 of at least one of the multiple areas is the reference distance or less. Note that if there is an area whose longest distance L1 exceeds the reference distance even after the division process is performed, the same division process can be performed again for that area.

[0365] In this way, when dividing the target area in the division process, the information processing unit 34 may divide the area not into equal parts, but so that the shapes of the two or more areas after division are uneven.

[0366] 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 explained using Fig. 33. Fig. 33 is a diagram showing an example of the correspondence between the area and the lower mesh network in the fifth embodiment. In Fig. 33, a dashed frame indicates that two or more nodes enclosed in the frame belong to the same lower mesh network.

[0367] In the example shown in Figure 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, areas Ar51 and Ar52, by division processing.Also, area Ar6 is divided into areas Ar61 and Ar62 by division processing.Also, area Ar7 is divided into areas Ar71 and Ar72 by division processing.These areas Ar51, Ar52, Ar61, Ar62, Ar71 and Ar72 are each determined to be lower mesh networks.

[0368] 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) can automatically determine whether the area is suitable for the first mesh network (lower mesh network) based on the area set by a setter or space designer, etc., eliminating the need for a determination by the setter or space designer, etc. In other words, such an information terminal 30 (information processing method) can support the setting work for constructing a hierarchical mesh network.

[0369] In addition, in the fifth embodiment, the information terminal 30 (information processing method) determines that an area to be a target of the determination process satisfies the constraint conditions, and executes a division process to divide the area if the constraint conditions are not satisfied. Such an information terminal 30 (information processing method) can automatically determine that multiple areas, including the divided area, are each a multiple number of lower mesh networks, so that no work is required by a setter or a space designer, etc.

[0370] [Modification of Example 5] In the fifth embodiment, the constraint condition includes that the longest distance L1 in the target area is equal to or less than a reference distance based on the communication distance between the nodes 20. However, the constraint condition is not limited to this. For example, the constraint condition may further include that the number of nodes 20 in the target area is equal to or less than a reference number. Here, the reference number is, for example, the maximum number of nodes 20 that can belong to a lower mesh network. In this case, the information processing unit 34 determines in the determination process that the constraint condition is satisfied only if the longest distance L1 in the target area is equal to or less than the reference distance and the number of nodes 20 is equal to or less than the reference number. On the other hand, in the determination process, even if the longest distance L1 in the target area is equal to or less than 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 and executes a division process to divide the area.

[0371] Furthermore, in the fifth embodiment, after determining a plurality of lower mesh networks, the information processing unit 34 may redetermine at least one lower mesh network using actual communication results between the plurality of nodes 20. Specifically, when the communication status of any of the plurality of first mesh networks (lower mesh networks) does not satisfy a predetermined condition, the information processing unit 34 may execute a division process to divide the area corresponding to at least the first mesh network whose communication status does not satisfy the predetermined condition so as to satisfy a constraint condition stricter than the above-mentioned constraint condition.

[0372] Here, the communication conditions in a lower mesh network not satisfying the predetermined conditions means, for example, that the communication conditions between the management node and management nodes belonging to other lower mesh networks are relatively poor due to interruptions, or that the lower mesh network has only one node 20. In such cases, the information processing unit 34 executes division processing again for at least the area corresponding to the lower mesh network whose communication conditions do not satisfy the predetermined conditions. At this time, the information processing unit 34 divides the area so as to satisfy stricter constraints than the above-mentioned constraints, for example, by reducing the coefficients.

[0373] The re-division process may be performed not only on the area corresponding to the lower mesh network whose communication status does not satisfy the predetermined condition, but also on all areas. The re-division process may be performed on the area corresponding to the lower mesh network whose communication status does not satisfy the predetermined condition, and on the areas surrounding the area.

[0374] In the fifth embodiment, the information processing unit 34 executes a division process to divide an area that does not satisfy the constraint conditions based on the execution result of the determination process, but this is not limited to this. For example, the information processing unit 34 may output the execution result of the determination process to the setter by displaying it on the display unit 32 without executing the division process. In this case, the setter can easily build an appropriate lower mesh network by checking the execution result of the determination process and correcting the area that does not satisfy the constraint conditions by dividing it, for example.

[0375] [Summary of Example 5 and its Modifications] As described above, the information terminal 30 includes an 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 a space in which a plurality of nodes 20 are installed is divided into two or more nodes 20. The information processing unit 34 executes a determination process to determine whether or not constraints are satisfied, including that the longest distance L1 in the area is less than or equal to a reference distance based on a communicable distance between the nodes 20. The lower mesh network is an example of a first mesh network, and the upper mesh network is an example of a second mesh network.

[0376] Such an information terminal 30 can automatically determine whether an area set by a configurator or space designer, etc., is suitable for a lower-level mesh network, eliminating the need for such a determination by the configurator or space designer, etc. In other words, such an information terminal 30 can support the configuration work required to build a hierarchical mesh network. Another advantage of such an information terminal 30 is that it can handle the area set by, for example, a configurator or space designer, etc., i.e., the operational control unit, and the mesh network on the same level, thereby enabling communication using the minimum number of packets during operation.

[0377] Furthermore, for example, in the determination process, if the area satisfies the constraint conditions, the information processing unit 34 determines that the area will be one of a plurality of lower mesh networks, and if the area does not satisfy the constraint conditions, executes a division process to divide the area. Furthermore, the information processing unit 34 determines that the divided area that satisfies the constraint conditions will be one of a plurality of lower mesh networks.

[0378] Such an information terminal 30 can automatically determine a plurality of areas including the divided area into a plurality of lower mesh networks, so that no work by a setter or space designer is required.

[0379] Furthermore, for example, in the division process, the information processing unit 34 divides the area that does not satisfy the constraint conditions into equal parts in the longitudinal direction.

[0380] By dividing the area equally, such information terminals 30 make it difficult to construct a lower mesh network with a complex configuration.

[0381] Furthermore, 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 divided into equal parts.

[0382] Such an information terminal 30 divides the rectangle circumscribing the area into equal parts, making it difficult to construct a lower mesh network with a complex configuration.

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

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

[0385] Furthermore, for example, the constraint conditions further include that the number of nodes 20 in the area is two or more and is equal to or less than a reference number.

[0386] Such an information terminal 30 can more accurately determine whether or not an area is suitable for a lower mesh network by taking into consideration the number of nodes 20 that can belong to the lower mesh network.

[0387] Also, for example, when the communication conditions in any of the multiple lower mesh networks do not satisfy a predetermined condition, the information processing unit 34 executes a division process to divide the area corresponding to at least the lower mesh network whose communication conditions do not satisfy the predetermined condition so as to satisfy a constraint condition stricter than the constraint condition.

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

[0389] The communication system 10 includes the information terminal 30 and a plurality of nodes 20.

[0390] Such a communication system 10 can automatically determine whether an area is suitable for a lower-level mesh network based on the area set by a setter or space designer, etc., eliminating the need for such determination by the setter or space designer, etc. In other words, such a communication system 10 can assist in the setting work for constructing a hierarchical mesh network.

[0391] Furthermore, for example, the plurality of nodes 20 includes lighting fixtures.

[0392] Such a communication system 10 can function as a control system for lighting fixtures.

[0393] The information processing method is a computer-executed information processing method 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 method acquires area information regarding a plurality of areas in a space in which a plurality of nodes 20 are installed, each of the plurality of nodes 20 being divided into two or more nodes 20. The information processing method executes a determination process to determine whether a constraint condition is satisfied, including that the longest distance L1 in the area is equal to or less than a reference distance based on a communication distance between the nodes 20.

[0394] This information processing method can automatically determine whether an area is suitable for a lower-level mesh network based on the area set by a setter or space designer, etc., eliminating the need for a determination by the setter or space designer, etc. In other words, this information processing method can support the setting work for building a hierarchical mesh network.

[0395] The program also causes one or more processors to execute the above information processing method.

[0396] Such a program can automatically determine whether an area is suitable for a lower-level mesh network based on the area set by a setter or space designer, etc., eliminating the need for the setter or space designer, etc. In other words, such a program can support the setting work for building a hierarchical mesh network.

[0397] [Example 6] In the sixth embodiment, a method for determining a management node for each of a plurality of lower mesh networks will be described. Note that in the sixth embodiment, the description will be given assuming that all nodes 20 belong to one of a plurality of lower mesh networks. In addition, in the sixth embodiment, "communicable" means that nodes 20 can communicate directly with each other without going through other nodes 20.

[0398] Fig. 34 is a flowchart showing the operation (i.e., the information processing method) of the communication system 10 in Example 6. (a) of Fig. 34 is a flowchart showing the operation of the information terminal 30. (b) of Fig. 34 is a flowchart showing the operation of the first management node or the second management node, which will be described later.

[0399] 34(a), first, when the operation receiving unit 31 of the information terminal 30 receives a predetermined operation by the setting person, the information processing unit 34 of the information terminal 30 determines (S121) a first management node that is a management node of one of a plurality of lower mesh networks (first mesh networks) among the plurality of nodes 20. The first management node is a node that is the starting point of the subsequent processing, and is also called a "start node."

[0400] Specifically, the setting person 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 this operation as the first management node.

[0401] It is preferable to determine the node 20 belonging to the lower mesh network located at the farthest edge of the space among the plurality of lower mesh networks as the first management node. Also, it is preferable to determine the node 20 closest to the center of the plurality of nodes 20 belonging to the lower mesh network as the first management node. Alternatively, the lower mesh network closest to the center of the space among the plurality of lower mesh networks and the node 20 closest to the center of the plurality of nodes 20 belonging to the lower mesh network may be determined as the first management node. When the first management node is determined as described above, it is expected that the time required for the process of determining management nodes for all lower mesh networks can be shortened.

[0402] Next, the information processing unit 34 of the information terminal 30 transmits starting point determination information to the node 20 determined to be 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 instructions for causing the node 20 to execute a search process and a determination process, which will be described later, as the first management node.

[0403] When the node 20 determined to be the first management node acquires the starting point determination information, the node 20 thereafter functions as the management node of the lower mesh network to which the node 20 belongs and as the first management node.

[0404] Next, the first management node executes a search process and a determination process. The search process and the determination process are executed by an information processing unit (not shown) included in the node 20, which is the management node (first management node). The information processing unit 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. 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 begins to function as the first management node.

[0405] The search process is a process of searching for one or more nodes 20 that belong to a lower mesh network other than the lower mesh network (first mesh network) to which the node itself (here, the first management node) belongs and that are communicable with. Here, "searching for a node" means searching for a node 20 that will return 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 performing the search process belongs are known, the request signal may be transmitted by multicast specifying the network IDs of the one or more adjacent lower mesh networks. Furthermore, if candidate management nodes are predetermined, the request signal may be transmitted by unicast specifying the address information of the candidate. The response signal includes a command to request the radio wave strength (e.g., RSSI value) of the received signal when the request signal is received.

[0406] If the radio wave strength of the received request signal is equal to or greater than a certain value, the node 20 belonging to another lower mesh network returns a response signal including information indicating the radio wave strength to the management node (here, the first management node) that executes the search process. Also, the node 20 that received the request signal may return a response signal to the management node that executes the search process regardless of the radio wave strength of the received request signal.

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

[0408] 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 that have been searched for in the search process. In the sixth embodiment, the communication state is represented by the strength (here, RSSI value) of the radio wave 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.

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

[0410] 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 the other lower mesh network. Also, in the determination process, the information processing unit of the management node may determine, as the management node, the node 20 that is closest to the center of the other lower mesh network among the nodes 20 that have an RSSI value equal to or greater than the reference RSSI value.

[0411] As shown in Figure 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 other lower mesh networks from the one or more nodes 20 found based on the communication state (S132).

[0412] 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. The management node determination information also includes a command to cause the node 20 to execute search processing and determination processing as the second management node.

[0413] When the node 20 determined to be the second management node obtains the management node determination information, the node 20 will thereafter function as the management node of the other lower mesh network to which the node 20 belongs and as the second management node.

[0414] After that, the information processing unit of the second management node determined by the determination process executes the search process and the determination process in the same way as 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 lower mesh networks.

[0415] Here, the information processing unit of the management node may search for multiple other lower mesh networks in the search process. In this case, the information processing unit of the management node determines a second management node for each other lower mesh network in the determination process. When multiple second management nodes are determined in this way, the multiple second management nodes each perform the 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 search process is performed in order from the second management node with the smallest number of hops from the first management node.

[0416] When multiple second management nodes are determined, the search process may be executed in order of, for example, the second management node from which the radio wave strength of the received request signal is greatest.Furthermore, when multiple second management nodes are determined, the search process may be executed in order of, for example, the second management node from which the response signal was received earliest.

[0417] 34(a), the information processing unit 34 of the information terminal 30 waits until the manager node is determined for all lower mesh networks (No in S123). The information processing unit 34 of the information terminal 30 may display the progress status, etc. on the display unit 32 until the manager node is determined. This allows the setting person to move around and work while checking the progress status, etc. until the manager node is determined.

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

[0419] The information processing unit 34 of the information terminal 30 acquires the registration information by receiving the registration information transmitted from each manager node. The timing when each manager node transmits the registration information is, for example, when each manager node starts operating as a manager node. In other words, step S124 may be executed before manager nodes are determined for all lower mesh networks.

[0420] Here, a specific example of the process of determining a management node for each of a plurality of lower mesh networks will be described with reference to Figs. 35 to 38. Fig. 35 is a diagram showing a first process of the search process and the determination process in the sixth embodiment. Fig. 36 is a diagram showing a second process of the search process and the determination process in the sixth embodiment. Fig. 37 is a diagram showing a third process of the search process and the determination process in the sixth embodiment. Fig. 38 is a diagram showing a fourth process of the search process and the determination process in the sixth embodiment.

[0421] 35 to 38 correspond to plan views of a space in which a plurality of nodes 20 are arranged. In FIGS. 35 to 38, open circles indicate the positions of the nodes 20, and filled circles indicate the positions of the management nodes. In addition, 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 example shown in FIGS. 35 to 38, each node 20 belongs to one of eight lower mesh networks Nw1 to Nw8.

[0422] In the first process shown in FIG. 35, the information terminal 30 determines that the node N21 of the lower mesh network Nw1 is the first management node. The node N21 executes a search process and a determination process. In FIG. 35, the solid circle surrounding the node N21 indicates that the node N21 is the first management node. The solid curve in FIG. 35 indicates the boundary between the communicable range and the incommunicable range of the node N21. Therefore, in the first process shown in FIG. 35, the search process of the node N21 searches for one or more nodes 20 located closer to the node N21 than the solid curve in the lower mesh network Nw2, and one or more nodes 20 located closer to the node N21 than the solid curve in the lower mesh network Nw3.

[0423] In the first process shown in Figure 35, the node N21 determines 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 found by the search process.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 found by the search process.

[0424] 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 first executes the search process. Also, the solid curve in FIG. 36 indicates the boundary between the communicable range and incommunicable range of node N22. Also, in FIG. 36, the dotted circle surrounding node N23 indicates that node N23 is the second management node that next executes the search process. Also, the dotted curve in FIG. 36 indicates the boundary between the communicable range and incommunicable range of node N23.

[0425] In the second process shown in Figure 36, in each of the lower mesh networks Nw4, Nw5, and Nw6 for which the management node has not been determined, one or more nodes 20 located on the node N22 side of the solid curve are searched for by the search process of the node N22. Then, in the second process shown in Figure 36, the node N22 determines, through the determination process, the node N24 from among the one or more nodes 20 belonging to the lower mesh network Nw4 found in the search process as the second management node of the lower mesh network Nw4. Also, through the determination process, the node N22 determines, through the determination process, the node N25 from among the one or more nodes 20 belonging to the lower mesh network Nw5 found in the search process as the second management node of the lower mesh network Nw5. Also, through the determination process, the node N22 determines, through the determination process, the node N26 from among the one or more nodes 20 belonging to the lower mesh network Nw6 found in the search process as the second management node of the lower mesh network Nw6.

[0426] Next, node N23 executes search process. However, in the second process shown in Figure 36, node N23 cannot search for one or more nodes 20 belonging to the lower mesh network whose management node has not been determined. Therefore, node N23 does not execute the determination process.

[0427] In the third process shown in FIG. 37, of the three second management nodes (node ​​N24, node N25, and node N26), node N25 first executes the search process, followed by node N26 and node N24 in that order. In FIG. 37, the solid circle surrounding node N25 indicates that node N25 is the second management node that executes the search process first. The solid curve in FIG. 37 indicates the boundary between the communicable range and incommunicable range of node N25. In FIG. 37, the dotted circle surrounding node N26 indicates that node N26 is the second management node that executes the search process next. The dotted curve in FIG. 37 indicates the boundary between the communicable range and incommunicable range of node N26. In FIG. 37, the dashed circle surrounding node N24 indicates that node N24 is the second management node that executes the search process last. The dashed-dotted curve in FIG. 37 represents the boundary between the communicable range and non-communicable range of node N24.

[0428] In the third process shown in Figure 37, in the lower mesh network Nw7 where the management node has not been determined, one or more nodes 20 located on the node N25 side of the solid curve are searched for by the search process of the node N25. Then, in the third process shown in Figure 37, the node N25 determines the node N27 as the second management node of the lower mesh network Nw7 among the one or more nodes 20 belonging to the lower mesh network Nw7 found by the search process.

[0429] Next, node N26 and node N24 perform the search process in this order. However, in the second process shown in Figure 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 will perform the determination process.

[0430] In the fourth step shown in Fig. 38, node N27, which is the second management node, is executing the search process. In Fig. 38, the solid circle surrounding node N27 indicates that node N27 is the second management node executing the search process. Also, the solid curve in Fig. 38 indicates the boundary between the communication range and the communication incommunication range of node N27.

[0431] In the fourth step shown in Figure 38, in the lower mesh network Nw8 where the management node has not been determined, one or more nodes 20 located on the node N27 side of the solid curve are searched for by the search process of the node N27. Then, in the fourth step shown in Figure 38, the node N27 determines the node N28 as the second management node of the lower mesh network Nw8 among the one or more nodes 20 belonging to the lower mesh network Nw8 found in the search process by the determination process. Through the above series of processes, the management nodes (nodes N21 to N28) are determined for all lower mesh networks Nw1 to Nw8.

[0432] As described above, in the sixth embodiment, the communication system 10 (information processing method) executes the search process and determination process by the first manager node, and the search process and determination process by the second manager node.

[0433] In this communication system 10 (information processing method), the configurator can automatically determine the manager node of each lower mesh network simply by performing a predetermined operation on the information terminal 30, thereby reducing the effort required of the configurator to determine the manager node of each lower mesh network. In other words, this communication system 10 (information processing method) can support the configuration work for building a hierarchical mesh network.

[0434] Furthermore, such a communication system 10 (information processing method) determines the manager node of each lower mesh network while actually communicating between the nodes 20, and therefore it is easy to guarantee that communication is possible between the manager nodes.

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

[0436] Specifically, in the determination process, among one or more nodes 20, a node 20 for which the difference between the radio wave strength (RSSI value) and the radio wave strength (RSSI value) estimated from the distance between the nodes is equal to or greater than a predetermined value may not be determined as the second management node. Here, the RSSI value estimated from the distance between the nodes is not the RSSI value of the signal actually received by the node 20, but corresponds to an ideal RSSI value estimated from the distance between the management node and node 20 when there are no obstacles or the like. Therefore, if the difference is equal to or greater than a predetermined value, it is considered that the communication state is not very good due to the presence of an obstacle or the like between the management node and node 20, and therefore it is possible to exclude such a node 20 with an inadequate communication state from candidates for the second management node.

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

[0438] In addition, in the sixth embodiment, the second management node may function provisionally as the second management node when it is determined, and then be officially determined as the second management node when it satisfies certain conditions. Hereinafter, a first example and a second example of a method for determining such a second management node will be described.

[0439] In the first example, after the second management node is determined, if a node 20 with better communication conditions than the second management node is found in the lower mesh network (first mesh network) to which the second management node belongs, the node 20 is updated to the management node of the lower mesh network.

[0440] A specific example will be described below with reference to 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 for in the search process. In FIG. 36, it is assumed that the node N22 determines the node N24 as the second management node of the lower mesh network Nw4 in the determination process, and then the node N23 executes the search process and the determination process. Here, it is assumed that the node N23 determines a node 20 other than the node N24 as the second management node of the lower mesh network Nw4 in the determination process. In this case, if the communication state of the node 20 is better than the communication state 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. In this case, in any lower mesh network, the node 20 having an appropriate communication state with the management node of another lower mesh network can be determined as the management node of the lower mesh network.

[0441] In the second example, when multiple manager nodes corresponding to each of multiple lower mesh networks (first mesh networks) are determined (i.e., manager nodes for all lower mesh networks are determined), the determination results of the multiple manager nodes including the communication status are output. The determination results are output to the display unit 32 of the information terminal 30, and are presented to the user.

[0442] A specific example will be described below with reference to Fig. 39. Fig. 39 is a diagram showing an example of an output screen in a modified example of the sixth embodiment. The output screen of Fig. 39 displays a plan view of a space in which a plurality of nodes 20 are arranged. Open circles indicate the positions of the nodes 20, and filled circles indicate the positions of the management nodes. Also, on the output screen of Fig. 39, rectangular frames indicate that two or more nodes 20 enclosed by the frames belong to the same lower mesh network.

[0443] Furthermore, in the output screen of Fig. 39, two-way arrows indicate the communication state between the management nodes. In the example shown in Fig. 39, a solid arrow indicates that the communication state between the management nodes is good (the RSSI value is relatively large), and a dashed arrow indicates that the communication state between the management nodes is poor (the RSSI value is relatively small). Note that the communication state may be indicated by the line type of the arrow, or may be indicated by the shading of the arrow. The communication state may also be indicated by a numerical value.

[0444] 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 configurator determines that there is a problem with the communication state between some of the management nodes, he or she performs an operation to update another node 20 to the management node. In this way, in the second example, the configurator can optimize the communication state between each management node by appropriately changing the management node while checking the determination results.

[0445] The determination result is not limited to being displayed in a plan view as shown in FIG. 39, and may be displayed on the display unit 32 of the information terminal 30 as, for example, a matrix table showing the RSSI values ​​between each of the management nodes.

[0446] In addition, in the sixth embodiment, the first management node and the second management node both execute the search process and the determination process autonomously, but this is not limited to this. For example, the first management node and the second management node may both execute the search process and the determination process in accordance with a command from the information terminal 30.

[0447] [Summary of Example 6 and its Modifications] As described 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, which is a management node of one of the plurality of first mesh networks among a 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 with the first mesh network. The determination process is a process of determining a second management node, which is a management node of the other first mesh network, from the one or more searched nodes 20 based on their communication status. The information processing method causes the second management node to execute the search process and the determination process. The lower mesh network is an example of a first mesh network, and the upper mesh network is an example of a second mesh network.

[0448] In this information processing method, the administrator can automatically determine the manager node of each lower mesh network simply by performing a predetermined operation on the information terminal 30, thereby reducing the time and effort required of the administrator to determine the manager node of each lower mesh network. In other words, this information processing method can support the configuration work required to build a hierarchical mesh network.

[0449] Furthermore, 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.

[0450] In this information processing method, the node 20 having an appropriate communication state with the manager node that executes the search process can be determined as the second manager node of another lower mesh network.

[0451] Also, for example, in the determination process, among one or more nodes 20, a node for which the difference between the radio wave strength and the radio wave strength estimated from the distance between the nodes 20 is greater than or equal to a predetermined value is not determined as the second management node.

[0452] In such an information processing method, a node 20 whose communication status with the management node performing the search process is inappropriate, for example due to the presence of an obstacle, can be excluded from candidates for the second management node of other lower mesh networks.

[0453] Furthermore, for example, the communication state is the distance between each of the one or more nodes 20. In the determination process, the node 20, of the one or more nodes 20, whose distance is closest to a reference distance based on the communicable distance between the nodes 20, is determined to be the second management node.

[0454] In this information processing method, the node 20 having an appropriate communication state with the manager node that executes the search process can be determined as the second manager node of another lower mesh network.

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

[0456] Such an information processing method makes it easy to efficiently perform the process of determining the management node for all lower-level mesh networks.

[0457] Also, for example, after the second management node is determined, if a node 20 with better communication conditions than the second management node is found in the lower mesh network to which the second management node belongs, the node 20 is updated to the management node of the lower mesh network.

[0458] In this information processing method, in any lower mesh network, the node 20 having an appropriate communication state with the manager node of another lower mesh network can be determined as the manager node of that lower mesh network.

[0459] Furthermore, for example, when multiple management nodes corresponding to multiple lower mesh networks are determined, the determination results of the multiple management nodes including the communication status are output. Here, outputting the determination results means both presenting (displaying) the determination results and outputting the determination results as data.

[0460] In such an information processing method, for example, a setting person can optimize the communication state between the management nodes by appropriately changing the management node while checking the determination result.

[0461] The program also causes one or more processors to execute the above information processing method.

[0462] Such a program allows the configurator to automatically determine the manager node of each lower mesh network simply by performing a predetermined operation on the information terminal 30, thereby reducing the time and effort required of the configurator to determine the manager node of each lower mesh network. In other words, such a program can support the configuration work required to build a hierarchical mesh network.

[0463] The communication system 10 also includes an information terminal 30 having 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 for 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 a lower mesh network different from the lower mesh network and are communicable with the first management node. The determination process is a process of determining a second management node that is a management node for the other lower mesh network from the one or more searched nodes 20 based on the communication state. The second management node among the plurality of nodes 20 executes the search process and the determination process.

[0464] In this communication system 10, the operator can automatically determine the manager node of each lower mesh network simply by performing a predetermined operation on the information terminal 30, thereby reducing the time and effort required for the operator to determine the manager node of each lower mesh network. In other words, this communication system 10 can support the configuration work required to build a hierarchical mesh network.

[0465] Furthermore, for example, the plurality of nodes 20 includes lighting fixtures.

[0466] Such a communication system 10 can function as a control system for lighting fixtures.

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

[0468] In such a node 20, the person setting up the network can automatically determine the manager node of each lower mesh network by simply performing a predetermined operation on the information terminal 30, thereby reducing the time and effort required for the person setting up the network to determine the manager node of each lower mesh network. In other words, such a node 20 can support the setting work for building a hierarchical mesh network.

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

[0470] The above-described embodiments, examples 1 to 6, should be recognized as interrelated examples, not as independent examples, and the present invention includes inventions that can be realized by any combination of the contents described in examples 1 to 6. For example, the process related to the display of the lower mesh network and the management node described in example 1 (such as the process of highlighting the management node on the display screen) may be combined with examples 2 to 6.

[0471] The present invention may also be realized as an information terminal that executes only a part of the method for determining a lower mesh network and the method for determining a management node described in the above embodiment. In this case, the method for determining a lower mesh network and the method for determining a management node described in the above embodiment may be combined in any way.

[0472] The present invention may also be realized as an information terminal that executes all of the methods for determining a lower mesh network and determining a management node described in the above embodiments. In this case, the method for determining a lower mesh network and the method for determining a management node to be adopted are determined, for example, by the operation of a configurator.

[0473] Alternatively, a priority may be assigned to each of the methods for determining a lower mesh network, and the information terminal may execute the methods for determining a lower mesh network in sequence according to the priority until the determined lower mesh network satisfies a predetermined requirement. Similarly, a priority may be assigned to each of the methods for determining a management node, and the information terminal may execute the methods for determining a management node in sequence according to the priority until the determined management node satisfies a predetermined requirement. In this case, the priority may be determined by, for example, the operation of a configurator, or may be determined in advance by a designer.

[0474] In addition, in the above embodiment, a communication system was described that is based on the premise that one lower mesh network includes only one management node, but one lower mesh network may include multiple management nodes.

[0475] In the above embodiment, a node that has not yet joined the mesh network periodically transmits a beacon signal. However, the communication system may be configured such that only a node that receives a wireless communication signal from an information terminal transmits a signal equivalent to a beacon signal. In other words, the communication system is not limited to a system in which nodes automatically transmit beacon signals.

[0476] Furthermore, in the above embodiment, one information terminal is used to construct a hierarchical mesh network, but a plurality of information terminals may also be used in combination.

[0477] The communication method between the devices described in the above embodiment is merely an example, and is not particularly limited to this.

[0478] In the above embodiments, the processing performed by a specific processing unit may be performed by another processing unit. The order of multiple processes may be changed, or multiple processes may be performed in parallel. 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.

[0479] In the above-described embodiments, each component may be realized by executing a software program suitable for that component, or by a program execution unit such as a CPU or processor reading and executing a software program recorded on a recording medium such as a hard disk or semiconductor memory.

[0480] Furthermore, each component may be realized by hardware. For example, each component may be a circuit (or integrated circuit). These circuits may form a single circuit as a whole, or each may be a separate circuit. Furthermore, 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).

[0481] Furthermore, the general or specific aspects of the present invention may be realized as a system, an apparatus, a method, an integrated circuit, a computer program, or a computer-readable recording medium such as a CD-ROM, or as any combination of a system, an apparatus, a method, an integrated circuit, a computer program, and a recording medium.

[0482] For example, the present invention may be realized as the communication system or information terminal of the above-described embodiments, or 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 as a non-transitory recording medium on which such a program is recorded. Such a program includes an application program for causing a computer such as a general-purpose information terminal to function as the information terminal of the above-described embodiments.

[0483] In addition, the present invention also includes forms obtained by applying various modifications to each embodiment that a person skilled in the art would think of, or forms realized by arbitrarily combining the components and functions of each embodiment within the scope of the present invention. [Explanation of symbols]

[0484] 10. Communication Systems 20 nodes 21 Radio Communication Department 30 Information terminal 31 Operation reception section 32 Display section 33 Radio Communication Department 34 Information Processing Department 35 Storage section

Claims

1. an information processing unit 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 a management node belonging to each of the plurality of first mesh networks; The information processing unit Acquire location information indicating the location of a plurality of nodes each belonging to any one of the plurality of first mesh networks; determining a plurality of the management nodes from among the plurality of nodes based on the acquired placement information; After determining the plurality of management nodes, setting information for allowing each of the plurality of nodes to join the hierarchical mesh network is transmitted to each of the plurality of nodes. Information terminal.

2. The information processing unit Further, acquiring belonging information indicating to which of the plurality of first mesh networks the plurality of nodes belongs; determining a plurality of management nodes based on the acquired placement information and the acquired affiliation information; The information terminal according to claim 1.

3. An information processing unit that performs 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 a management node belonging to each of the plurality of first mesh networks; The information processing unit Acquire location information indicating the location of a plurality of nodes each belonging to any one of the plurality of first mesh networks; Acquire affiliation information indicating to which of the plurality of first mesh networks the plurality of nodes belong; Calculating a first center of gravity position of nodes belonging to the same first mesh network among the plurality of nodes based on the acquired placement information and the acquired belonging information; Calculating a second center position of the plurality of nodes based on the acquired arrangement information; Among the nodes belonging to the same first mesh network, the node located closest to a point dividing the line segment connecting the first centroid position and the double center position into 1:n (n is a positive number) is determined as the management node belonging to the first mesh network. Information terminal.

4. The information processing unit determines the management node by changing the value of n for each of the first mesh networks.

4. The information terminal according to claim 3.

5. The information processing unit determines, among the nodes belonging to the same first mesh network, the node located closest to a point dividing the line segment 1:1 as the management node belonging to the first mesh network.

5. The information terminal according to claim 3 or 4.

6. The information processing unit Calculating a first center of gravity position of nodes belonging to the same first mesh network among the plurality of nodes based on the acquired placement information and the acquired belonging information; Among the nodes belonging to the same first mesh network, the node located closest to the first center of gravity is determined as the management node belonging to the first mesh network.

3. The information terminal according to claim 2.

7. An information processing unit that performs 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 a management node belonging to each of the plurality of first mesh networks; The information processing unit Acquire location information indicating the location of a plurality of nodes each belonging to any one of the plurality of first mesh networks; Acquire affiliation information indicating to which of the plurality of first mesh networks the plurality of nodes belong; Calculating a first center of gravity position of nodes belonging to the same first mesh network among the plurality of nodes based on the acquired placement information and the acquired belonging information; Calculating a second center position of the plurality of nodes based on the acquired arrangement information; Identifying the locations of the first mesh networks based on the acquired location information and the acquired belonging information; In a first mesh network that is not located at an end in the arrangement of the plurality of first mesh networks, among the nodes belonging to the first mesh network, a node that is located closest to the first center of gravity position of the nodes belonging to the first mesh network is determined 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 center of gravity among the nodes belonging to the first mesh network is determined as the management node belonging to the first mesh network. Information terminal.

8. The system further includes 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. An information terminal according to any one of claims 1 to 7.

9. An information terminal according to any one of claims 1 to 8; the plurality of nodes. Communication system.

10. The plurality of nodes includes a lighting fixture.

10. The communication system of claim 9.

11. 1. An information processing method for constructing a hierarchical mesh network, executed by a computer, 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: Acquire location information indicating the location of a plurality of nodes each belonging to any one of the plurality of first mesh networks; determining a plurality of the management nodes from among the plurality of nodes based on the acquired placement information; After determining the plurality of management nodes, setting information for allowing each of the plurality of nodes to join the hierarchical mesh network is transmitted to each of the plurality of nodes. Information processing methods.

12. 1. An information processing method for constructing a hierarchical mesh network, executed by a computer, 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: Acquire location information indicating the location of a plurality of nodes each belonging to any one of the plurality of first mesh networks; Acquire affiliation information indicating to which of the plurality of first mesh networks the plurality of nodes belong; Calculating a first center of gravity position of nodes belonging to the same first mesh network among the plurality of nodes based on the acquired placement information and the acquired belonging information; Calculating a second center position of the plurality of nodes based on the acquired arrangement information; Among the nodes belonging to the same first mesh network, the node located closest to a point dividing the line segment connecting the first centroid position and the double center position into 1:n (n is a positive number) is determined as the management node belonging to the first mesh network. Information processing methods.

13. 1. An information processing method for constructing a hierarchical mesh network, executed by a computer, 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: Acquire location information indicating the location of a plurality of nodes each belonging to any one of the plurality of first mesh networks; Acquire affiliation information indicating to which of the plurality of first mesh networks the plurality of nodes belong; Calculating a first center of gravity position of nodes belonging to the same first mesh network among the plurality of nodes based on the acquired placement information and the acquired belonging information; Calculating a second center position of the plurality of nodes based on the acquired arrangement information; Identifying the locations of the first mesh networks based on the acquired location information and the acquired belonging information; In a first mesh network that is not located at an end in the arrangement of the plurality of first mesh networks, among the nodes belonging to the first mesh network, a node that is located closest to the first center of gravity position of the nodes belonging to the first mesh network is determined 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 center of gravity among the nodes belonging to the first mesh network is determined as the management node belonging to the first mesh network. Information processing methods.

14. A program for causing the computer to execute the information processing method described in any one of claims 11 to 13.

Images