A multi-level management system for smart campus clocks

Abstract

The present invention belongs to the technical field of intelligent clock management systems. The present invention discloses a multi-level management system for campus intelligent clocks, including: an initial network construction module for initially establishing connections between the main server and each node; a node grouping module for clustering and grouping nodes according to building and grade information; a priority network construction module for optimizing the network structure using the marking method of relay nodes and affiliated child nodes; a network node monitoring module for real-time monitoring of the status of each node in the network and marking unqualified nodes; and a network node optimization module for optimizing and adjusting the network according to the nodes to be optimized. In this way, the present invention can achieve a stable and efficient campus intelligent clock network, reduce the load on the main server, improve network communication efficiency, and at the same time monitor and optimize the nodes, maintaining the stability of the priority communication network structure and improving and enhancing the communication quality of the network.

Description

Technical Field

[0001] The present invention relates to the field of intelligent clock management systems, and more specifically, to a multi-level management system for campus intelligent clocks. Background Art

[0002] In the construction of smart campuses, it is the general trend to use modern information technology means to improve the efficiency of education and teaching, optimize management processes, and enhance the management efficiency of educational resources. Currently, as an infrastructure, campus clocks play a very important role in curriculum arrangement, student schedules, and daily management. With the development of information technology, how to use modern means to achieve intelligent management of campus clocks, improve management efficiency and accuracy, has become an important topic.

[0003] Most existing intelligent clock management methods are based on a flat network structure, that is, all clock devices are equally connected to the same network. However, this management method is difficult to achieve ideal results in the face of large-scale and complex campus environments: on the one hand, the upper limit of the number of nodes in the flat network structure is limited and cannot meet the needs of large-scale intelligent clock management; on the other hand, each clock device in the network may affect the communication quality of the entire network when sending or receiving information.

[0004] Therefore, it is necessary to build a new network structure to hierarchically manage campus clocks. For large-scale and complex campus environments, to achieve efficient and accurate control and management of intelligent clocks, thereby improving network communication quality. Summary of the Invention

[0005] In order to overcome the problem that the existing technology may lead to poor network communication quality, the present invention proposes a multi-level management system for campus intelligent clocks to solve the above problems.

[0006] The present invention provides the following technical solutions:

[0007] A multi-level management system for campus intelligent clocks, comprising:

[0008] An initial network construction module, configured to set each clock as a corresponding node, establish a connection between the main server and the nodes, and an inter-node connection to obtain an initial communication network;

[0009] A node grouping module, configured to set an attribution information for each node through the initial communication network, the attribution information including building information and grade information, and divide the nodes according to the same building or the same grade to obtain node sets;

[0010] A priority network construction module, which is used to mark the nodes in the node set as relay nodes or the affiliated child nodes corresponding to the relay nodes through a node marking method; construct a priority communication network, where the priority communication network consists of the connections between the main server and the relay nodes, the mutual connections between the relay nodes, and the connections between the relay nodes and their affiliated child nodes;

[0011] A network node monitoring module, including a relay node monitoring unit and an affiliated child node monitoring unit, which is used to monitor the nodes in the priority communication network. The relay node monitoring unit is used to obtain relay information for the nodes marked as relay nodes by using a relay communication acquisition method, and judge whether the relay nodes are qualified according to the node relay information; if the judgment result is unqualified, set the relay nodes as relay nodes to be optimized;

[0012] The affiliated child node monitoring unit is used to obtain sub-communication information and judge whether the affiliated child nodes are qualified according to the sub-communication information; if the judgment result is unqualified, set the affiliated child nodes as affiliated child nodes to be optimized;

[0013] A network node optimization module, which is used to optimize the priority communication network according to the relay nodes to be optimized and optimize the priority communication network according to the affiliated child nodes to be optimized.

[0014] Preferably, the steps of the node marking method include:

[0015] S1. Control the main server to send test packets to each node in the node set, and record the transmission delay of the test packets as the main delay data corresponding to the nodes;

[0016] S2. Control each node in the node set to send test packets to other clocks respectively, and record the transmission delay of the data packets between the nodes as the mutual delay data;

[0017] S3. Preset the maximum marking quantity BJM that needs to be marked as relay nodes;

[0018] S4. Set the marking quantity BJ, and initialize the value of BJ to 1;

[0019] S5. Select the BJ nodes with the smallest main delay data as the initial center points;

[0020] S6. According to the BJ initial center points and the mutual delay data, calculate BJ node groups and the corresponding center nodes, and at the same time calculate the measurement index according to the BJ node groups and the corresponding center nodes and stamp the measurement index with a time stamp, and calculate the measurement change rate according to the measurement index;

[0021] S7. Increment the value of BJ by 1, and return to step S5 until the measurement change rate is less than the preset change threshold or the value of BJ is greater than BJM;

[0022] S8. Mark the latest obtained central node as the relay node, and mark the other nodes within the node group corresponding to the central node as the affiliated sub-nodes corresponding to the relay node.

[0023] Preferably, the calculating of the BJ node groups and the corresponding central nodes according to the BJ initial central points and the mutual delay data includes:

[0024] Set a corresponding temporary group for each of the BJ initial central points;

[0025] Obtain the mutual delay data of each node to the BJ initial central points, and assign each node to the temporary group corresponding to the initial central point with the minimum mutual delay data;

[0026] Calculate the comprehensive index of each node in the temporary group, and select the node with the minimum comprehensive index as the new center of the temporary group;

[0027] After selecting the new centers for all the temporary groups, use the temporary groups as the node groups and use the new centers as the central nodes of the node groups.

[0028] Preferably, the calculation steps of the comprehensive index include:

[0029] Obtain the number of nodes in the temporary group and denote it as m, obtain the main delay data of any node in the node group and denote it as y1, and obtain the sum of the mutual delay data with other nodes in the temporary group and denote it as y2;

[0030] Calculate the comprehensive index, and the calculation formula of the comprehensive index is In the formula, ZZ represents the comprehensive index, and e represents the natural constant.

[0031] Preferably, the calculating of the measurement index according to the BJ node groups and the corresponding central nodes includes: for each node group, add up the mutual delay data between the central node and each other node to obtain the sum of delays of the node group, and accumulate the sum of delays of all the BJ node groups to obtain the measurement index;

[0032] The calculating of the measurement change rate according to the measurement index includes:

[0033] Obtain the measurement index with the latest timestamp and denote it as h1, and obtain the measurement index with the second latest timestamp and denote it as h2, calculate the measurement change rate, and the calculation formula of the measurement change rate is hb = |(h1 - h2) / h2|, where hb represents the measurement change rate.

[0034] Preferably, the relay information includes relay delay, relay packet loss rate, relay error rate, and relay occupancy rate, and the sub-communication information includes sub-delay, sub-packet loss rate, and sub-error rate;

[0035] The process of the relay communication acquisition method includes: within a preset time, tracking and recording the data packet transmission between the master server and the node through a network monitoring tool; collecting the average transmission delay and using it as the relay delay; collecting the average packet loss rate and using it as the relay packet loss rate; collecting the average error rate and using it as the relay error rate; and collecting the occupancy rate at the node and using it as the relay occupancy rate.

[0036] The process of obtaining the sub-communication information includes: within a preset time, tracking and recording the data packet transmission between the relay node and the affiliated sub-node through a network monitoring tool; collecting the average transmission delay and using it as the sub-delay; collecting the average packet loss rate and using it as the sub-packet loss rate; and collecting the average error rate and using it as the sub-error rate.

[0037] Preferably, the determination of whether the relay node is qualified according to the node relay information includes:

[0038] Calculating a relay qualification index, and the calculation formula of the relay qualification index is:

[0039]

[0040] In the formula, JH represents the relay qualification index, jy represents the relay occupancy rate, a represents a preset occupancy coefficient and a < 0, jd represents the relay packet loss rate, jc represents the relay error rate, jy represents the relay delay, and jym represents a preset relay delay threshold;

[0041] Judging whether the relay qualification index is greater than or equal to a preset relay qualification threshold;

[0042] If so, judge that the relay node is qualified, otherwise, judge that the relay node is unqualified.

[0043] Preferably, the determination of whether the affiliated sub-node is qualified according to the sub-communication information includes:

[0044] Calculating a sub-qualification index, and the calculation formula of the sub-qualification index is:

[0045]

