Information terminals, communication systems, information processing methods, and programs

Abstract

To provide an information terminal that can support initial 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, determines to which of the plurality of lower mesh networks each of the plurality of nodes 20 is made to belong on the basis of the acquired arrangement information, 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 , and program . [[Background Art]]

[0002] Patent Document 1 discloses a lighting control apparatus that communicates with lighting equipment via a network. [[Prior Art Documents]] [[Patent Documents]]

[0003] [[Patent Document 1]] Japanese Unexamined Patent Application Publication No. 2017-59492 [[Summary of the Invention]] [[Problem to be Solved by the Invention]]

[0004] The present invention provides an information terminal and the like that can support 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 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 respectively belonging to each of the plurality of first mesh networks, the information processing unit acquires arrangement information indicating an arrangement of a plurality of nodes, determines which of the plurality of first mesh networks each of the plurality of nodes belongs to based on the acquired arrangement information, and determines the plurality of management nodes from among the plurality of nodes based on the acquired arrangement 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 for constructing a hierarchical mesh network, which is executed by a computer, wherein the hierarchical mesh network includes a plurality of first mesh networks and a second mesh network composed of management nodes belonging to each of the plurality of first mesh networks, the information processing method acquires arrangement information indicating the arrangement of the plurality of nodes, determines which of the plurality of first mesh networks each of the plurality of nodes belongs to based on the acquired arrangement information, and determines a plurality of management nodes from among the plurality of nodes based on the acquired arrangement information. [Effects of the Invention]

[0008] The information terminal and the like of the present invention can assist in the configuration work for constructing a hierarchical mesh network. [Brief explanation of the drawing]

[0009] [Figure 1] Figure 1 is a block diagram showing the functional configuration of a communication system according to an embodiment. [Figure 2] Figure 2 is a conceptual diagram illustrating a hierarchical mesh network. [Figure 3] Figure 3 shows an example of placement information. [Figure 4] Figure 4 is a flowchart showing an example of the initial setup procedure. [Figure 5] Figure 5 is a flowchart of Example 1. [Figure 6] Figure 6 shows an example of the settings screen in Example 1. [Figure 7A] Figure 7A is the first figure showing a template in a modified example of Example 1. [Figure 7B] Figure 7B is the second figure showing a template in a modified example of Example 1. [Figure 7C]FIG. 7C is a diagram illustrating an example of reduction (enlargement) of a template in a modification of Embodiment 1. [Figure 7D] FIG. 7D is a first diagram illustrating another example of a display range of a template in Embodiment 1. [Figure 7E] FIG. 7E is a second diagram illustrating another example of a display range of a template in Embodiment 1. [Figure 8] FIG. 8 is a flowchart of Embodiment 2. [Figure 9] FIG. 9 is a diagram illustrating the position of a management node determined in Embodiment 2. [Figure 10] FIG. 10 is a diagram illustrating a newly determined position of a management node in Embodiment 2. [Figure 11] FIG. 11 is a flowchart of First Modification of Embodiment 2. [Figure 12] FIG. 12 is a diagram for explaining arrangement of a plurality of lower mesh networks in First Modification of Embodiment 2. [Figure 13] FIG. 13 is a flowchart of Second Modification of Embodiment 2. [Figure 14] FIG. 14 is a first diagram for explaining a management node determination method in Second Modification of Embodiment 2. [Figure 15] FIG. 15 is a second diagram for explaining a management node determination method in Second Modification of Embodiment 2. [Figure 16] FIG. 16 is a third diagram for explaining a management node determination method in Second Modification of Embodiment 2. [Figure 17] FIG. 17 is a flowchart of Embodiment 3. [Figure 18] FIG. 18 is a diagram illustrating a first example of correspondence between control groups and lower mesh networks. [Figure 19] FIG. 19 is a diagram illustrating a second example of correspondence between control groups and lower mesh networks. [Figure 20] FIG. 20 is a flowchart of a modification of Embodiment 3. [Figure 21]Figure 21 shows an example of layout information including partition information. [Figure 22] Figure 22 is a flowchart showing the operation of the communication system in Example 4. [Figure 23] Figure 23 is an explanatory diagram of the first entry process by the information terminal in Example 4. [Figure 24] Figure 24 is an explanatory diagram of the second entry process by the management node in Example 4. [Figure 25] Figure 25 is an explanatory diagram of the decision process by the management node in Example 4. [Figure 26] Figure 26 is an explanatory diagram of the second entry process by the relay node in Example 4. [Figure 27] Figure 27 is an explanatory diagram of the operation of the communication system in a modified example of Embodiment 4. [Figure 28] Figure 28 shows an example of area information in Example 5. [Figure 29] Figure 29 is a flowchart of Example 5. [Figure 30] Figure 30 shows an example of the longest distance and an example of the division process in Example 5. [Figure 31] Figure 31 shows another example of the division process in Example 5. [Figure 32] Figure 32 shows yet another example of the division process in Example 5. [Figure 33] Figure 33 shows an example of the correspondence between areas and lower-level mesh networks in Example 5. [Figure 34] Figure 34 is a flowchart showing the operation of the communication system in Example 6. [Figure 35] Figure 35 shows the first steps of the search process and decision process in Example 6. [Figure 36] Figure 36 shows the second process of the search and decision processes in Example 6. [Figure 37] Figure 37 shows the third process of the search and decision processes in Example 6. [Figure 38] Figure 38 shows the fourth step of the search and decision processes in Example 6. [Figure 39] Figure 39 shows an example of the output screen in a modified example of Example 6. [Modes for carrying out the invention]

[0010] The embodiments will be described in detail below with reference to the drawings. Note that the embodiments described below are all comprehensive or specific examples. The numerical values, shapes, materials, components, arrangement positions and connection configurations of components, steps, and the order of steps shown in the following embodiments are examples only and are not intended to limit the present invention. Furthermore, components in the following embodiments that are not described in an independent claim will be described as optional components.

[0011] Please note that each figure is a schematic diagram and not necessarily a strictly accurate representation. Furthermore, in each figure, substantially identical components are denoted by the same reference numerals, and redundant explanations may be omitted or simplified.

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

[0013] In the communication system 10, each of the multiple nodes 20 has wireless communication capabilities, and the multiple nodes 20 form a hierarchical wireless mesh network (hereinafter simply referred to as a hierarchical mesh network) after the user (hereinafter also referred to as the configurator) completes the initial setup work using the information terminal 30. Note that the construction of a hierarchical mesh network after the completion of the initial setup work is merely one example, and other methods such as constructing a mesh network from the configured nodes 20 are also conceivable.

[0014] Figure 2 is a conceptual diagram illustrating a hierarchical mesh network. In Figure 2, N1 or N2 corresponds to one node 20 in Figure 1. A hierarchical mesh network includes multiple lower-level mesh networks and a higher-level mesh network. In the example in Figure 2, each lower-level mesh network is composed of multiple nodes (N1 and N2), and the higher-level mesh network is composed of management nodes (N2) belonging to each of the multiple lower-level mesh networks. Management nodes can also be referred to as bridge nodes, core nodes, or gateway nodes. The number of lower-level mesh networks included in a hierarchical mesh network is not particularly limited. The number of levels in a hierarchical mesh network is also not particularly limited.

[0015] In a lower-level mesh network, when information is transmitted from one node (also referred to as the first node) to another node (also referred to as the second node), the information is transmitted, for example, using a flooding method.

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

[0017] The flooding method is just one example of a method used for transmitting information within a lower-level mesh network. Other methods, such as routing methods, may also be used for transmitting information within a lower-level mesh network. For example, a method may be adopted in which relay functionality is permitted only for some nodes 20 in the upper-level mesh network and at least some of the mesh networks in the lower-level mesh network.

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

[0019] If all nodes belonged to the same mesh network, all nodes would relay the information when transmitting it, resulting in a large amount of communication per unit of time. In contrast, in a hierarchical mesh network, when information is transmitted within one lower-level mesh network, it 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 via a management node only when necessary. Therefore, a hierarchical mesh network can improve system robustness by suppressing the amount of communication per unit of time.

[0020] The following explanation will primarily refer to Figure 1 to describe Node 20 and Information Terminal 30. First, let's explain Node 20. In other words, Node 20 is a wireless communication device. Examples of Node 20 include lighting fixtures, remote controllers for lighting, and AC relays.

[0021] The AC relay includes, but is not limited to, the following two types: the first AC relay and the second AC relay. The first AC relay is a device that is installed in a wiring duct and can turn on and off a single lighting fixture installed in the wiring duct by switching the AC power to that fixture on and off. The second AC relay is a device that is installed at the base of a wiring duct and can turn on and off all lighting fixtures installed in the wiring duct by switching the AC power supply to the wiring duct on and off.

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

[0023] Furthermore, when lighting fixtures are included in multiple nodes 20, the information transmitted through the hierarchical mesh network may include, for example, control information for controlling the lighting fixtures to turn on, turn off, dim, adjust color temperature, or control the light distribution. In addition, when environmental sensors are included in multiple nodes 20, measured values ​​(sensing information) from the environmental sensors may be transmitted through the hierarchical mesh network. When cameras, speakers, or other devices are included in multiple nodes 20, video, images, audio, other information, or control values ​​may also be transmitted.

[0024] Node 20 includes a wireless communication unit 21. The wireless communication unit 21 is a wireless communication circuit for Node 20 to communicate wirelessly (more specifically, via radio waves) with other Nodes 20 and information terminals 30. After Node 20 joins the hierarchical mesh network, the wireless communication unit 21 communicates through the aforementioned hierarchical mesh network. Before Node 20 joins the hierarchical mesh network, for example, the wireless communication unit 21 periodically transmits beacon signals (sometimes called advertisement signals, etc.) and communicates wirelessly with information terminals 30 that receive the beacon signals. Specifically, the wireless communication unit 21 communicates wirelessly according to communication standards such as BLE (Bluetooth® Low Energy) or Wi-Fi®, but is not limited to these communication standards.

[0025] Next, the information terminal 30 will be described. The information terminal 30 is an information terminal used for initial setup work to bring multiple nodes 20 into the hierarchical mesh network. The information terminal 30 is, for example, a mobile terminal such as a smartphone, tablet, or PDA (Personal Digital Assistant). Alternatively, the information terminal 30 may be a dedicated remote controller used in the communication system 10. The information terminal 30 is used by the user (hereinafter also referred to as the configurator) who performs the initial setup work described above. Specifically, the information terminal 30 comprises 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 each component (~ unit) of the information terminal 30 shown in Figure 1 is merely an example and is not limited to this configuration.

[0026] The operation reception unit 31 receives operations from the user who performed the configuration. Specifically, the operation reception unit 31 is implemented by a touch panel or the like.

[0027] The display unit 32 displays the images necessary for the initial setup procedure described above. The display unit 32 is implemented by a display panel such as a liquid crystal panel or an organic EL (Electro-Luminescence) panel.

[0028] The wireless communication unit 33 is a wireless communication circuit that enables the information terminal 30 to communicate wirelessly (more specifically, via radio waves) with each of the multiple nodes 20. Specifically, the wireless communication unit 33 performs wireless communication according to 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 process in response to the user's operation received by the operation reception unit 31. This information processing is, in other words, information processing for constructing a hierarchical mesh network. The information processing unit 34 is implemented by, for example, a microcomputer, but may also be implemented by a processor or dedicated circuit. The functions of the information processing unit 34 are realized by the execution of a computer program (software) stored in the storage unit 35 by the hardware, such as the microcomputer or processor that constitutes the information processing unit 34.

[0030] The memory unit 35 is a storage device that stores information necessary for processing information related to the initial setup procedure. This information includes computer programs executed by the information processing unit 34. The memory unit 35 is implemented, for example, by semiconductor memory.

[0031] The storage unit 35 has pre-stored arrangement information indicating the placement of multiple nodes 20. Figure 3 is a diagram showing an example of arrangement information. The arrangement information is, for example, information indicating the placement of multiple nodes 20 (the two-dimensional coordinates of each node 20) in a plan view of the space in which the multiple nodes 20 are installed, and Figure 3 is a visualization of the arrangement information. In Figure 3, the circles indicate the positions of the nodes 20 (virtual nodes, which will be described later). The information terminal 30 can also read new arrangement information and create new arrangement information. Furthermore, the arrangement information stored in the storage unit 35 can be modified or deleted.

[0032] The arrangement of the multiple nodes 20 is predetermined, for example, by the designer of the space described above. If the multiple nodes 20 are lighting fixtures, the arrangement information can be stored in the storage unit 35 by reusing a lighting diagram or the like. In the following explanation of Figure 4, the nodes in the arrangement information will be referred to as virtual nodes to distinguish them from the actual nodes 20.

[0033] [Initial setup procedure] Next, we will describe the initial setup procedure for constructing a hierarchical mesh network. Figure 4 is a flowchart showing an example of the initial setup procedure.

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

[0035] As a result of the processing in 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 configurator associates the placement of multiple nodes 20 indicated in the placement information with the IDs of the actual multiple nodes 20 (S13). In other words, the configurator associates the IDs of the actual nodes 20 with the virtual nodes in the placement information. For example, the MAC (Media Access Control) address is used as the node ID. This operation is performed by the configurator's operation reception unit 31.

[0037] As a result of the processing in step S13, the virtual node in the placement information is identified as the actual node 20. Combining the results of the processing in steps S11 to S13, the ID of the actual node 20 is associated with the network ID of the lower mesh network to which the node 20 with that ID belongs, and whether or not the node 20 with that ID is a management node. Hereafter, the information showing this association will be referred to as management information. The management information is stored in the storage unit 35.

[0038] Next, the configurator stores configuration information for each of the existing nodes 20 to allow that node 20 to join the hierarchical mesh network (S14). Based on the configurator's operation to the operation reception unit 31, the information terminal 30 transmits the configuration information to the node 20 by communicating with the node 20 via unicast. The node 20 stores the received configuration information in its own storage unit (not shown). Here, unicast means communicating with a specific node 20 as the final destination, and it is not necessary for the information terminal 30 and the specific node 20 to communicate directly. In step S14, the information terminal 30 may perform unicast communication via an already functioning mesh network.

[0039] The configuration information includes the network ID of the lower mesh network to which node 20 belongs, and the address information (unicast address) of node 20 used for communication within the hierarchical mesh network. The configuration information may also include, if necessary, a security passcode used for communication within the lower mesh network, and information regarding the information terminal 30 (information regarding the device managing the hierarchical mesh network). If node 20 corresponds to the management node determined in step S12, the configuration information includes the information necessary for node 20 to function as a management node. Which configuration information to send to which node 20 can be determined by the management information described above.

[0040] Node 20, whose configuration information is stored in the memory unit, can join the hierarchical mesh network. Once Node 20 has joined the hierarchical mesh network, it stops periodically transmitting beacon signals, which it was doing before joining.

[0041] Here, various methods are possible for determining the lower mesh network in step S11 and the management node in step S12. Below, we will describe examples of methods for determining the lower mesh network and the management node.

[0042] [Example 1] Example 1 describes a method for determining the lower-level mesh network and management nodes using a template. Figure 5 is a flowchart of Example 1.

[0043] The information processing unit 34 of the information terminal 30 obtains arrangement information indicating the arrangement of multiple nodes 20 from the storage unit 35 (S21). The arrangement information is, for example, generated, read, or modified by the information processing unit 34 before step S21. The information processing unit 34 also obtains a template from the storage unit 35 (S22). The template is, for example, created empirically or experimentally by the designer of the communication system 10 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 management node on the display unit 32 (S23). Figure 6 shows an example of the setting screen.

[0045] In the settings screen shown in Figure 6, the template obtained in step S22 is superimposed on the layout information obtained in step S21. The template consists of a combination of a first template, in which squares (shown as rounded rectangles in Figure 6) are arranged in a staggered pattern, and a second template, in which equilateral triangles are arranged.

[0046] The first template is an example of range information that shows 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 superimposes the first template onto the arrangement information, it determines that the nodes 20 located within one square belong to the same lower mesh network. Superimposing the first template onto the arrangement information means, in other words, applying the range indicated by the range information to the arrangement of multiple nodes 20 indicated by the arrangement information.

[0047] The second template is an example of reference position information that shows the reference position within each of the multiple ranges indicated by the range information. The positions of the vertices of the 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 correspond to the positional relationships of the vertices of the equilateral triangle. The second template is combined with the first template such that one reference position is located within one of the squares in the first template.

[0048] The information processing unit 34, with the second template superimposed on the placement information, determines that the node 20 closest to the reference position among the nodes 20 belonging to the same lower-level mesh network will be the management node of that lower-level mesh network. The state in which the second template is superimposed on the placement information means, in other words, that the template (first template) has been applied to the placement information.

[0049] Furthermore, the fact that multiple reference points in the second template are positioned to correspond to the vertices of an equilateral triangle is intended 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 point located at the edge of the second template is connected by line segments to the other three reference points, and the reference point located in the center of the second template is connected by line segments to the other six reference points.

[0050] Furthermore, as will be described later, templates can be enlarged and reduced. The first template and the second template can be enlarged or reduced together, for example. In other words, the enlargement or reduction of the first template is performed while maintaining the positional relationship between the first template and the second template.

[0051] Here, the length of one side of the equilateral triangle in the second template corresponds to the designed distance between management nodes. This side length is defined as the distance at which management nodes can reliably communicate with each other. When the template is overlaid on the placement information in step S23, the information processing unit 34 automatically enlarges or reduces the template (the square (range) indicated by the first template) so that the designed length of one side of the equilateral triangle in 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. The information processing unit 34 may also 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 in the second template is 10m, 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 in the second template matches the length of 10m in the placement information.

[0053] Following step S23, the operation reception unit 31 receives adjustment operations from the user, such as changing the position of the template relative to the layout information, enlarging the template, and shrinking the template (S24). The information processing unit 34 adjusts the display position of the template on the settings screen and the size of the template displayed on the settings screen according to the adjustment operations (S25).

[0054] As mentioned above, the length of one side of the equilateral triangle in the second template is determined by the communication performance of the management node (more specifically, node 20 determined by the management node), and there is a concern that if the template is expanded indefinitely, communication between management nodes will become impossible. Therefore, an upper limit is set for the expansion of the template. This upper limit is determined 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 10m, the upper limit is set so that the length of one side of the equilateral triangle in the second template can be expanded to the equivalent of 12m.

[0055] Next, the operation reception unit 31 receives a confirmation operation for the position and size of the template from the setter (S26). The information processing unit 34 determines that the nodes 20 located within a single square, based on the positional relationship between the placement information and the template at the time the confirmation operation is performed, belong to the same lower-level mesh network (S27). The information processing unit 34 also determines that the node 20 closest to the reference position, based on the positional relationship between the placement information and the template at the time the confirmation operation is performed, is the management node (S28). If there are multiple nodes 20 closest to the reference position, any one of them may be determined as the management node.

[0056] The information processing unit 34 displays the location of the determined management node on the settings screen (S29). In other words, the display unit 32 displays the location of the determined management node in the arrangement of the multiple nodes 20 indicated by the arrangement information. In the example in Figure 6, the management node is displayed in gray (with hatching), and the normal node is displayed in white.

[0057] In step S29, the display unit 32 may display not only the location 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 refers to the number of nodes in the lower mesh network with the most nodes 20 belonging to the mesh network in question. The minimum number of nodes refers to the number of nodes in the lower mesh network with the fewest nodes 20 belonging to the mesh network in question.

[0058] As explained above, the information terminal 30 acquires placement information indicating the arrangement of multiple nodes 20, range information indicating multiple ranges for the arrangement of multiple nodes indicated by the placement information, and reference position information indicating the reference position in each of the multiple ranges. Based on the acquired placement information and range information, the information terminal 30 determines which of the multiple lower mesh networks each of the multiple nodes 20 should belong to, and determines multiple management nodes from among the multiple nodes 20 based on the acquired placement information, range information, and reference position information. Specifically, the information terminal 30 determines which of the multiple lower mesh networks each of the multiple nodes 20 should belong to by applying multiple ranges to the arrangement of multiple nodes 20 indicated by the acquired placement information, and in the state after the application, it 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 user in determining the lower mesh network and the management node.

[0060] [Modified Example 1] In Example 1, 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, the configuration may be such that if the predetermined requirement is not met, the confirmation operation will not be accepted (it will not be considered a valid operation). This allows the information terminal 30 to assist the user in constructing an appropriate hierarchical mesh network.

[0061] In this configuration, the user must perform the above adjustment operations until the specified requirements are met. Therefore, if there are requirements for the number of nodes belonging to a lower-level mesh network, the information processing unit 34 may visualize lower-level mesh networks that do not meet the node number requirement (i.e., squares in the first template) on the setting screen when the adjustment operation in step S24 is performed. For example, the information processing unit 34 may normally display the squares that meet the node number requirement from among the multiple squares (ranges) shown by the first template, and wash out (gray out) the squares that do not meet the node number requirement. In other words, the information processing unit 34 may change the color within the frame shown by the first template depending on whether or not the node number requirement is met. This allows the information terminal 30 to assist the user in the adjustment operations.

[0062] Furthermore, the information processing unit 34 may change the thickness of the frame shown by the first template depending on whether the node number requirement is met. For example, it may display frames that do not meet the node number requirement as thicker than frames that do. The information processing unit 34 may also change the color of the frame shown by the first template, or make the frame shown by the first template blink, depending on whether the node number requirement is met. In other words, the information processing unit 34 may provide notification by changing the display manner of the range (frame) shown by the first template depending on whether the node number requirement is met.

[0063] The information processing unit 34 may change the display manner of the frames (frame color, frame thickness, frame color, etc.) of nodes 20 belonging to lower-level mesh networks that do not meet the node number requirement when multiple nodes 20 are displayed in list format. In other words, the above notification may be made when multiple nodes 20 are displayed in list format.

[0064] Furthermore, the information processing unit 34 may, in addition to or in addition to an image, notify the user of the existence of a first template that does not meet the node number requirement, whether the layout diagram of multiple nodes 20 is displayed or the multiple nodes 20 are displayed in a list, by sound (such as an alarm sound), air pressure, or odor, instead of an image. In this case, the information terminal 30 is equipped with a speaker, a blower fan, or an odor generator, or is connected to a speaker, a blower fan, or an odor generator.

[0065] Similarly, the information processing unit 34 may also notify the system of the existence of a node 20 that does not belong to any lower mesh network (i.e., a node 20 that is not located within the framework of the first template) by means of images, sounds, wind pressure, or odor. This notification may also be given when a diagram showing the arrangement of multiple nodes 20 is displayed, or when multiple nodes 20 are displayed in a list.

[0066] Furthermore, the template pattern used in Example 1 is just one example, and templates with other patterns may be used. Figures 7A and 7B show templates in modified examples of Example 1.

[0067] The template shown in Figure 7A is composed of a combination of a first template, in which squares (shown as squares with rounded corners in Figure 7A to distinguish them from the second template) are arranged in a matrix, and a second template, in which squares are arranged in a matrix.

[0068] The first template is an example of range information that shows multiple ranges for the arrangement of multiple nodes 20 indicated by the arrangement information. The first template has the same configuration as the template shown in Figure 6, except for the arrangement of multiple squares.

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

[0070] Furthermore, the template shown in Figure 7B is composed of a combination of a first template tiled with regular hexagons and a second template tiled with equilateral triangles.

[0071] The first template is an example of range information that shows multiple ranges for the placement of multiple nodes 20 indicated by the placement information.

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

[0073] Thus, the templates used in Example 1 are not particularly limited. For example, the area indicated by the first template may be a rectangle or other 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 placement information. For example, the template should be generated so that the area of ​​the entire template is larger than the total area (gross floor area) of the space indicated by the placement information.

[0075] Furthermore, in Example 1, some of the placement information may be masked. In other words, some of the nodes 20 may be excluded from the determination of the lower mesh network and the determination of the management node using the template. To put it another way, the information processing unit 34 may have a function to determine which of the multiple lower mesh networks each of the multiple nodes indicated by the placement information belongs to.

[0076] Which nodes 20 to exclude is determined, for example, by an operation by the user specifying the range to be masked. Such an operation is performed when the arrangement of multiple nodes 20 is displayed on the display unit 32. Excluded nodes 20 are treated as unassigned (not participating in the mesh network), but may belong to any lower mesh network based on manual operation by the user. Which nodes 20 to exclude may also be determined by an operation to select a node 20 from a list when multiple nodes 20 are displayed in list format. The specific method for excluding nodes is not particularly limited.

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

[0078] Furthermore, although it was explained in Example 1 that the first template and the second template are enlarged or reduced together, only one of the first template or the second template may be enlarged or reduced. Figure 7C shows an example of reduction (enlargement) of the first template and the second template in a modified example.

[0079] In the example in Figure 7C, the management nodes are illustrated when the second template is scaled down around the centroid position (average of the coordinates of all 20 nodes) of all 20 nodes included in the placement information. The star in Figure 7C indicates the centroid position. In Figure 7C, the second template before scaling down is shown with a dashed line, and the second template after scaling down is shown with a solid line. The process of scaling down (or expanding) the second template independently of the first template can be described as a process of shortening (or extending) the distances between the multiple reference positions indicated by the second template, independently of the multiple ranges indicated by the first template, while maintaining the positional relationships of the multiple reference positions indicated by the second template. The purpose of scaling down the second template independently of the first template is presumably to ensure more reliable communication quality 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 centroid, the management nodes belonging to the outer lower mesh network can be moved closer to the inside, thereby shortening the distance between management nodes.

[0081] Furthermore, the requirement for the first and second templates is that there is exactly one vertex or intersection point of the second template within one of the ranges of the first template (not zero, and not two or more). In other words, scaling the first template (or the second template) is permitted on the condition that there is exactly one reference point in each of the multiple ranges indicated by the first template.

[0082] Furthermore, template adjustments may be performed internally by the information processing unit 34 rather than by the user performing the adjustment operation. In other words, the method for determining the lower mesh network and management nodes using the template may be automated. In this case, the information processing unit 34 can omit the information processing required to receive adjustment operations from the user. For example, the information processing unit 34 can omit the process of overlaying the placement information and the template and displaying it on the display unit 32.

[0083] Furthermore, as described above, if, when attempting to determine a lower-level mesh network by applying a template, a lower-level mesh network that does not meet the node number requirement is generated, the information processing unit 34 may automatically divide the said lower-level mesh network into multiple lower-level mesh networks. In its simplest form, the information processing unit 34 divides one lower-level mesh network into two by dividing one range of the first template that defines the lower-level mesh network that does not meet the node number requirement in half vertically or horizontally. Alternatively, as a method for dividing one range of the first template (one lower-level mesh network), the division method (algorithm) of Embodiment 5 or its modified version described later may be used.

[0084] By the way, in the settings screen of Figure 6, the entirety of the first template and the second template are displayed on the display unit 32, but the display unit 32 may also display only a portion of the first template and the second template. Figures 7D and 7E show another example of the display range of the first template and the second template in Embodiment 1, and the area enclosed by the thick line corresponds to the area displayed on the display unit 32. As shown in Figures 7D and 7E, the first template and the second template are displayed, for example, cropped into a rectangle to match the screen shape of the display unit 32.

[0085] Thus, the display unit 32 may display only the necessary parts of the first template and the second template.

[0086] [Summary of Example 1 and its modified examples] As described above, the information terminal 30 includes an information processing unit 34 that performs information processing for constructing a hierarchical mesh network. The hierarchical mesh network includes a plurality of lower mesh networks and a higher mesh network composed of management nodes belonging to each of the plurality of lower mesh networks. The information processing unit 34 acquires placement information indicating the arrangement of a plurality of nodes 20, determines which of the plurality of lower mesh networks each of the plurality of nodes 20 belongs to 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. A lower mesh network is an example of a first mesh network, and a higher mesh network is an example of a second mesh network.

[0087] Such an information terminal 30 can assist the configuration user in determining the lower mesh network and the management node. In other words, the information terminal 30 can assist in the configuration work for building 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 shown in the arrangement information, and reference position information indicating a reference position in each of the multiple ranges. Based on the acquired arrangement information and range information, it determines which of the multiple lower mesh networks each of the multiple nodes 20 should belong to, and based on the acquired arrangement information, range information, and reference position information, it determines multiple management nodes from among the multiple nodes 20.

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

[0090] Furthermore, for example, the information processing unit 34 determines, as the management node, the node 20 closest to the reference location among the nodes 20 belonging to the same lower-level mesh network, which are determined based on the acquired placement information and acquired range information.

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

[0092] Furthermore, for example, the information processing unit 34 determines which of the multiple lower-level mesh networks each of the multiple nodes 20 belongs to by fitting multiple ranges to the arrangement of the multiple nodes 20 indicated by the acquired arrangement information, and in the state after the fitting, it determines the node 20 closest to the reference position among the nodes 20 belonging to the same lower-level mesh network as the management node.

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

[0094] Furthermore, for example, each of the multiple lower-level mesh networks has a requirement regarding the number of nodes that can belong to that lower-level mesh network. The information processing unit 34 has a function to notify that there is a lower-level mesh network among the multiple lower-level mesh networks that does not meet the requirements after the application of multiple ranges has been performed.

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

[0096] Furthermore, for example, the information processing unit 34 notifies users by displaying the ranges that represent lower-level mesh networks that do not meet the requirements in a different manner from the other ranges.

[0097] Such an information terminal 30 can provide notifications by visualizing the area that indicates a lower mesh network that does not meet the requirements.

[0098] Furthermore, for example, the information processing unit 34 has a function to notify 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 the 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-level mesh network using range information, each representing multiple square areas.

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

[0103] Such information terminals 30 can determine a lower-level mesh network using range information, each representing multiple hexagonal areas.

[0104] Furthermore, for example, the multiple reference points indicated by the reference position information correspond to the positional relationships of the vertices of an equilateral triangle.

[0105] Such an information terminal 30 can determine a management node using reference position information that indicates multiple reference positions corresponding to the positional relationships of the vertices of an equilateral triangle.

[0106] Furthermore, for example, the multiple reference points indicated by the reference position information correspond to the positional relationships of the vertices of a square.

[0107] Such an information terminal 30 can determine a management node using reference position information that indicates multiple reference positions corresponding to the positional relationships of the vertices of a square.

[0108] Furthermore, for example, the information processing unit 34 expands or shrinks multiple ranges and applies the expanded or reduced ranges to the arrangement of the multiple nodes 20 indicated by the acquired arrangement information, thereby determining which of the multiple lower-level mesh networks each of the multiple nodes 20 belongs to.

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

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

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

[0112] Furthermore, for example, scaling multiple ranges up or down is performed automatically based on the acquired placement information.

[0113] Such an information terminal 30 can automatically perform adjustments related to determining the lower mesh network and the management node.

[0114] Furthermore, for example, scaling up or down multiple ranges is permitted independently of multiple reference points, provided that each of the ranges has only one reference point.

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

[0116] Furthermore, for example, the information processing unit 34 extends or shortens the distance between multiple reference positions independently of the multiple ranges, while maintaining the positional relationship between the multiple reference positions. Extending or shortening the distance between multiple reference positions is permitted on the condition that there is only one reference position in each of the multiple ranges.

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

[0118] Furthermore, for example, scaling multiple ranges is performed while maintaining the positional relationship between the multiple ranges and the multiple reference points.

[0119] Such an information terminal 30 can enlarge or reduce the first template and the second template in a coordinated manner.

[0120] Furthermore, for example, the information terminal 30 also includes a display unit 32 that displays the arrangement of multiple nodes 20 indicated by the arrangement information, multiple ranges, and a reference position.

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

[0122] Furthermore, for example, the information terminal 30 also includes a display unit 32 that displays the location of the determined management node in the arrangement of the multiple nodes 20 indicated by the arrangement information.

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

