Communication network automatic addressing method, automatic addressing system and related equipment

Abstract

The embodiment of the invention provides a communication network automatic addressing method, an automatic addressing system and related equipment. The method comprises the following steps: acquiring slave node distribution information of a communication network; selecting candidate slave nodes from the plurality of slave nodes; acquiring first ranging data corresponding to the first ranging request through the first communication module; acquiring second ranging data corresponding to the second ranging request through a second communication module; determining a first relative position between the candidate slave node and the master node according to the first ranging data and the second ranging data; performing matching in the slave node distribution information based on the first relative position, and determining a target slave node; and addressing the target slave node through the communication address of the candidate slave node, re-determining the candidate slave node from all the slave nodes which are not selected, and returning to execute the step of sending the first ranging request to the candidate slave node through the first communication module until all the slave nodes of the communication network finish addressing.

Description

Technical Field

[0001] The present application relates to the field of network communication technology, and in particular to a communication network automatic addressing method, an automatic addressing system and related equipment. Background Art

[0002] In a communication network, each connected device needs to be assigned a unique address to enable mutual communication and identification. Addressing technology refers to the technical method of assigning addresses to devices in the network. Reasonable and efficient addressing is essential for the normal operation of the network.

[0003] In the related art, the traditional addressing method relies on complex network protocols and manual configuration, that is, manually inputting and configuring addresses for each device. However, the traditional manual addressing method is not only inefficient, but also increases the possibility of errors as the network scale continues to expand. Therefore, manual addressing can no longer meet the needs of large-scale communication network addressing. Summary of the invention

[0004] The embodiments of the present application provide a communication network automatic addressing method, an automatic addressing system and related equipment, which can realize automatic addressing of large-scale network nodes.

[0005] To achieve the above-mentioned purpose, a first aspect of an embodiment of the present application proposes a communication network automatic addressing method, the method is applied to a master node in a communication network, the master node is configured with a first communication module and a second communication module, the communication network also includes a plurality of slave nodes, the method comprises: obtaining slave node distribution information of the communication network; wherein the slave node distribution information comprises the real position information of each slave node in the communication network relative to the master node; selecting a candidate slave node from the plurality of slave nodes; sending a first ranging request to the candidate slave node through the first communication module, and obtaining first ranging data corresponding to the first ranging request from the candidate slave node; and obtaining first ranging data corresponding to the first ranging request from the candidate slave node through the second communication module. The communication module sends a second ranging request to the candidate slave node, and obtains second ranging data corresponding to the second ranging request from the candidate slave node; determines a first relative position between the candidate slave node and the master node according to the first ranging data and the second ranging data; matches the slave node distribution information based on the first relative position to determine a target slave node; addresses the target slave node through the communication address of the candidate slave node, and re-determines the candidate slave node from the slave nodes that have not been selected, and returns to execute sending the first ranging request to the candidate slave node through the first communication module until all the slave nodes of the communication network have completed addressing.

[0006] In some embodiments, determining the first relative position between the candidate slave node and the master node based on the first ranging data and the second ranging data includes: acquiring a first distance between the first communication module and the second communication module; determining a first measurement angle formed by the candidate slave node, the first communication module, and the second communication module with the candidate slave node as a common endpoint based on the first distance, the first ranging data, and the second ranging data; and determining the first relative position based on the first measurement angle, the first ranging data, and the second ranging data.

[0007] In some embodiments, determining a first measurement angle formed by the candidate slave node, the first communication module, and the second communication module with the candidate slave node as a common endpoint based on the first distance, the first ranging data, and the second ranging data includes: calculating the second distance between the first communication module and the candidate slave node based on the first ranging data; calculating the third distance between the second communication module and the candidate slave node based on the second ranging data; and calculating the first measurement angle based on the first distance, the second distance, and the third distance based on the law of cosines.

[0008] In some embodiments, the first ranging data includes a first sending time of the first ranging request, a first receiving time when the candidate slave node receives the first ranging request, a second sending time when the candidate slave node sends the first ranging data, and a second receiving time when the master node receives the first ranging data; the second ranging data includes a third sending time when the second ranging request is sent, a third receiving time when the candidate slave node receives the second ranging request, a fourth sending time when the candidate slave node sends the second ranging data, and a fourth receiving time when the master node receives the second ranging data; the calculating the second distance between the first communication module and the candidate slave node according to the first ranging data includes: acquiring a channel transmission rate; calculating a first transmission time according to the first sending time, the first receiving time, the second sending time, and the second receiving time; calculating the second distance according to the channel transmission rate and the first transmission time; the calculating the third distance between the second communication module and the candidate slave node according to the second ranging data includes: calculating a second transmission time according to the third sending time, the third receiving time, the fourth sending time, and the fourth receiving time; and calculating the third distance according to the channel transmission rate and the second transmission time.

[0009] In some embodiments, the method further includes: obtaining a third ranging request sent by the candidate slave node to the first communication module, and sending third ranging data to the candidate slave node through the first communication module in response to the third ranging request, so that the candidate slave node calculates a fourth distance according to the third ranging data, and sends the fourth distance to the master node; obtaining a fourth ranging request sent by the candidate slave node to the second communication module, and sending fourth ranging data to the candidate slave node through the second communication module in response to the fourth ranging request, so that the candidate slave node calculates a fifth distance according to the fourth ranging data, and returns the fifth distance to the master node; obtaining the fourth distance and the fifth distance, calculating a first average distance according to the second distance and the fourth distance, and calculating a second average distance according to the third distance and the fifth distance; and calculating a first relative position between the candidate slave node and the master node according to the first average distance and the second average distance.