[0046] In the formula, ZH represents the sub-qualification index, zd represents the sub-packet loss rate, zc represents the sub-error rate, zy represents the sub-delay, and zym represents a preset sub-delay threshold;

[0047] Judging whether the sub-qualification index is greater than or equal to a preset sub-qualification threshold;

[0048] If so, judge that the relay node is qualified, otherwise, judge that the relay node is unqualified.

[0049] Preferably, the optimization of the priority communication network according to the relay node to be optimized includes:

[0050] Obtain the affiliated child nodes corresponding to the relay nodes to be optimized, use the relay communication acquisition method to obtain the relay information of the affiliated child nodes, calculate the relay qualification index according to the obtained relay information, mark the affiliated child node with the highest relay qualification index as the optimized relay node, mark other affiliated child nodes and the relay nodes to be optimized as the affiliated child nodes corresponding to the optimized relay node, disconnect the connection between the main server and the relay nodes to be optimized in the priority communication network, establish the connection between the main server and the optimized relay node in the priority communication network, and complete the optimization of the priority communication network.

[0051] Preferably, the optimization of the priority communication network according to the affiliated child nodes to be optimized includes:

[0052] Obtain the sub-communication information between the affiliated child nodes to be optimized and all relay nodes in the node set where they are located, calculate the sub-qualification index according to the obtained sub-communication information, mark the relay node with the highest sub-qualification index as the target relay node, in the optimized communication network, disconnect the communication connection between the affiliated child nodes to be optimized and the relay nodes they are currently connected to, and at the same time disconnect the connection between the affiliated child nodes to be optimized and other corresponding affiliated child nodes, establish the connection between the affiliated child nodes to be optimized and the target relay node and the affiliated child nodes corresponding to the target relay node, and complete the optimization of the priority communication network.

[0053] The present invention provides a multi-level management system for campus intelligent clocks, which has the following beneficial effects:

[0054] 1. Through the node grouping module, the clock devices within the whole school are grouped into node sets according to the physical locations of the grades or teaching buildings; then, through the priority network construction module, several relay nodes and affiliated child nodes are set for each node set; this design method allows us to achieve unified management of all classrooms in an entire node set, such as a teaching building or a grade, through the relay nodes, greatly reducing the network burden and improving the management efficiency. In addition, the main server changes from a large number of connections to a single node to connecting a limited number of relay nodes. Effectively reducing the load pressure on the main server and reducing the latency of network transmission, optimizing the communication quality and efficiency.

[0055] 2. Through the network node monitoring module, continuously monitor the performance of the relay nodes. When it is found that the performance of the relay nodes is unqualified, select a node with the best performance among its affiliated child nodes as the new relay node; at the same time, monitor the affiliated child nodes, and when it is found that the performance of the affiliated child nodes is unqualified, select a new relay node to connect; this way of fine-tuning and optimization not only maintains the stability of the priority communication network structure but also continuously improves and enhances the communication quality of the network. Description of the Drawings

[0056] Figure 1Schematic diagram of modules of a multi - level management system for a campus intelligent clock according to the present invention;

[0057] Figure 2 Schematic diagram of steps of a node marking method for a multi - level management system of a campus intelligent clock according to the present invention. Specific implementation manners

[0058] Next, the technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

[0059] Embodiment 1

[0060] Please refer to Figure 1 , in this embodiment, a multi - level management system for a campus intelligent clock includes:

[0061] An initial network construction module, configured to set each clock as a corresponding node, establish a connection between the main server and the nodes and the mutual connection between the nodes, and obtain an initial communication network;

[0062] In this embodiment, each clock is used as an independent node. These clock nodes can communicate with the main server and other nodes through built - in or external network communication modules such as Wi - Fi modules, Bluetooth modules or Ethernet interfaces. The main server can scan and identify all online clock nodes through a local area network or a wide area network and establish stable network connections with them. The clock nodes can be connected by constructing a Mesh network or other types of peer - to - peer networks. By using TCP / IP, UDP or other suitable network protocols to establish connections, an all - connected initial communication network is finally obtained.

[0063] A node grouping module, configured to set an attribution information for each node through the initial communication network, where the attribution information includes building information and grade information, and divide the nodes according to the same building or the same grade to obtain node sets;

[0064] In this embodiment, the attribution information of each node can be manually input by staff or obtained by docking with in - school systems such as the academic affairs system. Usually, in universities, nodes can be grouped according to buildings, while in primary schools, junior high schools and senior high schools, nodes can be grouped according to grades.

[0065] A priority network construction module is used to mark the nodes in the node set as relay nodes or the affiliated child nodes corresponding to the relay nodes through a node marking method; and construct a priority communication network, where the priority communication network consists of the connections between the main server and the relay nodes, the mutual connections between the relay nodes, and the connections between the relay nodes and their affiliated child nodes;

[0066] The steps of the node marking method include:

[0067] S1. Control the main server to send test packets to each node in the node set, and record the transmission delay of the test packets as the main delay data corresponding to the nodes;

[0068] S2. Control each node in the node set to send test packets to other clocks respectively, and record the transmission delay between the nodes as the mutual delay data;

[0069] S3. Preset the maximum marking quantity BJM that needs to be marked as relay nodes;

[0070] S4. Set the marking quantity BJ, and initialize the value of BJ to 1;

[0071] S5. Select the BJ nodes with the smallest main delay data as the initial center points;

[0072] S6. According to the BJ initial center points and the mutual delay data, calculate BJ node groups and the corresponding central nodes, and at the same time calculate the measurement index based on the BJ node groups and the corresponding central nodes and stamp a time stamp on the measurement index, and calculate the measurement change rate;

[0073] S7. Increment the value of BJ by 1, and return to step S5 until the measurement change rate is less than the preset change threshold or the value of BJ is greater than BJM;

[0074] S8. Mark the latest obtained central nodes as relay nodes, and mark the other nodes in the node groups corresponding to the central nodes as the affiliated child nodes corresponding to the relay nodes.

[0075] The calculation of obtaining BJ node groups and the corresponding central nodes according to the BJ initial center points and the mutual delay data includes:

[0076] Set a corresponding temporary group for each of the BJ initial center points;

[0077] Obtain the mutual delay data of each node to the BJ initial center points, and assign each node to the temporary group corresponding to the initial center point with the smallest mutual delay data;

[0078] Calculate the comprehensive index of each node in the temporary group, and select the node with the smallest comprehensive index as the new center of the temporary group;

[0079] After selecting new centers for all temporary groups, use the temporary groups as node groups and the new centers as the central nodes of the node groups.

[0080] The calculation steps of the comprehensive index include:

[0081] Obtain the number of nodes in the temporary group and denote it as m, obtain the main delay data of any node in the node group and denote it as y1, and the sum of the mutual delay data with other nodes in the temporary group and denote it as y2;

[0082] Calculate the comprehensive index. The calculation formula of the comprehensive index is In the formula, ZZ represents the comprehensive index, and e represents the natural constant.

[0083] The calculation of the measurement index based on BJ node groups and their corresponding central nodes includes: for each node group, add the mutual delay data between the central node and each other node to obtain the sum of delays of the node group, and accumulate the sum of delays of all BJ node groups to obtain the measurement index;

[0084] The calculation of the measurement change rate based on the measurement index includes:

[0085] Obtain the measurement index with the most recent timestamp and denote it as h1, and obtain the measurement index with the second most recent timestamp and denote it as h2. Calculate the measurement change rate. The calculation formula of the measurement change rate is hb = |(h1 - h2) / h2|, where hb represents the measurement change rate.

[0086] Please refer to Figure 2 , in this embodiment, in step S1, the master server sends a test packet to each node device in the node set. Subsequently, the master server records the response time after sending the packet to each node, and then sets this time as the main delay data. In step S2, each node in the node set sends test packets to other node devices respectively. The recorded delay time between the node devices is recorded as the mutual delay data. Then, in step S3, the maximum number of tags of the relay nodes is set in advance as the upper limit of the number of relay nodes in each node group, and this number can be set according to actual needs. In step S4, a tag number initially set to 1 is set.

[0087] Next, when entering step S5, the system selects, according to the main delay data, the same number of nodes with the minimum delay time as the initial center points. In step S6, according to the initial center points and the mutual delay data, the nodes in the node set are divided into multiple groups, and a central node is set for each group. Then, the system further calculates the measurement index and the measurement change rate based on the calculated node groups and central nodes; subsequently, the value of the tag number is incremented by 1, and steps S5 to S6 are repeatedly executed.