[0124] Furthermore, for example, only a portion of 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 terminal 30 has an information processing unit 34 that has the function of determining which of the multiple lower mesh networks to belong to only a portion of the multiple nodes 20.

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

[0128] Furthermore, the communication system 10 includes an information terminal 30 and a plurality of nodes 20.

[0129] Such a communication system 10 can assist the configuration user in determining the lower mesh network and the management node. In other words, the communication system 10 can assist in the configuration work for building a hierarchical mesh network.

[0130] Additionally, for example, multiple nodes 20 may include lighting fixtures.

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

[0132] Furthermore, the 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 arrangement of multiple nodes 20, determines which of the multiple lower mesh networks each of the multiple nodes 20 belongs to 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 information processing methods can assist the configuration user in determining the lower-level mesh network and management nodes. In other words, the information processing method can assist in the configuration work for building a hierarchical mesh network.

[0134] [Example 2] Example 2 describes a method for determining a management node based on the centroid position of the coordinates (arrangement) of multiple nodes 20 belonging to the same lower-level mesh network. Figure 8 is a flowchart of Example 2.

[0135] In Example 2, it is assumed that the lower-level mesh networks to which each of the multiple nodes 20 belongs have already been determined. In Example 2, the lower-level mesh networks are determined by either the method described above or below, but they may also be determined arbitrarily by the setter or by other existing methods. Once the lower-level mesh networks are determined, membership information indicating which of the multiple lower-level mesh networks each of the multiple nodes 20 belongs to is stored in the storage unit 35.

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

[0137] Next, the information processing unit 34 calculates the centroid position of the nodes 20 belonging to the same sub-mesh network from among the multiple nodes 20 based on the acquired placement information and the acquired affiliation information (S33). If the placement information indicates the arrangement of the multiple nodes 20 using two-dimensional coordinates (x and y coordinates), the x-coordinate of the centroid position will be the summation average of the x-coordinates of the nodes 20 belonging to the same sub-mesh network, and the y-coordinate of the centroid position will be the summation average of the y-coordinates of the nodes 20 belonging to the same sub-mesh network. The centroid position is calculated for each of the multiple sub-mesh networks.

[0138] Next, based on the acquired placement information, the information processing unit 34 determines that the node 20 closest to the centroid of the same lower-level mesh network from among the nodes 20 belonging to that lower-level mesh network will be designated as the management node for that lower-level mesh network (S34). A management node is determined for each of the multiple lower-level mesh networks. Figure 9 shows the location of the determined management node. Figure 9 corresponds to a plan view of the space where multiple nodes 20 are arranged, and one section in Figure 9 is a section where nodes 20 belonging to the same lower-level mesh network are arranged. In other words, the sections in Figure 9 correspond to lower-level mesh networks. The circles located within each section indicate the management node of that section (lower-level mesh network). Note that if there are multiple nodes 20 closest to the centroid, any one of them may be designated as the management node.

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

[0140] If it is determined that the distance between all management nodes is within a 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 a predetermined value (No in S35), it performs a re-determination process for the lower mesh network and the management nodes (S36).

[0141] The re-determination process will be explained below. For example, if it is determined that the distances between the three locations D1 to D3 in Figure 9 exceed a predetermined value, the information processing unit 34 divides section A into two, since D1 to D3 are all distances between management nodes within section A and other management nodes. Dividing the section is equivalent to dividing one lower-level mesh network into two lower-level mesh networks.

[0142] The information processing unit 34, for example, divides section A into two vertically aligned sections A1 and A2, 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 for determining the management node is the same as in steps S33 and S34. Figure 10 shows the location of the newly determined management node.

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

[0144] As described above, in Embodiment 2, the information terminal 30 acquires location information and affiliation information, calculates the centroid position of the nodes 20 belonging to the same lower-level mesh network from among the multiple nodes 20 based on the acquired location information and affiliation information, and determines the node 20 that is closest to the centroid position among the nodes 20 belonging to the same lower-level mesh network as the management node belonging to that lower-level mesh network.

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

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

[0147] [Modification 1 of Example 2] In the above Example 2, the management node was determined in the same way for all lower-level mesh networks. However, the method for determining the management node may be changed based on the location of the lower-level mesh networks (the arrangement of multiple lower-level mesh networks). Figure 11 is a flowchart of a modification 1 of Example 2.

[0148] The information processing unit 34 of the information terminal 30 acquires arrangement information indicating the arrangement of multiple nodes 20 from the storage unit 35 (S41). The arrangement information is, for example, generated, read, or modified by the information processing unit 34 before step S41. The information processing unit 34 also acquires affiliation information from the storage unit 35 (S42). Based on the acquired arrangement information and affiliation information, the information processing unit 34 calculates the centroid position of the nodes 20 that belong to the same lower-level mesh network among the multiple nodes 20 (S43). The processing in steps S41 to S43 is the same as in steps S31 to S33. The centroid position calculated in step S43 is also referred to as the first centroid position.

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

[0150] Next, the information processing unit 34 identifies the arrangement of multiple lower-level mesh networks based on the acquired arrangement information and the acquired affiliation information (S45). Figure 12 is a diagram illustrating the arrangement of multiple lower-level mesh networks. Figure 12 corresponds to a plan view of the space in which multiple nodes 20 are arranged, and one section in Figure 12 is a section in which nodes 20 belonging to the same lower-level mesh network are arranged. In other words, the sections in Figure 12 correspond to lower-level mesh networks. The circles located within each section indicate the management node of that section (lower-level mesh network).

[0151] The information processing unit 34 identifies (distinguishes) lower mesh networks located in the central part (not at the edges) of a configuration of multiple lower mesh networks (corresponding to the unhatched sections in Figure 12) and lower mesh networks located at the edges (corresponding to the hatched sections in Figure 12). In the example in Figure 12, being located in the central part means that all sides of the section representing the lower mesh network are adjacent to other sections (lower mesh networks). Being located at the edges means that at least one side of the section representing the lower mesh network is not adjacent to other sections (lower mesh networks).

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

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

[0154] Thus, in the modified example 1 of Embodiment 2, the information terminal 30 can suppress the occurrence of management nodes that are far from other management nodes by determining a node 20 closer to the overall center position (second double center position) as the management node in the lower mesh network located at the edge.

[0155] In addition, in the modified example 1 of Example 2, the determination and re-determination processes regarding the distance between management nodes, as described in Example 2, may also be performed.

[0156] [Modification 2 of Example 2] Furthermore, for each of the multiple lower-level mesh networks, the management node may be determined by using a combination of the first centroid position and the second centroid position described in Modification 2 of Example 2. Figure 13 is a flowchart of such Modification 2 of Example 2.

[0157] The information processing unit 34 of the information terminal 30 acquires arrangement information indicating the arrangement of multiple nodes 20 from the storage unit 35 (S51). The arrangement information is, for example, generated, read, or modified by the information processing unit 34 before step S51. The information processing unit 34 also acquires affiliation information from the storage unit 35 (S52). Based on the acquired arrangement information and affiliation information, the information processing unit 34 calculates the first centroid position (S53). Based on the acquired arrangement information, the information processing unit 34 calculates the second bicentral position (S54). The processing in steps S51 to S54 is the same as in steps S41 to S44.

[0158] The information processing unit 34 determines the management node in each of the multiple lower mesh networks based on the calculated first centroid position and the calculated second centroid position (S55). Figure 14 is a diagram illustrating the method for determining the management node in modified example 2 of Embodiment 2. Figure 14 corresponds to a plan view of the space in which multiple 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 sections in Figure 14 correspond to lower mesh networks. The circles located within each section indicate the nodes 20 belonging to that section (lower mesh network).

[0159] In Figure 14, the star indicates the position of the second centroid. Specifically, the information processing unit 34 determines that the node 20 closest to the point (the triangle in Figure 14) that divides the line segment connecting the first centroid and the second centroid into a 1:n ratio (where n is a positive number) among the nodes 20 belonging to the same lower-level mesh network is the management node belonging to that lower-level mesh network. In Figure 14, the management node is indicated by a hatched circle.

[0160] In the example in Figure 14, n=1, but n can be any other number greater than or equal to 1, such as 2, or a number less than 1. n can be determined empirically or experimentally as appropriate. Furthermore, n may be changed for each lower-mesh network. Note that n is defined, for example, as the distance from the second centroid position to the point of division, when the distance from the first centroid position to the point of division is set to 1.

[0161] If, for example, the node closest to the second dual-center position among the 20 nodes belonging to the same lower-level mesh network is determined as the management node, then multiple management nodes corresponding to multiple lower-level mesh networks may be too close to the second dual-center position, potentially causing management nodes of lower-level mesh networks located on the outside to move away from other management nodes located on the inside.

[0162] In contrast, in the modified example 2 of Embodiment 2, the information terminal 30 can suppress the occurrence of multiple management nodes being too close together near the second center position.

[0163] Furthermore, Modification 2 of Example 2 can also be applied when multiple nodes 20 are arranged as shown in Figures 15 and 16. Figures 15 and 16 are other diagrams illustrating the method for determining the management node in Modification 2 of Example 2. In addition, in Modification 2 of Example 2, the determination and re-determination processes regarding the distance between management nodes described in Example 2 may also be performed.

[0164] [Summary of Example 2 and its variations] As described above, the information terminal 30 includes an information processing unit 34 that performs information processing for constructing a hierarchical mesh network. The hierarchical mesh network includes a plurality of lower mesh networks and a higher mesh network composed of management nodes belonging to each of the plurality of lower mesh networks. The information processing unit 34 acquires placement 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 based on the acquired placement information. A lower mesh network is an example of a first mesh network, and a higher mesh network is an example of a second mesh network.

[0165] Such an information terminal 30 can assist the user in determining the management node. In other words, the information terminal 30 can assist in the configuration work for building a hierarchical mesh network.

[0166] Furthermore, for example, the information processing unit 34 acquires membership information indicating which of the multiple lower-level mesh networks each of the multiple nodes 20 belongs to, and determines multiple management nodes based on the acquired placement information and the acquired membership information.

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

[0168] Furthermore, for example, the information processing unit 34 calculates the first centroid position of the nodes 20 belonging to the same lower-level mesh network from among the multiple nodes 20 based on the acquired placement information and the acquired affiliation information, calculates the second-second centroid position of the multiple nodes 20 based on the acquired placement information, and determines that the node 20 located closest to the point that divides the line segment connecting the first centroid position and the second-second centroid position in a ratio of 1:n (where n is a positive number) from among the nodes 20 belonging to the same lower-level mesh network is the management node belonging to that lower-level mesh network.

[0169] Such an information terminal 30 can determine the number of management nodes so that the multiple management nodes do not end up too close together near the second center position.

[0170] Furthermore, for example, the information processing unit 34 determines the management node by changing the value of n for each lower-level mesh network.

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

[0172] Furthermore, for example, the information processing unit 34 determines that the node 20 located closest to the point that divides the line segment in a 1:1 ratio, among the nodes 20 belonging to the same lower-level mesh network, will be designated as the management node belonging to that lower-level mesh network.

[0173] Such an information terminal 30 can determine the number of management nodes so that the multiple management nodes do not end up too close together near the second center position.

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

[0175] Such an information terminal 30 can determine a node 20 located near the centroid of the coordinates (arrangement) of nodes 20 belonging to the same lower-level mesh network as the management node of that lower-level mesh network.

[0176] Furthermore, for example, the information processing unit 34 calculates the second centroid position of multiple nodes 20 based on the acquired placement information, identifies the arrangement of multiple lower-level mesh networks based on the acquired placement information and acquired affiliation information, determines that for lower-level mesh networks not located at the ends of the arrangement, the node 20 closest to the first centroid position among the nodes 20 belonging to that lower-level mesh network is designated as the management node belonging to that lower-level mesh network, and for lower-level mesh networks located at the ends of the arrangement, the node 20 closest to the second centroid position among the nodes 20 belonging to that lower-level mesh network is designated as the management node belonging to that lower-level mesh network.

[0177] Such an information terminal 30 can suppress the occurrence of management nodes that are far away from other management nodes.

[0178] Furthermore, the information terminal 30 is equipped with a display unit 32 that displays the location of the determined management node in the arrangement of the multiple nodes 20 indicated by the arrangement information.

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

[0180] Furthermore, the communication system 10 includes an information terminal 30 and a plurality of nodes 20.

[0181] Such a communication system 10 can assist the configuration user in determining the management node. In other words, the communication system 10 can assist in the configuration work for building a hierarchical mesh network.

[0182] Additionally, for example, multiple nodes 20 may include lighting fixtures.

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

[0184] Furthermore, the 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 arrangement of multiple nodes 20, each belonging to one of the multiple lower-level mesh networks, and determines multiple management nodes from among the multiple nodes 20 based on the acquired placement information.

[0185] Such information processing methods can assist the configuration user in determining the management node. In other words, the information processing method can assist in the configuration work for building a hierarchical mesh network.

[0186] [Example 3] Example 3 describes a method for determining the lower-level mesh network to which each of the multiple nodes 20 belongs, based on control groups of the multiple nodes 20.

[0187] First, let's explain control groups. For example, if each of several nodes 20 is a lighting fixture, each of the several nodes 20 belongs to a control group that controls the illumination of all of them at the same time. This control group is referred to as control group A. For example, several nodes 20 that turn on or off simultaneously when a wall switch in a space is pressed are several nodes 20 that belong to the same control group A. Note that the power supply systems of several nodes 20 belonging to the same control group A do not need to be the same; the power supply systems of several nodes 20 belonging to the same control group A may be different.

[0188] Each 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 belong. For example, a control group B is, in other words, an operational group of lighting. A control group B is a group in which at least one of the dimming rate and color temperature setting is unified, such as a group that emits daylight white light with a dimming rate of 80% and a group that emits warm white light with a dimming rate of 90%. Control groups B belonging to the same control group A are controlled collectively at the same time.

[0189] In Example 3, control group information indicating such control groups is pre-stored (registered) in the storage unit 35 of the information terminal 30. Below, a method for determining the lower mesh network to which each of the multiple nodes 20 belongs based on such control group information will be described. Figure 17 is a flowchart of Example 3.

[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 decides which of the multiple lower mesh networks each of the multiple nodes 20 should belong to (S62). For example, the information processing unit 34 establishes a one-to-one correspondence between control groups and lower mesh networks, and assigns nodes 20 belonging to the same control group to the same lower mesh network. The control group here is control group A as described above, but it may also be control group B as described above.

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

[0192] Subsequently, when the operation reception unit 31 receives an operation to instruct a change in the control group, the information processing unit 34 updates the control group information stored in the storage unit 35 (S63). Changes to 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 removing (deleting) an existing node 20 from a control group.

[0193] When the control group information is updated, the information processing unit 34 re-determines which of the multiple lower mesh networks each of the multiple nodes 20 belongs to, in accordance with the change in the control group (S64). For example, the information processing unit 34 establishes a one-to-one correspondence between the control group and the lower mesh network, and assigns nodes 20 belonging to the same control group to the same lower mesh network. In other words, the lower mesh network to which multiple nodes 20 belong is automatically changed in accordance with the change in the control group.

[0194] Furthermore, if there is a maximum number of nodes 20 belonging to the same lower-level mesh network (in other words, an upper limit or predetermined number), and the number of nodes 20 belonging to the same control group exceeds the maximum number of nodes, it is not possible to establish a one-to-one correspondence between the control group and the lower-level mesh network. The method for determining the lower-level mesh network in such cases will be explained below. Figure 18 shows a first example of the correspondence between a control group and a lower-level mesh network.

[0195] In the example in Figure 18, control group A includes 40 nodes 20. These 40 nodes 20 belong to one of several control groups B. These control groups B include control group B1, control group B2, and control group B3, each consisting of 10 nodes 20. The detailed configuration of these groups is shown in the control group information described above.

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

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

[0198] Furthermore, the information processing unit 34 determines whether the sum 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. In the example in Figure 18, the information processing unit 34 determines that the sum of the number of nodes 20 is less than or equal to the maximum number of nodes, and assigns all of the nodes 20 belonging to control group B1 and all of the nodes 20 belonging to control group B2 to the lower mesh network C2.

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

[0200] As explained above, the information processing unit 34 assigns the nodes 20 belonging to the same control group A to the same lower-level mesh network if the number of nodes 20 belonging to the same control group A is less than or equal to the maximum number of nodes (not shown). If the number of nodes 20 belonging to the same control group A is greater than the maximum number of nodes (as in the example in Figure 18), the information processing unit 34 assigns the nodes 20 to two or more (three in the example in Figure 18) lower-level mesh networks.

[0201] Focusing on control group B, in the example shown in Figure 18, the information processing unit 34 assigns nodes 20 belonging to the same control group B3 to the same lower-level mesh network if the number of nodes 20 belonging to the same control group B3 is less than or equal to the maximum number of nodes. In addition, the information processing unit 34 assigns nodes 20 belonging to control group B1 (an example of the first group) and nodes 20 belonging to control group B2 (an example of the second group) to the same lower-level mesh network.

[0202] Figure 19 shows a second example of the correspondence between control groups and lower-level mesh networks. In the example in Figure 19, control group A includes 80 nodes 20. The 80 nodes 20 included in control group A further belong to one of several control groups B. These several control groups B include control group B1, which consists of 20 nodes 20; control group B2, which consists of 20 nodes 20; and control group B3, which consists of 40 nodes 20. The detailed configuration of such groups is shown in the control group information described above.

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

[0204] In such a case, the information processing unit 34 identifies the control group with the largest number of nodes 20 among control groups B1 to B3 (control group B3), and determines whether the number of nodes 20 in the identified control group B3 exceeds the maximum number of nodes. In the example in Figure 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 control group B3 into two groups, assigning one group to the lower mesh network C1 and the other group to the lower mesh network C2.

[0205] Furthermore, the information processing unit 34 determines the number of nodes 20 belonging to the remaining control groups B1 and B2. In the example shown in Figure 19, the information processing unit 34 determines that the sum 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 less than or equal to the maximum number of nodes. The information processing unit 34 assigns the nodes 20 belonging to control group B1 to the lower mesh network C3, and the nodes 20 belonging to control group B2 to the lower mesh network C4.

[0206] As a result, as shown in Figure 19, a portion of control group B3 is associated with lower mesh network C1, another portion of control group B3 is associated with lower mesh network C2, control group B1 is associated with lower mesh network C3, and control group B2 is associated with lower mesh network C4.

[0207] Focusing on control group B, in the example shown in Figure 19, the information processing unit 34 assigns nodes 20 belonging to the same control group B1 (or control group B2) to the same lower-level mesh network if the number of nodes 20 belonging to the same control group B1 (or control group B2) is less than or equal to the maximum number of nodes. Furthermore, if the number of nodes 20 belonging to the same control group B3 is greater than the maximum number of nodes, the information processing unit 34 divides those nodes 20 into two or more lower-level mesh networks.

[0208] Furthermore, when assigning nodes 20 belonging to the same control group to two or more lower-level 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 arrangement of multiple nodes 20, and based on the acquired placement information, it can divide the nodes 20 belonging to the same control group into two or more groups considering 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 prioritizing the grouping of nodes 20 installed in the same partition.

[0210] Furthermore, when assigning a node 20 belonging to n control groups (n being a natural number between 2 and m) out of m control groups (m being a natural number greater than or equal to 3) to a single lower-mesh network, the method for selecting n control groups from m control groups is not particularly limited. For example, the information processing unit 34 can select n control groups with close positions (coordinates) from among the m control groups based on the acquired placement information, as the n control groups to be assigned to the same lower-mesh network.

[0211] Furthermore, if the placement information includes partition information (described later), the information processing unit 34 may select n control groups to belong to the same lower-level mesh network, taking into consideration whether or not they are installed in the same partition.

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

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

[0214] [Modified version of Example 3] In a modified example of Example 3, a method for determining the sub-mesh network to which each of the multiple nodes 20 belongs is described based on the partitioning of the space in which the multiple nodes 20 are installed. Figure 20 is a flowchart of the modified example of Example 3.

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

[0216] In Figure 21, the circles indicate the location of node 20. In the layout information, which includes partition information, the partition to which each of the multiple nodes 20 belongs is associated with its two-dimensional coordinates. Here, a partition is, for example, a unit (i.e., a room) that is physically divided from space by structures such as walls or doors, but it may also be a unit (operational unit) that is divided according to its purpose without a clear structure. In the example in Figure 21, the space is divided into six partitions, partitions A to F.

[0217] The information processing unit 34 determines which of the multiple lower mesh networks each of the multiple nodes 20 belongs to, based on the partition information included in the acquired placement information (S72). For example, the information processing unit 34 establishes a one-to-one correspondence between partitions and lower mesh networks, and assigns nodes 20 located in the same partition to the same lower mesh network.

[0218] As described above, in a hierarchical mesh network, when information is transmitted within one lower-level mesh network, that information is not relayed in other lower-level mesh networks. Also, nodes 20 installed in the same section are often controlled collectively (or in conjunction). Therefore, by establishing a one-to-one correspondence between sections and lower-level mesh networks, it is possible to suppress unnecessary communication in other lower-level mesh networks when controlling multiple nodes 20.

[0219] Subsequently, when the operation reception unit 31 receives an operation to instruct a change in partition, the information processing unit 34 updates the partition information stored in the storage unit 35 (S73). Partition changes include changing the partition to which an existing node 20 is installed, adding a new node 20 to a partition, and removing (deleting) the partition affiliation of an existing node 20.

[0220] When the partition information is updated, the information processing unit 34 re-determines which of the multiple lower mesh networks each of the multiple nodes 20 belongs to, in accordance with the change in partition (S74). For example, the information processing unit 34 establishes a one-to-one correspondence between partitions and lower mesh networks, and assigns nodes 20 located in the same partition to the same lower mesh network. In other words, the lower mesh network to which multiple nodes 20 belong is automatically changed in accordance with the change in partition.

[0221] Furthermore, if there is a maximum number of nodes (in other words, an upper limit or predetermined number) that can belong to the same lower-level mesh network, and the number of nodes 20 installed in the same section exceeds the maximum number of nodes, then a one-to-one correspondence between the section and the lower-level mesh network cannot be established.

[0222] In such cases, the information processing unit 34 determines, similar to Embodiment 3, whether the number of nodes 20 installed in each section exceeds the maximum number of nodes. For example, if the information processing unit 34 determines that the number of nodes 20 installed in the same section is less than or equal to the maximum number of nodes, it assigns those nodes 20 to the same lower-level 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, it assigns those nodes 20 to two or more lower-level mesh networks.

[0223] Furthermore, there are no particular limitations on how nodes 20 installed in the same section are divided into two or more groups. For example, the information processing unit 34 can divide nodes 20 installed in the same section into two or more groups based on their proximity in terms of location (coordinates) based on the placement information. In addition to the placement information, the information processing unit 34 can also acquire control group information and divide nodes 20 installed in the same section into two or more groups by considering the control groups, for example, by prioritizing the grouping of nodes 20 belonging to the same control group.

[0224] Furthermore, similar to Example 3, if the number of nodes 20 installed in each section is small, the information processing unit 34 may assign nodes 20 located in multiple sections to a single lower-level mesh network. For example, the information processing unit 34 may assign nodes 20 installed in the first section and nodes 20 installed in a second section different from the first section to the same lower-level mesh network.

[0225] Furthermore, when assigning nodes 20 located in n sections (n ​​being a natural number between 2 and m) out of m sections (m being a natural number greater than or equal to 3) to a single lower-mesh network, the method for selecting n sections from m sections is not particularly limited. For example, the information processing unit 34 can select n sections with close locations (coordinates) from among the m sections based on placement information to be assigned to the same lower-mesh network. The information processing unit 34 may also acquire control group information in addition to placement information and select n sections to be assigned to the same lower-mesh network by considering whether or not they belong to the same control group.

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

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

[0228] [Summary of Example 3 and its modified examples] As described above, the information terminal 30 includes an information processing unit 34 that performs information processing for constructing a hierarchical mesh network. The hierarchical mesh network includes a plurality of lower mesh networks and a higher mesh network composed of management nodes belonging to each of the plurality of lower mesh networks. The information processing unit 34 acquires at least one of the following pieces of information: control group information indicating the group in which the plurality of nodes 20 are controlled, and placement information indicating the arrangement of the plurality of nodes 20. Based on the acquired information, the unit determines which of the plurality of lower mesh networks each of the plurality of nodes 20 belongs to. A lower mesh network is an example of a first mesh network, and a higher mesh network is an example of a second mesh network.

[0229] Such an information terminal 30 can assist the user in determining the lower-level mesh network. In other words, the information terminal 30 can assist in the configuration 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 nodes 20 belonging to the same group from among multiple nodes 20 to the same lower-level mesh network.

[0231] Such an information terminal 30 can determine the lower mesh network in such a way that unnecessary communication occurs when controlling multiple nodes 20.

[0232] Furthermore, 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-level mesh network, and if the number of nodes 20 belonging to the same group is greater than the predetermined number, it assigns the nodes 20 to two or more lower-level mesh networks.

[0233] Such an information terminal 30 can determine the lower mesh network in a way that takes into account the limitations on the number of nodes in the lower mesh network, and suppresses 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, it divides the nodes 20 into two or more lower-level mesh networks based on the acquired placement information and assigns them to those networks.

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

[0236] Furthermore, for example, the information processing unit 34 assigns nodes 20 belonging to the first group and nodes 20 belonging to a second group different from the first group to the same lower-level mesh network.

[0237] Such an information terminal 30 can determine the lower mesh network in a way that reduces the total number of lower mesh networks while suppressing unnecessary communication when controlling multiple nodes 20.

[0238] Furthermore, for example, after the information processing unit 34 has determined which of the multiple lower mesh networks each of the multiple nodes 20 belongs to, if a change occurs in the group to which the multiple nodes 20 are controlled, it will again determine which of the multiple lower mesh networks each of the multiple nodes 20 belongs to in accordance with the change.

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

[0240] Furthermore, for example, the placement information includes partition information that indicates the partition of the space in which multiple 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 nodes 20 installed in the same partition to the same lower-level mesh network.

[0241] Such an information terminal 30 can determine the lower mesh network in such a way that unnecessary communication occurs when controlling multiple nodes 20.

[0242] Furthermore, 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-level mesh network, and if the number of nodes 20 installed in the same section is greater than the predetermined number, it assigns the nodes 20 to two or more lower-level mesh networks.

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

[0244] Furthermore, for example, if the number of nodes 20 installed in the same section exceeds a predetermined number, the information processing unit 34 divides the nodes 20 into two or more lower-level mesh networks based on the acquired placement information and assigns them to those networks.

[0245] When assigning nodes 20 located in the same area to two or more lower-level mesh networks, such an information terminal 30 can improve communication performance between nodes 20 by considering the arrangement of the nodes 20.

[0246] Furthermore, for example, the information processing unit 34 assigns to the same lower-level mesh network a node 20 located in the first section of the multiple nodes 20, and a node 20 located in a second section different from the first section of the multiple nodes 20.

[0247] Such an information terminal 30 can determine the lower mesh network in a way that reduces the total number of lower mesh networks while suppressing unnecessary communication when controlling multiple nodes 20.

[0248] Furthermore, for example, if the information processing unit 34 determines which of the multiple lower mesh networks each of the multiple nodes 20 belongs to after it has decided which of the multiple lower mesh networks each of the multiple nodes 20 belongs to, and then changes are made to the area in which the multiple nodes 20 are installed, it will again determine which of the multiple lower mesh networks each of the multiple nodes 20 belongs to in accordance with the change.

[0249] Such an information terminal 30 can automatically change the lower-level mesh network to which multiple nodes 20 belong in response to changes in the partition.

[0250] Furthermore, the communication system 10 includes an information terminal 30 and a plurality of nodes 20.

[0251] Such a communication system 10 can assist the configuration user in determining the lower mesh network. In other words, the communication system 10 can assist in the configuration work for building a hierarchical mesh network.

[0252] Additionally, for example, multiple nodes 20 may include lighting fixtures.

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

[0254] Furthermore, the 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 the following pieces of information: control group information indicating a group when multiple nodes 20 are controlled, and placement information indicating the arrangement of multiple nodes 20. Based on the acquired information, it determines which of the multiple lower mesh networks each of the multiple nodes 20 belongs to.

[0255] Such information processing methods can assist the setter in determining the lower-level mesh network. In other words, the information processing method can assist in the setup process for constructing a hierarchical mesh network.

[0256] [Example 4] In Example 4, unlike Examples 1-3, we will describe a method for having each of the multiple nodes 20 join the lower mesh network, and a method for having some of the multiple nodes 20 join the lower mesh network as management nodes. In Example 4, unless otherwise specified, it will be assumed that not all nodes 20 are participating in the hierarchical mesh network. Also, in Example 4, "communication possible" means that nodes 20 can communicate directly with each other without going through other nodes 20.

[0257] FIG. 22 is a flowchart showing the operation (i.e., the information processing method) of the communication system 10 in Example 4. FIG. 22(a) is a flowchart showing the operation of the information terminal 30. FIG. 22(b) is a flowchart showing the operation of the management node determined by the first entry process described later. FIG. 22(c) 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 performed 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 communicable with the information terminal 30, and causing the searched node 20 as a management node to enter any one of a plurality of lower mesh networks (first mesh network). The phrase "searching for a node" as used herein refers to searching, among the plurality of nodes 20, for a node 20 from which a periodically transmitted beacon signal can be received by the wireless communication unit 33 of the information terminal 30.

[0259] As shown in FIG. 22(a), in the first entry process, the information processing unit 34 searches for the node 20 (S81). When a node 20 from which a beacon signal can be received is found, the information processing unit 34 of the information terminal 30 determines the found node 20 as the management node (S82). That is, the information processing unit 34 of the information terminal 30 causes the found node 20 to enter the lower mesh network, and determines the node 20 as the management node of the lower mesh network. In addition, when there are a plurality of found nodes 20, the information processing unit 34 of the information terminal 30 determines each of the found plurality of nodes 20 as a management node.

[0260] In addition, the information processing unit 34 of the information terminal 30 does not determine all found nodes 20 as management nodes, and for example, may determine only nodes 20 whose radio wave intensity of the beacon signal (e.g., RSSI (Received Signal Strength Indication) value) is equal to or higher than a predetermined value as management nodes. In this case, it becomes easy to ensure communication performance such that reliable communication can be achieved between the information terminal 30 and the management node.

[0261] It is also conceivable that an excessively large number of management nodes increases traffic and imposes a load on the system, or that the number exceeds the upper limit of the number of management 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 management nodes so that it falls within a predetermined number. For example, when the information processing unit 34 of the information terminal 30 sorts the searched nodes 20 in descending order of the radio wave intensity of beacon signals, it may determine only the first predetermined number of nodes 20 from the top as management nodes. Further, for example, the information processing unit 34 of the information terminal 30 may randomly determine a predetermined number of management nodes from the plurality of searched nodes 20.

[0262] Then, the information processing unit 34 of the information terminal 30 transmits determination information to the node 20 determined as a management node (S83). The determination information includes the network ID of the lower-level 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 a management node. If necessary, the determination information may further include a security passcode used for communication within the lower-level mesh network, information about the information terminal 30 (information about a device that manages the hierarchical mesh network), and the like.

[0263] When the node 20 determined as a management node acquires the determination information, the node 20 enters the lower-level mesh network as a management node.

[0264] Here, a specific example of the first entry process will be explained using Figure 23. Figure 23 is an explanatory diagram of the first entry process by the information terminal 30 in Example 4. In Figure 23, management nodes are represented by black circles, and nodes that have not entered the hierarchical mesh network are represented by white circles. Also, in Figure 23, the bidirectional arrows between the information terminal 30 and the nodes indicate that communication is possible between the information terminal 30 and the nodes. The representation in Figure 23 is the same in Figures 24 to 27, which will be described later.

[0265] In the example shown in Figure 23, the information processing unit 34 of the information terminal 30 searches for three nodes 20A, 20B, and 20C during the first entry process. Therefore, the information processing unit 34 of the information terminal 30 determines that the three nodes 20A, 20B, and 20C are management nodes and sends determination information to each of the three nodes 20A, 20B, and 20C. As a result, nodes 20A, 20B, and 20C all receive the determination information and subsequently function as management nodes.

[0266] Next, the management node performs the second entry process and the decision process. The second entry process and the decision process are performed by an information processing unit (not shown) located in node 20, which is the management node. The information processing unit is implemented, for example, by a microcomputer, but may also be implemented by a processor or dedicated circuit. The functions of the information processing unit are realized by the hardware, such as a microcomputer or processor constituting the information processing unit, executing a computer program (software) stored in a memory unit (not shown) located in the management node. The second entry process and the decision process are automatically performed by node 20 (the management node) once it has acquired decision information and is functioning as a management node.

[0267] The second entry process involves searching for a node 20 that can communicate and allowing the found node 20 to join the lower mesh network (first mesh network) to which the management node (in this case) belongs. "Searching for a node" here means searching for a node 20 among multiple nodes 20 that can receive the periodically transmitted beacon signal with the wireless communication unit 21 of the management node. If there are multiple management nodes, the multiple management nodes may, for example, execute the second entry process in the order in which the information processing unit 34 of the information terminal 30 determined these multiple management nodes, or they may execute the second entry process in order of the signal strength between the management node and the information terminal 30, or they may execute the second entry process randomly.

[0268] Note that "searching for nodes" may also include, for example, broadcasting a search signal from the management node's wireless communication unit 21. In this case, node 20, upon receiving the search signal, joins the lower mesh network to which the management node that sent the search signal belongs. Here, if node 20 receives search signals from multiple management nodes, it may join the lower mesh network to which the management node that sent the search signal with the highest signal strength belongs.

[0269] The decision process is the process of determining a relay node in the lower mesh network (to which the management node belongs) based on the strength of the radio waves received by the management node itself. In Example 4, the relay node is a new management node belonging 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, node 20, which has been determined to be a relay node by the decision process, leaves the lower mesh network to which the management node belongs and functions as a new management node belonging to the new lower mesh network. Details of the decision process will be explained in step S93 below.

[0270] As shown in Figure 22(b), in the second entry process, the information processing unit of the management node searches for node 20 (S91). Once a node 20 capable of receiving beacon signals is found, the information processing unit of the management node invites 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 sends entry information to the node 20 that it wants to join. The entry information includes the lower mesh network ID to which the management node belongs, and the address information (unicast address) of node 20 used for communication within the hierarchical mesh network. The entry information may also include, if necessary, a security passcode used for communication within the lower mesh network, and information about the information terminal 30 (information about the device that manages the hierarchical mesh network).

[0272] The address information of node 20 may be assigned to node 20 by the information processing unit 34 of the information terminal 30 via the management node (or relay node described later), or the information processing unit of the management node (or relay node) may assign it to node 20. In the latter case, the information processing unit of the management node (or relay node) assigns to node 20 address information that is subordinate to the address information of the management node (or relay node), for example. This makes it possible to avoid duplication with the address information of nodes 20 belonging to other lower mesh networks.

[0273] Upon acquiring entry information, node 20 enters the lower mesh network to which the management node belongs. Once node 20 has entered the lower mesh network, it stops the periodic transmission of beacon signals that it was performing before entering the network.

[0274] Here, a specific example of the second entry process by the management node will be explained using Figure 24. Figure 24 is an explanatory diagram of the second entry process by the management node in Example 4. In Figure 24, nodes that have entered the lower mesh network are represented by dot-hatched circles. Also in Figure 24, bidirectional arrows between nodes indicate that communication is possible between nodes. Furthermore, in Figure 24, dashed boxes indicate that multiple nodes enclosed within the box belong to the same lower mesh network. The representation in Figure 24 is the same as in Figures 25 to 27, which will be described later.

[0275] In the example shown in Figure 24, the information processing units of the three management nodes, 20A, 20B, and 20C, each perform a second entry process. As a result, multiple nodes (four in this case) that can communicate with node 20A join the lower mesh network with node 20A as the management node (see the dashed box in the upper left of Figure 24). Similarly, multiple nodes (four in this case) that can communicate with node 20B join the lower mesh network with node 20B as the management node (see the dashed box in the upper right of Figure 24). Furthermore, multiple nodes (three in this case) that can communicate with node 20C join the lower mesh network with node 20C as the management node (see the dashed box in the lower right of Figure 24).

[0276] Next, as shown in Figure 22(b), the information processing unit of the management node determines the relay node in the decision process (S93). In step S93, the information processing unit of the management node determines the node 20 with the lowest signal strength among the one or more nodes 20 whose received beacon signal signal strength (here, RSSI value) is above a threshold as the relay node. The threshold is set appropriately to a value that ensures reliable communication performance, for example, between the management node and node 20.

[0277] In other words, the information processing unit of the management node determines the node 20 that is furthest from the management node among one or more nodes 20 that can reliably communicate with it to be the relay node. This reduces the possibility that the relay node may be too close to the management node, making it impossible to find nodes 20 that have not yet joined the hierarchical mesh network during the second entry process by the relay node, which will be described later.

[0278] Furthermore, the information processing unit of the management node does not perform a decision process if there is only one node 20 participating in the lower mesh network to which it belongs. This is because performing the decision process in such a case would result in only the management node belonging to the lower mesh network, leaving an unnecessary lower mesh network in the hierarchical mesh network.

[0279] The information processing unit of the management node then transmits relay decision information to node 20, which has been determined to be a relay node (S94). The relay decision information includes the network ID of a new lower mesh network that is different from the lower mesh network to which the management node belongs. The relay decision information also includes information necessary for node 20 to function as a new management node. The relay decision information may also include, if necessary, a security passcode used for communication within the new lower mesh network, and information about the information terminal 30 (information about the device that manages the hierarchical mesh network).

[0280] Node 20, having been designated as a relay node, acquires relay decision information, and thus functions as a relay node. In this case, Node 20 leaves the lower-level mesh network to which the management node belongs and joins a new lower-level mesh network as a relay node (new management node).

[0281] Here, a specific example of the determination processing performed by a management node will be described with reference to FIG. 25. FIG. 25 is an explanatory diagram of determination processing by a management node in Embodiment 4. In FIG. 25, a solid-line frame indicates that a node enclosed in 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 a management node, executes the determination processing. Note that the information processing units of nodes 20A and 20C, which are management nodes, also each execute determination processing, but description thereof is omitted here. By executing the determination processing, 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, as a relay node (here, a new management node), and transmits relay determination information to node 20D. Accordingly, by acquiring the relay determination information, node 20D subsequently functions as a relay node.

[0283] Next, the relay node executes second entry processing and determination processing in the same manner as a management node. In other words, the relay node executes the second entry processing and determination processing as a new management node. The second entry processing and determination processing are executed by an information processing unit (not shown) included in node 20, which is the relay node. When node 20 acquires relay determination information and starts functioning as a relay node, the node 20 (relay node) automatically executes the second entry processing and determination processing.

[0284] The second entry processing executed by a relay node is processing for searching for communicable nodes 20 and causing the searched nodes 20 to enter a lower mesh network (first mesh network) to which the self (here, the relay node) belongs. The "search for nodes" as used herein means searching, among the plurality of nodes 20, for a node 20 whose periodically transmitted beacon signal can be received by the wireless communication unit 21 of the relay node.

[0285] The decision process performed by a relay node is to determine which relay node (i.e., a new relay node) to use in the lower mesh network (to which the relay node belongs) based on the strength of the radio waves it receives. Node 20, determined to be a new relay node through this decision process, leaves the lower mesh network to which it 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 during the second entry process, the relay node is returned to the lower mesh network (first mesh network) to which the management node belongs. In other words, if 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 prevents unnecessary lower mesh networks from remaining in the hierarchical mesh network.

[0287] As shown in Figure 22(c), in the second entry process, the information processing unit of the relay node searches for node 20 (S101). If a node 20 capable of receiving beacon signals exists (Yes in S102), the information processing unit of the relay node allows the found node 20 to enter the lower mesh network to which the relay node belongs (S103). From then on, the relay node officially functions as a new management node.

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

[0289] By acquiring entry information, node 20 enters the lower-level mesh network to which the relay node belongs.

[0290] Here, a specific example of the second entry process by a relay node will be explained using Figure 26. Figure 26 is an explanatory diagram of the second entry process by a relay node in Example 4. In the example shown in Figure 26, the information processing unit of node 20D, which is a relay node, performs the second entry process. As a result, nodes that can communicate with node 20D join the lower mesh network with node 20D as the relay node (new management node) (see the dashed box in the upper right of Figure 26).

[0291] Next, as shown in Figure 22(c), the information processing unit of the relay node determines the relay node (i.e., the new relay node) in the decision process (S104). In step S104, the information processing unit of the relay node, similar to the decision process by the management node, determines the node 20 with the lowest signal strength among the one or more nodes 20 whose received beacon signal signal strength (here, RSSI value) is above the threshold as the new relay node. The threshold is set appropriately to a value that ensures reliable communication performance between the relay node and node 20, for example.

[0292] In other words, the information processing unit of a relay node determines the node 20 that is furthest from the relay node among one or more nodes 20 that can reliably communicate with it to become the new relay node. This reduces the possibility that the new relay node may be too close to the relay node, making it impossible to find nodes 20 that have not yet joined the hierarchical mesh network during the second entry process by the new relay node.

[0293] Furthermore, the information processing unit of a relay node does not perform a decision process if there is only one node 20 participating in the lower-level mesh network to which it belongs. This is because performing the decision process in such a case would result in only the relay node belonging to the lower-level mesh network, leaving an unnecessary lower-level mesh network in the hierarchical mesh network.

[0294] In the example shown in Figure 26, since there is only one node 20 in the lower mesh network to which node 20D, which is a relay node, belongs, the information processing unit of node 20D will not perform a decision process.

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

[0296] Node 20, which has been designated as a new relay node, acquires relay decision information, and then functions as a new relay node. In this case, Node 20 leaves the lower mesh network to which the management node belongs and joins a new lower mesh network as a new relay node (new management node).

[0297] On the other hand, if there are no nodes 20 capable of receiving beacon signals (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 in the original lower mesh network, neither a management node nor a relay node. The relay node may maintain its state as a relay node, but it is preferable to return to a normal node 20. This is because it prevents the retention of unnecessary relay nodes in the hierarchical mesh network.

[0298] The subsequent relay nodes will perform the second entry process and the decision process until the relay node's information processing unit can no longer search for node 20 in the second entry process, or until the relay node's information processing unit can no longer perform the decision process. When the relay node's information processing unit can no longer search for node 20 in the second entry process, or when the relay node's information processing unit can no longer perform the decision process, the series of processes for searching for node 20 described above will be completed.

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

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

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

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

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

[0304] [Modified Example 4] Figure 27 is an explanatory diagram of the operation (i.e., information processing method) of the communication system 10 in a modified example of Embodiment 4. In Figure 27, all nodes except for the two nodes enclosed in solid lines belong to the hierarchical mesh network. In other words, these two nodes do not belong to the hierarchical mesh network and therefore continue to transmit beacon signals periodically. Also in Figure 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 to the information terminal 30 indicating that there is a node 20 that has not joined the hierarchical mesh network. Upon receiving this information, the information processing unit 34 of the information terminal 30 determines that node 20α, the source of the information, is the new management node. The information processing unit 34 of the information terminal 30 then transmits this determination information to node 20α.

[0306] Once the information processing unit of node 20α acquires decision information, it then leaves the original lower-level mesh network and functions as a new management node. The information processing unit of node 20α then executes a second entry process to invite the two nodes that are not currently in the hierarchical mesh network to join the new lower-level mesh network to which it belongs.

[0307] As described above, in the modified example of Embodiment 4, if a node 20 that has joined the hierarchical mesh network searches for a node 20 that has not joined the hierarchical mesh network, the node 20 that has joined the hierarchical mesh network is determined to be the new management node, and the new management node is instructed to perform the second entry process. This reduces the chance of a node 20 missing from joining the hierarchical mesh network.

[0308] Furthermore, in Example 4, the relay node functions as a new management node at the time the second entry process is executed, but it is not limited to this. For example, the relay node may function as a new management node if it can find node 20 by executing the second entry process. In other words, if the relay node can find node 20, the relay node may be determined to be a new management node belonging to a lower mesh network (first mesh network) different from the lower mesh network (first mesh network) to which the management node belongs. If the relay node cannot find node 20 by executing the second entry process, it may maintain its state as a relay node or revert to being a normal node 20, but the latter is preferable because it prevents the retention of unnecessary relay nodes in a hierarchical mesh network.

[0309] Furthermore, in Embodiment 4, the communication system 10 (information processing method) only needs to perform at least the first entry process by the information terminal 30 and the second entry process by the management node, and does not need to perform the decision process by the management node, the second entry process by the relay node, and the decision process by the relay node.

[0310] [Summary of Example 4 and its modified examples] As explained above, the information processing method is an information processing method for constructing a hierarchical mesh network, which is executed by a computer. The hierarchical mesh network includes multiple first mesh networks and a second mesh network composed of management nodes belonging to each of the multiple first mesh networks. The information processing method searches for a node 20 that can communicate with the information terminal 30 and performs a first entry process to have the searched node 20 join one of the multiple first mesh networks as a management node. The information processing method then has the management node perform a second entry process to search for a node 20 that can communicate and to have the searched node 20 join the first mesh network to which it belongs. A lower mesh network is an example of a first mesh network, and a higher mesh network is an example of a second mesh network.

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

[0312] Furthermore, for example, the information processing method causes the management node to perform a decision process in which it determines which relay node to use based on the strength of the radio waves it receives within the lower mesh network to which the management node belongs.

[0313] This information processing method automatically determines the relay nodes, further reducing the effort required for the configuration user to build a hierarchical mesh network.

[0314] Furthermore, for example, the information processing method involves having the relay node perform the second entry process.

[0315] With this information processing method, relay nodes automatically build a hierarchical mesh network, further reducing the effort required for the configuration user to build the hierarchical mesh network.

[0316] Furthermore, for example, a relay node is a new management node belonging to a different lower-level mesh network than the one to which the management node belongs. The information processing method returns the relay node to the lower-level mesh network to which the management node belongs if the relay node cannot find node 20 in the second entry process.

[0317] This information processing method prevents the retention of unnecessary lower-level mesh networks in a hierarchical mesh network.

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

[0319] This information processing method reduces the possibility that the management node determined in the first round may not be able to find node 20 in the second entry process.

[0320] Furthermore, for example, if a relay node is able to find node 20, the relay node is determined to be a new management node belonging to a different lower-level mesh network than the one to which the management node belongs.

[0321] This information processing method prevents the retention of unnecessary lower-level mesh networks in a hierarchical mesh network.

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

[0323] This information processing method prevents unnecessary relay nodes from remaining in a hierarchical mesh network.

[0324] Furthermore, for example, the information processing method causes the relay node to execute a decision process if it is able to find node 20 in the second entry process.

[0325] With this information processing method, relay nodes automatically build a hierarchical mesh network, further reducing the effort required for the configuration user to build the hierarchical mesh network.

[0326] Furthermore, for example, in the decision process, among multiple nodes 20 whose radio wave intensity is above a threshold, the node 20 with the lowest radio wave intensity is selected as the relay node.

[0327] This information processing method reduces the possibility that a new relay node may become too close to another relay node, preventing it from searching for nodes 20 that have not yet joined the hierarchical mesh network during the second entry process by the new relay node.

[0328] Furthermore, for example, if a node 20 that is part of a hierarchical mesh network searches for a node 20 that is not part of the hierarchical mesh network, the node 20 that is part of the hierarchical mesh network is designated as the new management node, and the new management node is instructed to perform the second entry process.

[0329] This information processing method can reduce the chances of node 20 being missed from joining the hierarchical mesh network.

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

[0331] This information processing method allows for automatic registration of management nodes, further reducing the effort required for the configuration user to build a hierarchical mesh network.

[0332] The communication system 10 also includes an information terminal 30 equipped with an information processing unit 34 that performs 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 a higher mesh network composed of management nodes belonging to each of the plurality of lower mesh networks. The information processing unit 34 searches for a node 20 that can communicate with the plurality of nodes 20 and performs a first entry process to allow the searched 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 searches for a node 20 that can communicate with it and performs a second entry process to allow the searched 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 simply by the user performing a predetermined operation on the information terminal 30, thereby reducing the effort required for the user to construct the hierarchical mesh network. In other words, such a communication system 10 can support the configuration work required to construct a hierarchical mesh network.

[0334] Additionally, for example, multiple nodes 20 may include lighting fixtures.

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

[0336] Furthermore, if node 20 is a node used in the above-mentioned communication system 10 and is a management node, it will perform the second entry process.

[0337] With such a node 20, a hierarchical mesh network can be automatically constructed simply by the user performing a predetermined operation on the information terminal 30, reducing the effort required for the user to construct the hierarchical mesh network. In other words, such a node 20 can assist in the configuration work required to construct a hierarchical mesh network.

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

[0339] First, let's explain what an area is. An area is a unit divided by, for example, the setter or the designer of the space, to include two or more nodes 20. An area may be a unit that includes two or more nodes 20 that are controlled together at the same time, or it may be a unit in which a space such as a conference room is physically divided by a structure such as a wall or door. Furthermore, an area may be a unit divided according to its intended use.

[0340] In Example 5, area information indicating multiple such areas is pre-stored (registered) in the storage unit 35 of the information terminal 30 by being set by the setter or the space designer.

[0341] Here, an example of area information will be explained using Figure 28. Figure 28 is a diagram showing an example of area information in Embodiment 5. Figure 28 visualizes the area information and corresponds to a plan view of the space where multiple nodes 20 are arranged. In Figure 28, the circles indicate the positions of the nodes 20. In the area information, the area to which each node 20 belongs is associated with the two-dimensional coordinates of each of the multiple nodes 20. In the example shown in Figure 28, the space is divided into seven areas, from Area Ar1 to Area Ar7. In the example shown in Figure 28, all of the multiple areas Ar1 to Area Ar7 are rectangular, but the shape of each area is not limited to a rectangle; for example, it may be a circle or other shape.

[0342] The following describes how to determine the lower-level mesh network to which each of the multiple nodes 20 belongs, based on this area information. Figure 29 is a flowchart of Example 5.

[0343] First, the information processing unit 34 of the information terminal 30 acquires area information from the storage unit 35 (S111). Then, based on the acquired area information, the information processing unit 34 performs a determination process to determine whether or not each area satisfies the constraint conditions (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, that area may be designated as a lower mesh network, meaning that the two or more nodes 20 belonging to that area may remain in the same lower mesh network. On the other hand, if an area does not satisfy the constraint conditions, the area must be divided in such a way that the resulting areas satisfy the constraint conditions.

[0344] It should be noted that while area division is performed here to determine the sub-mesh network, this is merely a virtual division of the area during the process of determining the sub-mesh network. Therefore, dividing the area does not update the area information itself.

[0345] In Example 5, the constraints include the condition that the longest distance L1 (see Figure 30, etc.) in the target area is less than or equal to the reference distance based on the communication range between nodes 20. Here, the longest distance L1 in the area is the distance between the two furthest points in the area, or a distance equivalent to that distance.

[0346] The following are examples of the longest distance L1. Figure 30 shows an example of the longest distance L1 and an example of the division process in Example 5. Figure 30(a) shows an example where area Ar is rectangular. In the example shown in Figure 30(a), the longest distance L1 corresponds to the length of the diagonal of area Ar.

[0347] Figure 30(b) shows an example where area Ar is rectangular, but is inclined with respect to the horizontal (X-axis direction) and vertical (Y-axis direction) directions in the spatial plan view of the area information. In the example shown in Figure 30(b), the longest distance L1 corresponds to the length of the diagonal of the rectangle Sq that circumscribes area Ar in a two-dimensional Cartesian coordinate system (XY coordinate system). The rectangle Sq is a rectangle with 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 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 that circumscribes area Ar in a two-dimensional Cartesian coordinate system, similar to the example shown in Figure 30(b).

[0349] Furthermore, the longest distance L1 may be the distance between the two furthest nodes 20 out of the two or more nodes 20 included in the area. In this case, the longest distance L1 corresponds to the length of the line segment connecting the two-dimensional coordinates of these two nodes. In the following, the longest distance L1 will be defined as the length of the diagonal of area Ar, or the length of the diagonal of the rectangle Sq that circumscribes area Ar in a two-dimensional Cartesian coordinate system.

[0350] Furthermore, the communication range referred to here is the upper limit of the distance over which any node 20 can reliably communicate with other nodes 20. Here, the communication range is the upper limit of the distance over which any node 20 can reliably communicate with other nodes 20, assuming that there are no obstacles (e.g., walls or furniture) that would hinder communication between them.

[0351] In reality, however, obstacles may exist between the two nodes 20, and the diffraction properties (ease of bending) of radio waves may differ depending on the frequency of the radio waves used. Therefore, the actual distance over which communication is considered possible between the two nodes 20 will be shorter than the above-mentioned communication distance, depending on the communication environment. Thus, in Example 5, when comparing with the longest distance L1 in the determination process, a reference distance calculated by multiplying the communication distance by a coefficient is used instead of the above-mentioned communication distance.

[0352] The coefficient is a real number greater than 0 and less than or equal to 1, and is a constant set in advance considering the above communication environment. For example, the coefficient is 0.8. Note that the coefficient is not limited to a constant; for example, it may be a variable that changes depending on the frequency of the radio waves used. In this case, the coefficient would be set such that, for example, it becomes larger as the frequency of the radio waves used increases and smaller as the frequency of the radio waves used decreases.

[0353] Furthermore, the coefficients may be changed depending on how the longest distance L1 is expressed. That is, the coefficients may be different depending on whether the longest distance L1 is expressed as the length of the diagonal of an area Ar or rectangle Sq, or as the distance between the two furthest nodes 20.

[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, for each area, the information processing unit 34 compares the calculated longest distance L1 with the reference distance to determine whether or not the constraint conditions are met.

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

[0356] On the other hand, if the target area does not satisfy the constraints (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 the process of dividing the target area into two or more areas. By dividing the area that does not satisfy the constraints 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 constraints, and if the constraints are met, the divided area will be determined to be a lower mesh network.

[0357] The following are examples of the division process. In the example shown in Figure 30(a), the information processing unit 34 divides the area Ar that does not satisfy the constraints by bisecting the longest side (see dashed line). In other words, the information processing unit 34 divides the area Ar in the longitudinal direction. Also, in the examples shown in Figure 30(b) and (c), the information processing unit 34 divides the area Ar in the division process by bisecting the longest side of the rectangle Sq that circumscribing the area Ar that does not satisfy the constraints in a two-dimensional Cartesian coordinate system (XY coordinate system) (see dashed line). Note that in the example shown in Figure 30(c), since the rectangle Sq is a square, the information processing unit 34 may divide the sides along the X-axis or along the Y-axis.

[0358] Figure 31 shows another example of the division process in Example 5. Figure 31 shows the case where area Ar is rectangular and the longest distance L1 is longer than the longest distance L1 shown in Figure 30. In such cases where the longest distance L1 is relatively long, simply dividing area Ar into two areas may not result in the longest distance L1 of the divided areas being less than or equal to the reference distance. In such cases, the information processing unit 34 divides area Ar into three or more parts by dividing the longest side of area Ar that does not satisfy the constraints, or the longest side of rectangle Sq, into three or more parts during the division process. In the example shown in Figure 31, the information processing unit 34 divides the longest side of area Ar into three equal parts (see dashed line). The number of divisions of area Ar that does not satisfy the constraints during the division process may be appropriately determined according to the length of the longest distance L1.

[0359] Figure 32 shows yet another example of the division process in Example 5. Figure 32 shows the case where area Ar has a complex shape and, similar to Figure 31, the longest distance L1 is longer than the longest distance L1 shown in Figure 30. Figure 32 shows an example in which the information processing unit 34 keeps the number of divisions of area Ar constant (in this case, 2 divisions) and repeats the determination process and division process until the divided areas satisfy the constraint conditions.

[0360] In other words, as shown in Figure 32(a), the information processing unit 34 first divides area Ar in the division process by dividing the longer side of the rectangle Sq that circumscribing area Ar, which does not satisfy the constraints in a two-dimensional Cartesian coordinate system (XY coordinate system), into two equal parts (see the vertical dashed line). As a result, as shown in Figure 32(b), area Ar is divided into two areas: area Ar01 and area Ar02.

[0361] Here, the information processing unit 34 performs further determination processing for each of the two divided areas Ar01 and area Ar02. Specifically, the information processing unit 34 calculates the longest distance L01 of area Ar01 and the longest distance L02 of area Ar02, and compares each of the longest distances L01 and L02 with the reference distance. The longest distance L01 of area Ar01 corresponds to the length of the diagonal of the rectangle Sq01 that circumscribes area Ar01. The longest distance L02 of area Ar02 corresponds to the length of the diagonal of the rectangle Sq02 that circumscribes 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 less than or equal to the reference distance. In this case, the information processing unit 34 determines area Ar02 to be a lower mesh network and performs further division processing on area Ar01. That is, in the second division process, the information processing unit 34 divides area Ar01 so that the longer side of the rectangle Sq01 circumscribing area Ar01 is divided into two equal parts (see the dashed line in the horizontal direction).

[0363] As described above, the information processing unit 34 may, in the division process, appropriately change the number of divisions according to the length of the longest distance L1, so that the divided areas satisfy the constraint conditions. Alternatively, 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 Figure 29, the information processing unit 34 is executing the latter algorithm.

[0364] In addition, the information processing unit 34 may, in the division process, divide the target area or the rectangle circumscribing the area into equal parts, but rather divide the area such that the longest distance L1 of the divided areas becomes the reference distance. In this case, if the target area is divided into multiple areas, the longest distance L1 of at least one of the multiple areas will be the reference distance or less than or equal to the reference distance. If, after the division process is executed, there are areas where the longest distance L1 exceeds the reference distance, the same division process can be executed again for those areas.

[0365] Thus, in the division process, the information processing unit 34 may divide the target area not into equal parts, but rather in such a way that the shapes of the two or more resulting areas are irregular.

[0366] Here, using an example of area information shown in Figure 28, the results when the information processing unit 34 performs determination processing and division processing will be explained using Figure 33. Figure 33 is a diagram showing an example of the correspondence between an area and a lower-level mesh network in Embodiment 5. In Figure 33, a dashed frame indicates that two or more nodes enclosed by that frame belong to the same lower-level mesh network.

[0367] In the example shown in Figure 33, areas Ar1 to Ar4 are all determined to be sub-mesh networks without being divided. On the other hand, area Ar5 is divided into two areas, Ar51 and Ar52, through a division process. Area Ar6 is also divided into areas Ar61 and Ar62 through a division process. Area Ar7 is also divided into areas Ar71 and Ar72 through a division process. These areas Ar51, Ar52, Ar61, Ar62, Ar71, and Ar72 are then determined to be sub-mesh networks.

[0368] As explained above, in Example 5, the information terminal 30 (information processing method) acquires area information indicating multiple areas and determines whether the target area satisfies the constraints. Such an information terminal 30 (information processing method) can automatically determine whether an area is suitable for the first mesh network (lower mesh network) based on the area set by the setter or spatial designer, etc., thus eliminating the need for determination by the setter or spatial designer, etc. In other words, such an information terminal 30 (information processing method) can support the setup work for constructing a hierarchical mesh network.

[0369] Furthermore, in Example 5, the information terminal 30 (information processing method) determines if the target area satisfies the constraints in the determination process, and if it does not satisfy the constraints, it performs a division process to divide the area. Since such an information terminal 30 (information processing method) can automatically determine multiple areas, including the divided area, into multiple lower mesh networks, no work is required from the setter or spatial designer.

[0370] [Modified Example 5] In Example 5, the constraint condition included, but is not limited to, that the longest distance L1 in the target area is less than or equal to a reference distance based on the communication distance between nodes 20. For example, the constraint condition may further include that the number of nodes 20 (2 or more) in the target area is less than or equal to a reference number. Here, the reference number is, for example, the maximum number of nodes 20 that can belong to 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 less than or equal to the reference distance and the number of nodes 20 is less than or equal to the reference number. On the other hand, in the determination process, the information processing unit 34 determines that the constraint condition is not satisfied if the number of nodes 20 exceeds the reference number, even if the longest distance L1 in the target area is less than or equal to the reference distance, and executes a division process to divide the area.

[0371] Furthermore, in Embodiment 5, the information processing unit 34 may, after determining a plurality of lower mesh networks, re-determine at least one lower mesh network using the actual communication results between the plurality of nodes 20. Specifically, if the communication status in any of the plurality of first mesh networks (lower mesh networks) does not meet predetermined conditions, the information processing unit 34 may perform a division process to divide the area corresponding to at least the first mesh network whose communication status does not meet the predetermined conditions, so as to satisfy stricter constraints than those described above.

[0372] Here, when we say that the communication status in a lower mesh network does not meet the predetermined conditions, it means, for example, that the communication status between the management node and management nodes belonging to other lower mesh networks is interrupted or is in a relatively poor state, or that there is only one node 20 belonging to the lower mesh network. In such cases, the information processing unit 34 performs a re-division process for the area corresponding to at least the lower mesh network whose communication status does not meet the predetermined conditions. At this time, the information processing unit 34 divides the area in a way that satisfies stricter constraints than the above-mentioned constraints, for example by reducing the coefficient.

[0373] Furthermore, the re-decomposition process may be performed not only on areas corresponding to lower-level mesh networks where the communication status does not meet the specified conditions, but on all areas. Alternatively, the re-decomposition process may be performed on areas corresponding to lower-level mesh networks where the communication status does not meet the specified conditions, as well as on areas surrounding those areas.

[0374] In Example 5, the information processing unit 34 performs a division process to divide areas that do not satisfy the constraints based on the result of the judgment process, but it is not limited to this. For example, the information processing unit 34 may output the result of the judgment process to the user by displaying it on the display unit 32 without performing the division process. In this case, the user can easily construct an appropriate lower-level mesh network by checking the result of the judgment process and correcting it by dividing areas that do not satisfy the constraints.

[0375] [Summary of Example 5 and its modified examples] As described above, the information terminal 30 includes an information processing unit 34 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 composed of management nodes belonging to each of the plurality of first mesh networks. The information processing unit 34 acquires area information indicating a plurality of areas in which the plurality of nodes 20 are divided into two or more nodes 20 in a space where the plurality of nodes 20 are installed. The information processing unit 34 performs a determination process to determine whether or not constraint conditions are met, including that the longest distance L1 in an area is less than or equal to a reference distance based on the communication distance between the nodes 20. A lower mesh network is an example of a first mesh network, and an upper mesh network is an example of a second mesh network.

[0376] Such an information terminal 30 can automatically determine whether an area is suitable for a lower-level mesh network based on the area set by the setter or spatial designer, thus eliminating the need for the setter or spatial designer to make a determination. In other words, such an information terminal 30 can support the setup work for constructing a hierarchical mesh network. Furthermore, such an information terminal 30 has the advantage of enabling communication with minimal packets during operation by treating, for example, the area set by the setter or spatial designer, i.e., the operational control unit, and the mesh network on the same level.

[0377] Furthermore, for example, in the determination process, if the area satisfies the constraints, the information processing unit 34 determines that the area belongs to one of several lower-level mesh networks, and if the area does not satisfy the constraints, it performs a division process to divide the area. The information processing unit 34 also determines that the divided area that satisfies the constraints belongs to one of several lower-level mesh networks.

[0378] Such an information terminal 30 can automatically determine that multiple areas, including the divided areas, are each part of multiple lower-level mesh networks, thus eliminating the need for work by the programmer or spatial designer.

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

[0380] By dividing the area into equal parts, such information terminals 30 make it difficult to construct complex lower-level mesh networks.

[0381] Furthermore, for example, in the division process, the information processing unit 34 divides the area so that the longer sides of the rectangles circumscribing the area that does not satisfy the constraints in a two-dimensional Cartesian coordinate system are divided equally.

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

[0383] For example, the longest distance L1 is the distance between the two furthest nodes 20 out of the two or more nodes 20 included in the area.

[0384] Such an information terminal 30 makes it easier to determine whether or not an area satisfies the constraints during the decision-making process.

[0385] Furthermore, for example, the constraint condition may include that the number of nodes 20 or more in an area is less than or equal to a certain number.

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

[0387] Furthermore, for example, if the communication status in any of the multiple lower mesh networks does not meet predetermined conditions, the information processing unit 34 performs a partitioning process to divide the area corresponding to at least the lower mesh network whose communication status does not meet the predetermined conditions, so as to satisfy stricter constraints than the predetermined constraints.

[0388] Such an information terminal 30 can automatically determine, based on the actual communication conditions, that multiple areas, including the divided area, will each be part of multiple lower-level mesh networks.

[0389] Furthermore, the communication system 10 includes the information terminal 30 described above 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 an area set by the setter or spatial designer, thus eliminating the need for the setter or spatial designer to make such a determination. In other words, such a communication system 10 can support the setup work required to construct a hierarchical mesh network.

[0391] Additionally, for example, multiple nodes 20 may include lighting fixtures.

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

[0393] Furthermore, the information processing method is an information processing method executed by a computer for constructing a hierarchical mesh network. The hierarchical mesh network includes multiple lower mesh networks and a higher mesh network composed of management nodes belonging to each of the multiple lower mesh networks. The information processing method acquires area information for multiple areas in which multiple nodes 20 are divided into two or more nodes 20 in a space where multiple nodes 20 are installed. The information processing method performs a determination process to determine whether constraint conditions are met, including that the longest distance L1 in an area is less than or equal to a reference distance based on the communication distance between nodes 20.

[0394] This information processing method automatically determines whether an area is suitable for a lower-level mesh network based on the area defined by the setter or spatial designer, thus eliminating the need for the setter or spatial designer to make that determination. In other words, this information processing method can support the setup work required to construct a hierarchical mesh network.

[0395] Furthermore, the program causes one or more processors to execute the above-described 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 defined by the programmer or spatial designer, thus eliminating the need for the programmer or spatial designer to make that determination. In other words, such a program can assist in the configuration process for building a hierarchical mesh network.

[0397] [Example 6] Example 6 describes a method for determining the management node for each of the multiple lower-level mesh networks. In Example 6, it is assumed that all nodes 20 belong to one of the multiple lower-level mesh networks. Also, in Example 6, "communication possible" means that nodes 20 can communicate directly with each other without going through other nodes 20.

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

[0399] As shown in Figure 34(a), first, when the operation reception unit 31 of the information terminal 30 receives a predetermined operation from the user, the information processing unit 34 of the information terminal 30 determines the first management node, which is the management node of one of the multiple lower mesh networks (first mesh network) among the multiple nodes 20 (S121). The first management node is the node that serves as the starting point for subsequent processing and is also called the "start node".

[0400] Specifically, the user selects a node 20 in an arbitrary lower-level mesh network while viewing multiple 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] Furthermore, it is preferable to designate the node 20 belonging to the sub-mesh network located at the outermost edge of the space as the first management node. Alternatively, it is preferable to designate the node 20 closest to the center among the multiple nodes 20 belonging to that sub-mesh network as the first management node. In addition, the sub-mesh network closest to the center of the space, and the node 20 closest to the center among the multiple nodes 20 belonging to that sub-mesh network, may also be designated as the first management node. If the first management node is determined as described above, it is expected that the time required to determine the management node for all sub-mesh networks will be reduced.

[0402] Next, the information processing unit 34 of the information terminal 30 transmits origin determination information to the node 20 that has been determined to be the first management node (S122). The origin determination information includes information necessary for the node 20 to function as a management node. The origin determination information also includes a command to cause the node 20 to perform the search process and determination process described later as the first management node.

[0403] Once node 20, which has been determined to be the first management node, acquires the origin determination information, node 20 subsequently functions as both a management node and the first management node of the lower mesh network to which it belongs.

[0404] Next, the first management node performs the search process and the decision process. The search process and the decision process are performed by an information processing unit (not shown) located in node 20, which is the management node (first management node). The information processing unit is implemented, for example, by a microcomputer, but may also be implemented by a processor or dedicated circuit. The functions of the information processing unit are realized by the hardware, such as a microcomputer or processor constituting the information processing unit, executing a computer program (software) stored in a memory unit (not shown) located in the management node. The search process and the decision process are automatically performed by node 20 (the first management node) once it has acquired the starting point determination information and is functioning as the first management node.

[0405] The search process is the 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 first management node (in this case) belongs, and to which communication is possible. "Searching for nodes" here means searching for nodes 20 that will send a response signal by broadcasting a request signal that requests a response signal. Since one or more lower mesh networks adjacent to the lower mesh network to which the node 20 executing the search process belongs are known, the request signal may also be multicast by specifying the network ID of one or more adjacent lower mesh networks. If a candidate for the management node is predetermined, the request signal may also be unicast by specifying the address information of that candidate. The response signal includes a command to request the strength of the received signal (e.g., RSSI value) upon receiving the request signal.

[0406] Node 20, belonging to another lower-level mesh network, that receives a request signal will send a response signal containing information indicating the signal strength to the management node (in this case, the first management node) that performs the search process, if the signal strength of the received request signal is above a certain value. Alternatively, Node 20 that receives a request signal may send a response signal to the management node that performs the search process, regardless of the signal strength of the received request signal.

[0407] The decision process is the process of determining a second management node, which is the management node of another lower-level mesh network (first mesh network), from the one or more nodes 20 discovered in the search process, based on their communication status. In other words, the decision process is the process of determining the node 20 that has a good communication status with the management node, among the one or more nodes 20 that belong to another lower-level mesh network and can communicate with the management node that performs the search process, as the management node (second management node) of the other lower-level mesh network.

[0408] Here, "communication status" refers to the state of communication between the management node executing the search process and one or more nodes 20 discovered during the search process. In Example 6, the communication status is represented by the strength of the radio waves (in this case, the RSSI value) of the signals (request signals) received by each of the one or more nodes 20 during the search process. In other words, the larger the RSSI value, the better the communication status, and the smaller the RSSI value, the worse the communication status.

[0409] In Example 6, the information processing unit of the management node determines, in the decision process, that node 20, which has returned the RSSI value closest to the reference RSSI value, will be the management node of another lower mesh network. The reference RSSI value is an RSSI value obtained by adding a predetermined value to an RSSI value that ensures reliable communication performance between the management node and node 20. By determining the management node of another lower mesh network in this way, it is possible to prevent multiple management nodes from being too close to each other.

[0410] Furthermore, the information processing unit of the management node may, in the decision-making process, determine, for example, that node 20 that has returned the largest RSSI value to be the management node of the other lower mesh network. Alternatively, the information processing unit of the management node may, in the decision-making process, determine, among the nodes 20 that have an RSSI value equal to or greater than the reference RSSI value, the node 20 closest to the center of the other lower mesh network to be the management node.

[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-level mesh networks (S131). Then, from the one or more nodes 20 that were searched, the information processing unit of the first management node determines the management node (second management node) of the other lower-level mesh network based on the communication status (S132).

[0412] Next, the information processing unit of the first management node transmits management node determination information to node 20, which has been determined to be the second management node (S133). The management node determination information includes information necessary for node 20 to function as a management node. The management node determination information also includes instructions for node 20 to perform search processing and determination processing as the second management node.

[0413] Node 20, having been designated as the second management node, acquires management node determination information, and thereafter functions as both a management node and a second management node in the other lower mesh networks to which it belongs.

[0414] The information processing unit of the second management node, determined by the decision process, then performs the search process and decision process, similar to the first management node. In other words, the information processing unit of the second management node performs steps S131 to S133 shown in Figure 34(b). This series of processes is repeated until a management node (either the first or second management node) is determined for all lower-level mesh networks.

[0415] In this case, the information processing unit of the management node may search for multiple other lower-level mesh networks during the search process. In this case, the information processing unit of the management node determines a second management node for each other lower-level mesh network during the decision process. When multiple second management nodes are determined in this way, the multiple second management nodes each execute the search process in a predetermined order. In Example 6, if there are multiple other lower-level mesh networks (first mesh networks), in other words, if multiple second management nodes are determined, the search process is executed in order from the second management node with the smallest hop count from the first management node.

[0416] Furthermore, if multiple second management nodes are determined, the search process may be executed in order, for example, starting with the second management node with the strongest signal strength of the received request signal. Alternatively, if multiple second management nodes are determined, the search process may be executed in order, for example, starting with the second management node that received the response signal earliest.

[0417] As shown in Figure 34(a), the information processing unit 34 of the information terminal 30 waits until a management node is determined for all lower-level mesh networks (No in S123). The information processing unit 34 of the information terminal 30 may also display the progress status on the display unit 32 while waiting for the management node to be determined. This allows the user to move around and check the progress status while working until the management node is determined.

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

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

[0420] Here, a specific example of the process of determining the management node for each of the multiple lower-level mesh networks will be explained using Figures 35 to 38. Figure 35 is a diagram showing the first process of the search and determination process in Example 6. Figure 36 is a diagram showing the second process of the search and determination process in Example 6. Figure 37 is a diagram showing the third process of the search and determination process in Example 6. Figure 38 is a diagram showing the fourth process of the search and determination process in Example 6.

[0421] Figures 35 to 38 all correspond to plan views of the space where multiple nodes 20 are arranged. In Figures 35 to 38, the white circles indicate the location of the node 20, and the black circles indicate the location of the management node. In addition, in Figures 35 to 38, the sub-mesh network to which each of the multiple nodes 20 belongs is associated with its respective two-dimensional coordinates. In the example shown in Figures 35 to 38, each node 20 belongs to one of the eight sub-mesh networks Nw1 to Nw8.

[0422] In the first process shown in Figure 35, the information terminal 30 determines that node N21 of the lower mesh network Nw1 is the first management node. Node N21 performs the search process and the determination process. In Figure 35, the solid circle surrounding node N21 indicates that node N21 is the first management node. The solid curve in Figure 35 represents the boundary between the communication range and the non-communication range of node N21. Therefore, in the first process shown in Figure 35, one or more nodes 20 located on the node N21 side of the solid curve in the lower mesh network Nw2, and one or more nodes 20 located on the node N21 side of the solid curve in the lower mesh network Nw3 are searched for by node N21's search process.

[0423] In the first process shown in Figure 35, node N21, through a decision process, determines that node N22 is the second management node of the lower mesh network Nw2, out of the one or more nodes 20 belonging to the lower mesh network Nw2 that were discovered in the search process. Furthermore, node N21 determines that node N23 is the second management node of the lower mesh network Nw3, out of the one or more nodes 20 belonging to the lower mesh network Nw3 that were discovered in the search process.

[0424] In the second process shown in Figure 36, of the two second management nodes (nodes N22 and N23), node N22 performs the search process first, followed by node N23. In Figure 36, the solid circle surrounding node N22 indicates that node N22 is the second management node that first performs the search process. The solid curve in Figure 36 represents the boundary between the communication range and the non-communication range of node N22. Similarly, the dotted circle surrounding node N23 indicates that node N23 is the second management node that next performs the search process. The dotted curve in Figure 36 represents the boundary between the communication range and the non-communication range of node N23.

[0425] In the second process shown in Figure 36, in each of the lower mesh networks Nw4, Nw5, and Nw6, where the management node is undecided, one or more nodes 20 located on the side of the solid line curve towards node N22 are searched by node N22's search process. Then, in the second process shown in Figure 36, node N22, through its decision process, determines that node N24 is the second management node of lower mesh network Nw4, out of the one or more nodes 20 belonging to lower mesh network Nw4 that were searched in the search process. Also, through its decision process, node N22 determines that node N25 is the second management node of lower mesh network Nw5, out of the one or more nodes 20 belonging to lower mesh network Nw5 that were searched in the search process. Also, through its decision process, node N22 determines that node N26 is the second management node of lower mesh network Nw6, out of the one or more nodes 20 belonging to lower mesh network Nw6 that were searched in the search process.

[0426] Next, node N23 performs the search process. However, in the second process shown in Figure 36, node N23 cannot find one or more nodes 20 belonging to the lower mesh network where the management node is undecided. Therefore, node N23 does not perform the decision process.

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

[0428] In the third process shown in Figure 37, in the lower mesh network Nw7 where the management node is undecided, one or more nodes 20 located on the side of the solid line curve towards node N25 are searched by node N25's search process. Then, in the third process shown in Figure 37, node N25, through its decision process, determines that node N27 is the second management node of the lower mesh network Nw7 from among the one or more nodes 20 belonging to the lower mesh network Nw7 that were searched in the search process.

[0429] Next, nodes N26 and N24 perform the search process in this order. However, in the second process shown in Figure 37, neither node N26 nor node N24 can find one or more nodes 20 belonging to the lower mesh network where the management node is undecided. Therefore, neither node N26 nor node N24 performs the decision process.

[0430] In the fourth process shown in Figure 38, node N27, the second management node, is executing the search process. In Figure 38, the solid circle surrounding node N27 indicates that node N27 is the second management node that executes the search process. The solid curve in Figure 38 represents the boundary between the communication range and the non-communication range of node N27.

[0431] In the fourth process shown in Figure 38, in the lower mesh network Nw8 where the management node is undecided, one or more nodes 20 located on the side of the solid line curve towards node N27 are searched by node N27's search process. Then, in the fourth process shown in Figure 38, node N27, through its decision process, determines node N28 as the second management node of the lower mesh network Nw8 from among the one or more nodes 20 belonging to the lower mesh network Nw8 that were searched in the search process. Through this 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 Embodiment 6, the communication system 10 (information processing method) performs a search process and a decision process by the first management node, and a search process and a decision process by the second management node.

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

[0434] Furthermore, since this communication system 10 (information processing method) determines the management node of each lower mesh network while actually communicating between the nodes 20, it is easier to guarantee that communication is possible between the management nodes.

[0435] [Modified Example 6] In Example 6, the information processing unit of the management node (first management node or second management node) refers only to 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 status during the decision process, but is not limited to this. For example, the information processing unit of the management node may further refer to the RSSI value estimated from the distance between the management node and the one or more nodes 20 that were searched as the communication status.

[0436] Specifically, in the decision process, among one or more nodes 20, nodes 20 whose difference between the radio wave intensity (RSSI value) and the radio wave intensity (RSSI value) estimated from the distance between nodes is greater than or equal to a predetermined value may not be selected as the second management node. Here, the RSSI value estimated from the distance between nodes is not the RSSI value of the signal actually received by node 20, but rather the ideal RSSI value estimated from the distance between the management node and node 20, assuming no obstacles exist. Therefore, if the above difference is greater than or equal to a predetermined value, it is considered that the communication state is not very good due to the presence of obstacles between the management node and node 20, and thus nodes 20 with such inadequate communication can be excluded from the candidates for the second management node.

[0437] Furthermore, for example, the information processing unit of the management node may, in the decision process, refer to the distance between the management node and one or more of the searched nodes 20 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 decision process, the node 20 whose distance is closest to the reference distance based on the communication distance between nodes (see Example 5) may be determined as the second management node. In this case, the node 20 whose communication state with the management node is appropriate can be determined as the second management node.

[0438] Furthermore, in Example 6, the second management node may function as a provisional second management node at the time of its determination, and then be formally designated as a second management node once it meets certain conditions. Below, we will describe the first and second examples of methods for determining such a second management node.

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

[0440] The following will explain a specific example using Figure 36. In this first example, unlike in Example 6, the second management node will perform the decision process regardless of whether a management node has already been determined in the lower mesh network explored in the exploration process. In Figure 36, after node N22 has determined node N24 to be the second management node of the lower mesh network Nw4 through the decision process, node N23 will perform the exploration process and the decision process. Here, let's assume that node N23 has determined node 20, other than node N24, to be the second management node of the lower mesh network Nw4 through the decision process. In this case, if the communication status of node 20 is better than that of node N24 (for example, a larger RSSI value), node 20 will be updated to be the second management node of the lower mesh network Nw4. In this case, in any lower mesh network, node 20 with an appropriate communication status with the management nodes of other lower mesh networks can be determined to be the management node of that lower mesh network.

[0441] In the second example, after determining multiple management nodes corresponding to each of the multiple lower-level mesh networks (first mesh network) (i.e., determining the management nodes for all lower-level mesh networks), the determination results for the multiple management nodes, including their communication status, are output. The determination results are then displayed on the display unit 32 of the information terminal 30, and presented to the user who made the configuration.

[0442] The following specific examples will be explained using Figure 39. Figure 39 shows an example of the output screen in a modified version of Example 6. In the output screen of Figure 39, a plan view of the space in which multiple nodes 20 are arranged is displayed. The white circles indicate the positions of the nodes 20, and the black circles indicate the positions of the management nodes. In addition, in the output screen of Figure 39, the rectangular frame indicates that two or more nodes 20 enclosed by the frame belong to the same lower-level mesh network.

[0443] Furthermore, in the output screen of Figure 39, bidirectional arrows indicate the communication status between management nodes. In the example shown in Figure 39, solid arrows indicate good communication status between management nodes (relatively high RSSI value), while dashed arrows indicate poor communication status (relatively low RSSI value). Note that the communication status may also be indicated by the line type of the arrow, the thickness of the arrow, etc. Additionally, the communication status may be indicated numerically.

[0444] The configurator checks the decision results displayed on the output screen, and if there are no problems, performs the operation to formally designate each management node. On the other hand, if the configurator determines that there is a problem with the communication status between some management nodes, they perform the operation to update the other nodes 20 to management nodes. In this way, in the second example, the configurator can optimize the communication status between each management node by appropriately changing the management nodes while checking the decision results.

[0445] The determination results are not limited to a plan view as shown in Figure 39; for example, they may be displayed on the display unit 32 of the information terminal 30 as a matrix table showing the RSSI values ​​between each management node.

[0446] Furthermore, in Embodiment 6, both the first and second management nodes autonomously perform the search and decision processes, but this is not limited to this. For example, both the first and second management nodes may perform the search and decision processes in accordance with commands from the information terminal 30.

[0447] [Summary of Example 6 and its modified examples] As explained above, the information processing method is an information processing method for constructing a hierarchical mesh network, which is executed by a computer. The hierarchical mesh network includes a plurality of first mesh networks and a second mesh network composed of management nodes belonging to each of the plurality of first mesh networks. The information processing method causes a first management node, which is the management node of one of the plurality of first mesh networks, to perform a search process and a decision process. The search process is the process of searching for one or more nodes 20 that belong to a first mesh network other than the first mesh network in question and are able to communicate. The decision process is the process of determining a second management node, which is the management node of another first mesh network, from the one or more nodes 20 that were searched, based on the communication status. The information processing method causes the second management node to perform the search process and the decision process. A lower mesh network is an example of a first mesh network, and a higher mesh network is an example of a second mesh network.

[0448] With this information processing method, the administrator can automatically determine the management node for each lower-level mesh network simply by performing a predetermined operation on the information terminal 30, reducing the effort required for the administrator to determine the management node for each lower-level 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 status is the signal strength of the signal received by each of the 20 or more nodes during the search process.

[0450] In this information processing method, node 20, which has an appropriate communication status with the management node that performs the search process, can be determined to be the second management node of another lower-level mesh network.

[0451] Furthermore, for example, in the decision process, among one or more nodes 20, any node where the difference between the radio wave intensity and the radio wave intensity estimated from the distance between the nodes 20 is greater than or equal to a predetermined value is not designated as the second management node.

[0452] This information processing method allows for the exclusion of node 20, whose communication status with the management node performing the search process is inappropriate due to, for example, the presence of an obstacle, from being considered as a candidate for the second management node of other lower-level mesh networks.

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

[0454] In this information processing method, node 20, which has an appropriate communication status with the management node that performs the search process, can be determined to be the second management node of another lower-level mesh network.

[0455] Furthermore, if, for example, multiple other lower-level mesh networks exist, the search process will be executed sequentially, starting with the second management node, which has the fewest hops from the first management node.

[0456] This type of information processing method makes it easier to efficiently determine the management node for all lower-level mesh networks.

[0457] Furthermore, for example, if, after the second management node has been determined, a node 20 with better communication status than the second management node is found in the lower mesh network to which the second management node belongs, that node 20 is updated as the management node of the lower mesh network.

[0458] In this information processing method, in any lower-level mesh network, a node 20 whose communication status with the management nodes of other lower-level mesh networks is appropriate can be determined as the management node of that lower-level mesh network.

[0459] Furthermore, for example, when determining multiple management nodes corresponding to each of multiple lower-level mesh networks, the system outputs the determination results for those multiple management nodes, including their communication status. Outputting the determination results here includes both presenting (displaying) the determination results and outputting them as data.

[0460] With this type of information processing method, for example, the person configuring the system can optimize the communication state between management nodes by appropriately changing the management nodes while confirming the decision results.

[0461] Furthermore, the program causes one or more processors to execute the above-described information processing method.

[0462] Such a program allows the administrator to automatically determine the management node for each lower-level mesh network simply by performing a predetermined operation on the information terminal 30, thereby reducing the effort required for the administrator to determine the management node for each lower-level mesh network. In other words, such a program can assist in the configuration work required to build a hierarchical mesh network.

[0463] Furthermore, the communication system 10 includes an information terminal 30 equipped with an information processing unit 34 that performs 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 a higher mesh network composed of management nodes belonging to each of the plurality of lower mesh networks. The information processing unit 34 determines a first management node, which is the management node of one of the plurality of lower mesh networks among the plurality of nodes 20. The first management node among the plurality of nodes 20 performs a search process and a decision process. The search process is the process of searching for one or more nodes 20 that belong to other lower mesh networks different from the lower mesh network in question and that can communicate. The decision process is the process of determining a second management node, which is the management node of another lower mesh network, from the one or more nodes 20 that were searched, based on the communication status. The second management node among the plurality of nodes 20 performs the search process and the decision process.

[0464] Such a communication system 10 allows the administrator to automatically determine the management node for each lower-level mesh network simply by performing a predetermined operation on the information terminal 30, thereby reducing the effort required for the administrator to determine the management node for each lower-level mesh network. In other words, such a communication system 10 can support the configuration work for building a hierarchical mesh network.

[0465] Additionally, for example, multiple nodes 20 may include lighting fixtures.

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

[0467] Furthermore, node 20 is a node used in the above-mentioned communication system 10, and if it is the first management node or the second management node, it performs the search process and the decision process.

[0468] In such a node 20, the administrator can automatically determine the management node for each lower-level mesh network simply by performing a predetermined operation on the information terminal 30, reducing the effort required for the administrator to determine the management node for each lower-level mesh network. In other words, such a node 20 can support the configuration work required to build a hierarchical mesh network.

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

[0470] Examples 1 to 6 of the above embodiments should be recognized not as independent embodiments, but as interrelated embodiments, and the present invention includes an invention that can be realized by arbitrarily combining the contents described in Examples 1 to 6. For example, the processing related to the display of the lower mesh network and management node described in Example 1 (such as the processing of highlighting the management node on the display screen) may be combined with Examples 2 to 6.

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

[0472] Furthermore, the present invention may be implemented as an information terminal that performs all of the methods for determining the lower mesh network and the management node as described in the above embodiments. In this case, the choice of which method for determining the lower mesh network and the management node is adopted is determined, for example, by the operator's actions.

[0473] Furthermore, a priority order may be assigned to each of the methods for determining multiple lower-level mesh networks, and the information terminal may sequentially execute the lower-level mesh network determination method according to the priority order until the determined lower-level mesh network satisfies predetermined requirements. Similarly, a priority order may be assigned to each of the methods for determining multiple management nodes, and the information terminal may sequentially execute the management node determination method according to the priority order until the determined management node satisfies predetermined requirements. In this case, the priority order may be determined, for example, by the operator's actions, but may also be predetermined by the designer.

[0474] Furthermore, although the above embodiment described a communication system based on the premise that one lower-level mesh network contains only one management node, a single lower-level mesh network may contain multiple management nodes.

[0475] Furthermore, in the above embodiment, it was explained that nodes before joining the mesh network periodically transmit beacon signals. However, the communication system may also employ a configuration in which only nodes that receive wireless communication signals from information terminals transmit signals equivalent to beacon signals. In other words, the communication system is not limited to a system in which nodes automatically transmit beacon signals.

[0476] Furthermore, although one information terminal was used to construct the hierarchical mesh network in the above embodiment, multiple information terminals may be used in combination.

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

[0478] Furthermore, in the above embodiment, a process executed by a specific processing unit may be executed by another processing unit. Also, the order of multiple processes may be changed, or multiple processes may be executed in parallel. In addition, some of the processes included in the flowchart of the above embodiment may be omitted, or new processes may be added to the flowchart of the above embodiment.

[0479] Furthermore, in the above embodiment, each component may be realized by executing a software program suitable for each component. Each component may also be realized 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 implemented by hardware. For example, each component may be a circuit (or integrated circuit). These circuits may form a single circuit as a whole, or they may be separate circuits. Also, each of these circuits may be a general-purpose circuit or a dedicated circuit. Each component may be implemented by logic circuits such as FPGAs (Field-Programmable Gate Arrays).

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

[0482] For example, the present invention may be implemented as a communication system or information terminal as described in the above embodiment, or as an information processing method executed by a computer such as an information terminal. The present invention may be implemented as a program for causing a computer to execute such an information processing method, or as a non-temporary 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 an information terminal as described in the above embodiment.

[0483] Furthermore, the present invention also includes forms obtained by applying various modifications to each embodiment that a person skilled in the art could conceive, or forms realized by arbitrarily combining the components and functions of each embodiment without departing from the spirit of the present invention. [Explanation of Symbols]

[0484] 10 Communication Systems 20 nodes 21 Wireless Communication Section 30 Information terminals 31 Operation reception section 32 Display section 33 Wireless Communication Section 34 Information Processing Section 35 Storage section

Claims

1. It includes an information processing unit that performs information processing to construct a hierarchical mesh network, The hierarchical mesh network includes a plurality of first mesh networks and a second mesh network composed of management nodes belonging to each of the plurality of first mesh networks. The aforementioned information processing unit, Obtaining placement information that shows the arrangement of multiple nodes, Obtain range information indicating multiple ranges for the arrangement of the multiple nodes indicated by the arrangement information, and reference position information indicating a reference position in each of the multiple ranges, Based on the acquired placement information and the acquired range information, it is determined which of the plurality of first mesh networks each of the plurality of nodes belongs to. Based on the acquired placement information, acquired range information, and acquired reference position information, multiple management nodes are determined from among the multiple nodes. Information terminal.

2. The information processing unit determines, as the management node, the node closest to the reference position among the nodes belonging to the same first mesh network determined based on the acquired placement information and the acquired range information. The information terminal according to claim 1.

3. The aforementioned information processing unit, By applying the multiple ranges to the arrangement of the multiple nodes indicated by the acquired arrangement information, it is determined which of the multiple first mesh networks each of the multiple nodes belongs to. In the state after the above fitting has been performed, the node closest to the reference position among the nodes belonging to the same first mesh network is determined to be the management node. The information terminal according to claim 2.

4. Each of the aforementioned multiple first mesh networks has a requirement regarding the number of nodes that can belong to that first mesh network. The information processing unit has a function to notify that, after the application of the multiple ranges has been performed, there is a first mesh network among the multiple first mesh networks that does not satisfy the requirements. The information terminal according to claim 3.

5. The information processing unit provides the notification by displaying the range representing the first mesh network that does not satisfy the requirements among the multiple ranges in a different manner from the other ranges. The information terminal according to claim 4.

6. The information processing unit has a function to notify that, after the application of the multiple ranges has been performed, there is a node among the multiple nodes that does not belong to any of the multiple ranges. An information terminal according to any one of claims 3 to 5.

7. Each of the aforementioned ranges is a square. An information terminal according to any one of claims 1 to 6.

8. Each of the aforementioned ranges is a hexagon. An information terminal according to any one of claims 1 to 6.

9. The multiple reference positions indicated by the aforementioned reference position information correspond to the vertices of an equilateral triangle in their positional relationship. An information terminal according to any one of claims 1 to 8.

10. The multiple reference positions indicated by the aforementioned reference position information have a positional relationship that corresponds to the vertices of a square. An information terminal according to any one of claims 1 to 9.

11. The aforementioned information processing unit, The aforementioned multiple ranges are expanded or reduced, The acquired placement information indicates the arrangement of the multiple nodes, to which of the multiple first mesh networks each node belongs, by applying the multiple ranges after scaling them up or down. An information terminal according to any one of claims 1 to 10.

12. In the expansion of the aforementioned ranges, an upper limit is set. The aforementioned upper limit is determined based on the distance over which the management node can communicate with other management nodes. The information terminal according to claim 11.

13. The expansion or contraction of the aforementioned ranges is performed automatically based on the acquired arrangement information. The information terminal according to claim 11 or 12.

14. The expansion or contraction of the aforementioned ranges is permitted on the condition that each of the aforementioned ranges is located within a single aforementioned reference position. An information terminal according to any one of claims 11 to 13.

15. The information processing unit extends or shortens the distance between the plurality of reference positions independently of the plurality of ranges, while maintaining the positional relationship between the plurality of reference positions. Extending or shortening the distance between multiple reference positions is permitted on the condition that each of the multiple ranges contains only one reference position. An information terminal according to any one of claims 1 to 14.

16. The expansion or contraction of the aforementioned ranges is performed while maintaining the positional relationship between the aforementioned ranges and the aforementioned reference positions. An information terminal according to any one of claims 11 to 13.

17. Furthermore, the system includes a display unit that displays the arrangement of the plurality of nodes indicated by the arrangement information, the plurality of ranges, and the reference position. An information terminal according to any one of claims 1 to 16.

18. Furthermore, the system includes a display unit that displays the determined location 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 17.

19. Only a portion of the multiple ranges is displayed on the display unit, in accordance with the shape of the display unit. The information terminal according to claim 17 or 18.

20. The information processing unit has a function to determine which of the multiple first mesh networks each node belongs to. An information terminal according to any one of claims 1 to 19.

21. An information terminal according to any one of claims 1 to 20, comprising the plurality of nodes Communication system.

22. The aforementioned multiple nodes include lighting fixtures. The communication system according to claim 21.

23. A computer-based information processing method for constructing a hierarchical mesh network, The hierarchical mesh network includes a plurality of first mesh networks and a second mesh network composed of management nodes belonging to each of the plurality of first mesh networks. The aforementioned information processing method is Obtaining placement information that shows the arrangement of multiple nodes, Obtain range information indicating multiple ranges for the arrangement of the multiple nodes indicated by the arrangement information, and reference position information indicating a reference position in each of the multiple ranges, Based on the acquired placement information and the acquired range information, it is determined which of the plurality of first mesh networks each of the plurality of nodes belongs to. Based on the acquired placement information, acquired range information, and acquired reference position information, multiple management nodes are determined from among the multiple nodes. Information processing methods.

24. A program for causing the computer to execute the information processing method described in claim 23.

Images