CN105828432B - A kind of efficient method for secret protection of anchor node ranging localization - Google Patents
A kind of efficient method for secret protection of anchor node ranging localization Download PDFInfo
- Publication number
- CN105828432B CN105828432B CN201610304702.8A CN201610304702A CN105828432B CN 105828432 B CN105828432 B CN 105828432B CN 201610304702 A CN201610304702 A CN 201610304702A CN 105828432 B CN105828432 B CN 105828432B
- Authority
- CN
- China
- Prior art keywords
- anchor node
- ranging
- privacy
- node
- anchor
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 84
- 230000004807 localization Effects 0.000 title abstract description 7
- 239000011159 matrix material Substances 0.000 claims abstract description 65
- 238000000354 decomposition reaction Methods 0.000 claims abstract description 48
- 230000008569 process Effects 0.000 claims abstract description 23
- 238000004364 calculation method Methods 0.000 claims description 97
- 238000004891 communication Methods 0.000 abstract description 33
- 238000004422 calculation algorithm Methods 0.000 abstract description 8
- 238000004458 analytical method Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 5
- 238000004088 simulation Methods 0.000 description 3
- 239000000463 material Substances 0.000 description 2
- 238000005259 measurement Methods 0.000 description 2
- 239000002904 solvent Substances 0.000 description 2
- 241000287196 Asthenes Species 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000007728 cost analysis Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W64/00—Locating users or terminals or network equipment for network management purposes, e.g. mobility management
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
- G01S5/00—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations
- G01S5/02—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations using radio waves
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/029—Location-based management or tracking services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W64/00—Locating users or terminals or network equipment for network management purposes, e.g. mobility management
- H04W64/006—Locating users or terminals or network equipment for network management purposes, e.g. mobility management with additional information processing, e.g. for direction or speed determination
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Mobile Radio Communication Systems (AREA)
- Storage Device Security (AREA)
Abstract
The present invention relates to a kind of efficient method for secret protection of anchor node ranging localization.The following steps are included: anchor node executes its ranging process for arriving destination node, ranging information collection D is obtained；According to anchor node location information and above-mentioned ranging information collection D, coefficient matrices A and ranging matrix B are constructed；Matrix A and matrix B are carried out decomposing by row respectively, and to middle entry ATA and middle entry ATB carries out Cluster Decomposition；For above-mentioned middle entry decomposition result, carries out secret protection read group total and secret protection asks adjacent sum of products to calculate；Utilize ATA and ATThe privacy-preserving data computation of B is as a result, destination node carries out position calculating.The efficient method for secret protection of anchor node ranging localization of the invention not only solves privacy concern present in anchor node ranging localization; and it is without the use of homomorphic encryption algorithm; to have lower calculating cost and communication cost, the efficiency of method for secret protection can be improved while protecting user location privacy.
Description
Technical Field
The invention relates to the field of positioning and privacy protection, in particular to a high-efficiency privacy protection method for anchor node ranging positioning.
Background
With the continuous development of mobile communication network technology and ubiquitous computing technology, Location-Based Services (LBS) is becoming more and more important. Positioning technology has attracted extensive attention from researchers all over the world as a basis for location-aware computing and location-based services.
Anchor node ranging positioning is one of the most common positioning techniques. The anchor node ranging and positioning technology comprises two types of devices: a plurality of anchor node devices (e.g., smartphones) and a target node device (e.g., laptop, sensor, tablet). The anchor node ranging and positioning technology adopts three-stage mode. The first stage is an anchor node discovery process, a target node recruits a mobile anchor node through broadcasting a hello message at a communication interface of the target node, and the smart phone receives the hello message and replies the hello message to the target node so as to become the anchor node. The anchor node needs to satisfy two conditions: (1) the anchor node is within one-hop communication range of the target node for ranging. This condition is easily satisfied because the anchor node can receive the hello packet sent by the target node. (2) The anchor node must have its own location information. The target node can add an expected value of the position accuracy of the anchor node into the hello message, and only the anchor node meeting the accuracy can reply to the target node. In the second stage, the anchor node performs a ranging process, and the anchor node estimates the distance between the anchor node and the target node, and the ranging can be based on various methods, such as a sound wave ranging method based on time arrival difference and a ranging method based on signal reception strength. The third stage is position calculation, and the position calculation is carried out by using a multilateral positioning method according to the ranging information and the position information of the anchor node.
It can be seen from the process of the ranging and positioning of the anchor node that the ranging and positioning of the anchor node requires the anchor node to measure the distance between the anchor node and the target node, which may cause the anchor node to communicate to estimate the position of the target node, resulting in the leakage of the position information of the target node, and thus it can be seen that the ranging and positioning of the anchor node is more suitable for the scenario where the target node is not in a strong position concern. Although the anchor node ranging and positioning is considered as a practical positioning algorithm, the anchor node ranging and positioning has a potential privacy disclosure problem, and the privacy information of the target node user and the anchor node user can be disclosed. First, location information for the anchor node user may be leaked. Since the target node location calculation needs to use the location information and ranging information of the anchor node as inputs, the location information of the anchor node may be acquired by other anchor nodes to cause a security problem. Secondly, the position calculation result of the target node user may not be only known by the target node, but also other anchor nodes may obtain the positioning result, thereby causing privacy leakage. Finally, directly applying the existing homomorphic encryption algorithm for privacy protection causes a large calculation cost and communication cost, which is not favorable for popularization and use of the privacy protection method.
S.Tao et al published an article with the name of "detecting Multi-layer Localization Privacy in Privacy Environments" in IEEE/ACM Transactions on Networking 2015 23(5), and relates to a distance measuring and positioning Privacy protection method for an anchor node in a disclosed Multi-party Privacy protection and positioning method. The method does not use a homomorphic encryption algorithm, and can protect the privacy information in the anchor node ranging and positioning process. However, in the implementation process of the method, a specific anchor node needs to be selected to calculate the privacy information of all anchor nodes, which is equivalent to the method with the help of the thought of a trusted third party. The method of selecting a specific anchor node as a trusted third party in the privacy protection positioning process causes unfair status among the anchor nodes on one hand, and also causes huge calculation cost and communication cost for the specific anchor node on the other hand. The consequence of using a specific anchor node to calculate all the privacy information of the anchor node is not beneficial to the practical application of the distance measurement and positioning privacy protection method of the anchor node.
Compared with the method that the privacy leakage problem in the anchor node ranging and positioning process is solved by directly using the homomorphic encryption theory, the efficient privacy protection method for directly designing the anchor node ranging and positioning can protect the position privacy information of the user and reduce the calculation cost and the communication cost of the privacy protection method. In addition, the problem of unfair status among anchor nodes is not caused by calculating the adjacent product sum through privacy protection summation and privacy protection, and huge calculation cost and communication cost are not caused for a certain anchor node.
Disclosure of Invention
The invention aims to provide an anchor node ranging and positioning privacy protection method which can protect position privacy information of a user and can reduce calculation cost and communication cost of the privacy protection method.
To this end, the technical scheme provided by the invention is an efficient privacy protection method for ranging and positioning of an anchor node, which comprises the following steps:
s1, an anchor node executes a ranging process from the anchor node to a target node to obtain a ranging information set D;
s2, constructing a coefficient matrix A and a ranging matrix B according to anchor node position information and the ranging information set D;
s3, performing line-by-line decomposition on the matrix A and the matrix B respectively, and performing line-by-line decomposition on the intermediate item ATA and the intermediate term ATB, performing clustering decomposition;
s4, carrying out privacy protection summation calculation and privacy protection adjacent product summation calculation aiming at the intermediate item decomposition result;
s5, utilizing ATA and ATAnd B, performing privacy protection calculation, and performing position calculation on the target node.
Further, in the foregoing S1, it is assumed that there are m anchor nodes in the region, and for the anchor nodes i, 1, …, m, di0Representing an estimate of the distance of the anchor node i to the target node 0, i.e. ranging information di0Obtaining a ranging information set D ═ D after the ranging phase is finished for the privacy information of the anchor node ii0,i＝1…m}。
Further, in the aforementioned S2, the process of constructing the coefficient matrix a and the ranging matrix B is as follows:
s21, constructing a coefficient matrix A, and assuming the position of an anchor node i(xi1,xi2,…,xin) Where n represents the dimension of the space, the matrix a is defined as:
s22, constructing a ranging matrix B, wherein the definition of the matrix B is as follows according to the ranging information set D and the position coordinate information:
further, the step S3 specifically includes:
s31, decomposing each row of the matrix A, namely:
wherein A isi＝2[xi1-xi+11…xin-xi+1n]＝2(xi-xi+1),i＝1,…,m-1；
S32, decomposing each row of the matrix B, namely:
wherein,
s33, the intermediate item ATA clustering decomposition, according to the decomposition result of matrix A, for ATA, decomposing, so that the vector product in the first class of the decomposed result only contains the privacy information of a single anchor node, and the vector product in the second class only contains the privacy information of adjacent anchor nodes, namely:
ATA＝V1-V2
wherein,
s34, the intermediate item ATB clustering decomposition, according to the decomposition results of the matrixes A and B, carrying out A clustering decomposition on the matrixesTB, decomposing is carried out, so that the decomposed vector product in the first class only contains the privacy information of a single anchor node, and the vector product in the second class only contains the privacy information of adjacent anchor nodes, namely:
ATB＝U1-U2
wherein,
further, the aforementioned S4 further includes:
s41, the intermediate item ATV of A decomposition result1Performing privacy protection summation calculation on the intermediate item ATU of B decomposition result1Carrying out privacy protection summation calculation;
s42, the intermediate item ATV of A decomposition result2Performing privacy protection on the adjacent product sum calculation, and performing intermediate term ATU of B decomposition result2And carrying out privacy protection adjacent product summation calculation.
Still further, the aforementioned privacy preserving summation calculation comprises: suppose Mi(i-1, …, m-1) is the privacy information at anchor node i, then the privacy-preserving sum, i.e. privacy-preserving computationThe anchor node i (i-1, …, m-1) generates (m-1) random matricesk＝1,…,m-1，Anchor nodei RetentionThe rest matrixes are sent to corresponding (m-2) nodes, and the anchor node i adds the matrixes received by the anchor node i and sent by other nodes with the reserved matrixes to construct a matrixWhere P isiIs a random matrix, andanchor node i send αi＝Mi+PiTo the target node 0, the target node 0 calculates according to the received informationHere α is the result of the privacy preserving sum computation.
The privacy preserving neighboring product sum calculation comprises: suppose Mi(i-1, …, m-1) is privacy information at anchor node i, and the privacy protection is a sum of adjacent products, i.e. privacy protection calculationAnchor node i (i-1, …, m-1) generationWill be provided withIs reserved, willSending the random number to a node i +1, and receiving the random number sent by the anchor node i +1 by the anchor node iConstructing random numbersAnchor node i +1 generationWill be provided withIs reserved, willSending the random number to a node i, and receiving the random number sent by the anchor node i +1Constructing random numbersAnchor node i sendTo target node 0, anchor node i +1 sendsTo target node 0, based on the received information, target node 0 calculates βi,i+1＝βiβi+1β obtained by calculationi,i+1(i-1, …, m-1), target node 0 calculationHere β is the result of the neighbor product sum computation for privacy protection.
Finally, the aforementioned S5 includes: intermediate item A using sum of privacy protection calculation and sum of adjacent products calculation of privacy protectionTA and the intermediate term ATB, carrying out privacy protection calculation, and assuming that calculation results are respectively omega and psi, the position of the target node is
Has the advantages that: the efficient privacy protection method for anchor node ranging and positioning, provided by the invention, does not need to use a homomorphic encryption algorithm, can protect the privacy information of all users in the anchor point ranging and positioning process, and has lower calculation cost, communication cost and execution time. In addition, the efficient privacy protection method for anchor node ranging and positioning belongs to a completely distributed method, and each anchor node is equal in position, and calculation cost, communication cost and execution time are equal.
Drawings
Fig. 1 is a flow diagram of an efficient privacy protection method for anchor node ranging location.
Fig. 2 is a flow chart of a privacy preserving sum computation.
Figure 3 is a flow diagram of privacy preserving neighbor product sum computation.
Fig. 4 is an analysis result diagram describing the relationship between the calculation cost and the number m of anchor nodes in the present invention.
Fig. 5 is a diagram illustrating an analysis result of a relationship between a communication cost and the number m of anchor nodes in the present invention.
Fig. 6 is a diagram illustrating the analysis result of the relationship between the execution time and the number m of anchor nodes in the present invention.
Detailed Description
Specific embodiments of the present invention will now be described in further detail with reference to the accompanying drawings. In the drawings, the same or similar symbols denote the same or similar elements or elements having the same or similar functions throughout. An embodiment including simulation results is also provided and described with reference to the drawings, but the embodiment is exemplary and intended to be illustrative of the present invention and should not be construed as limiting the present invention.
The invention relates to the field of positioning and privacy protection, in particular to a high-efficiency privacy protection method for anchor node ranging positioning. The invention utilizes a matrix decomposition idea, combines an anchor node distance measurement positioning process, and solves the adjacent product sum calculation based on privacy protection sum calculation and privacy protection, thereby realizing the invention which has lower calculation cost and communication cost and carries out privacy protection on the information of all the participated users.
As shown in fig. 1, the efficient privacy protection method for anchor node ranging and positioning according to the embodiment of the present invention includes the following steps.
S1, the anchor node executes the ranging process from the anchor node to the target node to obtain a ranging information set D
The anchor node estimates its distance to the target node and takes the ranging information as privacy information. Ranging may be based on various methods, for example, if the anchor point and the target device are in the same Basic Service Set (BSS), an accurate ranging may be obtained using a Time-of-arrival (ToA) based acoustic ranging method. In addition, if the anchor point is far away from the target node, a Radio Frequency (RF) ranging method, such as RSS (Received Signal Strength) based ranging, may be used. Specifically, assuming that there are m anchor nodes and one target node in a region, for anchor node i ═ 1, …, m, di0Representing an estimate of the distance of the anchor node i to the target node 0, i.e. ranging information di0Is the privacy information of the anchor node i. After the ranging process is finished, obtaining a ranging information set D ═ { D ═ Di0I-1 … m, for each anchor node i, a ranging message d is obtainedi0And the ranging information is privacy information of the anchor node i.
And S2, constructing a coefficient matrix A and a ranging matrix B according to the anchor node position information and the ranging information set D. Specifically, the method further comprises the following steps:
s21, constructing a coefficient matrix A
In order to construct the coefficient matrix, location information of the anchor node needs to be acquired. When selecting the anchor node, the anchor node with own position information is selected, so that all the anchor nodes participating in positioning have self-positioningThe location information of the user. In particular, assume the location of anchor node i(xi1,xi2,…,xin) Where n denotes the dimension of the space (n ═ 2 denotes a two-dimensional space), the matrix a is defined as:
s22, constructing a ranging matrix B
In order to construct the ranging matrix, position information of the anchor node and distance information between the anchor node and the target node need to be acquired. As known from step S1, the ranging information is anchor node privacy information. Therefore, according to the ranging information and the position coordinate information, the matrix B is defined as:
s3, decomposing the matrix A and the matrix B according to rows and carrying out intermediate item ATA and the intermediate term ATAnd B, performing clustering decomposition. Specifically, the method further comprises the following steps:
s31, decomposing each row of the matrix A
According to the structure of the coefficient matrix a, it can be seen that each row only contains information of two anchor nodes. The matrix a is thus decomposed in row units, each row being a separate vector. In particular, the amount of the solvent to be used,
wherein A isi＝2[xi1-xi+11…xin-xi+1n]＝2(xi-xi+1) I is 1, …, m-1. As can be seen from the decomposition result, each element of the matrix a only contains the private information of two neighboring anchor nodes.
S32, decomposing each row of the matrix B
According to the structure of the ranging matrix B, it can also be found that each row contains only information of two anchor nodes. The matrix B is thus also decomposed in units of rows, each row being a separate element. In particular, the amount of the solvent to be used,
wherein,as can be seen from the decomposition results, each element of the matrix B contains only the private information of two neighboring anchor nodes.
S33, the intermediate item ATA carries out clustering decomposition
Since the intermediate term A is directly calculatedTA needs to acquire the positions of all anchor nodes, and the position information belongs to the privacy information of each anchor node. Therefore, the intermediate items are decomposed by using the decomposition result of the matrix A, so that the privacy information can be simply and safely calculated in the decomposed result. Specifically, according to the decomposition result of the matrix A, A is subjected toTA carries on the clustering and decomposes, can find the vector product only contains the privacy information of a single anchor node in the first kind of the result after decomposing, the vector product only contains the privacy information of the adjacent anchor node in the second kind, namely:
ATA＝V1-V2
wherein,as can be seen from the decomposition results, the intermediate term A is computed for securityTA, for V1Only need to enterLine privacy preserving sum computation for V2Only privacy protection for adjacent product sum calculations is required.
S34, the intermediate item ATB performing clustering decomposition
Since the intermediate term A is directly calculatedTB, acquiring the position information of all anchor nodes and the ranging information between the anchor nodes and the target node, wherein the position information and the ranging information are privacy information of the anchor nodes. Therefore, the intermediate items need to be decomposed by using the decomposition results of the matrix a and the matrix B, so that the decomposed results can be used for simply and safely calculating the private information. Specifically, according to the decomposition results of the matrixes A and B, the matrix A is subjected toTB, clustering decomposition is carried out, so that the decomposed vector product in the first class only contains the privacy information of a single anchor node, and the vector product in the second class only contains the privacy information of adjacent anchor nodes, namely:
ATB＝U1-U2
wherein,as can be seen from the decomposition results, the intermediate term A is computed for securityTB, for U1Only privacy protection summation calculation is needed for U2Only privacy protection for adjacent product sum calculations is required.
S4, carrying out privacy protection summation calculation and privacy protection adjacent product solving and calculation
S41, privacy protection summation calculation
According to the pair of the intermediate item ATA and ATB, two results can be found, a first type V1And U1Medium vector product computation containing information for a single anchor node, e.g.Andonly the information of the anchor node i is contained,andonly the information of anchor node i +1 is contained. V can thus be calculated using a privacy preserving summation method1And U1. Specifically, for the intermediate item ATA decomposition results of the first kindAndintermediate item ATB decomposition results first classAnda privacy preserving summation calculation is performed.
The privacy protection summation calculation needs to perform summation calculation aiming at the privacy information of m-1 anchor nodes, the privacy information of each anchor node is protected in the calculation process, and the summation result is only known by a target node. Specifically, assume target node 0, anchor node i, and anchor node privacy information Mi(i-1, …, m-1), privacy preserving computing is requiredThe privacy preserving sum calculation process is as follows: the anchor node i (i-1, …, m-1) generates (m-1) random matricesk＝1,…,m-1，Anchor node i reservationTransmitting the remaining matrices to corresponding (m-2) nodes; the anchor node i adds the received matrix sent by other nodes with the reserved matrix to construct a matrixWhere P isiIs a random matrix, andanchor node i send αi＝Mi+PiTo target node 0; based on the received information, target node 0 calculatesHere α is the result of the privacy preserving sum computation the flow chart of the privacy preserving sum computation is shown in fig. 2.
S42, carrying out adjacent product calculation and calculation under privacy protection
According to the pair of the intermediate item ATA and ATB, a second class V of two results can be found2And U2The vector products each contain information about two neighboring anchor nodes, e.g.Andboth contain information for anchor node i and anchor node i + 1. Therefore, V can be summed up by using the method of privacy protection2And U2And (6) performing calculation. Specifically, for the intermediate item ATA decomposition results in the second classAndand the intermediate item ATB decomposition results in the second classAndthe adjacent product sum calculation is performed with privacy protection.
The adjacent product and calculation for privacy protection needs to perform product calculation on the privacy information of two adjacent anchor nodes in the m anchor nodes, and then perform summation calculation. And the privacy information of each anchor node is protected in the calculation process, and the calculation result is only known by the target node. Specifically, assume target node 0, anchor node i, and anchor node privacy information Mi(i-1, …, m-1), privacy preserving computing is requiredThe calculation process of the adjacent product sum by privacy protection is as follows: anchor node i (i-1, …, m-1) generationWill be provided withIs reserved, willSending the random number to a node i +1, and receiving the random number sent by the anchor node i +1 by the anchor node iConstructing random numbersAnchor node i +1 generationWill be provided withIs reserved, willSending the random number to a node i, and receiving the random number sent by the anchor node i +1Constructing random numbersAnchor node i sendTo target node 0; anchor node i +1 transmissionTo target node 0, target node 0 calculates β based on the received informationi,i+1＝βiβi+1β obtained by calculationi,i+1(i-1, …, m-1), target node 0 calculationHere β is the result of the neighbor product sum calculation for privacy protection.a flow chart for neighbor product sum for privacy protection is shown in fig. 3.
S5, utilizing ATA and ATB, privacy protection calculation result and target node carry out position calculation
For position calculation, the intermediate term A needs to be acquiredTA and ATAnd B, calculating results. If the calculation is performed directly, it is necessary to know the location information and ranging information of all anchor nodes, which may result in privacy leakage. In order to solve the problem, a method of calculating the adjacent product sum by privacy protection summation and privacy protection is adopted to carry out the intermediate term ATA and ATAnd B, carrying out privacy protection calculation. Suppose for the intermediate term ATA and the intermediate term ATB is recorded as omega and psi, the position of the target node isSpecifically, for the intermediate item ATV of A decomposition result1The calculation results of the two items in the group for privacy protection summation are respectively recorded asFor the intermediate item ATU of B decomposition result1The calculation results of the two items in the group for privacy protection summation are respectively recorded asFor the intermediate item ATV of A decomposition result2The two calculation results of the adjacent product sum under privacy protection are respectively recorded asFor the intermediate item ATU of B decomposition result2The two calculation results of the adjacent product sum under privacy protection are respectively recorded asThen the target node 0 calculates Ω - Ω1+Ω2-Ω3-Ω4，ψ＝ψ1+ψ2-ψ3-ψ4，Here, theFor the position calculation result of the target node, Ω is the intermediate term ATThe calculation result of A, psi, is the intermediate term ATAnd B, calculating results. The following are simulation experiment results:
the simulation experiment parameters are configured as follows: assume that each transferred element is represented by 24 bits. KexX1,χ2,ε1,ε2Respectively representing the time for executing 24-bit multiplication operation, 2048-bit multiplication operation, 1024-bit exponential operation and 2048-bit exponential operation. In the numerical analysis herein, χ is assumed1＝1μs,χ2＝0.88ms,ε1＝81.08ms,ε2159.06 ms. Assume that the communication bandwidth is 2 Mbps. In the experiment, the calculation cost, the communication cost and the execution time of the efficient privacy protection method for the anchor node ranging and positioning are analyzed. The computation cost mainly measures the CPU time used for computing the vector product, and the communication cost mainly measures the number of bits transmitted by the positioning participants. The algorithm execution time is defined as: the time consumed by each step of the algorithm comprises calculation and communication cost, and the steps executed by a plurality of nodes in parallel are only calculated once. Here, only the results of two-dimensional localization were analyzed, and the results of three-dimensional localization were similar.
Fig. 4 shows the analysis results of the calculation cost of the whole privacy protection method, the calculation cost of a single anchor node, and the calculation cost of a target node. Firstly, the calculation cost of the whole method and the calculation cost of the target node are increased along with the increase of the number m of the anchor nodes, and the reason is that more anchor nodes participate in positioning along with the increase of the number of the anchor nodes, and the target node needs to perform more calculations, so the calculation cost of the whole method and the calculation cost of the target node are increased. Secondly, it can be found that the calculation cost of a single anchor node is kept unchanged along with the increase of the number of the anchor nodes, because the calculation cost of the anchor node is irrelevant to the number of the anchor nodes in the efficient privacy protection method for performing the anchor node ranging and positioning. Finally, it can be found that the computation cost of the whole method of the present invention is higher than that of the target node, because the computation cost of the whole method includes the computation costs of all anchor nodes and the computation cost of the target node. Fig. 5 shows the communication cost, the communication cost of a single anchor node and the communication cost analysis result of a target node in the whole method. Firstly, it can be seen that as the number of anchor nodes increases, the communication cost of the whole method, the communication cost of a single anchor node and the communication cost of a target node increase, because as the number of anchor nodes increases, more anchor nodes participate in positioning, and more communication bits are transmitted. Secondly, it can be seen that the communication cost of the whole method is greater than that of the target node and a single anchor node, because the communication cost of the whole method includes the communication costs of all the anchor nodes and the communication cost of the target node. Finally, it can be seen that the communication cost of the target node is higher than that of a single anchor node, because in the efficient privacy protection method for anchor node ranging and positioning of the present invention, the target node needs to communicate with all anchor nodes, and the single anchor node only needs to communicate with the target node and the adjacent anchor nodes.
FIG. 6 shows the results of the analysis of the overall method execution time, the execution time of a single anchor node, and the execution time of a target node. First, it can be seen that as the number of anchor nodes increases, the overall method execution time, the single anchor node execution time, and the target node execution time all increase, because as the number of anchor nodes increases, more anchor nodes participate in positioning and more computation and communication will be performed. Secondly, the target node execution time can be found to be consistent with the whole method execution time. Through analysis, the efficient privacy protection method for anchor node ranging and positioning disclosed by the invention is found that most of the calculation process and communication cost are located in the target node, and the anchor node only needs to perform a small part of calculation and communication, so that the completion of the execution of the target node means the completion of the execution of the whole method. Finally, it can be seen that the execution time of a single anchor node is smaller than the target node execution time, since the target node performs more computation and communication tasks.
In summary, the efficient privacy protection method for anchor node ranging and positioning of the present invention does not need to use a homomorphic encryption algorithm, can protect the privacy information of all users in the anchor point ranging and positioning process, and has relatively low computation cost and communication cost.
It should be noted that any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and that the scope of the preferred embodiments of the present invention includes alternative implementations in which functions may be executed out of order from that shown or discussed, including substantially the same way or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of patentable embodiments.
In the description herein, references to the terms "one embodiment," "some embodiments," "an example," "a specific example," or "some examples" or the like mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
Although embodiments of the present invention have been shown and described above, it should be understood that the above embodiments are exemplary and not to be construed as limiting the invention, and that those skilled in the art can make changes, modifications, substitutions and alterations to the above embodiments without departing from the spirit and scope of the invention.
Claims (3)
1. An efficient privacy protection method for anchor node ranging and positioning is characterized by comprising the following steps:
s1, an anchor node executes a ranging process from the anchor node to a target node to obtain a ranging information set D;
assuming that there are m anchor nodes in a region, for anchor node i ═ 1, …, m, di0Indicating ranging information from the anchor node i to the target node 0, ranging information di0Obtaining a ranging information set D ═ D after the ranging phase is finished for the privacy information of the anchor node ii0，i＝1，…，m}；
S2, constructing a coefficient matrix A and a ranging matrix B according to anchor node position information and the ranging information set D;
s21, constructing a coefficient matrix A, and assuming the position of an anchor node iWhere n represents the dimension of the space, the coefficient matrix a is defined as:
s22, constructing a ranging matrix B, wherein the ranging matrix B is defined as follows according to the ranging information set D and the position coordinate information:
s3, performing line-by-line decomposition on the coefficient matrix A and the ranging matrix B respectively, and performing line-by-line decomposition on the intermediate item ATA and the intermediate term ATB, performing clustering decomposition;
s31, decomposing each row of the coefficient matrix A, namely:
wherein A isi＝2[xi1-xi+11 … xin-xi+1n]＝2(xi-xi+1),i＝1,…,m-1；
S32, decomposing each row of the ranging matrix B, namely:
wherein,
s33, the intermediate item ATA clustering decomposition, according to the decomposition result of the coefficient matrix A, the intermediate item ATA, decomposing is carried out, so that the vector product in the first class of the decomposed result only contains the privacy information of a single anchor node, and the vector product in the second class only contains the privacy information of adjacent anchor nodes, namely:
ATA＝V1-V2
wherein,
s34, the intermediate item ATB clustering decomposition, based on the decomposition result of the coefficient matrix A and the ranging matrix B, the intermediate item ATB, decomposing is carried out, so that the decomposed vector product in the first class only contains the privacy information of a single anchor node, and the vector product in the second class only contains the privacy information of adjacent anchor nodes, namely:
ATB＝U1-U2
wherein,
s4, carrying out privacy protection summation calculation and privacy protection adjacent product summation calculation aiming at the intermediate item decomposition result;
the privacy preserving sum computation comprises: suppose MiIs the privacy information at the anchor node i, i is 1, …, m-1, then the privacy-preserving sum, i.e. privacy-preserving computationThe anchor node i generates m-1 random matrices Anchor node i reserved random matrixSending the rest random matrix to corresponding m-2 anchor nodes, adding the received random matrix sent by other anchor nodes and the reserved random matrix by the anchor node i to construct a matrixWhere P isiIs a random matrix, andanchor node i send αi＝Mi+PiTo the target node 0, the target node 0 calculates according to the received informationHere α is the result of the privacy preserving sum computation,
the privacy preserving neighbor product sum computation comprises: suppose MiThe privacy protection is the sum of adjacent products, namely privacy protection calculation, for the privacy information at the anchor node i, i is 1, …, m-1Anchor node i generationRandom number is addedReserving, random numberSending the random number to an anchor node i +1, and receiving the random number sent by the anchor node i +1 by the anchor node iConstructing random numbersAnchor node i +1 generationRandom number is addedReserving, random numberSending the random number to an anchor node i, and receiving the random number sent by the anchor node i by an anchor node i +1Constructing random numbersAnchor node i sendTo target node 0, anchor node i +1 sendsTo target node 0, based on the received information, target node 0 calculates βi,i+1＝βiβi+1β obtained by calculationi,i+1Target node 0 calculationHere β is the result of the neighboring product sum calculation for privacy protection;
s5, utilizing the intermediate item ATA and the intermediate term ATAnd B, performing privacy protection calculation, and performing position calculation on the target node.
2. The method for efficient privacy protection for anchor node ranging positioning as claimed in claim 1 wherein said S4 further comprises:
s41, the intermediate item ATV of A decomposition result1Performing privacy protection summation calculation on the intermediate item ATU of B decomposition result1Carrying out privacy protection summation calculation;
s42, the intermediate item ATV of A decomposition result2Performing privacy protection on the adjacent product sum calculation, and performing intermediate term ATU of B decomposition result2And carrying out privacy protection adjacent product summation calculation.
3. The method for efficient privacy protection for anchor node ranging positioning as claimed in claim 1 wherein said S5 comprises: intermediate item A using sum of privacy protection calculation and sum of adjacent products calculation of privacy protectionTA and the intermediate term ATB, carrying out privacy protection calculation, and assuming that calculation results are respectively omega and psi, the position of the target node is
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610304702.8A CN105828432B (en) | 2016-05-10 | 2016-05-10 | A kind of efficient method for secret protection of anchor node ranging localization |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610304702.8A CN105828432B (en) | 2016-05-10 | 2016-05-10 | A kind of efficient method for secret protection of anchor node ranging localization |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105828432A CN105828432A (en) | 2016-08-03 |
| CN105828432B true CN105828432B (en) | 2019-04-02 |
Family
ID=56528423
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610304702.8A Active CN105828432B (en) | 2016-05-10 | 2016-05-10 | A kind of efficient method for secret protection of anchor node ranging localization |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105828432B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110944285B (en) * | 2019-11-27 | 2021-06-01 | 燕山大学 | Underwater sensor positioning method with privacy protection function |
| CN112188394A (en) * | 2020-10-09 | 2021-01-05 | 华侨大学 | Communication adjustable point positioning protocol with anchor position privacy information protection capability |
| CN114302321B (en) * | 2021-12-07 | 2022-10-14 | 同济大学 | Privacy protection positioning method for hiding anchor node position information |
| WO2024000131A1 (en) * | 2022-06-27 | 2024-01-04 | 北京小米移动软件有限公司 | Ranging method and apparatus, communication device, and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103826237A (en) * | 2014-02-28 | 2014-05-28 | 西安电子科技大学 | Method for establishing location privacy protection model for continuous location based service |
| CN104394509A (en) * | 2014-11-21 | 2015-03-04 | 西安交通大学 | High-efficiency difference disturbance location privacy protection system and method |
| CN105491519A (en) * | 2015-11-24 | 2016-04-13 | 西安电子科技大学 | Privacy protection method based on continuous real time inquiry scene in position service |
-
2016
- 2016-05-10 CN CN201610304702.8A patent/CN105828432B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103826237A (en) * | 2014-02-28 | 2014-05-28 | 西安电子科技大学 | Method for establishing location privacy protection model for continuous location based service |
| CN104394509A (en) * | 2014-11-21 | 2015-03-04 | 西安交通大学 | High-efficiency difference disturbance location privacy protection system and method |
| CN105491519A (en) * | 2015-11-24 | 2016-04-13 | 西安电子科技大学 | Privacy protection method based on continuous real time inquiry scene in position service |
Non-Patent Citations (3)
| Title |
|---|
| "Multi-lateral Privacy-Preserving Localization in Pervasive Environments";Tao Shu等;《IEEE INFOCOM 2014 - IEEE Conference on Computer Communications》;20141231;第Ⅱ节A-B部分，第Ⅲ节B部分 |
| "Protecting Multi-Lateral Localization Privacy in Pervasive Environments";Tao Shu等;《IEEE/ACM TRANSACTIONS ON NETWORKING》;20151005;第23卷(第5期);第Ⅱ节A-B部分，第Ⅲ节B部分 |
| "基于SMC 协议的分布式聚类分析隐私保护的研究";杨林等;《计算机工程与设计》;20081130;第29卷(第21期);全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105828432A (en) | 2016-08-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Li et al. | Achieving privacy preservation in WiFi fingerprint-based localization | |
| Järvinen et al. | PILOT: Practical privacy-preserving indoor localization using outsourcing | |
| CN105828432B (en) | A kind of efficient method for secret protection of anchor node ranging localization | |
| Messous et al. | Online Sequential DV‐Hop Localization Algorithm for Wireless Sensor Networks | |
| Lee et al. | Multihop range-free localization with approximate shortest path in anisotropic wireless sensor networks | |
| Shi et al. | To hide private position information in localization using time difference of arrival | |
| Oliveira et al. | Error analysis of localization systems for sensor networks | |
| Shu et al. | Protecting multi-lateral localization privacy in pervasive environments | |
| Pandey et al. | Time synchronized node localization using optimal H-node allocation in a small world WSN | |
| Kumar et al. | Computational intelligence based algorithm for node localization in wireless sensor networks | |
| Ahmadi et al. | Range free localization in wireless sensor networks for homogeneous and non-homogeneous environment | |
| Kumar et al. | Game theory based hybrid localization technique for underwater wireless sensor networks | |
| Zhou et al. | DV-Hop localization algorithm based on bacterial foraging optimization for wireless multimedia sensor networks | |
| van der Beets et al. | FAPRIL: Towards faster privacy-preserving fingerprint-based localization | |
| Simic et al. | A distributed algorithm for localization in random wireless networks | |
| CN106060803B (en) | A kind of efficient method for secret protection of destination node ranging localization | |
| Sakib et al. | Privacy preserving proximity testing using elliptic curves | |
| Garcia-Alfaro et al. | Secure geolocalization of wireless sensor nodes in the presence of misbehaving anchor nodes | |
| Shen et al. | A RFID based localization algorithm applying trilateration for wireless sensor networks | |
| Stojkoska et al. | Cluster-based MDS algorithm for nodes localization in wireless sensor networks with irregular topologies | |
| Hu et al. | Protecting data source location privacy in wireless sensor networks against a global eavesdropper | |
| Liu et al. | Algebraic distributed source localisation algorithm using TDOA and AOA measurements | |
| Thimmaiah et al. | An adaptive localization error minimization approach for wireless sensor network | |
| Sahu et al. | Energy-efficient grid-based data dissemination in wireless sensor networks | |
| Youssef et al. | Self-localization techniques for wireless sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200720 Address after: Gulou District of Nanjing City, Jiangsu province 210003 new model road No. 66 South Post Networking Technology Park Building 8 Patentee after: NANJING RONGFEI TECHNOLOGY Co.,Ltd. Address before: 210003 Gulou District, Jiangsu, Nanjing new model road, No. 66 Patentee before: NANJING University OF POSTS AND TELECOMMUNICATIONS |