[0088] In this embodiment, a measurement index is used to represent the overall latency of a node group, and a measurement change rate is used to represent the change in the overall latency after adding a relay node. Therefore, when the measurement change rate is lower than a preset threshold, such as 0.1, that is, the change in the overall latency caused by adding a relay node is not obvious, or when the number of central nodes reaches the maximum marked number, the repeated execution of steps S5 to S6 stops.

[0089] After completing the above steps, the newly obtained central nodes will be marked as relay nodes. Non-central nodes within the same node group will be marked as corresponding affiliated sub-nodes. After a series of steps, the priority network construction module successfully constructs a priority communication network, which includes connections between the main server and relay nodes, connections between relay nodes, and connections between relay nodes and their affiliated sub-nodes. The technology used for connections between the server and nodes can be the same as that used in the initial communication network.

[0090] The network node monitoring module includes a relay node monitoring unit and an affiliated sub-node monitoring unit, and is used to monitor the nodes in the priority communication network. The relay node monitoring unit is used to obtain relay information for the nodes marked as relay nodes using the relay communication acquisition method, and determine whether the relay nodes are qualified based on the node relay information; if the judgment result is unqualified, the relay nodes will be set as relay nodes to be optimized;

[0091] The affiliated sub-node monitoring unit is used to obtain sub-communication information and determine whether the affiliated sub-nodes are qualified based on the sub-communication information; if the judgment result is unqualified, the affiliated sub-nodes will be set as affiliated sub-nodes to be optimized;

[0092] It is characterized in that the relay information includes relay latency, relay packet loss rate, relay error rate, and relay occupancy rate, and the sub-communication information includes sub-latency, sub-packet loss rate, and sub-error rate;

[0093] The process of the relay communication acquisition method includes: within a preset time, tracking and recording the data packet transmission between the main server and the nodes through a network monitoring tool; collecting the average transmission latency and using it as the relay latency; collecting the average packet loss rate and using it as the relay packet loss rate; and collecting the average error rate and using it as the relay error rate; collecting the occupancy rate at the nodes and using it as the relay occupancy rate;

[0094] The process of obtaining the sub-communication information includes: within a preset time, tracking and recording the data packet transmission between the relay node and the affiliated sub-node through a network monitoring tool; collecting the average transmission latency and using it as the sub-latency; collecting the average packet loss rate and using it as the sub-packet loss rate; and collecting the average error rate and using it as the sub-error rate.

[0095] Determining whether a relay node is qualified based on node relay information includes:

[0096] Calculating a relay qualification index, and the calculation formula of the relay qualification index is:

[0097]

[0098] In the formula, JH represents the relay qualification index, jy represents the relay occupancy rate, a represents a preset occupancy coefficient and a < 0, jd represents the relay packet loss rate, jc represents the relay error rate, jy represents the relay delay, and jym represents a preset relay delay threshold;

[0099] Judging whether the relay qualification index is greater than or equal to a preset relay qualification threshold;

[0100] If so, judge that the relay node is qualified; otherwise, judge that the relay node is unqualified.

[0101] Determining whether an affiliated sub-node is qualified based on sub-communication information includes:

[0102] Calculating a sub-qualification index, and the calculation formula of the sub-qualification index is:

[0103]

[0104] In the formula, ZH represents the sub-qualification index, zd represents the sub-packet loss rate, zc represents the sub-error rate, zy represents the sub-delay, and zym represents a preset sub-delay threshold;

[0105] Judging whether the sub-qualification index is greater than or equal to a preset sub-qualification threshold;

[0106] If so, judge that the relay node is qualified; otherwise, judge that the relay node is unqualified.

[0107] In an embodiment, we constructed a network node monitoring module to ensure the stability and reliability of nodes in the priority communication network. This module consists of two main monitoring units: the relay node monitoring unit and the affiliated sub-node monitoring unit, which each have different functions and monitoring methods.

[0108] First, the relay node monitoring unit collects necessary information about the relay node by using a preset relay communication acquisition method, including relay delay, relay packet loss rate, relay error rate, and relay occupancy rate. When implementing this process, the network monitoring tool tracks and records the packet transmission between the primary server and the relay node within a preset time. Through these records, we can collect the necessary statistical data to represent these metrics respectively, so as to evaluate the network status. For example, we record all the transmitted packets within a period of time, calculate their average transmission delay, and set this value as the relay delay; similarly, we count the packet loss rate and error rate within this period, and monitor the occupancy rate of the node, such as by detecting the time series data of the node's CPU and memory occupancy rate.

[0109] Next is the task performed by the affiliated sub-node monitoring unit. This unit also tracks the packet transmission between the relay node and the affiliated sub-node through the network monitoring tool within a preset time, performs the same data acquisition process, and collects information such as sub-delay, sub-packet loss rate, and sub-error rate.

[0110] Based on the collected relay information and sub-communication information, specific algorithms will be used to calculate the relay qualification index and the sub-qualification index. Since the relay delay reflects the speed at which packets are transmitted in the network, the smaller the delay, the higher the transmission efficiency of the relay node. The relay packet loss rate and error rate indicate the reliability of data during transmission. The lower the packet loss rate and error rate, the more reliable the data transmission of the relay node. The relay occupancy rate reflects the current load situation of the relay node. The higher the occupancy rate, it may mean that the node is too busy, thus affecting its processing speed and stability.

[0111] At the same time, as the relay node occupancy rate data is particularly important, the occupancy coefficient and the relay qualification threshold can be set based on past experience or through experiments. The relay qualification index is calculated through the above data and formula. If the calculated relay qualification index is greater than or equal to the preset relay qualification threshold, the relay node is considered qualified; otherwise, it will be marked as a relay node to be optimized. Similarly, for the affiliated sub-node, its qualification index will be calculated according to the formula, and it is judged whether the sub-node meets the preset standard based on the result. Through such a monitoring and calculation process, the nodes that may have problems in the network can be found in time, providing a reference for subsequent optimization strategies to maintain the best performance and reliability of the network.

[0112] The network node optimization module is used to optimize the priority communication network according to the relay node to be optimized and optimize the priority communication network according to the affiliated sub-node to be optimized.

[0113] In this embodiment, the relay nodes to be optimized or the affiliated sub-nodes to be optimized found in the priority communication network can be optimized by methods such as load balancing optimization, network protocol optimization, and network traffic management. Embodiment 2

[0114] Based on Embodiment 1, the optimization of the priority communication network according to the relay nodes to be optimized includes:

[0115] Obtain the affiliated sub-nodes corresponding to the relay points to be optimized, use the relay communication acquisition method to obtain the relay information of the affiliated sub-nodes, calculate the relay qualification index according to the obtained relay information, mark the affiliated sub-node with the highest relay qualification index as the optimized relay node, mark the other affiliated sub-nodes and the relay nodes to be optimized as the affiliated sub-nodes corresponding to the optimized relay node, disconnect the connection between the main server and the relay nodes to be optimized in the priority communication network, establish the connection between the main server and the optimized relay node in the priority communication network, and complete the optimization of the priority communication network.

[0116] The optimization of the priority communication network according to the affiliated sub-nodes to be optimized includes:

[0117] Obtain the sub-communication information between the affiliated sub-nodes to be optimized and all relay nodes in the node set where they are located, calculate the sub-qualification index according to the obtained sub-communication information, mark the relay node with the highest sub-qualification index as the target relay node. In the optimized communication network, disconnect the communication connection between the affiliated sub-nodes to be optimized and the relay nodes they are currently connected to, and at the same time disconnect the connection between the affiliated sub-nodes to be optimized and other corresponding affiliated sub-nodes, and establish the connection between the affiliated sub-nodes to be optimized, the target relay node, and the affiliated sub-nodes corresponding to the target relay node, and complete the optimization of the priority communication network.

[0118] In this embodiment, the optimization method for the relay nodes to be optimized is to select one of its affiliated sub-nodes as the new relay node, and the optimization method for the affiliated sub-nodes to be optimized is to select a new relay node for them. Through such optimization, on the premise that the original priority communication network structure does not change significantly, the communication efficiency and stability of the network are effectively improved.

[0119] In several embodiments provided by the present invention, it should be understood that the disclosed systems, devices, and methods can be implemented in other ways. For example, the device embodiments described above are merely illustrative. For example, the division of the units is only one way, and in actual implementation, there may be other division methods. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point, the displayed or discussed coupling or direct coupling or communication connection between each other can be through some interfaces, and the indirect coupling or communication connection of the devices or units can be in electrical, mechanical or other forms.

[0120] As described above, it is only the specific implementation manner of the present invention, but the protection scope of the present invention is not limited thereto. Any person skilled in the art within the technical scope disclosed by the present invention can easily think of changes or substitutions, which should all be covered within the protection scope of the present invention.

[0121] Finally: The above description is only the preferred embodiment of the present invention and is not used to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principle of the present invention shall be included within the protection scope of the present invention.

Claims

1. A campus smart clock multi-level management system, characterized in that: include: The initial network construction module is used to set each clock as a corresponding node, establish the connection between the main server and the node and the mutual connection between the nodes, and obtain the initial communication network; A node grouping module is used to set a belonging information for each node through the initial communication network, wherein the belonging information includes building information and grade information, and divide the nodes into node sets according to the same building or the same grade; A priority network building module is used to mark the nodes in the node set as relay nodes or as subsidiary sub-nodes corresponding to the relay nodes through a node marking method; Constructing a priority communication network, the priority communication network consisting of connections between a main server and relay nodes, mutual connections between relay nodes, and connections between relay nodes and their attached child nodes; A network node monitoring module, including a relay node monitoring unit and an attached sub-node monitoring unit, is used to monitor nodes in the priority communication network, wherein the relay node monitoring unit is used to obtain relay information of a node marked as a relay node using a relay communication acquisition method, and judge whether the relay node is qualified according to the node relay information; if the judgment result is unqualified, the relay node is set as a relay node to be optimized; The subsidiary subnode monitoring unit is used to obtain the subcommunication information and judge whether the subsidiary subnode is qualified according to the subcommunication information; if the judgment result is unqualified, the subsidiary subnode is set as the subsidiary subnode to be optimized; The network node optimization module is used to optimize the priority communication network according to the relay nodes to be optimized, and to optimize the priority communication network according to the subsidiary sub-nodes to be optimized.

2. The campus smart clock multi-level management system according to claim 1 is characterized in that: The steps of the node marking method include: S1, control the main server to send a test packet to each node in the node set, and record the transmission delay of the test packet as the main delay data corresponding to the node; S2, each node in the control node set sends a test packet to other clocks respectively, and records the transmission delay of the data packet between nodes as the mutual delay data; S3, preset the maximum number of tags BJM that need to be marked as relay nodes; S4, set the number of markers BJ, and initialize the value of BJ to 1; S5. Select BJ nodes with the smallest primary delay data as the initial center points; S6. According to the BJ initial center points and the mutual delay data, BJ node groups and corresponding center nodes are calculated. At the same time, a measurement index is calculated according to the BJ node groups and the corresponding center nodes, and a timestamp is added to the measurement index. The measurement change rate is calculated according to the measurement index. S7, add 1 to the value of BJ, and return to step S5, until the measured change rate is less than the preset change threshold or the value of BJ is greater than BJM; S8. Mark the newly obtained central node as a relay node, and mark other nodes in the node group corresponding to the central node as subsidiary sub-nodes corresponding to the relay node.

3. The campus smart clock multi-level management system according to claim 2 is characterized in that: The step of calculating BJ node groups and corresponding central nodes based on BJ initial central points and mutual delay data includes: Set a corresponding temporary group for each of the BJ initial center points; Obtain the mutual delay data from each node to BJ initial center points, and assign each node to the temporary group corresponding to the initial center point with the smallest mutual delay data; Calculate the comprehensive index of each node in the temporary group, and select the node with the smallest comprehensive index as the new center of the temporary group; After selecting new centers for all temporary groups, use the temporary groups as node groups and the new centers as the center nodes of the node groups.

4. The campus smart clock multi-level management system according to claim 3 is characterized in that: The calculation steps of the comprehensive index include: The number of nodes in the temporary group is obtained, which is recorded as m. The main delay data of any node in the node group is obtained, which is recorded as y1, and the sum of the mutual delay data with other nodes in the temporary group is recorded as y2. Calculate the comprehensive index. The calculation formula of the comprehensive index is: Wherein, ZZ represents the comprehensive index and e represents the natural constant.

5. The campus smart clock multi-level management system according to claim 4 is characterized in that: The calculation of the measurement index according to the BJ node groups and the corresponding central nodes includes: for each node group, adding the mutual delay data between the central node and each other node to obtain the sum of the delays of the node group, and accumulating the sum of the delays of all BJ node groups to obtain the measurement index; The calculation of the measurement change rate according to the measurement index includes: The measurement index with the most recent timestamp is recorded as h1, and the measurement index with the second most recent timestamp is recorded as h2, and the measurement change rate is calculated. The calculation formula of the measurement change rate is hb=|(h1-h2) / h2|, where hb represents the measurement change rate.

6. The campus smart clock multi-level management system according to claim 5 is characterized in that: The relay information includes relay delay, relay packet loss rate, relay error rate and relay occupancy rate, and the sub-communication information includes sub-delay, sub-packet loss rate and sub-error rate; The process of the relay communication acquisition method includes: tracking and recording the data packet transmission between the main server and the node through a network monitoring tool within a preset time; collecting the average transmission delay and using it as the relay delay; collecting the average packet loss rate and using it as the relay packet loss rate; and collecting the average error rate and using it as the relay error rate; collecting the occupancy rate at the node and using it as the relay occupancy rate; The process of acquiring the sub-communication information includes: tracking and recording the data packet transmission between the relay node and the attached sub-node through a network monitoring tool within a preset time; collecting the average transmission delay as a sub-delay; collecting the average packet loss rate as a sub-packet loss rate; and collecting the average error rate as a sub-error rate.

7. The campus smart clock multi-level management system according to claim 6 is characterized in that: The step of judging whether the relay node is qualified according to the node relay information includes: Calculate the relay qualification index, the calculation formula of the relay qualification index is: Wherein, JH represents the relay qualification index, jy represents the relay occupancy rate, a represents the preset occupancy coefficient and a<0, jd represents the relay packet loss rate, jc represents the relay error rate, jy represents the relay delay, and jym represents the preset relay delay threshold; Determine whether the relay qualification index is greater than or equal to a preset relay qualification threshold; If so, the relay node is judged to be qualified, otherwise, the relay node is judged to be unqualified.

8. The campus smart clock multi-level management system according to claim 7 is characterized in that: The determining whether the attached sub-node is qualified according to the sub-communication information includes: Calculate the sub-qualification index, the calculation formula of the sub-qualification index is: Where ZH represents the sub-qualified index, zd represents the sub-packet loss rate, zc represents the sub-error rate, zy represents the sub-delay, and zym represents the preset sub-delay threshold; Determining whether the sub-qualified index is greater than or equal to a preset sub-qualified threshold; If so, the relay node is judged to be qualified, otherwise, the relay node is judged to be unqualified.

9. The campus smart clock multi-level management system according to claim 8 is characterized in that: The optimizing the priority communication network according to the relay node to be optimized comprises: Obtain the subsidiary sub-node corresponding to the relay point to be optimized, use the relay communication acquisition method to obtain the relay information of the subsidiary sub-node, calculate the relay qualification index based on the obtained relay information, mark the subsidiary sub-node with the highest relay qualification index as the optimized relay node, mark the other subsidiary sub-nodes and the relay node to be optimized as the subsidiary sub-nodes corresponding to the optimized relay node, disconnect the connection between the main server and the relay node to be optimized in the priority communication network, establish the main server and the optimized relay node in the priority communication network, and complete the optimization of the priority communication network.

10. The campus smart clock multi-level management system according to claim 9 is characterized in that: The optimizing the priority communication network according to the subsidiary node to be optimized includes: Obtain the sub-communication information between the subsidiary sub-node to be optimized and all the relay nodes in the node set, calculate the sub-qualified index based on the obtained sub-communication information, record the relay node with the highest sub-qualified index as the target relay node, and in the optimized communication network, disconnect the communication connection between the subsidiary sub-node to be optimized and the relay node to which it is currently connected, and disconnect the connection between the subsidiary sub-node to be optimized and other corresponding subsidiary sub-nodes, establish the connection between the subsidiary sub-node to be optimized and the target relay node and the subsidiary sub-node corresponding to the target relay node, and complete the optimization of the priority communication network.

Images