Campus smart clock multi-level management system

Through multi-level management systems and dynamic network optimization, the problems of smart clock management and communication quality in large-scale campus environments are solved, and efficient and stable network communication is achieved.

CN119052049AActive Publication Date: 2024-11-29JIANGSU YAOLONG INFORMATION TECH CO LTD

Patent Information

Application Number
CN202410920642.7
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-10
Publication Date
2024-11-29
Estimated Expiration
2044-07-10

AI Technical Summary

Technical Problem

The existing smart clock management method is based on a planar network structure, which is difficult to meet the needs of efficient management and communication quality of large-scale campus environments, resulting in poor network communication quality.

Method used

Design a multi-level management system for campus smart clocks, establish a priority communication network through initial network construction, node grouping, priority network construction, network node monitoring and optimization modules, and optimize the network through dynamic marking and monitoring of relay nodes and subordinate child nodes. Structure to improve communication efficiency and quality.

Benefits of technology

It realizes efficient management of large-scale campus clock equipment, reduces master server load, reduces network latency, improves communication quality and efficiency, and maintains network stability and communication quality through continuous monitoring and optimization.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119052049A_ABST
    Figure CN119052049A_ABST
Patent Text Reader

Abstract

The invention belongs to the technical field of intelligent clock management systems, and discloses a campus intelligent clock multi-level management system, which comprises an initial network construction module used for initially establishing connection between a main server and each node; the node grouping module is used for carrying out cluster grouping on nodes according to building and grade information; the priority network construction module is used for optimizing a network structure by using a marking method of a relay node and an affiliated child node; the network node monitoring module is used for monitoring the state of each node in the network in real time and marking unqualified nodes; and the network node optimization module is used for optimizing and adjusting the network according to the nodes to be optimized. Through the mode, the campus smart clock network with a stable structure and high efficiency can be realized, the load of the main server is reduced, the network communication efficiency is improved, meanwhile, the nodes are monitored and optimized, the stability of the priority communication network structure is kept, and the communication quality of the network is improved and enhanced.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

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

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

[0003] Most of the existing smart 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 a large-scale and complex campus environment: on the one hand, the upper limit of the number of nodes in the flat network structure is limited, which cannot meet the needs of large-scale smart 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 result to manage campus clocks in a hierarchical manner. For large-scale and complex campus environments, smart clocks can be efficiently and accurately controlled and managed to improve the quality of network communication. Summary of the invention

[0005] In order to overcome the problem that the prior art may cause poor network communication quality, the present invention proposes a campus smart clock multi-level management system to solve the above problem.

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

[0007] A campus smart clock multi-level management system, comprising:

[0008] 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;

[0009] 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;

[0010] A priority network construction 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; construct a priority communication network, which is composed of the connection between the main server and the relay nodes, the mutual connection between the relay nodes, and the connection between the relay nodes and their subsidiary sub-nodes;

[0011] 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;

[0012] The subsidiary subnode monitoring unit is used to obtain the subcommunication information and determine whether the subsidiary subnode is qualified according to the subcommunication information; if the determination result is unqualified, the subsidiary subnode is set as the subsidiary subnode to be optimized;

[0013] 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.

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

[0015] 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;

[0016] 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;

[0017] S3, preset the maximum number of tags BJM that need to be marked as relay nodes;

[0018] S4, set the number of markers BJ, and initialize the value of BJ to 1;

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

[0020] 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.

[0021] 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;

[0022] 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.

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

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

[0025] 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;

[0026] 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;

[0027] 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.

[0028] Preferably, the step of calculating the comprehensive index includes:

[0029] 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.

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

[0031] Preferably, the step of calculating the measurement index based on 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;

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

[0033] 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.

[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: 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;

[0036] 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.

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

[0038] Calculate the relay qualification index, the calculation formula of the relay qualification index is:

[0039]

[0040] 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;

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

[0042] If so, the relay node is judged to be qualified, otherwise, the relay node is judged to be unqualified.

[0043] Preferably, judging whether the attached sub-node is qualified according to the sub-communication information includes:

[0044] Calculate the sub-qualification index, the calculation formula of the sub-qualification index is:

[0045]

[0046] 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;

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

[0048] If so, the relay node is judged to be qualified, otherwise, the relay node is judged to be unqualified.

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

[0050] 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.

[0051] Preferably, the optimizing the priority communication network according to the subsidiary node to be optimized includes:

[0052] 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.

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

[0054] 1. The clock devices in the whole school are grouped into node sets according to the grade or the physical location of the teaching building through the node grouping module; and a number of relay nodes and subsidiary sub-nodes are set for each node set through the priority network construction module; this design method allows us to achieve unified management of the entire node set, such as a teaching building or all classrooms of a grade, through relay nodes, which greatly reduces the network burden and improves management efficiency. In addition, the main server will be transformed from a large number of connections to a limited number of relay nodes. The load pressure of the main server is effectively reduced, the delay of network transmission is reduced, and the communication quality and efficiency are optimized.

[0055] 2. The performance of relay nodes is continuously monitored through the network node monitoring module. When the performance of a relay node is found to be unqualified, a node with the best performance among its subsidiary nodes will be selected as a new relay node. At the same time, the subsidiary nodes are monitored, and when the performance of the subsidiary nodes is found to be unqualified, a new relay node will be selected for connection. This fine-tuning and optimization method not only maintains the stability of the priority communication network structure, but also continuously improves and enhances the communication quality of the network. BRIEF DESCRIPTION OF THE DRAWINGS

[0056] Figure 1A schematic diagram of a module of a campus smart clock multi-level management system of the present invention;

[0057] Figure 2 The present invention is a schematic diagram of the steps of a node marking method for a multi-level management system of a campus smart clock. DETAILED DESCRIPTION

[0058] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0059] Example 1

[0060] See also Figure 1 In this embodiment, a campus smart clock multi-level management system includes:

[0061] 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;

[0062] In this embodiment, each clock is used as an independent node, and 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 a stable network connection with them. The clock nodes can be connected by building a Mesh network or other types of point-to-point networks, and the connection is established by using TCP / IP, UDP or other suitable network protocols, and finally a fully connected initial communication network is obtained.

[0063] 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;

[0064] In this embodiment, the ownership information of each node can be manually entered by staff or obtained by connecting to school systems such as academic affairs; under normal circumstances, colleges and universities can group nodes according to buildings, while elementary schools, junior high schools and high schools can group nodes according to grades.

[0065] A priority network construction 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; construct a priority communication network, which is composed of the connection between the main server and the relay nodes, the mutual connection between the relay nodes, and the connection between the relay nodes and their subsidiary sub-nodes;

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

[0067] 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;

[0068] 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;

[0069] S3, preset the maximum number of tags BJM that need to be marked as relay nodes;

[0070] S4, set the number of markers BJ, and initialize the value of BJ to 1;

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

[0072] 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.

[0073] 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;

[0074] 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.

[0075] The step of calculating BJ node groups and corresponding central nodes based on BJ initial central points and mutual delay data includes:

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

[0077] 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;

[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 center nodes of the node groups.

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

[0081] 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.

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

[0083] 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;

[0084] The calculation of the measurement change rate according to the measurement index includes:

[0085] 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.

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

[0087] Next, when entering step S5, the system will select the nodes with the smallest delay time and the same number of marks as the initial center points according to the main delay data. In step S6, the nodes in the node set are divided into multiple groups according to the initial center points and the mutual delay data, and a center node is set for each group. Then, the system further calculates the measurement index and measurement change rate based on the calculated node groups and center nodes; then the value of the number of marks is increased by 1, and steps S5 to S6 are repeated.

[0088] In this embodiment, the measurement index is used to express the overall delay of the node group, and the measurement change rate is used to express the change in the overall delay 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 delay caused by adding relay nodes is not obvious, or the number of central nodes reaches the maximum marked number, stop repeating steps S5 to S6.

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

[0090] 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;

[0091] The subsidiary subnode monitoring unit is used to obtain the subcommunication information and determine whether the subsidiary subnode is qualified according to the subcommunication information; if the determination result is unqualified, the subsidiary subnode is set as the subsidiary subnode to be optimized;

[0092] 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;

[0093] 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;

[0094] 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.

[0095] The step of judging whether the relay node is qualified according to the node relay information includes:

[0096] Calculate the relay qualification index, the calculation formula of the relay qualification index is:

[0097]

[0098] 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;

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

[0100] If so, the relay node is judged to be qualified, otherwise, the relay node is judged to be unqualified.

[0101] The determining whether the attached sub-node is qualified according to the sub-communication information includes:

[0102] Calculate the sub-qualification index, the calculation formula of the sub-qualification index is:

[0103]

[0104] 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;

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

[0106] If so, the relay node is judged to be qualified, otherwise, the relay node is judged to be unqualified.

[0107] In the embodiment, we construct 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: a relay node monitoring unit and an attached sub-node monitoring unit, each of which has different functions and monitoring methods.

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

[0109] Next, it is the task performed by the attached subnode monitoring unit. This unit also tracks the data packet transmission between the relay node and the attached subnode through the network monitoring tool within the preset time, performs the same data collection 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, a specific algorithm will be used to calculate the relay qualification index and sub-qualification index. Since the relay delay reflects the speed at which data 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 of the relay node. The higher the occupancy rate, it may mean that the node is too busy, which affects its processing speed and stability.

[0111] At the same time, the occupancy rate data of relay nodes is particularly important. Therefore, the occupancy coefficient and relay qualification threshold can be set based on past experience or 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 deemed qualified; otherwise, it will be marked as a relay node to be optimized. Similarly, for the subsidiary sub-nodes, their qualification index will be calculated according to the formula, and the result will be used to determine whether the sub-node meets the preset standard. Through such a monitoring and calculation process, 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 nodes to be optimized, and to optimize the priority communication network according to the subsidiary sub-nodes to be optimized.

[0113] In this embodiment, the relay nodes to be optimized or the subsidiary nodes to be optimized found in the priority communication network can be optimized by load balancing optimization, network protocol optimization, network traffic management and other methods.

[0114] On the basis of Embodiment 1, optimizing the priority communication network according to the relay node to be optimized includes:

[0115] 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.

[0116] The optimizing the priority communication network according to the subsidiary node to be optimized includes:

[0117] 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.

[0118] In this embodiment, the optimization method for the relay node to be optimized is to select one of its affiliated sub-nodes as a new relay node. The optimization method for the affiliated sub-node to be optimized is to select a new relay node for it. Through such optimization, the communication efficiency and stability of the network can be effectively improved while maintaining the original priority communication network structure without major changes.

[0119] In the 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 only schematic, for example, the division of the units is only one, and there may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0120] The above description is only a specific implementation mode of the present invention, but the protection scope of the present invention is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed by the present invention, which should be covered by the protection scope of the present invention.

[0121] Finally: The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention should be included in 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 determine whether the subsidiary subnode is qualified according to the subcommunication information; if the determination 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: Where 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.

Citation Information

Patent Citations

  • Double-layer sheet network device and core communication automatic scheduling method

    CN104811395A

  • Intelligent community Internet of Things communication method based on tree structure

    CN118118508A

  • Big data network communication coordination method and system

    CN118316881A

  • Network optimisation method, system and storage medium

    US20230180025A1

Cited By

  • Intelligent campus teaching space overall management system

    CN119831790A

  • A smart campus teaching space overall management system

    CN119831790B