Local area communication network construction method, device and system based on intelligent command backpack
By establishing a single-level network in the local communication network of the intelligent command backpack, dynamically replacing and sorting nodes, updating them into multi-level networks, and dividing them into multi-level subnets, the problems of network instability and high energy consumption caused by dynamic changes of nodes are solved, and stable and efficient communication is achieved.
Patent Information
- Application Number
- CN202510138592.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-02-08
- Publication Date
- 2025-05-09
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
In the local communication network between intelligent command backpacks, the prior art causes network instability due to dynamic changes in nodes, and nodes need to always maintain the communication information of all nodes, resulting in high energy consumption and high resource consumption.
By establishing a single-level network and determining the main-level node and the last-level node, obtaining the signal search between nodes at intervals, sorting and replacing the main-level nodes, updating the network structure into a multi-level network, and dividing it into a multi-level sub-network, dynamically adjusting the number of node levels to maintain the network stability.
It effectively avoids network instability caused by dynamic changes in nodes, reduces the energy consumption of nodes, reduces the resource consumption of the overall system, and realizes stable communication of local dynamic networks.
Smart Images

Figure CN119967451A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of communication technology, and in particular to a method, device and system for constructing a local area communication network based on an intelligent command backpack. Background Art
[0002] In field operations, backpacks are a common piece of equipment. With the development of technology, backpacks are also beginning to develop in the direction of intelligence, for example, recording the physical condition of the operators, collecting information about the surrounding environment, etc. Nowadays, there is an intelligent command backpack, which is equipped with a communication device to enable the intelligent command backpacks to communicate with each other, so that the information collected by each intelligent command backpack can be communicated in a timely manner.
[0003] Currently, the communication between intelligent command backpacks is carried out in a broadcasting manner. Each intelligent command backpack is regarded as a node. Each node sends broadcast data to the outside, and all nodes can receive the broadcast data. There is no distinction between primary and secondary nodes.
[0004] This is done because the nodes are in a dynamic state and the distance between nodes is constantly changing. The advantage of using this method is that it can avoid network instability caused by dynamic changes in nodes. However, this requires each node to always receive communication information from all nodes. The energy consumption of each node is very high, and the overall system consumes a lot of resources. Therefore, it is necessary to establish a local dynamic network to ensure stable communication between nodes while reducing the energy consumption of nodes. Summary of the invention
[0005] Based on this, it is necessary to provide a method, device and system for building a local area communication network based on an intelligent command backpack to address the above-mentioned problems.
[0006] The embodiment of the present invention is implemented by a method for constructing a local area communication network based on an intelligent command backpack, and the method for constructing a local area communication network based on an intelligent command backpack comprises:
[0007] S101, establishing a single-stage network and determining a main-stage node and a final-stage node among the nodes of the single-stage network;
[0008] S102, obtaining a signal search status of each node for other nodes at every first preset time;
[0009] S103, sorting all nodes according to the signal search status of each node for other nodes to obtain a first sequence;
[0010] S104, determining whether the sequence number of the primary node in the first sequence is less than a preset sequence number, and if so, selecting a replacement node to replace the primary node from the final nodes;
[0011] S105, determining the upper node of each final node according to the primary node and its replacement node;
[0012] S106, updating the single-level network into a multi-level network according to the replacement node of the main-level node and the upper-level node of each last-level node;
[0013] S107, dividing the multi-level network into a plurality of multi-level sub-networks;
[0014] S108, for each multi-level sub-network, determine whether the level of the multi-level sub-network reaches the preset value every second preset time. If so, determine the replacement node of the parent node of the last-level node and replace it. If not, execute the execution steps of the main-level node in S103-S107 for the parent node of the last-level node.
[0015] In one embodiment, the present invention provides a local area communication network construction device based on an intelligent command backpack, and the local area communication network construction device based on the intelligent command backpack includes:
[0016] A first establishing module is used to establish a single-stage network and determine a main-stage node and a final-stage node among the nodes of the single-stage network;
[0017] A signal acquisition module, used for acquiring the signal search status of each node for other nodes at every first preset time;
[0018] A node sorting module, used to sort all nodes according to the signal search situation of each node on other nodes to obtain a first sequence;
[0019] A node replacement module, used to determine whether the sequence number of the main node in the first sequence is less than a preset sequence number, and if so, select a replacement node to replace the main node from the last node;
[0020] A node determination module, used to determine the upper node of each final node according to the primary node and its replacement node;
[0021] A second establishment module is used to update the single-level network into a multi-level network according to the replacement node of the main-level node and the upper-level node of each last-level node;
[0022] A network partitioning module is used to divide a multi-level network into several multi-level sub-networks;
[0023] The network level module is used to determine whether the level of each multi-level sub-network has reached a preset value at a second preset time interval. If so, determine the replacement node of the parent node of the last-level node and replace it. If not, execute the execution steps of the main-level node in the node sorting module, node replacement module, node determination module, second establishment module and network division module on the parent node of the last-level node.
[0024] In one embodiment, the present invention provides a local area communication network construction system based on an intelligent command backpack, wherein the local area communication network construction device system based on the intelligent command backpack includes a plurality of nodes and a computer device disposed in the node;
[0025] The plurality of nodes are connected in pairs to form a multi-level network;
[0026] The computer device is used to execute the steps of the above-mentioned method for constructing a local area communication network based on the intelligent command backpack.
[0027] The local communication network construction method based on the intelligent command backpack provided by the embodiment of the present invention establishes a single-level network and determines the main-level node and the last-level node in the nodes of the single-level network; obtains the signal search situation of each node for other nodes at every first preset time; sorts all the nodes according to the signal search situation of each node for other nodes to obtain a first sequence; judges whether the sequence number of the main-level node in the first sequence is less than the preset sequence number, and if so, selects a replacement node to replace the main-level node in the last-level node; determines the upper-level node of each last-level node according to the main-level node and its replacement node; updates the single-level network to a multi-level network according to the replacement node of the main-level node and the upper-level node of each last-level node; divides the multi-level network into a plurality of multi-level sub-networks; for each multi-level sub-network, judges whether the level of the multi-level sub-network reaches the preset value at every second preset time, and if so, determines the replacement node of the upper-level node of the last-level node and replaces it, and if not, executes the execution steps of the main-level node in the above steps for the upper-level node of the last-level node. In this way, the nodes at all levels of the entire multi-level network are replaced and adjusted at a first preset time interval, thereby avoiding network instability caused by dynamic changes in nodes; during this period, a node only needs to communicate with its upper node and its lower node, and does not need to always maintain the state of receiving communication information from all nodes, which can reduce the energy consumption of each node and reduce the resource consumption of the overall system, solving the problem of establishing a local dynamic network to reduce the energy consumption of nodes while ensuring stable communication between nodes. BRIEF DESCRIPTION OF THE DRAWINGS
[0028] Figure 1 It is a flowchart of a method for constructing a local area communication network based on an intelligent command backpack in one embodiment;
[0029] Figure 2 It is a structural block diagram of a local area communication network construction device based on an intelligent command backpack in one embodiment;
[0030] Figure 3 A structural block diagram of a local area communication network construction system based on an intelligent command backpack in one embodiment;
[0031] Figure 4 FIG. 4 is a block diagram of the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION
[0032] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention.
[0033] It is understood that the terms "first", "second", etc. used in the present invention may be used herein to describe various elements, but unless otherwise specified, these elements are not limited by these terms. These terms are only used to distinguish a first element from another element. For example, a first xx script may be referred to as a second xx script, and similarly, a second xx script may be referred to as a first xx script without departing from the scope of the present invention.
[0034] like Figure 1 As shown, in one embodiment, a method for constructing a local area communication network based on an intelligent command backpack is proposed, which may specifically include the following steps:
[0035] S101, establishing a single-stage network and determining a main-stage node and a final-stage node among the nodes of the single-stage network;
[0036] S102, obtaining a signal search status of each node for other nodes at every first preset time;
[0037] S103, sorting all nodes according to the signal search status of each node for other nodes to obtain a first sequence;
[0038] S104, determining whether the sequence number of the primary node in the first sequence is less than a preset sequence number, and if so, selecting a replacement node to replace the primary node from the final nodes;
[0039] S105, determining the upper node of each final node according to the primary node and its replacement node;
[0040] S106, updating the single-level network into a multi-level network according to the replacement node of the main-level node and the upper-level node of each last-level node;
[0041] S107, dividing the multi-level network into a plurality of multi-level sub-networks;
[0042] S108, for each multi-level sub-network, determine whether the level of the multi-level sub-network reaches the preset value every second preset time. If so, determine the replacement node of the parent node of the last-level node and replace it. If not, execute the execution steps of the main-level node in S103-S107 for the parent node of the last-level node.
[0043] In this embodiment, the smart command backpack has multiple functions, such as collecting on-site environmental information, monitoring the physical condition of the personnel, monitoring the travel route, monitoring the travel speed, etc. The collected information needs to be communicated and integrated in a timely manner, so the smart command backpacks need to communicate with each other. Therefore, communication equipment is installed inside the smart command backpack, and each communication device is a node, so one smart command backpack can be regarded as a node.
[0044] In this embodiment, the main node is the first-level node, and there is only one host node. The final node is the last-level node, and there are multiple final nodes. Since the single-level network consists of two levels, the second-level node is the final node.
[0045] In this embodiment, the first preset time can be set to 10 minutes or longer.
[0046] In this embodiment, the preset sequence number can be set to 1 / 3 or 1 / 2 of the total number of sequence numbers. Generally speaking, the sequence numbers are arranged from small to large, for example, from 1 to 9. If the preset sequence number is 1 / 3 of the total number of sequence numbers, then the preset sequence number is 3, that is, if the main node is ranked 4th in the first sequence, then it meets the situation that the sequence number of the main node in the first sequence is less than the preset sequence number.
[0047] In this embodiment, the replacement node can only be selected from the last-level nodes, because the last-level nodes are only connected to their upper-level nodes and can be replaced at any time.
[0048] In this embodiment, if the sequence number of the main-level node in the first sequence is greater than or equal to the preset sequence number, the replacement node will not be selected, and the parent node of each last-level node cannot be determined based on the main-level node and its replacement node, that is, S105-S107 will not be performed. If a multi-level sub-network already exists, S108 will be executed. If there is no multi-level sub-network, S108 will not be executed.
[0049] In this embodiment, after determining the parent node of the last-level node, a multi-level network is formed. The replacement node will replace the main-level node to become a first-level node, the parent node of the last-level node will be a second-level node, and the last-level node will become a third-level node, i.e., a node at the last level.
[0050] In this embodiment, the multi-level sub-network is a vertical division. The level of the multi-level sub-network divided for the first time is equal to the level of the multi-level network. In S108, each multi-level sub-network is judged as a separate individual. The maximum level of the multi-level sub-network is equal to the level of the multi-level network.
[0051] In this embodiment, the second preset time is much smaller than the first preset time, and can be set to 1 / 10 or 1 / 5 of the first preset time. It can be understood that the first preset time is a large cycle, and the second preset time is a number of small cycles in the large cycle.
[0052] In this embodiment, the preset value can be set to 5, and the preset value must be greater than or equal to 3, because after completing S101-S107, the formed multi-level network is a 3-level network.
[0053] In this embodiment, the steps of determining and replacing the replacement node of the parent node of the final node are the same as the execution steps of the main node in S104 and S106, that is, judging whether the sequence number of the parent node of the final node in the first sequence is less than the preset sequence number, and if so, selecting a replacement node of the parent node of the final node in the final node to replace; and updating the multi-level network according to the replacement node of the parent node of the final node and the parent node of each final node. At this time, it is not necessary to perform the execution steps of the main node in S105 on the parent node of the final node, because the number of levels of the multi-level sub-network has reached the preset value and the number of levels cannot be increased. In the process, it is still within the period of the first preset time, so the main node does not need to be replaced.
[0054] In this embodiment, executing the execution steps of the main node in S103-S107 on the parent node of the final node means bringing the parent node of the final node into the position of the main node in S103-S107 to execute S103-S107, that is, judging whether the sequence number of the parent node of the final node in the first sequence is less than the preset sequence number, and if so, selecting a replacement node to replace the parent node of the final node in the final node; determining the parent node of each final node according to the parent node of the final node and its replacement node; updating the multi-level network according to the replacement node of the parent node of the final node and the parent node of each final node. At this time, it is necessary to perform the execution steps of the main node in S105 on the parent node of the final node.
[0055] In this embodiment, it can be understood that within a first preset time, every second preset time, the upper node of the last node of each multi-level sub-network is replaced or added. Whether to add depends on whether the number of levels of the multi-level sub-network reaches a preset value. This process does not operate on the nodes above the upper node of the last node. For example, if the multi-level sub-network is a 3-level network, then only the nodes of the second level are operated, and the nodes of the first level are not operated.
[0056] In this embodiment, at every first preset time, if it is determined in S104 that the sequence number of the main-level node in the first sequence is less than the preset sequence number, the main-level node needs to be replaced. At this time, the multi-level network established before is rearranged. At this time, except for the original main-level node and the determined replacement node of the main-level node, other nodes, no matter which level they are in, are regarded as last-level nodes.
[0057] In this embodiment, the reason why the superior node of each terminal node is determined in S105 is that the replacement node is obtained by calculation, and it cannot be guaranteed that each terminal node can communicate smoothly with the replacement node after the switch is completed, and it cannot guarantee the communication quality of each terminal node after the switch. Therefore, special processing means need to be taken at this time to introduce the superior node. The superior node can communicate well with the original main node and its replacement node to ensure the communication quality during the replacement process. A terminal node must have a corresponding superior node, and a superior node can correspond to multiple terminal nodes.
[0058] The local communication network construction method based on the intelligent command backpack provided by the embodiment of the present invention establishes a single-level network and determines the main-level node and the last-level node in the nodes of the single-level network; obtains the signal search situation of each node for other nodes at every first preset time; sorts all the nodes according to the signal search situation of each node for other nodes to obtain a first sequence; judges whether the sequence number of the main-level node in the first sequence is less than the preset sequence number, and if so, selects a replacement node to replace the main-level node in the last-level node; determines the upper-level node of each last-level node according to the main-level node and its replacement node; updates the single-level network to a multi-level network according to the replacement node of the main-level node and the upper-level node of each last-level node; divides the multi-level network into a plurality of multi-level sub-networks; for each multi-level sub-network, judges whether the level of the multi-level sub-network reaches the preset value at every second preset time, and if so, determines the replacement node of the upper-level node of the last-level node and replaces it, and if not, executes the execution steps of the main-level node in the above steps for the upper-level node of the last-level node. In this way, the nodes at all levels of the entire multi-level network are replaced and adjusted at a first preset time interval, thereby avoiding network instability caused by dynamic changes in nodes; during this period, a node only needs to communicate with its upper node and its lower node, and does not need to always maintain the state of receiving communication information from all nodes, which can reduce the energy consumption of each node and reduce the resource consumption of the overall system, solving the problem of establishing a local dynamic network to reduce the energy consumption of nodes while ensuring stable communication between nodes.
[0059] In one embodiment, the step of establishing a single-stage network and determining a main-stage node and a final-stage node among nodes of the single-stage network includes:
[0060] Select any node from all the nodes;
[0061] The selected nodes establish communication links with other nodes respectively to establish a secondary network;
[0062] Determine the two-level network as a single-level network;
[0063] Determine the first-level nodes of the single-level network as primary-level nodes;
[0064] The nodes of the second level of the single-level network are determined as the final-level nodes.
[0065] In this embodiment, the selected nodes generally exclude nodes at the edge of the area image enclosed by all nodes, and can be screened in a simple manner. For example, if the signal strength of all other nodes cannot be searched for a node, it will be excluded.
[0066] In one embodiment, obtaining the signal search status of each node for other nodes includes:
[0067] For each node, obtain the signal strength of the node to other nodes respectively;
[0068] For each acquired signal strength, determine whether the signal strength is greater than a preset strength, and if not, remove the signal strength;
[0069] The signal strengths of the first preset number of signal strengths and the nodes corresponding thereto are taken as the signal search conditions of the node and obtained.
[0070] In this embodiment, the signal strength is a node relative to another node, so for a node, during the signal search process, its own signal strength cannot be obtained, and the maximum number of searched nodes is the total number of nodes minus 1.
[0071] In this embodiment, the preset strength may be an average value of all signal strengths, a value set according to historical data, or half of the maximum signal strength.
[0072] In this embodiment, the first preset number may be set to 10, or may be set to half of the total number of nodes.
[0073] In one embodiment, the step of sorting all nodes according to the signal search status of each node for other nodes includes:
[0074] The maximum signal strength B is determined based on the signal search results of each node for other nodes;
[0075] For each node, determine the number of times n that the node appears in the signal search of other nodes according to the signal search of other nodes by each node;
[0076] Depend on Get the first score C1 of the node;
[0077] The second score C2 of the node is obtained by A2*n / N;
[0078] Depend on Get the third score C3 of the node;
[0079] The final score of the node is obtained by k1*C1+k2*C2+k3*C3;
[0080] Sort all nodes in descending order according to their final scores to obtain the first sequence;
[0081] Among them, A1 is the total score of the first score, A2 is the total score of the second score, A3 is the total score of the third score, N is the total number of nodes other than this node, i is the serial number of the node other than this node, bi is the signal strength of the node in the signal search of the i-th node, M is the number of nodes in the signal search of other nodes by the node, and m i is the ranking of the signal strength of the node in the signal search of the i-th node, sorted from large to small, and k1, k2, and k3 are the weight coefficients of the first score, the second score, and the third score, respectively.
[0082] In this embodiment, the sum of k1, k2, and k3 is 1.
[0083] In this embodiment, the total score of the first score, the second score, and the third score can be set to the same value, for example, can be set to 100.
[0084] In this embodiment, since a node cannot search for itself, the calculation needs to exclude itself, that is, the number of nodes needs to be reduced by 1 during the calculation process, which is why N is the total number of nodes other than the node.
[0085] In this embodiment, if the signal search condition of the node at the i-th node does not occur, then b i is 0, m i Add 1 to M.
[0086] In this embodiment, if the final scores are equal during sorting, the sorting order of the nodes with equal final scores is determined according to the size of the first score. If they are still equal, they can be sorted according to the second score and the third score.
[0087] In one embodiment, selecting a replacement node to replace the main-level node from the final-level node includes:
[0088] According to the signal search situation of each node for other nodes, all nodes are sorted from most to least according to the number of occurrences to obtain the second sequence;
[0089] For each final node, the replacement score of the final node is obtained by k4*A4+k5*A5;
[0090] Select the final-level node with the highest replacement score as the replacement node to replace the primary-level node;
[0091] Among them, k4 is the weight coefficient of the first sequence, k5 is the weight coefficient of the second sequence, A4 is the ranking score of the last node in the first sequence, and A5 is the ranking score of the last node in the second sequence.
[0092] In this embodiment, the sum of k4 and k5 is 1.
[0093] In this embodiment, for example, the score of the first ranking of the first sequence is set to 100, the score of the second ranking is set to 90, and the scores thereafter decrease in sequence. The same is true for the second sequence. Therefore, for each final node, A4 and A5 are clear and do not need to be calculated.
[0094] In one embodiment, determining the upper node of each final node according to the primary node and its replacement node includes:
[0095] S601, marking all nodes in the signal search situation of the replacement node as temporary nodes;
[0096] S602, determining whether there is a master node in the temporary node, and if so, removing the master node from the temporary node;
[0097] S603, selecting the temporary node at the front of the ranking according to the order of the temporary nodes in the first sequence and recording it as the target node, and obtaining the team L of the node p in the signal search situation of the target node;
[0098] S604, determining whether there is a host node, a replacement node, a temporary node, or a node with a subordinate node in team L, and if so, removing the host node, the replacement node, the temporary node, or the node with a subordinate node from team L;
[0099] S605, determining whether there are still nodes in the team L after the removal, if not, removing the target node from the queue of temporary nodes, if yes, determining whether there is an upper-level node in each node p in the team L;
[0100] S606, if the node p has an upper node, determine whether the signal strength of the node p in the signal search of the target node is greater than the signal strength of the node p in the signal search of its upper node, if so, change the upper node of the node p to the target node, and remove the target node from the queue of temporary nodes and final nodes;
[0101] S607, if the node p has no upper node, determine the upper node of the node p as the target node, and remove the target node from the queue of temporary nodes and final nodes;
[0102] S608, determine whether all the last-level nodes except the temporary nodes have upper-level nodes. If so, for each temporary node, the node with the largest signal strength among the nodes with lower-level nodes in the signal search situation of the temporary node is determined as the upper-level node of the temporary node. If not, repeat S603-S607 until all the last-level nodes except the temporary nodes have upper-level nodes.
[0103] In this embodiment, the upper node and the lower node are relative concepts. If node a is the upper node of node b, then node b is the lower node of node a.
[0104] In this embodiment, there are multiple temporary nodes in S601. However, there is only one temporary node (target node) ranked first in S603. Since the target node will be removed from the queue of temporary nodes and final nodes after becoming the parent node of node p, the temporary node (target node) ranked first in each cycle is a new temporary node.
[0105] In one embodiment, the updating of a single-stage network into a multi-stage network according to a replacement node of a main-stage node and an upper-stage node of each last-stage node includes:
[0106] The replacement node of the main-level node establishes a communication link with the upper-level node of each final-level node, and each final-level node establishes a communication link with its upper-level node to update the single-level network to a multi-level network;
[0107] The node with the largest signal strength among the nodes with lower-level nodes in the signal search of the main-level node is determined as the upper-level node of the main-level node, and the main-level node is changed to the last-level node.
[0108] In this embodiment, for a multi-level sub-network, it is not necessary to modify the nodes above the parent node of the final node, and the parent node of the final node can be brought into the main node for modification.
[0109] In one embodiment, dividing the multi-level network into a plurality of multi-level sub-networks includes:
[0110] Grouping the upper-level nodes of the last-level nodes according to a second preset number;
[0111] The nodes of the same group are networked in a multi-level network as a multi-level sub-network.
[0112] In this embodiment, the second preset number can be set to 2, that is, the upper level nodes of the last level node of each multi-level sub-network have and only have 2. If the number of upper level nodes of the last level node is odd, the number of the last group can be set to 3.
[0113] In this embodiment, there is only one node at each level above the parent node of the last level node.
[0114] like Figure 2 As shown, in one embodiment, a local area communication network construction device based on an intelligent command backpack is provided, which may specifically include:
[0115] A first establishing module is used to establish a single-stage network and determine a main-stage node and a final-stage node among the nodes of the single-stage network;
[0116] A signal acquisition module, used for acquiring the signal search status of each node for other nodes at every first preset time;
[0117] A node sorting module, used to sort all nodes according to the signal search situation of each node on other nodes to obtain a first sequence;
[0118] A node replacement module, used to determine whether the sequence number of the main node in the first sequence is less than a preset sequence number, and if so, select a replacement node to replace the main node from the last node;
[0119] A node determination module, used to determine the upper node of each final node according to the primary node and its replacement node;
[0120] A second establishment module is used to update the single-level network into a multi-level network according to the replacement node of the main-level node and the upper-level node of each last-level node;
[0121] A network partitioning module is used to divide a multi-level network into several multi-level sub-networks;
[0122] The network level module is used to determine whether the level of each multi-level sub-network has reached a preset value at a second preset time interval. If so, determine the replacement node of the parent node of the last-level node and replace it. If not, execute the execution steps of the main-level node in the node sorting module, node replacement module, node determination module, second establishment module and network division module on the parent node of the last-level node.
[0123] In this embodiment, the various modules of the local area communication network construction device based on the intelligent command backpack are modularization of the method part of the present invention. For the specific explanation of each module, please refer to the corresponding content of the method part of the present invention, and the embodiment of the present invention will not be repeated here.
[0124] like Figure 3 As shown, in one embodiment, a local area communication network construction system based on an intelligent command backpack is provided, which may specifically include:
[0125] A number of nodes and computer devices disposed in the nodes;
[0126] The plurality of nodes are connected in pairs to form a multi-level network;
[0127] The computer device is used to execute the steps of the above-mentioned method for constructing a local area communication network based on the intelligent command backpack.
[0128] In this embodiment, the essence of the node is the communication device of the intelligent command backpack, so the local communication network construction system based on the intelligent command backpack includes several intelligent command backpacks and computer devices set in the nodes; the communication device is set inside the intelligent command backpack.
[0129] In this embodiment, if Figure 3 As shown, the multi-level network is distributed in a tree diagram, where node 1 is the main node, nodes 111-119, nodes 121-129, nodes 131-139, nodes 141-149 are the end nodes, and nodes 11, nodes 12, nodes 13, and nodes 14 are the upper nodes of the end nodes, that is, the nodes of the second level. Among them, nodes 1, nodes 11, nodes 12, nodes 111-119, nodes 121-129 form a multi-level sub-network; nodes 1, nodes 13, nodes 14, nodes 131-139, nodes 141-149 form a multi-level sub-network.
[0130] The local communication network construction system based on the intelligent command backpack provided by the embodiment of the present invention establishes a single-level network and determines the main-level node and the last-level node in the nodes of the single-level network; obtains the signal search status of each node for other nodes at every first preset time; sorts all the nodes according to the signal search status of each node for other nodes to obtain a first sequence; judges whether the sequence number of the main-level node in the first sequence is less than the preset sequence number, and if so, selects a replacement node to replace the main-level node in the last-level node; determines the upper-level node of each last-level node according to the main-level node and its replacement node; updates the single-level network to a multi-level network according to the replacement node of the main-level node and the upper-level node of each last-level node; divides the multi-level network into a plurality of multi-level sub-networks; for each multi-level sub-network, judges whether the level of the multi-level sub-network reaches the preset value at every second preset time, and if so, determines the replacement node of the upper-level node of the last-level node and replaces it, and if not, executes the execution steps of the main-level node in the above steps for the upper-level node of the last-level node. In this way, the nodes at all levels of the entire multi-level network are replaced and adjusted at a first preset time interval, thereby avoiding network instability caused by dynamic changes in nodes; during this period, a node only needs to communicate with its upper node and its lower node, and does not need to always maintain the state of receiving communication information from all nodes, which can reduce the energy consumption of each node and reduce the resource consumption of the overall system, solving the problem of establishing a local dynamic network to reduce the energy consumption of nodes while ensuring stable communication between nodes.
[0131] Figure 4 FIG. 2 shows an internal structure diagram of a computer device in one embodiment. Figure 4As shown, the computer device includes a processor, a memory, a network interface, an input device and a display screen connected via a system bus. Among them, the memory includes a non-volatile storage medium and an internal memory. The non-volatile storage medium of the computer device stores an operating system and may also store a computer program. When the computer program is executed by the processor, the processor can implement the local communication network construction method based on the intelligent command backpack provided in the embodiment of the present invention. The internal memory may also store a computer program. When the computer program is executed by the processor, the processor can execute the local communication network construction method based on the intelligent command backpack provided in the embodiment of the present invention.
[0132] Those skilled in the art will understand that Figure 4 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present invention, and does not constitute a limitation on the computer device to which the solution of the present invention is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.
[0133] In one embodiment, the local area communication network construction device based on the intelligent command backpack provided by the embodiment of the present invention can be implemented in the form of a computer program. The computer program can be used in Figure 4 The computer device shown in the figure is run. The memory of the computer device can store various program modules that constitute the local area communication network construction device based on the intelligent command backpack, for example, Figure 2 The computer program composed of the first establishment module, signal acquisition module, node sorting module, node replacement module, node determination module, second establishment module, network division module and network level module shown in the figure enables the processor to execute the steps of the local area communication network construction method based on the intelligent command backpack of each embodiment of the present invention described in this specification.
[0134] For example, Figure 4 The computer device shown can be Figure 2 The first establishment module in the local area communication network construction device based on the intelligent command backpack shown executes step S101; the computer device can execute step S102 through the signal acquisition module; the computer device can execute step S103 through the node sorting module; the computer device can execute step S104 through the node replacement module; the computer device can execute step S105 through the node determination module; the computer device can execute step S106 through the second establishment module; the computer device can execute step S107 through the network division module; the computer device can execute step S108 through the network level module.
[0135] In one embodiment, a computer device is provided, the computer device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the following steps are implemented:
[0136] S101, establishing a single-stage network and determining a main-stage node and a final-stage node among the nodes of the single-stage network;
[0137] S102, obtaining a signal search status of each node for other nodes at every first preset time;
[0138] S103, sorting all nodes according to the signal search status of each node for other nodes to obtain a first sequence;
[0139] S104, determining whether the sequence number of the primary node in the first sequence is less than a preset sequence number, and if so, selecting a replacement node to replace the primary node from the final nodes;
[0140] S105, determining the upper node of each final node according to the primary node and its replacement node;
[0141] S106, updating the single-level network into a multi-level network according to the replacement node of the main-level node and the upper-level node of each last-level node;
[0142] S107, dividing the multi-level network into a plurality of multi-level sub-networks;
[0143] S108, for each multi-level sub-network, determine whether the level of the multi-level sub-network reaches the preset value every second preset time. If so, determine the replacement node of the parent node of the last-level node and replace it. If not, execute the execution steps of the main-level node in S103-S107 for the parent node of the last-level node.
[0144] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the processor performs the following steps:
[0145] S101, establishing a single-stage network and determining a main-stage node and a final-stage node among the nodes of the single-stage network;
[0146] S102, obtaining a signal search status of each node for other nodes at every first preset time;
[0147] S103, sorting all nodes according to the signal search status of each node for other nodes to obtain a first sequence;
[0148] S104, determining whether the sequence number of the primary node in the first sequence is less than a preset sequence number, and if so, selecting a replacement node to replace the primary node from the final nodes;
[0149] S105, determining the upper node of each final node according to the primary node and its replacement node;
[0150] S106, updating the single-level network into a multi-level network according to the replacement node of the main-level node and the upper-level node of each last-level node;
[0151] S107, dividing the multi-level network into a plurality of multi-level sub-networks;
[0152] S108, for each multi-level sub-network, determine whether the level of the multi-level sub-network reaches the preset value every second preset time. If so, determine the replacement node of the parent node of the last-level node and replace it. If not, execute the execution steps of the main-level node in S103-S107 for the parent node of the last-level node.
[0153] It should be understood that, although each step in the flow chart of each embodiment of the present invention is shown in sequence according to the indication of the arrow, these steps are not necessarily performed in sequence according to the order indicated by the arrow. Unless there is a clear explanation in this article, the execution of these steps does not have a strict order restriction, and these steps can be performed in other orders. Moreover, at least a portion of the steps in each embodiment may include a plurality of sub-steps or a plurality of stages, and these sub-steps or stages are not necessarily performed at the same time, but can be performed at different times, and the execution order of these sub-steps or stages is not necessarily performed in sequence, but can be performed in turn or alternately with at least a portion of other steps or sub-steps or stages of other steps.
[0154] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiments can be completed by instructing the relevant hardware through a computer program, and the program can be stored in a non-volatile computer-readable storage medium. When the program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided by the present invention can include non-volatile and / or volatile memory. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory. Volatile memory can include random access memory (RAM) or external cache memory. As an illustration and not limitation, RAM is available in many forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
[0155] The technical features of the above-described embodiments may be arbitrarily combined. To make the description concise, not all possible combinations of the technical features in the above-described embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.
[0156] The above-mentioned embodiments only express several implementation methods of the present invention, and the description thereof is relatively specific and detailed, but it cannot be understood as limiting the scope of the present invention. It should be pointed out that, for ordinary technicians in this field, several variations and improvements can be made without departing from the concept of the present invention, which all belong to the protection scope of the present invention.
Claims
1. A method for constructing a local area communication network based on an intelligent command backpack, characterized in that: The local area communication network construction method based on the intelligent command backpack includes: S101, establishing a single-stage network and determining a main-stage node and a final-stage node among the nodes of the single-stage network; S102, obtaining a signal search status of each node for other nodes at every first preset time; S103, sorting all nodes according to the signal search status of each node for other nodes to obtain a first sequence; S104, determining whether the sequence number of the primary node in the first sequence is less than a preset sequence number, and if so, selecting a replacement node to replace the primary node from the final nodes; S105, determining the upper node of each final node according to the primary node and its replacement node; S106, updating the single-level network into a multi-level network according to the replacement node of the main-level node and the upper-level node of each last-level node; S107, dividing the multi-level network into a plurality of multi-level sub-networks; S108, for each multi-level sub-network, determine whether the level of the multi-level sub-network reaches the preset value every second preset time. If so, determine the replacement node of the parent node of the last-level node and replace it. If not, execute the execution steps of the main-level node in S103-S107 for the parent node of the last-level node.
2. The method for constructing a local area communication network based on an intelligent command backpack according to claim 1, characterized in that: The step of establishing a single-stage network and determining a main-stage node and a final-stage node among the nodes of the single-stage network includes: Select any node from all the nodes; The selected nodes establish communication links with other nodes respectively to establish a secondary network; Determine the two-level network as a single-level network; Determine the first-level nodes of the single-level network as primary-level nodes; The nodes of the second level of the single-level network are determined as the final-level nodes.
3. The method for constructing a local area communication network based on an intelligent command backpack according to claim 1, characterized in that: The obtaining of the signal search status of each node for other nodes includes: For each node, obtain the signal strength of the node to other nodes respectively; For each acquired signal strength, determine whether the signal strength is greater than a preset strength, and if not, remove the signal strength; The signal strengths of the first preset number of signal strengths and the nodes corresponding thereto are taken as the signal search conditions of the node and obtained.
4. The method for constructing a local area communication network based on an intelligent command backpack according to claim 1, characterized in that: The step of sorting all nodes according to the signal search status of each node for other nodes includes: The maximum signal strength B is determined based on the signal search results of each node for other nodes; For each node, determine the number of times n that the node appears in the signal search of other nodes according to the signal search of other nodes by each node; Depend on Get the first score C1 of the node; The second score C2 of the node is obtained by A2*n / N; Depend on Get the third score C3 of the node; The final score of the node is obtained by k1*C1+k2*C2+k3*C3; Sort all nodes in descending order according to their final scores to obtain the first sequence; Among them, A1 is the total score of the first score, A2 is the total score of the second score, A3 is the total score of the third score, N is the total number of nodes other than this node, i is the serial number of the node other than this node, b i is the signal strength of the node in the signal search of the i-th node, M is the number of nodes in the signal search of other nodes by the node, and m i is the ranking of the signal strength of the node in the signal search of the i-th node, sorted from large to small, and k1, k2, and k3 are the weight coefficients of the first score, the second score, and the third score, respectively.
5. The method for constructing a local area communication network based on an intelligent command backpack according to claim 1, characterized in that: The step of selecting a replacement node to replace the main-level node from the final-level node includes: According to the signal search situation of each node for other nodes, all nodes are sorted from most to least according to the number of occurrences to obtain the second sequence; For each final node, the replacement score of the final node is obtained by k4*A4+k5*A5; Select the final-level node with the highest replacement score as the replacement node to replace the primary-level node; Among them, k4 is the weight coefficient of the first sequence, k5 is the weight coefficient of the second sequence, A4 is the ranking score of the last node in the first sequence, and A5 is the ranking score of the last node in the second sequence.
6. The method for constructing a local area communication network based on an intelligent command backpack according to claim 1, characterized in that: The step of determining the upper node of each final node according to the primary node and its replacement node includes: S601, marking all nodes in the signal search situation of the replacement node as temporary nodes; S602, determining whether there is a master node in the temporary node, and if so, removing the master node from the temporary node; S603, selecting the temporary node at the front of the ranking according to the order of the temporary nodes in the first sequence and recording it as the target node, and obtaining the team L of the node p in the signal search situation of the target node; S604, determining whether there is a host node, a replacement node, a temporary node, or a node with a subordinate node in team L, and if so, removing the host node, the replacement node, the temporary node, or the node with a subordinate node from team L; S605, determining whether there are still nodes in the team L after the removal, if not, removing the target node from the queue of temporary nodes, if yes, determining whether there is an upper-level node in each node p in the team L; S606, if the node p has an upper node, determine whether the signal strength of the node p in the signal search of the target node is greater than the signal strength of the node p in the signal search of its upper node, if so, change the upper node of the node p to the target node, and remove the target node from the queue of temporary nodes and final nodes; S607, if the node p has no upper node, determine the upper node of the node p as the target node, and remove the target node from the queue of temporary nodes and final nodes; S608, determine whether all the last-level nodes except the temporary nodes have upper-level nodes. If so, for each temporary node, the node with the largest signal strength among the nodes with lower-level nodes in the signal search situation of the temporary node is determined as the upper-level node of the temporary node. If not, repeat S603-S607 until all the last-level nodes except the temporary nodes have upper-level nodes.
7. The method for constructing a local area communication network based on an intelligent command backpack according to claim 1, characterized in that: The method of updating a single-level network into a multi-level network according to a replacement node of a main-level node and an upper-level node of each last-level node includes: The replacement node of the main-level node establishes a communication link with the upper-level node of each final-level node, and each final-level node establishes a communication link with its upper-level node to update the single-level network to a multi-level network; The node with the largest signal strength among the nodes with lower-level nodes in the signal search of the main-level node is determined as the upper-level node of the main-level node, and the main-level node is changed to the last-level node.
8. The method for constructing a local area communication network based on an intelligent command backpack according to claim 1, characterized in that: The multi-level network is divided into a plurality of multi-level sub-networks, including: Grouping the upper-level nodes of the last-level nodes according to a second preset number; The nodes of the same group are networked in a multi-level network as a multi-level sub-network.
9. A local area communication network construction device based on an intelligent command backpack, characterized in that: The local area communication network construction device based on the intelligent command backpack includes: A first establishing module is used to establish a single-stage network and determine a main-stage node and a final-stage node among the nodes of the single-stage network; A signal acquisition module, used for acquiring the signal search status of each node for other nodes at every first preset time; A node sorting module, used to sort all nodes according to the signal search situation of each node on other nodes to obtain a first sequence; A node replacement module, used to determine whether the sequence number of the main node in the first sequence is less than a preset sequence number, and if so, select a replacement node to replace the main node from the last node; A node determination module, used to determine the upper node of each final node according to the primary node and its replacement node; A second establishment module is used to update the single-level network into a multi-level network according to the replacement node of the main-level node and the upper-level node of each last-level node; A network partitioning module is used to divide a multi-level network into several multi-level sub-networks; The network level module is used to determine whether the level of each multi-level sub-network has reached a preset value at a second preset time interval. If so, determine the replacement node of the parent node of the last-level node and replace it. If not, execute the execution steps of the main-level node in the node sorting module, node replacement module, node determination module, second establishment module and network division module on the parent node of the last-level node.
10. A local area communication network construction system based on an intelligent command backpack, characterized in that: The local area communication network construction device system based on the intelligent command backpack includes a plurality of nodes and computer equipment arranged in the nodes; The plurality of nodes are connected in pairs to form a multi-level network; The computer device is used to execute the steps of the method for constructing a local area communication network based on an intelligent command backpack as described in any one of claims 1 to 8.