[0010] In some embodiments, addressing the target slave node through the communication address of the candidate slave node includes: obtaining the target slave node number of the target slave node; establishing a mapping between the target slave node number and the communication address; and setting the communication address as the target communication address of the target slave node.

[0011] In some embodiments, before selecting a candidate slave node from the plurality of slave nodes, the method further includes: acquiring ranging tag data; wherein the ranging tag data includes real position information of the test slave node relative to the test master node in the test communication network; controlling the test master node to send a test ranging request to the test slave node based on a preset communication frequency and a preset filtering algorithm, and acquiring test ranging data corresponding to the test ranging request from the test slave node; comparing the test ranging data with the ranging tag data to obtain test deviation data; optimizing the preset communication frequency and the preset filtering algorithm based on the test deviation data, and returning to execute control of the test master node to send a test ranging request to the test slave node based on the optimized communication frequency and the optimized filtering algorithm, until the test deviation data meets preset conditions, and obtains a target communication frequency and a target filtering algorithm.

[0012] To achieve the above-mentioned purpose, the second aspect of the embodiment of the present application proposes a communication network automatic addressing system, comprising: a node distribution module, used to obtain slave node distribution information of the communication network; wherein the slave node distribution information includes the real position information of each slave node in the communication network relative to the master node; a candidate node module, used to select a candidate slave node from a plurality of the slave nodes; a first ranging module, used to send a first ranging request to the candidate slave node through the first communication module of the master node, and obtain first ranging data corresponding to the first ranging request from the candidate slave node; a second ranging module, used to send a second ranging request to the candidate slave node through the second communication module of the master node, and obtain first ranging data corresponding to the first ranging request from the candidate slave node The candidate slave node obtains the second ranging data corresponding to the second ranging request; a relative position module is used to determine the first relative position between the candidate slave node and the master node according to the first ranging data and the second ranging data; a target slave node module is used to match the slave node distribution information based on the first relative position to determine the target slave node; an addressing module is used to address the target slave node through the communication address of the candidate slave node, and re-determine the candidate slave node from the slave nodes that have not been selected, and return to execute sending the first ranging request to the candidate slave node through the first communication module until all the slave nodes in the communication network have completed addressing.

[0013] To achieve the above-mentioned purpose, the third aspect of an embodiment of the present application proposes an electronic device, which includes a memory and a processor, the memory stores a computer program, and the processor implements the communication network automatic addressing method as described in the first aspect when executing the computer program.

[0014] To achieve the above-mentioned purpose, the fourth aspect of an embodiment of the present application proposes a storage medium, which is a computer-readable storage medium, and the storage medium stores a computer program. When the computer program is executed by a processor, it implements the communication network automatic addressing method as described in the first aspect.

[0015] The embodiment of the present application proposes an automatic addressing method for a communication network, an automatic addressing system and related equipment. The method is applied to a master node in a communication network, the master node is configured with a first communication module and a second communication module, and the communication network also includes multiple slave nodes. The method includes: obtaining slave node distribution information of the communication network; selecting a candidate slave node from the multiple slave nodes; sending a first ranging request to the candidate slave node through the first communication module, and obtaining first ranging data corresponding to the first ranging request from the candidate slave node; sending a second ranging request to the candidate slave node through the second communication module, and obtaining second ranging data corresponding to the second ranging request from the candidate slave node; determining a first relative position between the candidate slave node and the master node according to the first ranging data and the second ranging data; matching in the slave node distribution information based on the first relative position to determine the target slave node; addressing the target slave node through the communication address of the candidate slave node, reselecting the candidate slave node until all slave nodes in the communication network are addressed, using the high-precision ranging capabilities of the first communication module and the second communication module to accurately determine the target slave node, and automatically complete the addressing of the slave node, so as to realize automatic addressing of large-scale network nodes.

[0016] Other features and advantages of the present application will be described in the following description, and partly become apparent from the description, or understood by practicing the present application. The purpose and other advantages of the present application can be realized and obtained by the structures specifically pointed out in the description, claims and drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] Figure 1 is an optional flow chart of the communication network automatic addressing method provided in an embodiment of the present application;

[0018] Figure 2 is another optional flow chart of the communication network automatic addressing method provided in an embodiment of the present application;

[0019] Figure 3 is another optional flow chart of the communication network automatic addressing method provided in an embodiment of the present application;

[0020] Figure 4 is a schematic diagram of a first measurement angle of the communication network automatic addressing method provided in an embodiment of the present application;

[0021] Figure 5 is another optional flow chart of the communication network automatic addressing method provided in an embodiment of the present application;

[0022] Figure 6 is a schematic diagram of first ranging data provided by an embodiment of the present application;

[0023] Figure 7is another optional flow chart of the communication network automatic addressing method provided in an embodiment of the present application;

[0024] Figure 8 is a schematic diagram of a third ranging request provided in an embodiment of the present application;

[0025] Fig. 9 It is a schematic diagram of a master node and a slave node of a communication network provided in an embodiment of the present application;

[0026] Fig.10 is another optional flow chart of the communication network automatic addressing method provided in an embodiment of the present application;

[0027] Fig.11 is another optional flow chart of the communication network automatic addressing method provided in an embodiment of the present application;

[0028] Fig.12 It is a functional module diagram of the communication network automatic addressing system provided by an embodiment of the present application;

[0029] Fig.13 It is a schematic diagram of the hardware structure of the electronic device provided in the embodiment of the present application. DETAILED DESCRIPTION

[0030] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application 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 application and are not used to limit the present application.

[0031] It should be noted that although the functional modules are divided in the device schematic and the logical order is shown in the flowchart, in some cases, the steps shown or described may be performed in a different order than the module division in the device or the order in the flowchart.

[0032] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art to which this application belongs. The terms used herein are only for the purpose of describing the embodiments of this application and are not intended to limit this application.

[0033] In a communication network, each connected device needs to be assigned a unique address to enable mutual communication and identification. Addressing technology refers to the technical method of assigning addresses to devices in the network. Reasonable and efficient addressing is essential for the normal operation of the network.

[0034] In the related art, the traditional addressing method relies on complex network protocols and manual configuration, that is, manually inputting and configuring addresses for each device. However, the traditional manual addressing method is not only inefficient, but also increases the possibility of errors as the network scale continues to expand. Therefore, manual addressing can no longer meet the needs of large-scale communication network addressing.

[0035] Based on this, the embodiments of the present application provide a communication network automatic addressing method, an automatic addressing system and related equipment, which can realize automatic addressing of large-scale network nodes.

[0036] The communication network automatic addressing method, automatic addressing system and related equipment provided in the embodiments of the present application are specifically described by the following embodiments. First, the communication network automatic addressing method in the embodiments of the present application is described. The communication network automatic addressing method in the embodiments of the present application can be described by the following embodiments.

[0037] Figure 1 It is an optional flowchart of the communication network automatic addressing method provided in an embodiment of the present application. The method is applied to a master node in a communication network. The master node is configured with a first communication module and a second communication module. The communication network also includes multiple slave nodes. Figure 1 The method in the embodiment may include but is not limited to steps 101 to 107. Figure 1 The order of step 101 to step 107 is not specifically limited, and the order of steps can be adjusted or some steps can be reduced or added according to actual needs.

[0038] Step 101: Obtain slave node distribution information of a communication network.

[0039] The slave node distribution information includes the real position information of each slave node relative to the master node in the communication network.

[0040] The following is a detailed description of step 101.

[0041] Exemplarily, the master node is the core of the communication network, responsible for coordinating and managing all communication activities in the network. It is configured with a first communication module and a second communication module to achieve effective communication with the slave node. The slave node refers to a device node that communicates with the master node in the communication network. The first communication module and the second communication module are basic components for sending and receiving data in the communication system, and may include a radio frequency module, a module that uses radio frequencies for wireless communication, suitable for long-distance and wide-bandwidth communications, and may also include an ultra-wideband (UWB) module, a module that uses ultra-wideband technology for high-speed data transmission and precise distance measurement.

[0042] It can be understood that the slave node distribution information refers to the actual spatial position information of each slave node relative to the master node in the communication network, including but not limited to the geographical coordinates, physical position, relative position in the network topology structure, etc. of the slave node relative to the master node. Collecting the distribution information of all slave nodes in the communication network is the basis of the automatic addressing method. The collected slave node distribution information will be used in the subsequent steps of sending ranging requests, determining relative positions, matching and automatic addressing, and is the key information of the entire automatic addressing method.

[0043] Step 102: Select a candidate slave node from a plurality of slave nodes.

[0044] The following is a detailed description of step 102.

[0045] Exemplarily, a candidate node may be selected from multiple slave nodes by a relevant algorithm or rule, which may include random selection, priority-based sequential selection, etc., and may be based on multiple factors, including but not limited to the signal strength, communication quality, geographic location, energy consumption status, historical communication records, etc. of the slave node. A candidate slave node is selected from multiple slave nodes to perform ranging for the candidate slave node.

[0046] Step 103: Send a first ranging request to the candidate slave node through the first communication module, and obtain first ranging data corresponding to the first ranging request from the candidate slave node.

[0047] The following is a detailed description of step 103.

[0048] It can be understood that in this step, the candidate slave node is measured by the first communication module, and the first ranging request is a signal or message sent by the master node based on the first communication module, which is intended to start the distance measurement process with the slave node. The first ranging data refers to the measurement result returned by the slave node to the master node, which may include information such as timestamp and signal strength, and is used to calculate the distance between the master node and the candidate slave node.

[0049] In some embodiments, the first communication module sends a first ranging request to the candidate slave node using ultra-wideband (UWB) technology, which can provide higher time resolution, thereby achieving more accurate distance measurement. The candidate slave node replies to the first communication module with ranging data including the timestamp and signal strength of receiving the first ranging request.

[0050] Step 104: Send a second ranging request to the candidate slave node through the second communication module, and obtain second ranging data corresponding to the second ranging request from the candidate slave node.

[0051] Step 104 is described in detail below.

[0052] It can be understood that in this step, the second communication module is used to measure the distance of the candidate slave node, and the second ranging request is a signal or message sent by the master node based on the second communication module, which is intended to start the distance measurement process between the master node and the slave node. The second ranging data refers to the measurement result returned by the slave node to the master node, which may include information such as timestamp and signal strength, and is used to calculate the distance between the master node and the candidate slave node.

[0053] In some embodiments, if in step 103 or step 104, a candidate slave node fails to reply the first ranging data or the second ranging data within a predetermined time, the master node will mark the slave node as a communication failure and select a new candidate slave node to re-measure the distance.

[0054] Step 105: Determine a first relative position between the candidate slave node and the master node according to the first ranging data and the second ranging data.

[0055] The following is a detailed description of step 105.

[0056] It can be understood that in this step, the first relative position between the candidate slave node and the master node is determined based on the first ranging data and the second ranging data, and the distance and angle between the master node and the candidate slave node can be measured. For example, the collected first ranging data and the second ranging data include the distance and angle data between the master node and the candidate slave node, and the position of the candidate slave node relative to the master node, that is, the first relative position, is calculated through a data processing algorithm, such as the cosine theorem.

[0057] See also Figure 2 In some embodiments, determining the first relative position between the candidate slave node and the master node based on the first ranging data and the second ranging data may include the following steps 201 to 203.

[0058] Step 201: Acquire a first distance between a first communication module and a second communication module.

[0059] Step 202: Determine a first measurement angle formed by the candidate slave node, the first communication module, and the second communication module with the candidate slave node as a common endpoint according to the first distance, the first ranging data, and the second ranging data.

[0060] Step 203: Determine a first relative position according to the first measured angle, the first distance measurement data, and the second distance measurement data.

[0061] Steps 201 to 203 are described in detail below.

[0062] It is understood that the first distance refers to the known distance between the first communication module and the second communication module, which is used for subsequent geometric calculations. The first measured angle is an angle calculated based on the first ranging data, the second ranging data, and the first distance, with the candidate slave node as the vertex. The first relative position is the position of the candidate slave node relative to the master node calculated based on the ranging data and the first measured angle.

[0063] Exemplarily, the first distance between the first communication module and the second communication module can be obtained by direct measurement, using network configuration information, or based on previously calibrated data. Using the first ranging data and the second ranging data, as well as the first distance, determining the first measurement angle by geometric calculation may involve using trigonometric functions and the law of cosines, and constructing a triangle with the first communication module and the second communication module as fixed points and the candidate slave node as vertices, and solving the triangle to find the first relative position of the candidate slave node.

[0064] Through the above steps 201 to 203, the first distance between the first communication module and the second communication module is obtained, and the first measurement angle formed by the candidate slave node, the first communication module, and the second communication module with the candidate slave node as a common endpoint is determined according to the first distance, the first ranging data, and the second ranging data. The first relative position is determined according to the first measurement angle, the first ranging data, and the second ranging data, and the first relative position of the candidate slave node relative to the master node can be accurately obtained.

[0065] See also Figure 3 In some embodiments, determining a first measurement angle formed by three points of a candidate slave node, a first communication module, and a second communication module with the candidate slave node as a common endpoint according to the first distance, the first ranging data, and the second ranging data may include the following steps 301 to 303:

[0066] Step 301: Calculate a second distance between a first communication module and a candidate slave node according to first ranging data.

[0067] Step 302: Calculate and obtain a third distance between the second communication module and the candidate slave node according to the second ranging data.

[0068] Step 303: Based on the law of cosines, a first measurement angle is calculated according to the first distance, the second distance, and the third distance.

[0069] Steps 301 to 303 are described in detail below.

[0070] Understandably, see Figure 4, the second distance is the distance between the first communication module and the candidate slave node calculated based on the first ranging data. The first communication module is a module on the master node used for UWB communication with the slave node. Through UWB communication, the first communication module of the master node can measure the distance between the master node and the candidate slave node, which is recorded as the second distance. The third distance is the distance between the second communication module and the candidate slave node calculated based on the second ranging data. The first measurement angle is an internal angle in the triangle formed by the candidate slave node, the first communication module and the second communication module. With the candidate slave node as the vertex, the cosine value of the first measurement angle can be calculated based on the cosine theorem, and then the degree or radian of the first measurement angle can be obtained by taking the inverse cosine value.

[0071] Through the above steps 301 to 303, the second distance between the first communication module and the candidate slave node is calculated according to the first ranging data, and the third distance between the second communication module and the candidate slave node is calculated according to the second ranging data. Based on the cosine theorem, the first measurement angle is calculated according to the first distance, the second distance and the third distance, and the measurement angle formed by the candidate slave node and the two communication modules is determined, providing basic data for subsequent position calculation and automatic addressing.

[0072] See also Figure 5 In some embodiments, the first ranging data includes a first sending time of a first ranging request, a first receiving time when a candidate slave node receives the first ranging request, a second sending time when the candidate slave node sends the first ranging data, and a second receiving time when the master node receives the first ranging data. Calculating the second distance between the first communication module and the candidate slave node according to the first ranging data may include the following steps 401 to 403:

[0073] Step 401: Obtain channel transmission rate.

[0074] Step 402: Calculate a first transmission time according to a first sending time, a first receiving time, a second sending time, and a second receiving time.

[0075] Step 403: Calculate a second distance according to the channel transmission rate and the first transmission time.

[0076] Steps 401 to 403 are described in detail below.

[0077] For example, see Figure 6 The first ranging data includes a first sending time t0 of a first ranging request, a first receiving time t1 of a candidate slave node receiving the first ranging request, a second sending time t2 of a candidate slave node sending the first ranging data, and a second receiving time t3 of a master node receiving the first ranging data.

[0078] It can be understood that the first communication module can be based on UWB communication, and the channel transmission rate c is an important parameter that determines the transmission speed of data in the channel. The master node can obtain the current channel transmission rate by pre-configuration or dynamic testing. The first sending moment is the moment when the master node sends the first ranging request, the first receiving moment is the moment when the candidate slave node receives the first ranging request, the second sending moment is the moment when the candidate slave node sends the first ranging data, and the second receiving moment is the moment when the master node receives the first ranging data. Based on these four moments, the transmission time of the first ranging request in the channel can be calculated, that is, the first transmission time = t3-t0-(t2-t1). The second distance is half of the product of the first transmission time and the channel transmission rate.

[0079] See also Figure 5 The second ranging data includes a third sending time of the second ranging request, a third receiving time when the candidate slave node receives the second ranging request, a fourth sending time when the candidate slave node sends the second ranging data, and a fourth receiving time when the master node receives the second ranging data. Calculating the third distance between the second communication module and the candidate slave node according to the second ranging data may include the following steps 404 to 405:

[0080] Step 404: Calculate a second transmission time according to the third sending time, the third receiving time, the fourth sending time, and the fourth receiving time.

[0081] Step 405: Calculate a third distance according to the channel transmission rate and the second transmission time.

[0082] Steps 404 to 405 are described in detail below.

[0083] It can be understood that the second ranging data includes the third sending time of the second ranging request, the third receiving time when the candidate slave node receives the second ranging request, the fourth sending time when the candidate slave node sends the second ranging data, and the fourth receiving time when the master node receives the second ranging data. The second transmission time is calculated according to the third sending time, the third receiving time, the fourth sending time and the fourth receiving time, and the third distance is calculated according to the channel transmission rate and half of the product of the second transmission time.

[0084] Through the above steps 401 to 405, the master node can calculate the second distance between the first communication module and the candidate slave node, and the third distance between the second communication module and the candidate slave node according to the timestamp information recorded in the first ranging data and the second ranging data, combined with the channel transmission rate, and utilizes the time-of-flight ranging characteristics of UWB communication to efficiently and accurately obtain the location information of the candidate slave node.

[0085] See also Figure 7 In some embodiments, the method further includes the following steps 501 to 504:

[0086] Step 501: Obtain a third ranging request sent by a candidate slave node to a first communication module, and in response to the third ranging request, send third ranging data to the candidate slave node through the first communication module, so that the candidate slave node calculates a fourth distance according to the third ranging data, and sends the fourth distance to the master node.

[0087] Step 502: Obtain a fourth ranging request sent by the candidate slave node to the second communication module, and send fourth ranging data to the candidate slave node through the second communication module in response to the fourth ranging request, so that the candidate slave node calculates a fifth distance according to the fourth ranging data, and returns the fifth distance to the master node.

[0088] Step 503: Obtain the fourth distance and the fifth distance, calculate the first average distance according to the second distance and the fourth distance, and calculate the second average distance according to the third distance and the fifth distance.

[0089] Step 504: Calculate a first relative position between the candidate slave node and the master node according to the first average distance and the second average distance.

[0090] Steps 501 to 504 are described in detail below.

[0091] For example, see Figure 8 , the candidate slave node sends a third ranging request to the first communication module, and in response to the third ranging request, sends third ranging data to the candidate slave node through the first communication module, so that the candidate slave node can calculate a fourth distance according to the third ranging data, and return the distance to the master node. The candidate slave node sends a fourth ranging request to the second communication module, and in response to the fourth ranging request, sends fourth ranging data to the candidate slave node through the second communication module.

[0092] It can be understood that the master node obtains the fourth distance and the fifth distance returned by the candidate slave node, calculates the first average distance based on the second distance and the fourth distance calculated previously, and calculates the second average distance based on the third distance and the fifth distance calculated previously. The master node uses the first average distance and the second average distance, combined with the triangulation principle, to calculate the position coordinates of the candidate slave node relative to the master node, that is, the first relative position.

[0093] Through the above steps 501 to 504, the master node obtains the distance information sent from the candidate slave node twice, namely the fourth distance and the fifth distance, and calculates two average distances based on the second distance and the third distance. Finally, these average distance information are used to infer the position coordinates of the candidate slave node relative to the master node, so that the position information of the slave node can be obtained more accurately.

[0094] Step 106: Match the slave node distribution information based on the first relative position to determine the target slave node.

[0095] Step 106 is described in detail below.

[0096] It is understandable that the master node first obtains the topological distribution information of all slave nodes, such as their specific coordinate positions in space, and these topological distribution information are stored as slave node distribution information. The master node matches and compares the calculated first relative position with the previously known slave node distribution information, and finds the closest slave node by calculating the distance between the first relative position and each slave node position, and determines it as the target slave node. This matching process can use the nearest neighbor algorithm or other spatial indexing technology to improve matching efficiency.

[0097] Step 107: Address the target slave node through the communication address of the candidate slave node, and re-determine the candidate slave node from the slave nodes that have not been selected, and return to execute sending the first ranging request to the candidate slave node through the first communication module until all slave nodes in the communication network have completed addressing.

[0098] Step 107 is described in detail below.

[0099] It is understandable that after determining the target slave node, the communication address of the candidate slave node is used to address the target slave node, and a unique address identifier is assigned to the target slave node for subsequent communication and management. According to the measured location information, the master node binds the physical location of each candidate slave node with their MAC address to achieve automatic addressing.

[0100] participate Fig. 9In some embodiments, the communication network includes a master node, the master node is configured with a first communication module and a second communication module, the first communication module is M-UWB1, the second communication module is M-UWB2, and the first communication module and the second communication module are both based on ultra-wideband technology communication. It also includes multiple slave nodes (slave node 1, slave node 2, slave node 3, slave node 4, ..., slave node N), each slave node is configured with an ultra-wideband communication module (S-UWB1, S-UWB2, S-UWB3, S-UWB4, ..., S-UWBN) of the slave node. The master node MCU configures the first communication module and the second communication module to complete initialization, and controls the first communication module and the second communication module to establish a wireless connection with the ultra-wideband communication modules (S-UWB1, S-UWB2, S-UWB3, S-UWB4, ..., S-UWBN) of all slave nodes. According to the slave node distribution information and the first relative position of each slave node and the master node, the specific position of each node in the two-dimensional plane is determined, each slave node is physically addressed, and a number corresponding to the node mapping relationship is assigned to it. The slave node MAC address is matched with the physical address one by one to complete the automatic addressing of all slave nodes.

[0101] See also Fig.10 In some embodiments, addressing the target slave node by the communication address of the candidate slave node may include the following steps 601 to 603:

[0102] Step 601: Obtain the target slave node number of the target slave node.

[0103] Step 602: Establish a mapping between the target slave node number and the communication address.

[0104] Step 603: Set the communication address to the target communication address of the target slave node.

[0105] Steps 601 to 603 are described in detail below.

[0106] It can be understood that the target slave node number is a unique identifier used to distinguish different slave nodes. After the master node obtains the target slave node number of the target slave node, it is necessary to establish a mapping relationship between it and the communication address of the slave node. The mapping relationship can be stored in the database or other data structure of the master node for subsequent address management and query. The communication address is set to the target communication address of the target slave node. For example, using a network management protocol (such as SNMP, NetConf, etc.), the communication address in the mapping relationship is written into the network interface of the target slave node to complete the addressing of the target slave node.

[0107] Through the above steps 101 to 107, the slave node distribution information of the communication network is obtained; a candidate slave node is selected from multiple slave nodes; a first ranging request is sent to the candidate slave node through the first communication module, and first ranging data corresponding to the first ranging request is obtained from the candidate slave node; a second ranging request is sent to the candidate slave node through the second communication module, and second ranging data corresponding to the second ranging request is obtained from the candidate slave node; a first relative position between the candidate slave node and the master node is determined according to the first ranging data and the second ranging data; a match is performed in the slave node distribution information based on the first relative position to determine the target slave node; the target slave node is addressed through the communication address of the candidate slave node, and the candidate slave node is reselected until all slave nodes in the communication network are addressed, and the high-precision ranging capabilities of the first communication module and the second communication module are used to accurately determine the target slave node, and the addressing of the slave node is automatically completed, so as to realize automatic addressing of large-scale network nodes.

[0108] See also Fig.11 In some embodiments, before selecting a candidate slave node from a plurality of slave nodes, the method may further include the following steps 701 to 704:

[0109] Step 701: Obtain ranging tag data.

[0110] The ranging tag data includes the real position information of the test slave node relative to the test master node in the test communication network.

[0111] Step 702: Control the test master node to send a test ranging request to the test slave node based on a preset communication frequency and a preset filtering algorithm, and obtain test ranging data corresponding to the test ranging request from the test slave node.

[0112] Step 703: Compare the test distance measurement data with the distance measurement tag data to obtain test deviation data.

[0113] Step 704: Optimize the preset communication frequency and the preset filtering algorithm based on the test deviation data, return to the execution control test master node to send a test ranging request to the test slave node based on the optimized communication frequency and the optimized filtering algorithm, until the test deviation data meets the preset conditions, and obtain the target communication frequency and the target filtering algorithm.

[0114] Steps 701 to 704 are described in detail below.

[0115] It is understandable that the real position information of the test slave node relative to the test master node is collected as the benchmark data for the subsequent distance measurement data comparison. According to the preset communication frequency, the frequency of sending the distance measurement request is determined, for example, once per second, and the preset filtering algorithm is used to process the sent and received signals to reduce noise and interference. The test master node sends a distance measurement request to the test slave node, and the request may contain information such as a timestamp and a serial number. The test distance measurement data returned by the test slave node is received, and these data will be used for comparison with the distance measurement tag data.

[0116] Exemplarily, the accuracy of the test ranging data is determined, and the existing deviations are identified. A statistical method or algorithm can be used to compare the test ranging data with the ranging tag data, and the difference between the test ranging data and the ranging tag data is recorded to obtain the test deviation data. Based on the test deviation data, the communication frequency and the filtering algorithm are optimized to improve the accuracy of ranging, and the test deviation data is analyzed to adjust the communication frequency and the parameters of the filtering algorithm, such as increasing the communication frequency and changing the type or parameters of the filter. Repeat steps 703 and 704 until the test deviation data meets the preset conditions. When the test deviation data meets the preset conditions, the communication frequency and the filtering algorithm obtained are the target communication frequency and the target filtering algorithm.

[0117] Through the above steps 701 to 704, the preset communication frequency and the preset filtering algorithm are optimized based on the test deviation data, and the execution control test master node is returned to send a test ranging request to the test slave node based on the optimized communication frequency and the optimized filtering algorithm until the test deviation data meets the preset conditions. The optimal communication frequency and filtering algorithm of the first communication module and the second communication module are determined through the process of testing, comparing, optimizing and retesting, which can improve the accuracy of ranging.

[0118] See also Fig.12 The embodiment of the present application further provides a communication network automatic addressing system 1200, which can implement the above communication network automatic addressing method, including:

[0119] The node distribution module 1201 is used to obtain the slave node distribution information of the communication network; wherein the slave node distribution information includes the real position information of each slave node relative to the master node in the communication network;

[0120] A candidate node module 1202 is used to select a candidate slave node from multiple slave nodes;

[0121] A first ranging module 1203, configured to send a first ranging request to a candidate slave node through a first communication module of the master node, and obtain first ranging data corresponding to the first ranging request from the candidate slave node;

[0122] A second ranging module 1204, configured to send a second ranging request to the candidate slave node through the second communication module of the master node, and obtain second ranging data corresponding to the second ranging request from the candidate slave node;

[0123] A relative position module 1205, configured to determine a first relative position between the candidate slave node and the master node according to the first ranging data and the second ranging data;

[0124] A target slave node module 1206 is used to match the slave node distribution information based on the first relative position to determine the target slave node;

[0125] The addressing module 1207 is used to address the target slave node through the communication address of the candidate slave node, and re-determine the candidate slave node from the slave nodes that have not been selected, and return to execute sending the first ranging request to the candidate slave node through the first communication module until all slave nodes in the communication network have completed addressing.

[0126] The specific implementation of the communication network automatic addressing system is basically the same as the specific implementation of the communication network automatic addressing method described above, and will not be repeated here. Under the premise of meeting the requirements of the embodiment of the present application, the communication network automatic addressing system can also be provided with other functional modules to implement the communication network automatic addressing method in the above embodiment.

[0127] The present application also provides an electronic device, including:

[0128] at least one memory;

[0129] at least one processor;

[0130] at least one program;

[0131] The program is stored in the memory, and the processor executes at least one program to implement the above-mentioned communication network automatic addressing method implemented in this application. The electronic device can be any intelligent terminal including a mobile phone, a tablet computer, a personal digital assistant (PDA), a car computer, etc.

[0132] See also Fig.13 , Fig.13 The hardware structure of an electronic device of another embodiment is illustrated, and the electronic device includes:

[0133] The processor 1301 may be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an application-specific integrated circuit (Application Specific Integrated Circuit, ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of the present application;

[0134] The memory 1302 can be implemented in the form of ROM (Read Only Memory), static storage device, dynamic storage device or RAM (Random Access Memory). The memory 1202 can store operating systems and other applications. When the technical solutions provided in the embodiments of this specification are implemented by software or firmware, the relevant program codes are stored in the memory 1202, and the processor 1201 calls and executes the communication network automatic addressing method of the embodiment of this application;

[0135] Input / output interface 1303, used to implement information input and output;

[0136] The communication interface 1304 is used to realize the communication interaction between the device and other devices. The communication can be realized through a wired manner (such as USB, network cable, etc.) or a wireless manner (such as mobile network, WIFI, Bluetooth, etc.);

[0137] A bus 1305 that transmits information between the various components of the device (e.g., the processor 1301, the memory 1302, the input / output interface 1303, and the communication interface 1304);

[0138] The processor 1301 , the memory 1302 , the input / output interface 1303 and the communication interface 1304 are connected to each other in communication within the device via a bus 1305 .

[0139] An embodiment of the present application also provides a storage medium, which is a computer-readable storage medium. The storage medium stores a computer program, and when the computer program is executed by a processor, the above-mentioned communication network automatic addressing method is implemented.

[0140] The memory, as a non-transient computer-readable storage medium, can be used to store non-transient software programs and non-transient computer executable programs. In addition, the memory may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some embodiments, the memory may optionally include a memory remotely disposed relative to the processor, and these remote memories may be connected to the processor via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0141] The embodiments described in the embodiments of the present application are intended to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided in the embodiments of the present application. Those skilled in the art will appreciate that with the evolution of technology and the emergence of new application scenarios, the technical solutions provided in the embodiments of the present application are also applicable to similar technical problems.

[0142] Those skilled in the art will appreciate that the technical solutions shown in the figures do not constitute a limitation on the embodiments of the present application, and may include more or fewer steps than shown in the figures, or a combination of certain steps, or different steps.

[0143] The device embodiments described above are merely illustrative, and the units described as separate components may or may not be physically separated, that is, they may be located in one place or distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0144] Those skilled in the art will appreciate that all or some of the steps in the methods disclosed above, and the functional modules / units in the systems and devices may be implemented as software, firmware, hardware, or a suitable combination thereof.

[0145] The terms "first", "second", "third", "fourth", etc. (if any) in the specification of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0146] It should be understood that in the present application, "at least one (item)" means one or more, and "plurality" means two or more. "And / or" is used to describe the association relationship of associated objects, indicating that three relationships may exist. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally indicates that the objects associated before and after are in an "or" relationship. "At least one of the following items" or similar expressions refers to any combination of these items, including any combination of single items or plural items. For example, at least one item (one) of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, c can be single or multiple.

[0147] In the several embodiments provided in the present application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the above units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. The mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0148] The units described above as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0149] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0150] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including multiple instructions to enable a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of various embodiments of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (Read-Only Memory, referred to as ROM), random access memory (Random Access Memory, referred to as RAM), disk or optical disk and other media that can store programs.

[0151] The preferred embodiments of the present application are described above with reference to the accompanying drawings, but the scope of the rights of the present application is not limited thereto. Any modification, equivalent substitution and improvement made by those skilled in the art without departing from the scope and essence of the present application should be within the scope of the rights of the present application.

Claims

1. A communication network automatic addressing method, characterized in that: The method is applied to a master node in a communication network, the master node is configured with a first communication module and a second communication module, the communication network also includes a plurality of slave nodes, and the method includes: Acquire slave node distribution information of the communication network; wherein the slave node distribution information includes real position information of each slave node in the communication network relative to the master node; Selecting a candidate slave node from the plurality of slave nodes; Sending a first ranging request to the candidate slave node through the first communication module, and acquiring first ranging data corresponding to the first ranging request from the candidate slave node; Sending a second ranging request to the candidate slave node through the second communication module, and acquiring second ranging data corresponding to the second ranging request from the candidate slave node; Determine a first relative position between the candidate slave node and the master node according to the first ranging data and the second ranging data; Determine a target slave node based on matching the first relative position in the slave node distribution information; The target slave node is addressed by the communication address of the candidate slave node, and the candidate slave node is re-determined from the slave nodes that have not been selected, and the first ranging request is sent to the candidate slave node through the first communication module, until all the slave nodes in the communication network are addressed.

2. The communication network automatic addressing method according to claim 1, characterized in that: The determining, according to the first ranging data and the second ranging data, a first relative position between the candidate slave node and the master node comprises: Acquire a first distance between the first communication module and the second communication module; Determine, according to the first distance, the first ranging data, and the second ranging data, a first measurement angle formed by the candidate slave node, the first communication module, and the second communication module with the candidate slave node as a common endpoint; The first relative position is determined according to the first measured angle, the first distance measurement data, and the second distance measurement data.

3. The communication network automatic addressing method according to claim 2, characterized in that: The determining, according to the first distance, the first ranging data, and the second ranging data, a first measurement angle formed by the candidate slave node, the first communication module, and the second communication module with the candidate slave node as a common endpoint includes: Calculate a second distance between the first communication module and the candidate slave node according to the first ranging data; Calculate a third distance between the second communication module and the candidate slave node according to the second ranging data; Based on the law of cosines, the first measurement angle is calculated according to the first distance, the second distance, and the third distance.

4. The communication network automatic addressing method according to claim 3, characterized in that: The first ranging data includes a first sending time of the first ranging request, a first receiving time when the candidate slave node receives the first ranging request, a second sending time when the candidate slave node sends the first ranging data, and a second receiving time when the master node receives the first ranging data; the second ranging data includes a third sending time when the second ranging request is sent, a third receiving time when the candidate slave node receives the second ranging request, a fourth sending time when the candidate slave node sends the second ranging data, and a fourth receiving time when the master node receives the second ranging data; and the second distance between the first communication module and the candidate slave node is calculated according to the first ranging data, including: Get channel transmission rate; Calculate a first transmission time according to the first sending time, the first receiving time, the second sending time, and the second receiving time; Calculate the second distance according to the channel transmission rate and the first transmission time; The calculating, according to the second ranging data, a third distance between the second communication module and the candidate slave node comprises: Calculate a second transmission time according to the third sending time, the third receiving time, the fourth sending time, and the fourth receiving time; The third distance is calculated according to the channel transmission rate and the second transmission time.

5. The communication network automatic addressing method according to claim 4, characterized in that: The method further comprises: Acquire a third ranging request sent by the candidate slave node to the first communication module, and send third ranging data to the candidate slave node through the first communication module in response to the third ranging request, so that the candidate slave node calculates a fourth distance according to the third ranging data, and sends the fourth distance to the master node; Acquire a fourth ranging request sent by the candidate slave node to the second communication module, and send fourth ranging data to the candidate slave node through the second communication module in response to the fourth ranging request, so that the candidate slave node calculates a fifth distance according to the fourth ranging data, and returns the fifth distance to the master node; acquiring the fourth distance and the fifth distance, calculating a first average distance according to the second distance and the fourth distance, and calculating a second average distance according to the third distance and the fifth distance; A first relative position between the candidate slave node and the master node is calculated based on the first average distance and the second average distance.

6. The communication network automatic addressing method according to claim 1, characterized in that: The step of addressing the target slave node by using the communication address of the candidate slave node comprises: Obtain a target slave node number of the target slave node; Establishing a mapping between the target slave node number and the communication address; The communication address is set as the target communication address of the target slave node.

7. The method according to claim 2, characterized in that Before selecting a candidate slave node from the plurality of slave nodes, the method further comprises: Acquire ranging tag data; wherein the ranging tag data includes real position information of the test slave node relative to the test master node in the test communication network; Controlling the test master node to send a test ranging request to the test slave node based on a preset communication frequency and a preset filtering algorithm, and obtaining test ranging data corresponding to the test ranging request from the test slave node; Comparing the test distance measurement data with the distance measurement tag data to obtain test deviation data; The preset communication frequency and the preset filtering algorithm are optimized based on the test deviation data, and the test master node is returned to execute control to send a test ranging request to the test slave node based on the optimized communication frequency and the optimized filtering algorithm until the test deviation data meets the preset conditions, thereby obtaining the target communication frequency and the target filtering algorithm.

8. A communication network automatic addressing system, characterized in that: include: A node distribution module is used to obtain slave node distribution information of the communication network; wherein the slave node distribution information includes the real position information of each slave node in the communication network relative to the master node; A candidate node module, used for selecting a candidate slave node from a plurality of slave nodes; A first ranging module, configured to send a first ranging request to the candidate slave node through the first communication module of the master node, and obtain first ranging data corresponding to the first ranging request from the candidate slave node; A second ranging module, configured to send a second ranging request to the candidate slave node through the second communication module of the master node, and obtain second ranging data corresponding to the second ranging request from the candidate slave node; A relative position module, configured to determine a first relative position between the candidate slave node and the master node according to the first ranging data and the second ranging data; A target slave node module, configured to determine a target slave node by matching the first relative position in the slave node distribution information; The addressing module is used to address the target slave node through the communication address of the candidate slave node, and re-determine the candidate slave node from the slave nodes that have not been selected, and return to execute sending a first ranging request to the candidate slave node through the first communication module until all the slave nodes in the communication network have completed addressing.

9. An electronic device, characterized in that: It comprises a memory and a processor, the memory stores a computer program, and is characterized in that when the processor executes the computer program, it implements the communication network automatic addressing method according to any one of claims 1 to 7.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the communication network automatic addressing method according to any one of claims 1 to 7 is implemented.

Images