CN113438660A - Node group deployment method - Google Patents
Node group deployment method Download PDFInfo
- Publication number
- CN113438660A CN113438660A CN202110698344.4A CN202110698344A CN113438660A CN 113438660 A CN113438660 A CN 113438660A CN 202110698344 A CN202110698344 A CN 202110698344A CN 113438660 A CN113438660 A CN 113438660A
- Authority
- CN
- China
- Prior art keywords
- node
- distance
- channel
- child
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
- H04W16/20—Network planning tools for indoor coverage or short range network deployment
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
- G01S5/00—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations
- G01S5/02—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations using radio waves
- G01S5/14—Determining absolute distances from a plurality of spaced points of known location
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/023—Services making use of location information using mutual or relative location information between multiple location based services [LBS] targets or of distance thresholds
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/80—Services using short range communication, e.g. near-field communication [NFC], radio-frequency identification [RFID] or low energy communication
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W64/00—Locating users or terminals or network equipment for network management purposes, e.g. mobility management
- H04W64/006—Locating users or terminals or network equipment for network management purposes, e.g. mobility management with additional information processing, e.g. for direction or speed determination
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a deployment method of a node group, wherein an autonomous node automatically starts to perform ergodic distance measurement towards the other end, and a first database is updated once according to distance measurement data in each distance measurement process, so that the channel distances between a main node and all sub-nodes are obtained when the ergodic distance measurement is completed, the deployment is quickly completed, the engineering quantity is small, the positioning in a channel is favorably realized by the node groups and the data of the first database, and the distance measurement error is small and the precision is high because each node of the node group is traversed in the distance measurement process.
Description
Technical Field
The present invention relates to the field of channel positioning, and more particularly, to a method for deploying a node group.
Background
Tunnels, such as tunnels, are often constructed or rescued, and it is difficult to locate vehicles or people in the tunnel due to the long tunnel and the strong communication shielding effect.
The idea of using RFID technology for positioning in a tunnel is proposed in the art, which is mainly implemented by reading an RFID tag carried by a vehicle or a person located within a communication distance by an RFID reading head installed in the tunnel. This solution requires the measurement and storage of the distance data of each RFID reading head to the tunnel entrance or exit in advance to deploy the RFID reading heads and provide a data base for the calculation in the subsequent positioning. However, in practical implementation, because the tunnel is long, the number of RFID reading heads is large, and the amount of engineering is large, the deployment is difficult to implement, and thus the implementation of the scheme is difficult.
Disclosure of Invention
The present invention is directed to solve the above technical problems or disadvantages, and provides a method for deploying a node group, which can automatically and quickly deploy a node group initially installed in a channel, and obtain distances between a main node and each child node in the node group, so as to provide a data base for positioning in the channel by using the nodes.
In order to achieve the purpose, the technical scheme of the invention is as follows: a method for deploying a node group, wherein the node group is positioned in a channel and comprises a plurality of nodes which are arranged at intervals along the extending direction of the channel; in the node group, the absolute distance between any node and the adjacent node is smaller than the absolute distance between the node and the non-adjacent node; in the node group, any two adjacent nodes define a sub-channel with a straight line segment structure or a curve segment structure in the channel, and the node group is configured to enable the curvature radius of the sub-channel with any curve segment structure to be far larger than the absolute distance between the two nodes defining the sub-channel, so that the channel distance between any two adjacent nodes is equal to the absolute distance; each node in the node group is suitable for at least ranging the adjacent node; one end node in the node group is configured as a main node, and other nodes are configured as sub-nodes suitable for communicating with the main node; the deployment method comprises a primary deployment method, which is used for obtaining the channel spacing between the main node and all the sub-nodes after the initial installation of the node group, and comprises the following steps: step 1: the main node carries out distance measurement on other sub-nodes and generates distance measurement data; the distance measurement data comprises the absolute distance between a main measurement node and a measured node; step 2: the main node extracts a sub-node closest to the absolute distance of the main node and the absolute distance in the ranging data, takes the absolute distance as the channel distance between the sub-node and the main node, and generates a first database; the first database is used for storing the channel spacing between the main node and other sub-nodes; and step 3: the master node sends a ranging instruction to a child node farthest from the master node in the first database; the child node receiving the ranging instruction performs ranging on other nodes to generate ranging data, and sends the ranging data back to the master node; and 4, step 4: after receiving the ranging data of the child nodes, the master node extracts a new child node closest to the absolute distance of the master node and the absolute distance, and takes the absolute distance as the channel distance between the new child node and the master node to obtain the channel distance between the new child node and the master node according to the channel distance so as to update the first database; and 5: after updating the first database each time, the main node sends a ranging instruction to the child node farthest from the main node, so that the child node ranges the range of other nodes and sends new ranging data back to the main node; step 6: and when the master node cannot update the first database after receiving the new ranging data, the master node does not send a ranging instruction and completes the initial deployment.
Further, the ranging data comprises a code of a master node, a corresponding relation between the code of a node to be tested and an absolute distance between the node to be tested and the master node; the first database stores the codes of all the child nodes and the corresponding relation between the child nodes and the channel spacing of the main node; in step 4, each time the ranging data sent back by a certain child node as a master node is received, the master node updates the first database by the following method: step 4 a: searching codes of new sub-nodes which are not stored in the existing first database in the ranging data, extracting the new sub-node which is closest to the absolute distance of the main node and the absolute distance based on at least one new sub-node obtained by searching, and taking the absolute distance as the channel distance between the new sub-node and the main node; and 4 b: calling a channel distance between a master node and a master node in an existing first database according to a code of the master node contained in the ranging data; and 4 c: storing the code of the new child node and the corresponding relation between the new child node and the channel space of the main node in the first database to complete the updating of the first database; and the channel distance between the new child node and the main node is equal to the sum of the channel distance between the new child node and the main test node and the channel distance between the main test node and the main node.
Further, when the code for searching the ranging data for the new child node that is not stored in the existing first database fails in step 4a, the first database fails to be updated, and the master node does not send the ranging instruction any more and completes the initial deployment.
Further, the method for newly adding deployment is further included, and after the initial deployment is completed and the end nodes forming the child nodes are newly added, the first database is updated: and 7: the newly added child node carries out ranging on other nodes and sends the ranging data generated by the newly added child node to the master node; and 8: the master node extracts a sub-node closest to the absolute distance of the newly added sub-node and the absolute distance from the ranging data of the newly added sub-node, and takes the absolute distance as the channel distance between the newly added sub-node and the closest sub-node; and step 9: the main node calls a channel distance between the nearest child node and the main node in an existing first database according to the code of the nearest child node; step 10: the main node stores the code of the new sub-node and the corresponding relation between the new sub-node and the channel distance of the main node in the first database so as to update the first database; and the channel distance between the newly-added child node and the main node is equal to the sum of the channel distance between the newly-added child node and the nearest child node and the channel distance between the nearest child node and the main node.
Further, the method for replacing and deploying is further included, and after the initial deployment is completed and a certain child node is replaced, the first database is updated: step 11: the newly replaced child node measures the distance of other nodes and sends the distance measurement data generated by the newly replaced child node to the master node; step 12: the master node extracts two sub-nodes which are nearest to and next to the absolute distance of the master node in the ranging data of the newly replaced sub-node and corresponding absolute distances, and the two absolute distances are respectively used as the channel distances between the corresponding nearest sub-node and the corresponding next-nearest sub-node and the newly replaced sub-node; step 13: the main node calculates the channel distance between the main node and the newly replaced child node according to the channel distances between the existing first database, the newly replaced child node, the nearest child node and the next-nearest child node, and searches the code of the replaced child node in the existing first database according to the channel distance; step 14: the master node replaces the code of the replaced child node with the code of the new replacement child node to update the first database.
Further, in the step 13, the master node specifically calculates the channel distance between the master node and the new replacement child node by the following method: the main node calls the channel distance between the main node and the nearest child node and the next nearest child node from the existing first database; the main node takes the nearest child node as an adjacent node of the newly replaced child node, and obtains two operation results of the channel spacing between the main node and the newly replaced child node, wherein the two operation results are the sum or difference of the channel spacing between the main node and the nearest child node and the channel spacing between the newly replaced child node and the nearest child node; the main node takes the next nearest child node as an adjacent node of the newly replaced child node, and obtains two other operation results of the channel spacing between the main node and the newly replaced child node, which are the sum or difference of the channel spacing between the main node and the next nearest child node and the channel spacing between the newly replaced child node and the next nearest child node; and the main node takes the same two of the four operation results as the channel distance between the new replacing child node and the main node.
Furthermore, each node is suitable for establishing a first communication relationship with at least one other node, and the absolute distance between the two nodes is obtained through the corresponding relationship between the signal strength of the preset first communication relationship and the absolute distance; each child node is further adapted to establish a second communication relationship directly with the master node to enable communication therewith, or adapted to establish a second communication relationship chain between itself and the master node and enable communication therewith by successively establishing second communication relationships with other child nodes.
Further, the group of nodes is configured to: the end node can only measure the distance of the adjacent nodes, and the middle node can only measure the distance of the two adjacent nodes.
Further, each node comprises an RFID read head, an RFID tag and a Lora communication module; the RFID reading head of each node and the RFID labels of other nodes establish an RFID communication relation, and the RFID communication relation forms the first communication relation; and each node establishes a Lora communication relationship through a respective Lora communication module, and the Lora communication relationship forms the second communication relationship.
Further, the channel is a tunnel, and each node of the node group is a tunnel lamp.
Compared with the prior art, the invention has the beneficial effects that:
(1) the node group of the present invention has the following configuration: one end node of the node group is a main node, and other nodes are all sub-nodes capable of communicating with the main node. In addition, the distance between any node and the adjacent node is the closest, and each node is suitable for at least ranging the adjacent node, so that each node can at least ranging the adjacent node every time, and the closest node and the next closest node measured by each intermediate node are two adjacent nodes of the node.
Based on the configuration, the initial deployment method starts traversal distance measurement from the main node, processes distance measurement data generated by each distance measurement, generates and updates the first database one by one, and sends a next distance measurement instruction to one sub-node after each processing, and the channel spacing between the main node and all the sub-nodes is obtained and the initial deployment is completed until the distance measurement process traverses to the other end node and cannot update the first database.
Specifically, when processing the ranging data of the master node, the master node analyzes the adjacent child node and takes the child node as the next ranging node; when the ranging data of other child nodes are processed, the main node analyzes the child node far away from the main node in two adjacent nodes of the child node based on the data in the existing first database and takes the child node as the next ranging node. And in each processing process of the ranging data, the main node calculates the channel distance between the next ranging node and the main node based on the existing data in the first database so as to multiplex the ranging data in the next ranging process, thereby gradually updating the first database until the ranging process traverses to the node at the other end.
It can be seen that the initial deployment method of the present invention automatically performs traversal ranging from the master node to the other end, and updates the first database once according to the ranging data in each ranging process, so that the channel spacing between the master node and all the child nodes is obtained when the traversal ranging is completed, the deployment is completed quickly, the engineering quantity is small, and the positioning in the channel is facilitated by the node groups and by using the data of the first database. In addition, the distance measurement process of the initial deployment method of the invention traverses each node of the node group, so the distance measurement error is smaller and the precision is higher.
In addition, the curvature radius of the sub-channel of the curve segment structure defined by any two adjacent nodes in the channel in the node group is far larger than the absolute distance between the two nodes defining the sub-channel, so that the channel distance between any two adjacent nodes is equal to the absolute distance, and further, the absolute distance between each node and the adjacent node measured by each node can be at least ensured to be regarded as the channel distance between the two nodes under the condition that the channel has the arc structure, and the channel distance between each sub-node and the main node is obtained by the primary deployment method.
(2) Extracting the subnode which is not stored in the new subnode of the existing first database and is closest to the main node from the ranging data of the subnode, and analyzing that the new subnode is the subnode which is far away from the main node from two adjacent nodes of the main node; the channel distance between the main node and the main node of each distance measurement is called in the existing first database, and is added with the extracted channel distance between the new sub-node and the main node, so that the first database can be updated; meanwhile, the new child node newly updated in the first database is also the next ranging node.
(3) When the distance measurement data is processed and the new child node is searched for unsuccessfully, the first database updating failure can be judged and the initial deployment is completed, and the operand is small.
(4) The newly added deploying method of the invention enables the newly added child node to automatically measure the distance after the child node forming the end node is newly added, and calls the channel distance between the newly added child node and the main node in the existing first database according to the measured nearest child node, namely the channel distance between the newly added child node and the main node can be obtained through the sum of the two channel distances, and the updating of the first database is completed. Therefore, the deployment method of the invention can automatically and quickly perform new deployment after the child nodes are newly added.
(5) The replacement deployment method of the invention enables the newly replaced sub-node to autonomously measure the distance after the sub-node is replaced, calculates the channel distance between the newly replaced sub-node and the main node according to the measured nearest sub-node and the next nearest sub-node, searches the sub-node which accords with the distance relation in the existing first database, and finds the obtained sub-node which is the replaced sub-node; the updating of the first database may be accomplished by replacing the code of the replaced child node with the code of the new replacement child node. Therefore, the deployment method of the invention can automatically and quickly perform replacement deployment after the child nodes are damaged and replaced.
(6) In the replacement deployment method, the main node respectively takes the nearest child node and the next nearest child node as the adjacent nodes of the newly replaced child node, calculates four possible conditions of the channel distance between the main node and the newly replaced child node, and takes the same two of the four calculation results as the channel distance between the newly replaced child node and the main node to calculate the channel distance between the newly replaced child node and the newly replaced child node, so that the method does not need to search, judge and verify for many times, has small calculation amount and can be suitable for the condition that the end node or the intermediate node is replaced.
(7) Each node establishes a first communication relation with other nodes, and obtains the absolute distance between the two nodes through the corresponding relation between the signal strength and the absolute distance of the first communication relation, so that the nodes can perform wireless distance measurement, and the method is suitable for configuring the distance measurement range of the nodes by adjusting the channel distance of the nodes.
In addition, each node communicates with the main node through the second communication relation and realizes the transmission of instructions and data, and the sub-nodes far away from the main node can also communicate with the main node through establishing the second communication relation chain, thereby well solving the communication problem in the channel.
(8) Each node can only carry out ranging on the adjacent nodes, so that redundant data in ranging data every time are removed, and the calculation amount of the main node in the process of processing the ranging data is effectively reduced.
(9) Realize wireless range finding through the RFID technique, realize data communication through the Lora communication, the communication process is comparatively stable.
(10) The channel is the tunnel, and the node is the tunnel lamp, therefore can refer to existing tunnel lighting arrangement scheme and dispose the node group, and can supply power for the circuit module in the node through the power of tunnel lamp, guaranteed the stable work of node group.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
FIG. 1 is a schematic diagram of a node group within a channel according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of the arrangement of the node group in the channel after adding the end nodes forming the child nodes according to the embodiment of the present invention;
fig. 3 is a schematic diagram of the arrangement of a node group in a channel after replacing a certain child node according to an embodiment of the present invention.
Detailed Description
The technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. It is to be understood that the described embodiments are presently preferred embodiments of the invention and are not to be taken as an exclusion of other embodiments. All other embodiments, which can be obtained by a person skilled in the art without any inventive step based on the embodiments of the present invention, are within the scope of the present invention.
In the claims, the description and the drawings of the present application, unless expressly defined otherwise, the terms "first", "second" or "third", etc. are used for different objects in a group of holes and are not used to describe a particular order.
In the claims, the specification and the drawings of the present invention, the terms "including", "having" and their variants, if used, are intended to be inclusive and not limiting.
In the claims, the description and the drawings of the present invention, the term "absolute distance" is used to refer to the physical straight line distance or the shortest distance between two nodes, and the term "channel distance" is used to refer to the distance between two nodes along the channel extending direction.
The invention provides a method for deploying node groups.
The node group is positioned in the channel and comprises a plurality of nodes which are arranged at intervals along the extending direction of the channel. One end node of the group of nodes is configured as a master node and the other nodes are each configured as child nodes adapted to communicate with the master node.
In this embodiment, the channel is a tunnel, and the nodes are all tunnel lamps. Specifically, the nodes comprise RFID read heads, RFID tags and Lora communication modules, the RFID read heads of each node establish RFID communication relations with the RFID tags of other nodes, and the RFID communication relations form a first communication relation; each node establishes a Lora communication relationship through a respective Lora communication module, and the Lora communication relationship constitutes a second communication relationship.
In this way, each node is suitable for establishing the first communication relationship with at least one other node, and the absolute distance between the two nodes is obtained through the corresponding relationship between the signal strength of the preset first communication relationship and the absolute distance. Each child node is further adapted to establish said second communication relationship with the master node directly for communication with the master node, or adapted to establish a second communication relationship chain between itself and the master node by successively establishing said second communication relationships with other child nodes and to communicate with the master node.
Further, the node group has a configuration in which an absolute distance between any node and its neighboring node is smaller than an absolute distance between the node and a non-neighboring node, and each node is adapted to perform at least ranging on its neighboring node. In other words, the end node can perform ranging on at least one node adjacent to the end node, the nearest node measured by the end node is the adjacent node, the intermediate node can perform ranging on at least two adjacent nodes, and the nearest node and the next nearest node measured by the intermediate node are two adjacent nodes of the intermediate node.
In addition, in the node group, any two adjacent nodes define a sub-channel with a straight line segment structure or a curved line segment structure in the channel, and the node group is configured such that the curvature radius of the sub-channel with any curved line segment structure is much larger than the absolute distance between two nodes defining the sub-channel, so that the channel distance between any two adjacent nodes is substantially equal to the absolute distance, and further, the absolute distance between each node and the adjacent node measured by each node can be regarded as the channel distance between the two nodes even if the channel has an arc-shaped structure.
Based on the node group with the configuration, an embodiment of the present invention provides a method for deploying a node group, which includes a primary deployment method, configured to obtain channel distances between the master node and all the child nodes after a node group is initially installed.
The initial deployment method comprises the following steps:
step 1: the main node carries out distance measurement on other sub-nodes and generates distance measurement data; the distance measurement data comprise the absolute distance between the master node and the measured node. Specifically, the ranging data includes a code of the master node, and a correspondence between the code of the node to be measured and an absolute distance between the node to be measured and the master node.
Step 2: the main node extracts a sub-node closest to the absolute distance of the main node and the absolute distance in the ranging data, takes the absolute distance as the channel distance between the sub-node and the main node, and generates a first database; the first database is used for storing the channel distances between the main node and other sub-nodes. Specifically, the first database stores the code of each child node and the corresponding relationship between the child node and the channel distance of the master node.
And step 3: the master node sends a ranging instruction to a child node farthest from the master node in the first database; and the child node receiving the ranging instruction performs ranging on other nodes to generate ranging data, and sends the ranging data back to the main node.
And 4, step 4: after receiving the ranging data of the child nodes each time, the master node extracts a new child node and the absolute distance, wherein the new child node is closest to the absolute distance of the master node, the absolute distance is used as the channel distance between the new child node and the master node, and the channel distance between the new child node and the master node is obtained according to the channel distance, so that the first database is updated.
And 5: and the main node sends a ranging instruction to the child node farthest from the main node after updating the first database each time, so that the child node ranges the range of other nodes and sends new ranging data back to the main node.
Step 6: and when the master node cannot update the first database after receiving the new ranging data, the master node does not send a ranging instruction and completes the initial deployment.
In other words, the initial deployment method starts traversal ranging from the master node, processes ranging data generated by each ranging, generates and updates the first database one by one, and sends a next ranging instruction to one child node after each processing, until the ranging process traverses to the other end node and cannot update the first database, the channel spacing between the master node and all the child nodes is obtained and deployment is completed.
Specifically, when processing the ranging data of the master node, the master node analyzes the adjacent child node and takes the child node as the next ranging node; when the ranging data of other child nodes are processed, the main node analyzes the child node far away from the main node in two adjacent nodes of the child node based on the data in the existing first database and takes the child node as the next ranging node. And in each processing process of the ranging data, the main node calculates the channel distance between the next ranging node and the main node based on the existing data in the first database so as to multiplex the ranging data in the next ranging process, thereby gradually updating the first database until the ranging process traverses to the node at the other end.
It can be seen that the initial deployment method of the present invention automatically performs traversal ranging from the master node to the other end, and updates the first database once according to the ranging data in each ranging process, so that the channel spacing between the master node and all the child nodes is obtained when the traversal ranging is completed, the deployment is completed quickly, the engineering quantity is small, and the positioning in the channel is facilitated by the node groups and by using the data of the first database. In addition, the distance measurement process of the initial deployment method of the invention traverses each node of the node group, so the distance measurement error is smaller and the precision is higher.
In this embodiment, the step 4 specifically includes:
step 4 a: and searching codes of new sub-nodes which are not stored in the existing first database in the ranging data, extracting the new sub-node which is closest to the absolute distance of the main node and the absolute distance based on at least one new sub-node obtained by searching, and taking the absolute distance as the channel distance between the new sub-node and the main node.
And 4 b: and calling the channel distance between the master node and the master node in the existing first database according to the code of the master node contained in the ranging data.
And 4 c: storing the code of the new child node and the corresponding relation between the new child node and the channel space of the main node in the first database to complete the updating of the first database; and the channel distance between the new child node and the main node is equal to the sum of the channel distance between the new child node and the main test node and the channel distance between the main test node and the main node.
It can be seen that, in step 4, the child node closest to the master node among the new child nodes not stored in the existing first database is extracted from the ranging data of the child nodes, so that the new child node can be analyzed as the child node far away from the master node among the two adjacent nodes of the master node; the channel distance between the main node and the main node in each ranging is called in the existing first database, and is added with the extracted channel distance between the new sub node and the main node, so that the first database can be updated. Meanwhile, the new child node newly updated in the first database is also the next ranging node.
Based on the specific implementation method of step 4, when the code of the new child node which is not stored in the existing first database is found in the ranging data in step 4a and fails to be searched, the first database fails to be updated, and the master node does not send the ranging instruction any more and completes the initial deployment.
Further, the deployment method further includes a new deployment method and a replacement deployment method after the initial deployment is completed, so as to update the first database after an end node constituting the child node is added or a certain child node is replaced, respectively.
The newly added deployment method comprises the following steps:
and 7: the newly added child node carries out ranging on other nodes and sends the ranging data generated by the newly added child node to the master node;
and 8: the master node extracts a sub-node closest to the absolute distance of the newly added sub-node and the absolute distance from the ranging data of the newly added sub-node, and takes the absolute distance as the channel distance between the newly added sub-node and the closest sub-node;
and step 9: the main node calls a channel distance between the nearest child node and the main node in an existing first database according to the code of the nearest child node;
step 10: the main node stores the code of the new sub-node and the corresponding relation between the new sub-node and the channel distance of the main node in the first database so as to update the first database; and the channel distance between the newly-added child node and the main node is equal to the sum of the channel distance between the newly-added child node and the nearest child node and the channel distance between the nearest child node and the main node.
It can be seen that, in the newly added deployment method according to the embodiment of the present invention, after the child nodes forming the end node are newly added, the newly added child node autonomously measures the distance, and calls the channel distance between the newly added child node and the master node in the existing first database according to the measured nearest child node, that is, the channel distance between the newly added child node and the master node can be obtained by the sum of the two channel distances, and the update of the first database is completed. Therefore, the deployment method of the invention can automatically and quickly perform new deployment after the child nodes are newly added.
The replacement deployment method comprises the following steps:
step 11: the newly replaced child node measures the distance of other nodes and sends the distance measurement data generated by the newly replaced child node to the master node;
step 12: the master node extracts two sub-nodes which are nearest to and next to the absolute distance of the master node in the ranging data of the newly replaced sub-node and corresponding absolute distances, and the two absolute distances are respectively used as the channel distances between the corresponding nearest sub-node and the corresponding next-nearest sub-node and the newly replaced sub-node;
step 13: the main node calculates the channel distance between the main node and the newly replaced child node according to the channel distances between the existing first database, the newly replaced child node, the nearest child node and the next-nearest child node, and searches the code of the replaced child node in the existing first database according to the channel distance;
step 14: the master node replaces the code of the replaced child node with the code of the new replacement child node to update the first database.
It can be seen that, in the replacement deployment method of the embodiment of the present invention, after a child node is replaced, a newly replaced child node autonomously measures distance, calculates a channel distance between the newly replaced child node and a master node according to the measured nearest child node and the next nearest child node, searches for a child node conforming to the distance relationship in the existing first database, and finds out an obtained child node, that is, a replaced child node; the updating of the first database may be accomplished by replacing the code of the replaced child node with the code of the new replacement child node. Therefore, the deployment method of the invention can automatically and quickly perform replacement deployment after the child nodes are damaged and replaced.
Specifically, in step 13, the main node may calculate the channel distance between the new replacement child node and the main node in the following manner.
The main node calls the channel spacing between the main node and the nearest child node and the channel spacing between the main node and the next-nearest child node from the existing first database, and calculates four possible conditions of the channel spacing between the main node and the newly replaced child node by taking the two child nodes as the adjacent nodes of the newly replaced child node. In other words, the master node first uses the nearest child node as the neighbor node of the new replacement child node, and calculates two calculation results of the channel spacing between the master node and the new replacement child node, which are the sum or difference between the channel spacing between the master node and the nearest child node and the channel spacing between the new replacement child node and the nearest child node, respectively. And then the main node takes the next-nearest child node as an adjacent node of the newly replaced child node, and calculates other two calculation results of the channel spacing between the main node and the newly replaced child node, wherein the two calculation results are the sum or difference of the channel spacing between the main node and the next-nearest child node and the channel spacing between the newly replaced child node and the next-nearest child node respectively. And finally, the main node takes the same two of the four operation results as the channel distance between the new replacement child node and the main node. The method is adopted for operation, multiple times of searching, judging and verifying are not needed, the operation amount is small, and the method can be suitable for the condition that the end node or the middle node is replaced.
Of course, in other embodiments, the above calculation may also calculate two possible channel distances between the master node and the new child node according to the nearest child node, and perform the auxiliary verification according to the channel distance between the next-nearest child node and the master node.
In addition, in the preferred embodiment, the end node can only range its neighbors, and the intermediate node can only range its two neighbors. In other words, each node can only perform ranging on the adjacent nodes, so that redundant data in ranging data every time is removed, and the calculation amount of the main node in the process of processing the ranging data is effectively reduced.
It should be noted that, in the present invention, the processing of various types of data by the master node (including extracting or searching in the ranging data, reading and writing the first database, and operating various types of data) may be performed by using the processor of the master node itself, or may be performed by uploading the data to another processor that is in signal communication with the master node and has a stronger calculation power, and then returning the data to the master node (in other words, the master node only functions as a gateway), which all belong to the scope of the present invention in which the master node processes various types of data, and thus all fall within the protection scope of the present invention.
Further, the deployment method of the present embodiment is specifically described below by referring to the node layouts shown in fig. 1 to 3 as an example, so that those skilled in the art can understand the method more clearly.
In fig. 1-3, end node a is configured as the master node and the other nodes are each configured as child nodes. Since the channels shown in the figures are of rectilinear configuration, the measured absolute spacing of the nodes is the channel spacing. Furthermore, each node has the same ranging range, in this example the ranging range of the end node can only cover two other nodes, and the ranging range of the intermediate node can cover three or four other nodes. It is to be understood, however, that the channel in which the node group of the present invention is located is not limited to the illustrated straight line configuration, the pitch of each node is not necessarily limited to the pitch illustrated in the figure, and the range of each node is not necessarily limited to the above range.
The process of initial deployment is first described with reference to fig. 1. At the time of initial deployment, the a-node performs ranging on other nodes and generates ranging data as shown in table 1 below.
TABLE 1-ranging data for node A
Then, the node a extracts the child node closest to its absolute distance in the ranging data and the absolute distance, i.e., the node B and the absolute distance X1, and uses the absolute distance X1 as the channel distance X1 between the node B and the node a, and generates the first database as shown in table 2 below.
TABLE 2 first database generated after node A ranging
| A | B | X1 |
Subsequently, the a-node sends a ranging command to the child node farthest from the a-node in the existing first database (table 2), that is, sends a ranging command to the B-node, so that the B-node can range and send the measured ranging data shown in table 3 below back to the a-node.
TABLE 3 ranging data for node B
Subsequently, the node a finds new child nodes, i.e., node C and node D, which are not stored in the existing first database (i.e., table 2) in the ranging data of the node B, extracts the new child node closest to the absolute distance of the node B and the absolute distance, i.e., node C and absolute distance X2, and uses the absolute distance X2 as the channel distance X2 between the node C and the node B. The a node also retrieves the channel distance X1 between the B node and the a node in the existing first database (i.e., table 2), adds the two channel distances to obtain the channel distance X1+ X2 between the C node and the a node, and stores the C node and the channel distance X1+ X2 between the C node and the a node in the first database to form and update the first database as shown in table 4 below.
TABLE 4 first database updated after node B ranging
Then, similarly, node a sends a ranging command to the child node farthest from the child node in the existing first database (table 4), that is, sends a ranging command to node C, so that it can range and send the measured ranging data shown in table 5 below back to node a.
TABLE 5 ranging data for C node
Then, the node a searches the ranging data of the node B for new child nodes, i.e., node D and node E, which are not stored in the existing first database (i.e., table 4), and extracts the new child node closest to the absolute distance between the node C and the new child node, i.e., node D and the absolute distance X3, and uses the absolute distance X3 as the channel distance X3 between the node C and the node D. The a node also retrieves the channel spacing X1+ X2 between the C node and the a node in the existing first database (i.e., table 4), adds the two channel spacings to obtain the channel spacing X1+ X2+ X3 between the D node and the a node, and stores the D node and the channel spacing X1+ X2+ X3 between the D node and the a node in the first database to form and update the first database as shown in table 6 below.
TABLE 6 first database updated after C node ranging
And by analogy, the node A continuously sends a ranging instruction to the child node farthest from the node A in the updated first database, so that the child node measures the distance of other nodes and sends back new ranging data to the node A, and after new ranging data are processed each time, a new child node and the channel distance between the new child node and the node A are obtained, and the first database is updated until the node A is updated to the first database shown in the following table 7 after the node Q is subjected to ranging, and a ranging instruction is sent to the node R at the other end so that the ranging data shown in the following table 8 are sent back.
TABLE 7 first database updated after Q node ranging
TABLE 8-distance measurement data of R node
At this time, the a node cannot find a new child node not stored in the existing first database (table 7) in the ranging data of the R node, so that the first database fails to be updated, thereby completing the initial deployment, and outputting the first database as shown in table 7.
The process of adding a new deployment is described next with reference to fig. 2. And a new end node S node forming a child node is newly added at the end of the R node far away from the A node, and the S node performs ranging on other nodes, generates and sends ranging data back to the A node as shown in the following table 1.
TABLE 9-S node ranging data
The node a extracts the nearest node in the ranging data of the node S and its absolute distance, i.e., the node R and the absolute distance X18, and uses the absolute distance X18 as the channel distance X18 between the node S and the node R. The a node also retrieves the channel distance X1+ X2+ … … + X17 between the R node and the a node in the existing first database (i.e., table 7), adds the two channel distances to obtain the channel distance X1+ X2+ … … + X17+ X18 between the S node and the a node, and stores the S node and the channel distance X1+ X2+ … … + X18 between the S node and the a node in the first database to form and update the first database as shown in table 10 below.
TABLE 10 first database updated after S node ranging
Finally, the process of replacement deployment is described with reference to fig. 3. Due to the damage of the D node, it is replaced with a D node, which performs ranging on other nodes, generates and transmits ranging data back to the a node as shown in table 11 below.
TABLE 11-d node ranging data
The node a extracts the nearest and next nearest nodes in the ranging data of the node d and their absolute distances, that is, the node C and absolute distance X3 and the node E and absolute distance X4, and uses the absolute distance X3 as the channel distance X3 between the node C and the node d, and uses the absolute distance X4 as the channel distance X4 between the node E and the node d.
The node a also retrieves the channel distance X1+ X2 between the node C and the node a and the channel distance X1+ X2+ X3+ X4 between the node E and the node a in the existing first database (table 7), and calculates four possible channel distances between the node d and the node a based on the channel distances, that is, (X1+ X2) + (X3), (X1+ X2) - (X3), (X1+ X2+ X3+ X4) + (X4), and (X1+ X2+ X3+ X4) - (X4), and then the node a takes the same two of the four calculation results as the channel distance between the node d and the node a, that is, the channel distance X1+ X2+ X3. The a node and the channel distance X1+ X2+ X3 are used to search the existing first database (i.e., table 7) for child nodes having the same distance relationship, i.e., D nodes, so as to form and update the first database shown in the following table 12 with the code D of the D node and the code D of the replacement D node.
TABLE 12 first database updated after d node ranging
It should be noted that, in the replacement deployment process, even if the D node or D node is not an intermediate node as shown in fig. 3, but an end node, the nearest node and the next nearest node measured by the D node are respectively a B node and a C node, the channel distances from the D node are respectively X2+ X3 and X3, and since the channel distances from the B node and the C node to the a node are respectively X1 and (X1+ X2), the four cases obtained after the above operations are (X1) + (X2+ X3), (X1) - (X2+ X3), (X1+ X2) + (X3), and (X1+ X2) - (X3). It can be seen that the results of the two identical operations remain X1+ X2+ X3, making the algorithm applicable to the case where an end node or an intermediate node is replaced.
The description of the above specification and examples is intended to be illustrative of the scope of the present invention and is not intended to be limiting. Modifications, equivalents and other improvements which may occur to those skilled in the art and which may be made to the embodiments of the invention or portions thereof through a reasonable analysis, inference or limited experimentation, in light of the common general knowledge, the common general knowledge in the art and/or the prior art, are intended to be within the scope of the invention.
Claims (10)
1. A method for deploying a node group, characterized by: the node group is positioned in the channel and comprises a plurality of nodes which are arranged at intervals along the extending direction of the channel;
in the node group, the absolute distance between any node and the adjacent node is smaller than the absolute distance between the node and the non-adjacent node;
in the node group, any two adjacent nodes define a sub-channel with a straight line segment structure or a curve segment structure in the channel, and the node group is configured to enable the curvature radius of the sub-channel with any curve segment structure to be far larger than the absolute distance between the two nodes defining the sub-channel, so that the channel distance between any two adjacent nodes is equal to the absolute distance;
each node in the node group is suitable for at least ranging the adjacent node;
one end node in the node group is configured as a main node, and other nodes are configured as sub-nodes suitable for communicating with the main node;
the deployment method comprises a primary deployment method, which is used for obtaining the channel spacing between the main node and all the sub-nodes after the initial installation of the node group, and comprises the following steps:
step 1: the main node carries out distance measurement on other sub-nodes and generates distance measurement data; the distance measurement data comprises the absolute distance between a main measurement node and a measured node;
step 2: the main node extracts a sub-node closest to the absolute distance of the main node and the absolute distance in the ranging data, takes the absolute distance as the channel distance between the sub-node and the main node, and generates a first database; the first database is used for storing the channel spacing between the main node and other sub-nodes;
and step 3: the master node sends a ranging instruction to a child node farthest from the master node in the first database; the child node receiving the ranging instruction performs ranging on other nodes to generate ranging data, and sends the ranging data back to the master node;
and 4, step 4: after receiving the ranging data of the child nodes, the master node extracts a new child node closest to the absolute distance of the master node and the absolute distance, and takes the absolute distance as the channel distance between the new child node and the master node to obtain the channel distance between the new child node and the master node according to the channel distance so as to update the first database;
and 5: after updating the first database each time, the main node sends a ranging instruction to the child node farthest from the main node, so that the child node ranges the range of other nodes and sends new ranging data back to the main node;
step 6: and when the master node cannot update the first database after receiving the new ranging data, the master node does not send a ranging instruction and completes the initial deployment.
2. The method of deploying a group of nodes according to claim 1, wherein:
the distance measurement data comprises a code of a master node, a corresponding relation between the code of a tested node and an absolute distance between the tested node and the master node; the first database stores the codes of all the child nodes and the corresponding relation between the child nodes and the channel spacing of the main node;
in step 4, each time the ranging data sent back by a certain child node as a master node is received, the master node updates the first database by the following method:
step 4 a: searching codes of new sub-nodes which are not stored in the existing first database in the ranging data, extracting the new sub-node which is closest to the absolute distance of the main node and the absolute distance based on at least one new sub-node obtained by searching, and taking the absolute distance as the channel distance between the new sub-node and the main node;
and 4 b: calling a channel distance between a master node and a master node in an existing first database according to a code of the master node contained in the ranging data;
and 4 c: storing the code of the new child node and the corresponding relation between the new child node and the channel space of the main node in the first database to complete the updating of the first database; and the channel distance between the new child node and the main node is equal to the sum of the channel distance between the new child node and the main test node and the channel distance between the main test node and the main node.
3. A method of deploying a group of nodes according to claim 2, wherein: when the code of the new child node which is not stored in the existing first database is found in the ranging data in the step 4a, the first database is failed to update, and the master node does not send the ranging instruction any more and completes the initial deployment.
4. The method of claim 2, further comprising a new deployment method for updating the first database after the initial deployment is completed and the end nodes constituting the child nodes are newly added:
and 7: the newly added child node carries out ranging on other nodes and sends the ranging data generated by the newly added child node to the master node;
and 8: the master node extracts a sub-node closest to the absolute distance of the newly added sub-node and the absolute distance from the ranging data of the newly added sub-node, and takes the absolute distance as the channel distance between the newly added sub-node and the closest sub-node;
and step 9: the main node calls a channel distance between the nearest child node and the main node in an existing first database according to the code of the nearest child node;
step 10: the main node stores the code of the new sub-node and the corresponding relation between the new sub-node and the channel distance of the main node in the first database so as to update the first database; and the channel distance between the newly-added child node and the main node is equal to the sum of the channel distance between the newly-added child node and the nearest child node and the channel distance between the nearest child node and the main node.
5. The method of claim 2, further comprising a replacement deployment method for updating the first database after the initial deployment is completed and a child node is replaced:
step 11: the newly replaced child node measures the distance of other nodes and sends the distance measurement data generated by the newly replaced child node to the master node;
step 12: the master node extracts two sub-nodes which are nearest to and next to the absolute distance of the master node in the ranging data of the newly replaced sub-node and corresponding absolute distances, and the two absolute distances are respectively used as the channel distances between the corresponding nearest sub-node and the corresponding next-nearest sub-node and the newly replaced sub-node;
step 13: the main node calculates the channel distance between the main node and the newly replaced child node according to the channel distances between the existing first database, the newly replaced child node, the nearest child node and the next-nearest child node, and searches the code of the replaced child node in the existing first database according to the channel distance;
step 14: the master node replaces the code of the replaced child node with the code of the new replacement child node to update the first database.
6. The method for deploying a node group according to claim 5, wherein in step 13, the master node calculates the channel distance between the master node and the new child node by specifically:
the main node calls the channel distance between the main node and the nearest child node and the next nearest child node from the existing first database;
the main node takes the nearest child node as an adjacent node of the newly replaced child node, and obtains two operation results of the channel spacing between the main node and the newly replaced child node, wherein the two operation results are the sum or difference of the channel spacing between the main node and the nearest child node and the channel spacing between the newly replaced child node and the nearest child node;
the main node takes the next nearest child node as an adjacent node of the newly replaced child node, and obtains two other operation results of the channel spacing between the main node and the newly replaced child node, which are the sum or difference of the channel spacing between the main node and the next nearest child node and the channel spacing between the newly replaced child node and the next nearest child node;
and the main node takes the same two of the four operation results as the channel distance between the new replacing child node and the main node.
7. A method of deploying a group of nodes according to any of claims 1-6, wherein:
each node is suitable for establishing a first communication relation with at least one other node, and the absolute distance between the two nodes is obtained through the corresponding relation between the signal strength of the preset first communication relation and the absolute distance;
each child node is further adapted to establish a second communication relationship directly with the master node to enable communication therewith, or adapted to establish a second communication relationship chain between itself and the master node and enable communication therewith by successively establishing second communication relationships with other child nodes.
8. The method of deploying a node group according to claim 7, wherein the node group is configured to: the end node can only measure the distance of the adjacent nodes, and the middle node can only measure the distance of the two adjacent nodes.
9. A method of deploying a group of nodes according to claim 7, wherein: each node comprises an RFID read head, an RFID tag and a Lora communication module;
the RFID reading head of each node and the RFID labels of other nodes establish an RFID communication relation, and the RFID communication relation forms the first communication relation;
and each node establishes a Lora communication relationship through a respective Lora communication module, and the Lora communication relationship forms the second communication relationship.
10. A method of deploying a group of nodes according to claim 9, wherein: the channel is a tunnel, and each node of the node group is a tunnel lamp.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110698344.4A CN113438660B (en) | 2021-06-23 | 2021-06-23 | Node group deployment method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110698344.4A CN113438660B (en) | 2021-06-23 | 2021-06-23 | Node group deployment method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113438660A true CN113438660A (en) | 2021-09-24 |
| CN113438660B CN113438660B (en) | 2022-07-19 |
Family
ID=77755151
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110698344.4A Active CN113438660B (en) | 2021-06-23 | 2021-06-23 | Node group deployment method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113438660B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103762591A (en) * | 2014-01-16 | 2014-04-30 | 国家电网公司 | Power distribution network topology layout method |
| US20160360562A1 (en) * | 2015-06-04 | 2016-12-08 | Accenture Global Services Limited | Wireless network with unmanned vehicle nodes providing network data connectivity |
| CN110753328A (en) * | 2019-09-30 | 2020-02-04 | 天地（常州）自动化股份有限公司 | Chain type networking transmission method based on LoRa technology |
| US20200229124A1 (en) * | 2019-01-11 | 2020-07-16 | Qualcomm Incorporated | Network calibration with round-trip-time (rtt)-based positioning procedures |
| CN111836332A (en) * | 2019-04-19 | 2020-10-27 | 武汉所为科技有限公司 | Lora chain network communication method, Lora gateway and Lora chain network communication system |
| CN112566239A (en) * | 2020-11-09 | 2021-03-26 | 西安电子科技大学 | Anchor node selection and deployment method, system, storage medium, equipment and application |
-
2021
- 2021-06-23 CN CN202110698344.4A patent/CN113438660B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103762591A (en) * | 2014-01-16 | 2014-04-30 | 国家电网公司 | Power distribution network topology layout method |
| US20160360562A1 (en) * | 2015-06-04 | 2016-12-08 | Accenture Global Services Limited | Wireless network with unmanned vehicle nodes providing network data connectivity |
| US20200229124A1 (en) * | 2019-01-11 | 2020-07-16 | Qualcomm Incorporated | Network calibration with round-trip-time (rtt)-based positioning procedures |
| CN111836332A (en) * | 2019-04-19 | 2020-10-27 | 武汉所为科技有限公司 | Lora chain network communication method, Lora gateway and Lora chain network communication system |
| CN110753328A (en) * | 2019-09-30 | 2020-02-04 | 天地（常州）自动化股份有限公司 | Chain type networking transmission method based on LoRa technology |
| CN112566239A (en) * | 2020-11-09 | 2021-03-26 | 西安电子科技大学 | Anchor node selection and deployment method, system, storage medium, equipment and application |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113438660B (en) | 2022-07-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110609759B (en) | Fault root cause analysis method and device | |
| US7280481B2 (en) | Shortest path search method “Midway” | |
| Calamoneri | The L (h, k)-labelling problem: an updated survey and annotated bibliography | |
| CN107508632B (en) | Method and device for positioning faults of optical cables in same route | |
| US8667447B2 (en) | Wiring design apparatus and method | |
| US8134964B2 (en) | Network address assigning and allocating method and routing method for long-thin wireless network | |
| CN113438660B (en) | Node group deployment method | |
| Ghesmoune et al. | Micro-batching growing neural gas for clustering data streams using spark streaming | |
| CN108574640B (en) | Method and device for detecting service same route in transmission network | |
| CN108667659B (en) | Method and system for searching loop node in network topological graph | |
| Karaşan et al. | Survivability in hierarchical telecommunications networks under dual homing | |
| CN115017861A (en) | Method, device and equipment for automatically wiring PCB and readable medium | |
| CN110635925B (en) | Network node analysis system and analysis method | |
| CN109726895B (en) | Multi-target-point task execution planning method and device | |
| Dondi et al. | Weak pattern matching in colored graphs: Minimizing the number of connected components | |
| CN115086224B (en) | Shortest route implementation method and system based on Farey model | |
| US8649295B2 (en) | Course searching method and node device | |
| Nguyen et al. | Cleman: Comprehensive clone group evolution management | |
| US20220360335A1 (en) | End-to-end circuit stitching | |
| Pan | A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings | |
| CN115460094B (en) | Determination method and device for physical looping point | |
| Cinel et al. | A distributed heuristic algorithm for the rectilinear steiner minimal tree problem | |
| US20220283585A1 (en) | Transport management system, transport management method, and program | |
| CN111130846B (en) | Target object determination method and device and storage medium | |
| CN111258271B (en) | Cutting graph generation method and device, computer equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |