Internet of Things privacy protection positioning method based on heterogeneous quantization and related equipment
Through heterogeneous quantization and weighted aggregation technology, privacy protection and efficiency issues in IoT positioning are solved, high-precision and low-cost positioning are achieved, and privacy leakage risks caused by malicious device interference is reduced.
Patent Information
- Application Number
- CN202410957863.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-16
- Publication Date
- 2024-11-08
AI Technical Summary
In the existing IoT positioning technology, it is difficult for privacy protection methods to achieve positioning accuracy, efficiency and communication efficiency at the same time, and there is a risk of privacy leakage caused by malicious device interference.
Using the IoT privacy protection positioning method based on heterogeneous quantization, the distance and angle are measured by anchor points, heterogeneous quantization is performed and weighted aggregation is carried out, and the position information is quantized and weighted aggregated by combining the minimum error quantizer and the optimal weight allocation. Ensure location accuracy and privacy protection.
The positioning accuracy and communication efficiency are improved, and the risk of location privacy leakage is reduced. The simulation results show that the positioning accuracy is increased by 74.3% on average in the presence of malicious anchor points, while reducing communication costs.
Smart Images

Figure CN118921655A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of Internet of Things positioning technology, and in particular to an Internet of Things privacy protection positioning method based on heterogeneous quantization and related equipment. Background Art
[0002] The Internet of Things is a huge network that combines a large number of sensor devices with the Internet. Accurate positioning technology provides strong protection and support for applications such as data collection and transmission, target tracking, and routing based on geographic location in the Internet of Things. However, due to the exponential growth in the number of connected IoT devices, accompanied by a large amount of data interaction, transmission, and calculation, the risk of privacy leakage in the positioning process increases. Due to the open and dynamic characteristics of mobile positioning networks, malicious devices can participate in the execution of positioning, thereby storing and forwarding a large amount of location-sensitive information (such as distance and angle). This sensitive information can make it easy for malicious devices to calculate the location of other devices to infer the user's movement trajectory, living habits, and other privacy. Therefore, it is crucial to study privacy issues in the positioning process of the Internet of Things.
[0003] Current privacy protection methods can be roughly divided into three categories. Nieminen et al. proposed a privacy-preserving indoor localization scheme based on homomorphic encryption in a paper titled "Practicalprivacy-preserving indoor localization based on secure two-party computation (IEEE Transactions on Mobile Computing, vol. 20, no. 9, pp. 2877–2890, 2021)". This encryption method provides strong privacy protection, but it will have a large computational overhead. Shi et al. used differential privacy under Euclidean metric, that is, geographic indistinguishability, to study privacy-preserving positioning in a paper titled "CLAP: A contract-based incentive mechanism for cooperative localization balancing localization accuracy and location privacy (IEEE Internet of Things Journal, vol. 9, no. 9, 2022)". Differential privacy methods protect sensitive information by adding structured noise to geographic locations. Although it has high computational efficiency, it will reduce positioning accuracy. Yan et al. proposed an underwater privacy-preserving localization protocol in a paper titled "Privacy-preserving localization for underwater sensor networks via deep reinforcement learning (IEEE Transactions on Information Forensics and Security, vol. 16, pp. 1880–1895, 2021)", which uses information hiding technology to hide the private location information of nodes. Information hiding usually uses a zero-sum noise addition mechanism to protect privacy, eliminating additional noise in the location estimation. This method does not affect the positioning accuracy, but the generation of zero-sum noise will result in additional communication costs. Researchers have paid extensive attention to privacy-preserving positioning methods in the Internet of Things. However, existing solutions still sacrifice efficiency and accuracy to a certain extent. Therefore, it is of great significance to develop a privacy-preserving positioning method that can achieve positioning accuracy, privacy protection, and communication efficiency at the same time. Summary of the invention
[0004] In view of the problem that the existing Internet of Things privacy protection methods cannot achieve the accuracy, efficiency and privacy protection of positioning at the same time, the present invention proposes an Internet of Things privacy protection positioning method based on heterogeneous quantization (Quantizationbased Privacy Preserving Localization, QPPL) and related equipment. The present invention ensures the accuracy and efficiency of positioning while realizing privacy protection in the positioning process.
[0005] In a first aspect, the present invention provides a privacy protection positioning method for the Internet of Things based on heterogeneous quantization, comprising:
[0006] Step 1: Each anchor point measures the distance and angle between itself and the target node to calculate its own position update information for the target node;
[0007] Step 2: Perform heterogeneous quantization on the position update information of all anchor points to obtain the corresponding quantized position update information and quantization error;
[0008] Step 3: The target node assigns a weight to each anchor point according to the quantization error of each anchor point to perform weighted aggregation on the position update information of all anchor points to obtain the position estimation information of the target node;
[0009] Step 4: Determine whether the iteration stop condition is met. If so, the position estimation information of the target node obtained in this round is used as the final position positioning result. Otherwise, repeat steps 1 to 3.
[0010] Furthermore, step 2 specifically includes:
[0011] The position update information of all anchor points is subjected to heterogeneous quantization with different bit numbers using a minimum error quantizer to obtain the corresponding quantized position update information and square quantization error.
[0012] Furthermore, step 3 specifically includes:
[0013] Step 3.1: The target node assigns weights to each anchor point according to the following formula;
[0014]
[0015] Among them, M i (t) represents the quantization error corresponding to the i-th anchor point, p i (t) represents the weight assigned to the i-th anchor point in the t-th round;
[0016] Step 3.2: Use the following formula to perform weighted aggregation on the position update information of all anchor points;
[0017]
[0018] Among them, X t represents the position estimation information of the target node obtained in the t-th round, m represents the total number of anchor points, represents the quantized position update information corresponding to the i-th anchor point in the t-th round, represents the estimated position of the target node by the i-th anchor point in the t-th round, represents the position update information before quantization corresponding to the i-th anchor point in the t-th round.
[0019] Furthermore, step 4 specifically includes:
[0020] Step 4.1: When X t - X t-1 > ∈ and t < t max , the target node broadcasts the position estimation information X t of the target node in the t-th round to the m anchor points performing positioning, so that the m anchor points and the target node repeat steps 1 to 3 for the next round of positioning;
[0021] Step 4.2: When X t - X t-1 < M or t ≥ t max , the iteration stops, and the final position positioning result X t of the target node is obtained.
[0022] In a second aspect, the present invention provides an Internet of Things privacy protection positioning system based on heterogeneous quantization, including:
[0023] A position update module, configured to measure the distance and angle between each anchor point and the target node to calculate the position update information of each anchor point with respect to the target node;
[0024] A quantization module, configured to perform heterogeneous quantization on the position update information of all anchor points to obtain the corresponding quantized position update information and quantization error of each;
[0025] An aggregation module, configured for the target node to assign weights to each anchor point according to the quantization error of each anchor point to perform weighted aggregation on the position update information of all anchor points to obtain the position estimation information of the target node;
[0026] A judgment module, configured to judge whether the iteration stop condition is reached. If so, the position estimation information of the target node obtained in this round is used as the final position positioning result. Otherwise, the next round of positioning is performed.
[0027] In a third aspect, the present invention provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor implements the method described in the first aspect when executing the program.
[0028] In a fourth aspect, the present invention provides a non-transitory computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the method described in the first aspect.
[0029] Beneficial effects of the present invention:
[0030] (1) The present invention quantifies the location information that needs privacy protection, thereby deviating from the original location information and protecting the location privacy during the positioning process. At the same time, quantization compresses the data size, reduces communication costs, and improves positioning efficiency.
[0031] (2) Considering the heterogeneity of computing power or hardware capabilities of different anchor points, the present invention adopts a heterogeneous quantization method when quantizing the position information of each anchor point, in preparation for the subsequent improvement of positioning accuracy.
[0032] (3) Since a heterogeneous quantization method is adopted, heterogeneous quantization accuracy is generated. In order to improve the overall positioning accuracy, the present invention proposes an optimal weight allocation scheme, that is, by minimizing the weighted sum of the sum of squares of the quantization errors of all anchor points, a closed-form optimal weight allocation solution is derived using convex optimization theory, thereby allocating personalized weights to the anchor points according to their quantization errors.
[0033] In summary, the present invention can estimate the position of the target node while ensuring the accuracy, privacy protection and efficiency of positioning. The simulation results show that in the presence of malicious anchor points, the positioning accuracy of the present invention solution is improved by an average of 74.3%. BRIEF DESCRIPTION OF THE DRAWINGS
[0034] Figure 1 A schematic diagram of a process flow of a privacy-preserving positioning method for the Internet of Things based on heterogeneous quantization provided by an embodiment of the present invention;
[0035] Figure 2 A schematic diagram of the structure of a privacy protection positioning system for the Internet of Things based on heterogeneous quantization provided by an embodiment of the present invention;
[0036] Figure 3 A schematic diagram of the structure of an electronic device provided by an embodiment of the present invention;
[0037] Figure 4 An analysis result diagram describing the relationship between positioning error and number of iterations provided in an embodiment of the present invention;
[0038] Figure 5 An analysis result diagram describing the relationship between the weighted sum of square quantization error (Square Quantization Error, SQE) and the number of iterations provided in an embodiment of the present invention;
[0039] Figure 6 An analysis result diagram describing the relationship between positioning error and the number of anchor points provided by an embodiment of the present invention;
[0040] Figure 7 An analysis result diagram describing the relationship between positioning error and measurement times provided by an embodiment of the present invention;
[0041] Figure 8 An analysis result diagram describing the relationship between the communication cost and the number of anchor points provided in an embodiment of the present invention;
[0042] Fig. 9 An analysis result diagram describing the relationship between positioning error and the number of malicious anchor points provided in an embodiment of the present invention. DETAILED DESCRIPTION
[0043] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution in the embodiment of the present invention will be clearly described below in conjunction with the drawings in the embodiment of the present invention. Obviously, the described embodiment is a part of the embodiment of the present invention, not all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0044] Example 1
[0045] like Figure 1 As shown, an embodiment of the present invention provides an IoT privacy protection method based on heterogeneous quantization, comprising the following steps:
[0046] S101: Each anchor point measures the distance and angle between itself and the target node to calculate its own position update information with respect to the target node;
[0047] Specifically, the anchor point can use existing measurement methods to measure the distance and angle between itself and the target node, such as the ranging method based on the signal reception strength. The anchor point's updated position information for the target node is the privacy data that needs to be protected. Taking the i-th anchor point as an example, the anchor point calculates the estimated position of the target node in the tth round based on the measured distance information and angle information. Then, calculate the location update information at this time
[0048] S102: Perform heterogeneous quantization on the position update information of all anchor points to obtain the quantized position update information and quantization error corresponding to each anchor point;
[0049] Specifically, by quantizing the private location update information, the original location update information is offset, thereby achieving privacy protection during the positioning process. At the same time, quantization compresses the data size and reduces communication overhead, thereby improving positioning efficiency. At the same time, considering that the computing power of different anchor points is heterogeneous, this step adopts heterogeneous quantization, that is, heterogeneous quantization bits are applied to devices with different capabilities.
[0050] As an implementation method, the position update information of all anchor points is quantized with different bit numbers using a minimum error quantizer to obtain the corresponding quantized position update information and square quantization error M i (t); wherein the calculation method of the minimum error quantizer is derived based on the design idea of the minimum error quantizer in the document "A simple federated learning-based scheme for security enhancement over Internet of Medical Things (IEEE Journal of Biomedical and Health Informatics, 2022, 27(2): 652-663.)", and the corresponding quantization formula is:
[0051]
[0052] Wherein, x represents the original data to be quantified.
[0053] The so-called square quantization error refers to: in, represents the position update information before quantization corresponding to the i-th anchor point in the t-th round, represents the quantized position update information corresponding to the i-th anchor point in the t-th round, i=1,2,···,m. It should be noted that X0=0 is initialized.
[0054] S103: the target node assigns a weight to each anchor point according to the quantization error of each anchor point to perform weighted aggregation on the position update information of all anchor points to obtain the position estimation information of the target node;
[0055] Specifically, since devices with different capabilities may apply heterogeneous quantization bits, resulting in heterogeneous quantization accuracy. This quantization heterogeneity brings a new problem: how to optimally aggregate location information with different quantization levels on the target to achieve accurate positioning. To solve this problem, this step assigns personalized weights to all anchor points based on the quantization error. Specifically, it includes the following sub-steps:
[0056] S1031: The target node assigns a weight to each anchor point according to the following formula;
[0057]
[0058] Among them, M i (t) represents the quantization error corresponding to the i-th anchor point, p i (t) represents the weight assigned to the i-th anchor point in the t-th round; the above weight formula is based on the optimal weight assignment solution derived by minimizing the weighted sum of squared quantization errors.
[0059] S1032: Perform weighted aggregation on the location update information of all anchor points using the following formula;
[0060]
[0061] Among them, X t represents the estimated position information of the target node obtained in the tth round, m represents the total number of anchor points, represents the quantized position update information corresponding to the i-th anchor point in the t-th round, represents the estimated position of the target node of the i-th anchor point in the t-th round, Represents the position update information before quantization corresponding to the i-th anchor point in the t-th round.
[0062] S104: Determine whether the iteration stop condition is met. If so, the position estimation information of the target node obtained in this round is used as the final position positioning result. Otherwise, repeat steps S101 to S103.
[0063] S1041: When X t -X t-1 >∈ and t <t max When the target node sends the position estimation information X of the target node in round t t Broadcast to the m anchor points performing positioning, so that the m anchor points and the target node repeat steps 1 to 3 for the next round of positioning;
[0064] S1042: When X t -X t-1 <∈ or t≥t max When , the iteration stops and the final position positioning result X of the target node is obtained. t .
[0065] Example 2
[0066] Corresponding to the above method, such as Figure 2 As shown, an embodiment of the present invention provides an Internet of Things privacy protection positioning system based on heterogeneous quantization, including: a location update module, a quantization module, an aggregation module and a judgment module.
[0067] The position update module is used for each anchor point to measure the distance and angle between itself and the target node to calculate its own position update information for the target node; the quantization module is used to perform heterogeneous quantization on the position update information of all anchor points to obtain the corresponding quantized position update information and quantization error; the aggregation module is used for the target node to assign weights to each anchor point according to the quantization error of each anchor point to perform weighted aggregation on the position update information of all anchor points to obtain the position estimation information of the target node; the judgment module is used to judge whether the iteration stop condition is met. If so, the position estimation information of the target node obtained in this round is used as the final position positioning result. Otherwise, the next round of positioning is carried out.
[0068] It should be noted that the embodiment of the present invention is to implement the above method, and its specific functions can be referred to the above method embodiment, which will not be repeated here.
[0069] Figure 3 An example of a physical structure diagram of an electronic device is shown in FIG. Figure 3 As shown, the electronic device may include: a processor 301, a communication interface 302, a memory 303 and a communication bus 304, wherein the processor 301, the communication interface 302 and the memory 303 communicate with each other through the communication bus 304. The processor 301 may call the logic instructions in the memory 303 to execute the privacy protection positioning method of the Internet of Things based on heterogeneous quantization, the method comprising: step 1: each anchor point measures the distance and angle between itself and the target node to calculate its own position update information for the target node; step 2: heterogeneously quantize the position update information of all anchor points to obtain the quantized position update information and quantization error corresponding to each anchor point; step 3: the target node assigns a weight to each anchor point according to the quantization error of each anchor point to perform weighted aggregation on the position update information of all anchor points to obtain the position estimation information of the target node; step 4: determine whether the iteration stop condition is reached, if so, the position estimation information of the target node obtained in this round is used as the final position positioning result, otherwise, repeat steps 1 to 3.
[0070] In addition, when the logic instructions in the above-mentioned memory 303 are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art or the 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 several instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.
[0071] An embodiment of the present invention also provides a computer program product, which includes a computer program stored on a non-transitory computer-readable storage medium, and the computer program includes program instructions. When the program instructions are executed by a computer, the computer can execute the methods provided by the above-mentioned method embodiments, for example, including: Step 1: Each anchor point measures the distance and angle between itself and the target node to calculate its own position update information for the target node; Step 2: Heterogeneously quantize the position update information of all anchor points to obtain the corresponding quantized position update information and quantization error; Step 3: The target node assigns a weight to each anchor point according to the quantization error of each anchor point to weightedly aggregate the position update information of all anchor points to obtain the position estimation information of the target node; Step 4: Determine whether the iteration stop condition is met. If so, the position estimation information of the target node obtained in this round is used as the final position positioning result. Otherwise, repeat steps 1 to 3.
[0072] An embodiment of the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the methods provided by the above-mentioned method embodiments are implemented, for example, including: Step 1: Each anchor point measures the distance and angle between itself and the target node to calculate its own position update information for the target node; Step 2: The position update information of all anchor points is heterogeneously quantized to obtain the corresponding quantized position update information and quantization error; Step 3: The target node assigns a weight to each anchor point according to the quantization error of each anchor point to perform weighted aggregation on the position update information of all anchor points to obtain the position estimation information of the target node; Step 4: Determine whether the iteration stop condition is met. If so, the position estimation information of the target node obtained in this round is used as the final position positioning result. Otherwise, repeat steps 1 to 3.
[0073] Through the description of the above implementation methods, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus a necessary general hardware platform, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solution is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.
[0074] In order to verify the effect of the technical solution of the present invention, the following experiments were conducted:
[0075] The simulation experiment parameters are configured as follows: 30 anchor nodes are uniformly and randomly distributed in a square area with a side length of 100, and the target node is located in the center. Considering the heterogeneity of the computing power of different anchor points, it is assumed that among the 30 anchor nodes, 10% of the anchor points, that is, 3 anchor points, have weak hardware capabilities, and the measured angle and distance information have large errors. The iteration rounds are 10 rounds, and the heterogeneous quantization is set to 80% 3bit and 20% 5bit, that is, 24 anchor points are quantized with 3bit, and the remaining 6 nodes are quantized with 5bit.
[0076] The comparison schemes include iterative single anchor node localization algorithm (LSAL), equal weight based Quantization Single Anchor Localization algorithm (E-QAL), random weight based Quantization Single Anchor Localization algorithm (R-QAL), Gaussian noisebased Privacy Preserving Localization (GPPL), zero-sum noisebased Privacy Preserving Localization (ZPPL) and homomorphic encryption-based Privacy-Preserving Localization (HPPL).
[0077] Figure 4The influence of the number of iterations on the positioning error is given. The simulation results show that the more the number of iterations, the smaller the positioning error. The positioning error of the QPPL of the present invention after 10 rounds of iterations is significantly lower than that of the other three methods, and the positioning error gradually converges to 0, proving that the method of the present invention has convergence and can achieve accurate positioning results. The positioning errors of E-QAL and R-QAL are much larger than those of QPPL, which verifies the superiority of the weight allocation method in QPPL.
[0078] Figure 5 The influence of the number of iterations on the weighted sum of SQE is given. The weighted sum of SQE of QPPL of the present invention is the SQE of each anchor point multiplied by the weight assigned to it by the target in this round, and then added. The weighted sum of SQE of E-QAL is the SQE of each anchor point multiplied by 1 / 30, and then added. The simulation results show that the weighted sum of SQE of QPPL is much smaller than that of E-QAL, which verifies the derivation and analysis results of SQE minimization and proves the correctness and superiority of the weight allocation scheme of QPPL under heterogeneous quantization settings. Figure 4 and Figure 5 , which can prove the correctness of the QPPL method.
[0079] Figure 6 The influence of the number of anchor points on the positioning error is given. The simulation results show that the positioning errors of the four methods all decrease with the increase of the number of nodes, because more anchor nodes will bring more information, thus achieving accurate positioning. Compared with the other three methods, the positioning error of the QPPL of the present invention is the smallest, indicating that QPPL has better position estimation while achieving heterogeneous quantization, proving the accuracy of QPPL. In particular, as the number of anchor nodes increases, the decrease in the positioning error of QPPL becomes smaller and smaller, proving that QPPL can achieve better results using only a small number of positioning devices, reflecting the superiority of QPPL.
[0080] Figure 7 The influence of the number of measurements on the positioning error is given. The simulation results show that when the number of measurements is greater, more angle and distance information will be obtained, resulting in a smaller positioning error. In addition, when the number of measurements is infinite, the measurement error will approach 0, thus making the positioning error converge to 0. Compared with the other three schemes, QPPL has the smallest positioning error, which once again proves the accuracy of QPPL. Figure 6 and Figure 7 , which verifies that the positioning results of QPPL are more accurate.
[0081] Figure 8The communication overhead of QPPL, that is, the number of bits transmitted during the execution process, is shown. As the number of nodes increases, the position data that needs to be transmitted increases, and the communication overhead becomes larger and larger. During the execution process of LSAL, what is transmitted is the position estimate of the target node by each node in each round. During the execution process of QPPL, what is transmitted is the quantized position update and quantization error of each node in each round. Since QPPL uses low-bit quantization, the proportion of quantized position updates is much smaller than the proportion of original position information in LSAL. In addition, since the minimum error quantizer is used, the number of bits of the quantization error is also much smaller than the number of bits of the original data. Therefore, compared with LSAL, QPPL has a smaller communication overhead and can improve positioning efficiency, which proves the high efficiency of QPPL.
[0082] Fig. 9 The influence of the number of malicious anchor points on the positioning error is given. 3 to 15 malicious anchor points are set during the positioning process, which may tamper with the data and thus interfere with the positioning results. By observing the relationship between the number of malicious anchor points and the positioning error, the privacy protection performance of QPPL is studied. The simulation results show that the positioning error of QPPL is much smaller than that of the other three algorithms, proving that malicious anchor points will not affect the accuracy of QPPL and have a good privacy protection effect. In addition, as the number of malicious anchor points increases, the positioning error of QPPL does not fluctuate much, while the positioning errors of HPPL, ZPPL, and GPPL increase significantly. This is because more malicious nodes tamper with more data, and these three methods cannot eliminate the impact of malicious nodes, resulting in a significant increase in positioning errors.
[0083] In summary, the present invention provides a privacy-preserving positioning method for the Internet of Things based on heterogeneous quantization, which protects location privacy by applying heterogeneous quantization to the location update of anchor points. At the same time, quantization compresses the data size and reduces communication and computing costs. Furthermore, in order to improve the positioning accuracy, an optimal weight allocation scheme is proposed to aggregate the position estimates of heterogeneously quantized anchor points by minimizing the weighted sum of SQE. This method can ensure the accuracy, privacy protection and efficiency of positioning while estimating the position of the target. Simulation results show that in the presence of misbehaving nodes, the positioning accuracy of this method is improved by an average of 74.3%.
[0084] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims
1. A privacy-preserving positioning method for the Internet of Things based on heterogeneous quantization, characterized in that: include: Step 1: Each anchor point measures the distance and angle between itself and the target node to calculate its own position update information for the target node; Step 2: Perform heterogeneous quantization on the position update information of all anchor points to obtain the corresponding quantized position update information and quantization error; Step 3: The target node assigns a weight to each anchor point according to the quantization error of each anchor point to perform weighted aggregation on the position update information of all anchor points to obtain the position estimation information of the target node; Step 4: Determine whether the iteration stop condition is met. If so, the position estimation information of the target node obtained in this round is used as the final position positioning result. Otherwise, repeat steps 1 to 3.
2. According to claim 1, a privacy protection positioning method for the Internet of Things based on heterogeneous quantization is characterized in that: Step 2 specifically includes: The position update information of all anchor points is subjected to heterogeneous quantization with different bit numbers using a minimum error quantizer to obtain the corresponding quantized position update information and square quantization error.
3. A privacy-preserving positioning method for the Internet of Things based on heterogeneous quantization according to claim 1 or 2, characterized in that: Step 3 specifically includes: Step 3.1: The target node assigns weights to each anchor point according to the following formula; Among them, M i (t) represents the quantization error corresponding to the i-th anchor point, p i (t) represents the weight assigned to the i-th anchor point in the t-th round; Step 3.2: Use the following formula to perform weighted aggregation on the position update information of all anchor points; Among them, X t represents the estimated position information of the target node obtained in the tth round, m represents the total number of anchor points, represents the quantized position update information corresponding to the i-th anchor point in the t-th round, represents the estimated position of the target node of the i-th anchor point in the t-th round, Represents the position update information before quantization corresponding to the i-th anchor point in the t-th round.
4. According to claim 3, a privacy protection positioning method for the Internet of Things based on heterogeneous quantization is characterized in that: Step 4 specifically includes: Step 4.1: When X t -X t-1 >∈ and t <t max When the target node sends the position estimation information X of the target node in round t t Broadcast to the m anchor points performing positioning, so that the m anchor points and the target node repeat steps 1 to 3 for the next round of positioning; Step 4.2: When X t -X t-1 <∈ or t≥t max When , the iteration stops and the final position positioning result X of the target node is obtained. t .
5. A privacy-preserving positioning system for the Internet of Things based on heterogeneous quantization, characterized in that: include: A position update module is used for each anchor point to measure the distance and angle between itself and the target node to calculate its own position update information with respect to the target node; A quantization module is used to perform heterogeneous quantization on the position update information of all anchor points to obtain the corresponding quantized position update information and quantization error; Aggregation module, used for the target node to assign weights to each anchor point according to the quantization error of each anchor point to perform weighted aggregation on the position update information of all anchor points to obtain the position estimation information of the target node; The judgment module is used to judge whether the iteration stop condition is met. If so, the position estimation information of the target node obtained in this round is used as the final position positioning result. Otherwise, the next round of positioning is carried out.
6. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the method according to any one of claims 1 to 4 is implemented.
7. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 4 is implemented.
