Automatic addressing method and automatic addressing system for communication network, and related device

Abstract

Provided in the embodiments of the present application are an automatic addressing method and automatic addressing system for a communication network, and a related device. The method comprises: acquiring slave node distribution information of a communication network; selecting a candidate slave node from among a plurality of slave nodes; by means of a first communication module, acquiring first ranging data corresponding to a first ranging request; by means of a second communication module, acquiring second ranging data corresponding to a second ranging request; on the basis of the first ranging data and the second ranging data, determining a first relative position between the candidate slave node and a master node; on the basis of the first relative position, performing matching in the slave node distribution information to determine a target slave node; and addressing the target slave node by means of the communication address of the candidate slave node, re-determining a candidate slave node from among the slave nodes that have not been selected, and returning to execute sending the first ranging request to the candidate slave node by means of the first communication module until all of the slave nodes of the communication network are addressed.

Description

Method, system and related device for automatic addressing of a communication network

[0001] Cross-reference to Related Applications

[0002] This application claims priority to the Chinese patent application No. 202411336768.6, filed on September 24, 2024, and entitled "Method, system and related device for automatic addressing of a communication network", the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0003] The present application relates to the field of network communication technology, and in particular to a method, system and related device for automatic addressing of a communication network. BACKGROUND

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

[0005] In the related art, traditional addressing methods rely on complex network protocols and manual configuration, i.e., manually inputting and configuring addresses for each device. However, traditional manual addressing methods are not only inefficient, but as the size of the network continues to expand, the likelihood of errors also increases. Therefore, manual addressing has been unable to meet the needs of large-scale communication network addressing.

[0006] SUMMARY

[0007] The embodiments of the present application provide a method, system and related device for automatic addressing of a communication network, which can achieve automatic addressing of large-scale network nodes.

[0008] To achieve the above object, a first aspect of the embodiment of the present application provides a communication network automatic addressing method, which 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 further comprises a plurality of slave nodes, the method comprises: obtaining slave node distribution information of the communication network; wherein the slave node distribution information comprises 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; 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 the first relative position in the slave node distribution information to determine a target slave node; addressing the target slave node through a communication address of the candidate slave node, and re-determining the candidate slave node from each slave node that has not been selected, returning to execute sending a first ranging request to the candidate slave node through the first communication module, until each slave node of the communication network is addressed.

[0009] In some embodiments, the determining the first relative position between the candidate slave node and the master node according to the first ranging data and the second ranging data comprises: obtaining a first distance between the first communication module and the second communication module; determining a first measurement angle of the candidate slave node, the first communication module and the second communication module as a common endpoint according to the first distance, the first ranging data and the second ranging data; determining the first relative position according to the first measurement angle, the first ranging data and the second ranging data.

[0010] In some embodiments, the determining the first measurement angle of the candidate slave node, the first communication module and the second communication module as a common endpoint according to the first distance, the first ranging data and the second ranging data comprises: calculating a second distance between the first communication module and the candidate slave node according to the first ranging data; calculating a third distance between the second communication module and the candidate slave node according to the second ranging data; calculating the first measurement angle according to the first distance, the second distance and the third distance based on the cosine law.

[0011] In some embodiments, the first ranging data comprises a first sending time of the first ranging request, a first receiving time at which the candidate slave node receives the first ranging request, a second sending time at which the candidate slave node sends the first ranging data, and a second receiving time at which the master node receives the first ranging data, and the second ranging data comprises a third sending time of the second ranging request, a third receiving time at which the candidate slave node receives the second ranging request, a fourth sending time at which the candidate slave node sends the second ranging data, and a fourth receiving time at which the master node receives the second ranging data.

[0012] In some embodiments, the calculating the second distance between the first communication module and the candidate slave node according to the first ranging data comprises: obtaining 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; and calculating the second distance according to the channel transmission rate and the first transmission time.

[0013] In some embodiments, the second distance is one half of the product of the first transmission time and the channel transmission rate.

[0014] In some embodiments, the calculating the third distance between the second communication module and the candidate slave node according to the second ranging data comprises: 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.

[0015] In some embodiments, the third distance is one half of the product of the second transmission time and the channel transmission rate.

[0016] In some embodiments, the method further comprises: 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.

[0017] In some embodiments, the addressing the target slave node by the communication address of the candidate slave node comprises: obtaining a 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 a target communication address of the target slave node.

[0018] In some embodiments, before selecting the candidate slave node from the plurality of slave nodes, the method further comprises: obtaining ranging tag data; wherein the ranging tag data comprises real position information of a test slave node relative to a test master node in a test communication network; controlling the test master node to send a trial ranging request to the test slave node based on a preset communication frequency and a preset filtering algorithm, and obtaining trial ranging data corresponding to the trial ranging request from the test slave node; comparing the trial ranging data with the ranging tag data to obtain test deviation data; performing an optimization process on the preset communication frequency and the preset filtering algorithm based on the test deviation data, and returning to control the test master node to send a trial ranging request to the test slave node based on the optimized communication frequency and the optimized filtering algorithm until the test deviation data meets a preset condition, to obtain a target communication frequency and a target filtering algorithm.

[0019] In some embodiments, the sending the first ranging request to the candidate slave node through the first communication module comprises: sending the first ranging request to the candidate slave node through the first communication module based on ultra-wideband technology; and the sending the second ranging request to the candidate slave node through the second communication module comprises: sending the second ranging request to the candidate slave node through the second communication module based on ultra-wideband technology.

[0020] In some embodiments, the slave node distribution information comprises at least one of: a position of the slave node relative to the master node in a network topology, geographical coordinates of the slave node relative to the master node, and a physical position of the slave node relative to the master node.

[0021] To achieve the above object, a second aspect of the embodiments of the present application provides a communication network automatic addressing system, comprising: a node distribution module configured to acquire slave node distribution information of a communication network; wherein the slave node distribution information comprises real position information of each slave node relative to a master node in the communication network; a candidate node module configured to select 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 a first communication module of the master node, and acquire 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 a second communication module of the master node, and acquire 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 based on matching of the first relative position in the slave node distribution information; an addressing module configured to address the target slave node through a communication address of the candidate slave node, and re-determine the candidate slave node from each of 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 each of the slave nodes of the communication network completes addressing.

[0022] To achieve the above object, a third aspect of the embodiments of the present application provides an electronic device, comprising a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the communication network automatic addressing method according to the first aspect.

[0023] To achieve the above object, a fourth aspect of the embodiments of the present application provides a storage medium, which is a computer readable storage medium, and stores a computer program, wherein the computer program is executed by a processor to implement the communication network automatic addressing method according to the first aspect.

[0024] The application embodiment provides a communication network automatic addressing method, an automatic addressing system and related equipment. The method is applied to a master node in a communication network. The master node is provided with a first communication module and a second communication module. The communication network further includes a plurality of slave nodes. The method includes the following steps: obtaining slave node distribution information of the communication network; 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; 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 the first relative position in the slave node distribution information to determine a target slave node; addressing the target slave node through a communication address of the candidate slave node, and reselecting the candidate slave node until each slave node of the communication network is addressed. The high-precision ranging capability of the first communication module and the second communication module is used to accurately determine the target slave node, automatically complete the addressing of the slave node, and realize automatic addressing of a large-scale network node.

[0025] Other features and advantages of the present application will be set forth in the following description, and in part will become apparent from the description, or can be learned by practice of the present application. The objects and other advantages of the present application will be realized and attained by the structure particularly pointed out in the written description and claims thereof. BRIEF DESCRIPTION OF DRAWINGS

[0026] FIG. 1 is an optional flowchart of the communication network automatic addressing method provided by the application embodiment;

[0027] FIG. 2 is another optional flowchart of the communication network automatic addressing method provided by the application embodiment;

[0028] FIG. 3 is another optional flowchart of the communication network automatic addressing method provided by the application embodiment;

[0029] FIG. 4 is a schematic diagram of a first measurement angle of the communication network automatic addressing method provided by the application embodiment;

[0030] FIG. 5 is another optional flowchart of the communication network automatic addressing method provided by the application embodiment;

[0031] FIG. 6 is a schematic diagram of the first ranging data provided by the application embodiment;

[0032] FIG. 7 is another optional flowchart of the communication network automatic addressing method provided by the application embodiment;

[0033] FIG. 8 is a schematic diagram of a third ranging request provided by the application embodiment;

[0034] FIG. 9 is a schematic diagram of a master node and a slave node of a communication network according to an embodiment of the present application;

[0035] FIG. 10 is another optional flowchart of a method for automatically addressing a communication network according to an embodiment of the present application;

[0036] FIG. 11 is another optional flowchart of a method for automatically addressing a communication network according to an embodiment of the present application;

[0037] FIG. 12 is a schematic diagram of functional modules of a system for automatically addressing a communication network according to an embodiment of the present application;

[0038] FIG. 13 is a schematic diagram of a hardware structure of an electronic device according to an embodiment of the present application. DETAILED DESCRIPTION

[0039] In order to make the objects, technical solutions and advantages of the present application clearer, the present application will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and should not be used to limit the present application.

[0040] It should be noted that although the functional modules are divided in the schematic diagram of the apparatus, and the logical order is shown in the flowchart, in some cases, the steps shown or described can be performed in a manner different from the module division in the apparatus or the order in the flowchart.

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

[0042] 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 crucial for the normal operation of the network.

[0043] In the related art, the traditional addressing method relies on complex network protocols and manual configuration, i.e., manually inputting and configuring addresses for each device. However, the traditional manual addressing method is not only inefficient, but as the network size continues to expand, the likelihood of errors also increases. Therefore, manual addressing has been unable to meet the needs of large-scale communication network addressing.

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

[0045] The communication network automatic addressing method, the communication network automatic addressing system and the related device provided by the embodiments of the present application are described in detail as follows. 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 as follows.

[0046] FIG. 1 is an optional flowchart of the communication network automatic addressing method provided by the embodiments 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 further includes a plurality of slave nodes. The method in FIG. 1 can include, but is not limited to, steps 101 to 107. It can be understood that the order of steps 101 to 107 in FIG. 1 is not limited in the embodiments, and the order of steps can be adjusted or some steps can be reduced or added according to actual needs.

[0047] Step 101: Obtain slave node distribution information of the communication network.

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

[0049] Step 101 is described in detail as follows.

[0050] For example, the master node is the core of the communication network and is 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 enable effective communication with slave nodes. 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 transmitting and receiving data in a communication system, which can include a radio frequency module, a module for wireless communication using radio frequency, suitable for long-distance and wide-bandwidth communication, and an ultra-wideband (UWB) module, a module for high-speed data transmission and accurate distance measurement using ultra-wideband technology.

[0051] It can be understood that the slave node distribution information refers to the actual spatial position information of each slave node in the communication network relative to the master node, including but not limited to the geographical coordinates, physical position, relative position in the network topology, 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 for subsequent steps such as distance measurement request sending, relative position determination, matching and automatic addressing, and is the key information of the entire automatic addressing method.

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

[0053] Step 102 is described in detail as follows.

[0054] Exemplarily, the candidate node can be selected from the plurality of slave nodes by a correlation algorithm or rules, which can include random selection, priority-based sequential selection, etc., and can be based on various factors including but not limited to signal strength, communication quality, geographical location, energy consumption status, historical communication record, etc. of the slave nodes. The candidate slave node is selected from the plurality of slave nodes for ranging to the candidate slave node.

[0055] Step 103: 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.

[0056] The step 103 is described in detail as follows.

[0057] It can be understood that in this step, the candidate slave node is ranged 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, aiming 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 can include timestamp, signal strength, etc., and is used to calculate the distance between the master node and the candidate slave node.

[0058] In some embodiments, the first communication module uses ultra-wideband (UWB) technology to send the first ranging request to the candidate slave node, which can provide higher time resolution and thus achieve more accurate distance measurement. The candidate slave node replies to the first communication module with ranging data containing the timestamp and signal strength of receiving the first ranging request.

[0059] Step 104: 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.

[0060] The step 104 is described in detail as follows.

[0061] It can be understood that in this step, the candidate slave node is ranged by the second communication module, and the second ranging request is a signal or message sent by the master node based on the second communication module, aiming to start the distance measurement process with the slave node. The second ranging data refers to the measurement result returned by the slave node to the master node, which can include timestamp, signal strength, etc., and is used to calculate the distance between the master node and the candidate slave node.

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

[0063] Step 105: 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.

[0064] Step 105 is described in detail as follows.

[0065] It can be understood that, in this step, the 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, and the distance and the angle between the master node and the candidate slave node can be measured. For example, the first ranging data and the second ranging data collected include the distance and the included angle data of the master node and the candidate slave node, and the position of the candidate slave node relative to the master node, i.e., the first relative position, is calculated through a data processing algorithm, such as the cosine theorem.

[0066] Referring to FIG. 2, in some embodiments, the 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, which can include the following steps 201 to 203.

[0067] Step 201: obtaining a first distance between the first communication module and the second communication module.

[0068] Step 202: determining a first measured included 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.

[0069] Step 203: determining the first relative position according to the first measured included angle, the first ranging data and the second ranging data.

[0070] The steps 201 to 203 are described in detail as follows.

[0071] It can be 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 calculation. The first measured included angle is an angle with the candidate slave node as a vertex, which is calculated according to the first ranging data and the second ranging data and the first distance. The first relative position is the position of the candidate slave node relative to the master node, which is calculated according to the ranging data and the first measured included angle.

[0072] For example, 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. The first measured included angle is determined by geometric calculation using the first ranging data and the second ranging data and the first distance, which can involve the use of trigonometric functions and the cosine theorem, and a triangle with the first communication module and the second communication module as fixed points and the candidate slave node as a vertex can be constructed, and the first relative position of the candidate slave node is found by solving the triangle.

[0073] By the steps 201 to 203, the first distance between the first communication module and the second communication module is obtained, the first measurement angle 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, and the first relative position is determined according to the first measurement angle, the first ranging data and the second ranging data, so that the first relative position of the candidate slave node relative to the master node can be accurately obtained.

[0074] Referring to FIG. 3, in some embodiments, the first measurement angle with the candidate slave node as a common endpoint formed by the candidate slave node, the first communication module and the second communication module can include the following steps 301 to 303 according to the first distance, the first ranging data and the second ranging data:

[0075] Step 301: The second distance between the first communication module and the candidate slave node is calculated according to the first ranging data.

[0076] Step 302: The third distance between the second communication module and the candidate slave node is calculated according to the second ranging data.

[0077] Step 303: The first measurement angle is calculated according to the first distance, the second distance and the third distance based on the cosine law.

[0078] The steps 301 to 303 are described in detail below.

[0079] It can be understood that, referring to FIG. 4, the second distance is the distance between the first communication module and the candidate slave node calculated according to the first ranging data, and the first communication module is a module on the master node for UWB communication with the slave node. Through UWB communication, the first communication module of the master node can measure the distance between 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 according to the second ranging data, and 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 a vertex. Based on the cosine law, the cosine value of the first measurement angle can be calculated, and then the degree or radian of the first measurement angle is obtained by taking the inverse cosine value.

[0080] By the 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, the third distance between the second communication module and the candidate slave node is calculated according to the second ranging data, and the first measurement angle is calculated according to the first distance, the second distance and the third distance based on the cosine law, so as to provide basic data for subsequent position calculation and automatic addressing.

[0081] Referring to FIG. 5, in some embodiments, the first ranging data includes a first sending time of the first ranging request, a first receiving time at which the candidate slave node receives the first ranging request, a second sending time at which the candidate slave node sends the first ranging data, and a second receiving time at which the master node receives the first ranging data, and the second distance between the first communication module and the candidate slave node calculated according to the first ranging data can include the following steps 401 to 403:

[0082] Step 401: Obtain the channel transmission rate.

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

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

[0085] The steps 401 to 403 are described in detail as follows.

[0086] For example, referring to FIG. 6, the first ranging data includes a first sending time t0 of the first ranging request, a first receiving time t1 at which the candidate slave node receives the first ranging request, a second sending time t2 at which the candidate slave node sends the first ranging data, and a second receiving time t3 at which the master node receives the first ranging data.

[0087] It can be understood that the first communication module can be based on UWB communication, the channel transmission rate c is an important parameter that determines the transmission speed of data in the channel, and the master node can obtain the current channel transmission rate through pre-configuration or dynamic testing. The first sending time is the time at which the master node sends the first ranging request, the first receiving time is the time at which the candidate slave node receives the first ranging request, the second sending time is the time at which the candidate slave node sends the first ranging data, and the second receiving time is the time at which the master node receives the first ranging data. According to the four times, the transmission time of the first ranging request in the channel, i.e., the first transmission time, can be calculated as t3-t0-(t2-t1). The second distance is one half of the product of the first transmission time and the channel transmission rate.

[0088] Referring to FIG. 5, the second ranging data includes a third sending time of the second ranging request, a third receiving time at which the candidate slave node receives the second ranging request, a fourth sending time at which the candidate slave node sends the second ranging data, and a fourth receiving time at which the master node receives the second ranging data, and the third distance between the second communication module and the candidate slave node calculated according to the second ranging data can include the following steps 404 to 405:

[0089] Step 404: calculating the second transmission time according to the third sending time, the third receiving time, the fourth sending time and the fourth receiving time.

[0090] Step 405: calculating the third distance according to the channel transmission rate and the second transmission time.

[0091] The steps 404 to 405 are described in detail as follows.

[0092] 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 one half of the product of the channel transmission rate and the second transmission time.

[0093] Through the 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 time stamp information recorded in the first ranging data and the second ranging data and in combination with the channel transmission rate, and the position information of the candidate slave node can be efficiently and accurately obtained by using the time flight ranging characteristics of the UWB communication.

[0094] Referring to FIG. 7, in some embodiments, the method further includes the following steps 501 to 504:

[0095] Step 501: acquiring 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.

[0096] Step 502: acquiring 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.

[0097] Step 503: 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.

[0098] Step 504: 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.

[0099] The steps 501-504 are described in detail as follows.

[0100] For example, referring to FIG. 8, the candidate slave node sends a third ranging request to the first communication module, and in response to the third ranging request, the third ranging data is sent to the candidate slave node by 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, the fourth ranging data is sent to the candidate slave node by the second communication module.

[0101] It can be understood that the master node obtains the fourth distance and the fifth distance returned by the candidate slave node, calculates a first average distance according to the second distance and the fourth distance calculated before, and calculates a second average distance according to the third distance and the fifth distance calculated before. The master node calculates the position coordinates of the candidate slave node relative to the master node, i.e., the first relative position, by using the first average distance and the second average distance in combination with the principle of triangulation.

[0102] Through the steps 501-504 described above, the master node obtains the distance information sent twice by the candidate slave node, i.e., the fourth distance and the fifth distance, and calculates two average distances according to the second distance and the third distance, and finally calculates the position coordinates of the candidate slave node relative to the master node by using the average distance information, so that the position information of the slave node can be obtained more accurately.

[0103] Step 106: Matching in the slave node distribution information based on the first relative position to determine the target slave node.

[0104] The step 106 is described in detail as follows.

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

[0106] Step 107: Addressing the target slave node through the communication address of the candidate slave node, and re-determining the candidate slave node from the slave nodes that have not been 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 slave nodes of the communication network are addressed.

[0107] The step 107 is described in detail as follows.

[0108] It can be understood that after determining the target slave node, the target slave node is addressed by using the communication address of the candidate slave node, and a unique address identifier is allocated to the target slave node for subsequent communication and management. According to the measured position information, the master node binds the physical position of each candidate slave node with their MAC address, and realizes automatic addressing.

[0109] Referring to FIG. 9, in some embodiments, a 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, and the second communication module is M-UWB2. The first communication module and the second communication module both communicate based on ultra-wideband technology. A plurality of slave nodes (slave node 1, slave node 2, slave node 3, slave node 4,..., slave node N) are also included, each slave node is configured with a slave node ultra-wideband communication module (S-UWB1, S-UWB2, S-UWB3, S-UWB4,..., S-UWBN). The master node MCU configures the first communication module and the second communication module to complete initialization, controls the first communication module and the second communication module to establish wireless connection with all slave node ultra-wideband communication modules (S-UWB1, S-UWB2, S-UWB3, S-UWB4,..., S-UWBN). According to the slave node distribution information and the first relative position of each slave node to the master node, the specific position of each node in the two-dimensional plane is determined, each slave node is physically addressed, and the corresponding node mapping relationship number is assigned, the slave node MAC address is one-to-one corresponding to the physical address, and automatic addressing of all slave nodes is completed.

[0110] Referring to FIG. 10, in some embodiments, the target slave node is addressed by the communication address of the candidate slave node, which can include the following steps 601 to 603:

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

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

[0113] Step 603: Set the communication address as the target communication address of the target slave node.

[0114] The steps 601 to 603 are described in detail as follows.

[0115] It can be understood that the target slave node number is a unique identifier for distinguishing different slave nodes. After the master node obtains the target slave node number of the target slave node, it needs to establish a mapping relationship between the target slave node number 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, which is used for subsequent address management and query. The communication address is set as 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, and the addressing of the target slave node is completed.

[0116] 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 the plurality of slave nodes; the first ranging request is sent to the candidate slave node through the first communication module, and the first ranging data corresponding to the first ranging request is obtained from the candidate slave node; the second ranging request is sent to the candidate slave node through the second communication module, and the second ranging data corresponding to the second ranging request is obtained from the candidate slave node; the 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; the target slave node is determined by matching the first relative position in the slave node distribution information; the target slave node is addressed through the communication address of the candidate slave node, and the candidate slave node is reselected until the addressing of each slave node of the communication network is completed. The high-precision ranging capability of the first communication module and the second communication module is used to accurately determine the target slave node, automatically complete the addressing of the slave node, and realize the automatic addressing of a large-scale network node.

[0117] Referring to FIG. 11, in some embodiments, before the candidate slave node is selected from the plurality of slave nodes, the method can further include the following steps 701 to 704:

[0118] Step 701: Obtain ranging tag data.

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

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

[0121] Step 703: Compare the trial ranging data with the ranging tag data to obtain test deviation data.

[0122] Step 704: optimizing the preset communication frequency and the preset filtering algorithm based on the test deviation data, and returning to execute the control test master node to send the 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 condition, and obtaining the target communication frequency and the target filtering algorithm.

[0123] The steps 701 to 704 are described in detail below.

[0124] It can be understood that the real position information of the test slave node relative to the test master node is collected as the reference data for subsequent ranging data comparison. According to the preset communication frequency, the frequency of sending the ranging request is determined, for example, once per second, and the preset filtering algorithm is used to process the transmitted and received signals to reduce noise and interference. The test master node sends the ranging request to the test slave node, which may contain time stamp, serial number and other information. The test ranging data returned by the test slave node is used for comparison with the ranging tag data.

[0125] For example, the accuracy of the test ranging data is determined, and the existing deviation is identified. The test ranging data and the ranging tag data can be compared using statistical methods or algorithms to record the difference between the test ranging data and the ranging tag data, and 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 the ranging. The test deviation data is analyzed, and the parameters of the communication frequency and the filtering algorithm are adjusted, such as increasing the communication frequency, changing the type or parameters of the filter. Steps 703 and 704 are repeated until the test deviation data meets the preset condition. When the test deviation data meets the preset condition, the obtained communication frequency and filtering algorithm are the target communication frequency and the target filtering algorithm.

[0126] 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 control test master node is returned to send the 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 condition. Through the process of testing, comparison, optimization and retesting, the best communication frequency and filtering algorithm of the first communication module and the second communication module are determined, which can improve the accuracy of the ranging.

[0127] Please refer to FIG. 12, the embodiment of the application further provides a communication network automatic addressing system 1200, which can implement the above communication network automatic addressing method, comprising:

[0128] The node distribution module 1201 is configured to obtain slave node distribution information of the communication network, wherein the slave node distribution information comprises real position information of each slave node in the communication network relative to the master node.

[0129] a candidate node module 1202, configured to select a candidate slave node from the plurality of slave nodes;

[0130] a first ranging module 1203, configured to send, by a first communication module of the master node, a first ranging request to the candidate slave node, and acquire first ranging data corresponding to the first ranging request from the candidate slave node;

[0131] a second ranging module 1204, configured to send, by a second communication module of the master node, a second ranging request to the candidate slave node, and acquire second ranging data corresponding to the second ranging request from the candidate slave node;

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

[0133] a target slave node module 1206, configured to determine a target slave node based on matching in the slave node distribution information according to the first relative position;

[0134] an addressing module 1207, configured to address the target slave node by a 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 perform the sending of the first ranging request to the candidate slave node by the first communication module until each slave node of the communication network completes the addressing.

[0135] The specific implementation of the communication network automatic addressing system is basically the same as the specific embodiments of the communication network automatic addressing method described above, and will not be repeated here. 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 embodiments, as long as the requirements of the embodiments of the present application are met.

[0136] The embodiments of the present application also provide an electronic device, including: at least one memory; at least one processor; at least one program; wherein the program is stored in the memory, and the processor executes the at least one program to implement the communication network automatic addressing method of the embodiments of the present application. The electronic device can be any smart terminal including a mobile phone, a tablet computer, a personal digital assistant (PDA), a vehicle-mounted computer, etc.

[0137] Please refer to FIG. 13, which shows the hardware structure of the electronic device of another embodiment, including:

[0138] The processor 1301 can be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an ASIC (Application Specific Integrated Circuit), or one or more integrated circuits, and is configured to execute related programs to implement the technical solutions provided by the embodiments of the present application.

[0139] The memory 1302 can be implemented by a ROM (Read-Only Memory), a static storage device, a dynamic storage device, or a RAM (Random Access Memory), etc. The memory 1202 can store an operating system and other application programs, and when the technical solutions provided by the embodiments of the present application are implemented by software or firmware, the related program codes are stored in the memory 1202 and are called and executed by the processor 1201 to implement the communication network automatic addressing method of the embodiments of the present application.

[0140] The input / output interface 1303 is configured to implement information input and output.

[0141] The communication interface 1304 is configured to implement the communication interaction between the device and other devices, and can realize the communication through a wired manner (for example, a USB, a network cable, etc.) or a wireless manner (for example, a mobile network, WIFI, Bluetooth, etc.).

[0142] The bus 1305 is configured to transmit information between various components (for example, the processor 1301, the memory 1302, the input / output interface 1303, and the communication interface 1304) of the device.

[0143] The processor 1301, the memory 1302, the input / output interface 1303, and the communication interface 1304 are connected to each other through the bus 1305 to realize the communication connection between the device.

[0144] The embodiments of the present application further provide a storage medium, which is a computer readable storage medium, and stores a computer program. The computer program is executed by a processor to implement the above communication network automatic addressing method.

[0145] Memory, as a non-transitory computer-readable storage medium, can be used to store non-transitory software programs and non-transitory computer-executable programs. In addition, the memory can include a high-speed random access memory and can also include a non-transitory memory, such as at least one magnetic disk storage device, a flash memory device, or other non-transitory solid-state memory device. In some embodiments, the memory can optionally include a memory disposed remotely from the processor, which can be connected to the processor through a network. Examples of the above network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0146] The embodiments described in the embodiments of the present application are used 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 by the embodiments of the present application. Those skilled in the art can know that, with the evolution of technology and the appearance of new application scenarios, the technical solutions provided by the embodiments of the present application are also applicable to similar technical problems.

[0147] Those skilled in the art can understand that the technical solutions shown in the figures do not constitute a limitation on the embodiments of the present application, and can include more or fewer steps than shown in the figures, or combine certain steps, or different steps.

[0148] The device embodiments described above are only schematic, and the units described as separate components can or can not be physically separate, i.e., can be located in one place, or can be distributed on multiple network units. Part or all of the modules can be selected according to actual needs to achieve the purpose of the embodiments of the present application.

[0149] Those skilled in the art can understand that all or some of the steps in the above disclosed method, the functional modules / units in the system and the device can be implemented as software, firmware, hardware and their appropriate combinations.

[0150] The terms "first", "second", "third", "fourth" and the like used in the specification of the present application and the above-described drawings, if any, are used to distinguish similar objects, and do not necessarily have to describe a particular order or sequence. It should be understood that the data thus used can be interchanged under appropriate circumstances, so that the embodiments of the present application described herein can be implemented in an order other than that illustrated or described herein. In addition, the terms "include" and "have" and any variations thereof are intended to cover non-exclusive inclusion, for example, a process, method, system, product or device including a series of steps or units does not have to be limited to only those steps or units clearly listed, but can include other steps or units not clearly listed or inherent to these processes, methods, products or devices.

[0151] It should be understood that, in the present application, "at least one" refers to one or more, and "multiple" refers to two or more. "And / or" is used to describe the association relationship of the associated objects, which means that there can be three relationships, for example, "A and / or B" can represent three cases of only A, only B, and A and B existing at the same time, wherein A and B can be singular or plural. The character " / " generally represents an "or" relationship between the associated objects before and after it. "At least one of the following" or the like means any combination of these items, including any combination of single or multiple items. For example, at least one of a, b or c can represent a, b, c, "a and b", "a and c", "b and c", or "a and b and c", wherein a, b, and c can be single or multiple.

[0152] In 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 illustrative, for example, the division of the above units is only a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. The coupling or direct coupling or communication connection between the displayed or discussed each other can be indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.

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

[0154] In addition, each functional unit in each embodiment of the present application can be integrated in one processing unit, or each unit can exist physically, or two or more units can be integrated in one unit. The integrated unit can be realized in the form of hardware or in the form of a software functional unit.

[0155] The integrated unit, if implemented in the form of a software function unit and sold or used as an independent product, can be stored in a computer-readable storage medium. Based on such understanding, the technical solutions of the present application essentially or say the part that contributes to the prior art or the whole or part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium, and includes multiple instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods of the various embodiments of the present application. The aforementioned storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and various program storage media.

[0156] The preferred embodiments of the embodiments of the present application are described above with reference to the accompanying drawings, and are not limited to the scope of the embodiments of the present application. Any modifications, equivalent replacements and improvements made by those skilled in the art without departing from the scope and essence of the embodiments of the present application shall be within the scope of the embodiments of the present application. Industrial applicability

[0157] By using the high-precision ranging capability of the first communication module and the second communication module, the target slave node can be accurately determined, the addressing of the slave node can be automatically completed, and automatic addressing of a large-scale network node can be implemented.

Claims

1. A method of automatic addressing of a communication network, wherein, 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 further comprises a plurality of slave nodes, and the method comprises: obtaining slave node distribution information of the communication network; wherein the slave node distribution information comprises 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; 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; based on the first relative position, matching in the slave node distribution information to determine a target slave node; addressing the target slave node through a communication address of the candidate slave node, and re-determining the candidate slave node from each slave node that has not been selected, returning to execute sending a first ranging request to the candidate slave node through the first communication module, until each slave node of the communication network is addressed.

2. The method of automatically addressing a communication network of claim 1, wherein, The method further comprises: obtaining a first distance between the first communication module and the second communication module; determining a first measurement angle of the candidate slave node, the first communication module, and the second communication module, which are common endpoints, according to the first distance, the first ranging data, and the second ranging data; determining the first relative position according to the first measurement angle, the first ranging data, and the second ranging data.

3. The method of automatically addressing a communication network of claim 2, wherein, The method further comprises: calculating a second distance between the first communication module and the candidate slave node according to the first ranging data; calculating a third distance between the second communication module and the candidate slave node according to the second ranging data; calculating the first measurement angle according to the first distance, the second distance, and the third distance based on the cosine theorem.

4. The method of automatically addressing a communication network of claim 3, wherein, The first ranging data comprises a first sending time of the first ranging request, a first receiving time of the candidate slave node receiving the first ranging request, a second sending time of the candidate slave node sending the first ranging data, and a second receiving time of the master node receiving the first ranging data. The second ranging data comprises 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.

5. The method of automatically addressing a communication network of claim 4, wherein, The second distance between the first communication module and the candidate slave node is calculated according to the first ranging data, comprising: 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.

6. The method of automatically addressing a communication network of claim 5, wherein, The second distance is half of the product of the first transmission time and the channel transmission rate.

7. The method of automatically addressing a communication network of claim 4, wherein, The third distance between the second communication module and the candidate slave node is calculated according to the second ranging data, comprising: calculating a second transmission time according to the third sending time, the third receiving time, the fourth sending time and the fourth receiving time; calculating the third distance according to the channel transmission rate and the second transmission time.

8. The method of automatically addressing a communication network of claim 7, wherein, The third distance is half of the product of the second transmission time and the channel transmission rate.

9. The method of automatically addressing a communication network of claim 4, wherein, The method further comprises: acquiring 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; acquiring 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; 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; 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.

10. The method of automatically addressing a communication network of claim 1, wherein, The target slave node is addressed through the communication address of the candidate slave node, comprising: acquiring a target slave node number of the target slave node; establishing a mapping between the target slave node number and the communication address; setting the communication address as a target communication address of the target slave node.

11. The method of claim 2, wherein, Before selecting the candidate slave node from the plurality of slave nodes, the method further comprises: acquiring ranging tag data; wherein the ranging tag data comprises real position information of a test slave node relative to a test master node in a test communication network; The test master node is controlled to send a test ranging request to the test slave node based on a preset communication frequency and a preset filtering algorithm, and to obtain test ranging data corresponding to the test ranging request from the test slave node; The test ranging data is compared with the ranging 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 controlled to send a test ranging request based on the optimized communication frequency and the optimized filtering algorithm until the test deviation data meets a preset condition, and a target communication frequency and a target filtering algorithm are obtained.

12. The method of claim 1, wherein, The first ranging request is sent to the candidate slave node through the first communication module, including: The first ranging request is sent to the candidate slave node through the first communication module based on ultra-wideband technology; The second ranging request is sent to the candidate slave node through the second communication module, including: The second ranging request is sent to the candidate slave node through the second communication module based on ultra-wideband technology.

13. The method of any one of claims 1-12, wherein, The slave node distribution information includes at least one of the following: the position of the slave node relative to the master node in the network topology, the geographic coordinates of the slave node relative to the master node, and the physical position of the slave node relative to the master node.

14. A communication network auto-addressing system wherein, The method comprises: a node distribution module for obtaining slave node distribution information of a communication network, wherein the slave node distribution information includes real position information of each slave node relative to the master node in the communication network; a candidate node module for selecting a candidate slave node from a plurality of slave nodes; a first ranging module for sending a first ranging request to the candidate slave node through a first communication module of the master node, and obtaining first ranging data corresponding to the first ranging request from the candidate slave node; a second ranging module for sending a second ranging request to the candidate slave node through a second communication module of the master node, and obtaining second ranging data corresponding to the second ranging request from the candidate slave node; a relative position module for 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; a target slave node module for matching the first relative position in the slave node distribution information to determine a target slave node; an addressing module for addressing the target slave node through a communication address of the candidate slave node, and re-determining the candidate slave node from each slave node that has not been selected, and returning to send a first ranging request to the candidate slave node through the first communication module until each slave node of the communication network is addressed.

15. An electronic device, comprising: The computer program is executed by the processor to implement the communication network automatic addressing method of any one of claims 1 to 13.

16. A computer readable storage medium having stored thereon a computer program, wherein, The computer program is executed by the processor to implement the communication network automatic addressing method of any one of claims 1 to 13.

Images