CN101246211B - Circulating trihedral combination measuring method of weight triangle selection method based on circle - Google Patents

Circulating trihedral combination measuring method of weight triangle selection method based on circle Download PDF

Info

Publication number
CN101246211B
CN101246211B CN2008100641113A CN200810064111A CN101246211B CN 101246211 B CN101246211 B CN 101246211B CN 2008100641113 A CN2008100641113 A CN 2008100641113A CN 200810064111 A CN200810064111 A CN 200810064111A CN 101246211 B CN101246211 B CN 101246211B
Authority
CN
China
Prior art keywords
weight
node
triangle
calculate
algorithm
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.)
Expired - Fee Related
Application number
CN2008100641113A
Other languages
Chinese (zh)
Other versions
CN101246211A (en
Inventor
蔡绍滨
李希
田鹰
高振国
姚念民
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Harbin Engineering University
Original Assignee
Harbin Engineering University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Harbin Engineering University filed Critical Harbin Engineering University
Priority to CN2008100641113A priority Critical patent/CN101246211B/en
Publication of CN101246211A publication Critical patent/CN101246211A/en
Application granted granted Critical
Publication of CN101246211B publication Critical patent/CN101246211B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Position Fixing By Use Of Radio Waves (AREA)

Abstract

The invention provides a circular three sides combined measure method which is based on weight triangle choice method. 1) randomly choosing two nodes A and B, calculating side a of segment AB, and calculating a<2>; 2) calculating x*AB; 3) repeating step 1 and step 2, calculating square of every side, and ever x*AB; 4) randomly choosing three nodes A, B and C, which are separately corresponding side a, b and c, wherein a is the shortest side; 5) if a<2>+c<2>-b<2>>0 and a<2>+b<2>-c<2>>0 and <=xa, then the triangle Delta ABC is a triangle with big weight; 6) calculating one vertex of weighing polygonal; 7) repeating the step 4,5 and 6, calculating vertexes of every weighing polygonal; 8) calculating weight centroid position of polygonal according to weight centroid method, estimated coordinate figure of unknown node: (IX,IY)=(Sigma <m>[k=1]IX[k]/l, Sigma <m>[k=1]IY[k]/l). Compared with IACT, the energy consumption of node is reduced further without reducing positioning precision.

Description

Circulation three limit combined joint position measurement methods based on the weight triangle selection method of circle
(1) technical field
What the present invention relates to is a kind of location measurement method.
(2) background technology
In the application of sensor network, to have only when node with by the position of the object of perception and can know, the information that node obtains is just meaningful.Therefore, node locating is one of gordian technique of sensor network.
Now existing many scholars both domestic and external have proposed a lot of location algorithms, but on overall, well both balances between bearing accuracy and the energy consumption cost, bearing accuracy is high, often is accompanied by algorithm high complexity and the high cost of communicating by letter.Sensor node often adopts and receives signal intensity (RSSI; Received Signal StrengthIndex) technology, time of arrival (toa) (TOA; Time Of Arrival) technology, signal arrival time difference (TDOA; Time Difference of Arrival) technology and signal arrival angle (AOA, Angle Of Arrival) technology is carried out internodal range finding.On the basis of finding range between above node; Sensor network can adopt APS, and AHLoS algorithm, trilateration, Lateration algorithm, circulation three limit multiple measurement methods (ACT) and improved circulation three limit multiple measurement method (IACT) scheduling algorithms carry out the location of unknown node.
Trilateration is the distance of the coordinate and unknown node to three beaconing nodes of known three beaconing nodes, asks the coordinate of unknown node.In order further to improve the bearing accuracy of trilateration, circulation three limit multiple measurement methods have been proposed in sensor network location algorithm and the correlation technique research (the PhD dissertation .2006 of University Of Chongqing).It obtains polygonal summit through the leg-of-mutton center of calculating any three beaconing nodes and forming, and utilizes centroid method location unknown node again.In order further to reduce the complexity and the communication cost of algorithm; Improved circulation three limit multiple measurement methods have been proposed again; It utilizes the tan value at leg-of-mutton angle to select weight triangle as weight, and only selects m the bigger triangle of weight to calculate and reduce computational costs and communication cost.But the computation complexity of IACT remains n 3, computational costs is still higher.Therefore, we need seek the lower location algorithm of a kind of expense, also will guarantee the bearing accuracy of algorithm simultaneously.
(3) summary of the invention
The object of the present invention is to provide a kind of expense lower, simultaneously can guarantee the circulation three limit multiple measurement methods based on the weight triangle selection method of circle of bearing accuracy.
The objective of the invention is to realize like this:
1. optional two node A and B ( Plant and select selection scheme), ask the length of side a of line segment AB, and calculate a 2
2. calculate xAB (x=cot α, α are the smallest angles of weight triangle, and α=arccot (1.5), x set according to bearing accuracy) before node lays;
3. repeated for 1 and 2 steps; Calculate all limits (
Figure GSB00000469951400022
bar limit) square and all xAB;
4. optional three node A, B and C ( plants selection scheme); Difference corresponding sides a; B and c, wherein a is minor face;
5. if a 2+ c 2-b 2>0 and a 2+ b 2-c 2>0 and b≤xa, then triangle Δ ABC is a triangle with big weight;
6. calculate the polygonal summit of weight;
7. repeating step 4,5 and 6, calculate the polygonal summit of all weights;
8. utilize the weight gravity model appoach to calculate the weight centre of gravity place of l limit shape (total is selected l high weight triangle that satisfies condition), i.e. the estimated coordinates value of unknown node:
Figure GSB00000469951400024
Advantage of the present invention is verified through following analysis:
1, the mathematical analysis of CBACT algorithm performance
Because the time complexity that plus-minus method calculates is far below multiplication and division computing and trigonometric function operation, so do not consider the plus-minus method complexity of calculation here.The computational costs of CBACT algorithm and Lateration algorithm is equal basically, well below ACT and IACT algorithm.Multiplication and division computing in the ACT algorithm is about 52 times, trigonometric function operation be 3
Figure GSB00000469951400025
inferior.The IACT algorithm is owing to having adopted different weight angle function, so the trigonometric function of having avoided carrying out a large amount of inverses and root computing calculates.The multiplication and division computing of IACT algorithm be 9
Figure GSB00000469951400026
+28m time, do not have trigonometric function operation.Based on circular weight triangle selection algorithm; 2
Figure GSB00000469951400027
+25l, there is not trigonometric function operation.Obviously, the computational complexity of this algorithm is far below the IACT algorithm.Fig. 1 has provided the comparison of several kinds of algorithm complexities in the time of m=20, α=35 °.The result who analyzes shows that the complicacy of ACT algorithm is the highest, and when having 12 beaconing nodes, the calculation times of ACT algorithm is near ten thousand times, and computational costs is very high.Compare with ACT, IACT has reduced computational costs to a great extent, but the computation complexity of IACT remains n 3, computational costs is still higher.It is n that computation complexity is reduced to 2Compare with IACT, greatly reduced computational costs.
2, the simulation analysis of CBACT algorithm performance
In order to estimate this algorithm, utilize the method for Digital Simulation that algorithm IACT algorithm is compared.The network model of simulation analysis is provided with as follows:
1) all sensor node and beaconing nodes all are randomly dispersed in the square area of 50m * 50m;
2) number N of beaconing nodes is no less than 5, and each beaconing nodes all contains ID number and the positional information of self, and all nodes all have computing power and range capability;
3) do not have barrier in the sensors field, all nodes that therefore are positioned within the communication radius scope all can be realized communication;
4) in the IACT algorithm, the trilateration number of combinations of choosing after the weighted value ordering is m=20;
5) in algorithm, each communication radius is chosen as
Figure GSB00000469951400031
6) the distance measuring noises standard deviation is set at 20% of range finding at random.
In emulation, that has studied unknown node on average can detect the influence of beaconing nodes number to the node locating error.In order to guarantee the reliability of simulation result, two emulation all move 1000 times, obtain the mean value of positioning error then.
In simulation study, utilize the evaluation criterion of EL, E as the positioning error size LBy computes:
E L = ( IX - X actual ) 2 + ( IY - Y actual ) 2
In the formula, (IX is IY) with (X Actual, Y Actual) be respectively the estimated position and the physical location of unknown node.For ease of comparing, all positioning errors are absolute error.
1) can detect the beaconing nodes number changes affect positioning
In first simulating scheme, this simulation analysis can detect the beaconing nodes number and change affect positioning.As shown in Figure 2, the CBACT algorithm does not receive to monitor the influence of beaconing nodes, this means that this algorithm can obviously reduce network to the beaconing nodes density requirements.The IACT algorithm increases along with detecting the node number, and positioning error reduces, and when arriving a certain value, positioning error tends towards stability.The critical transitions point of IACT algorithm is 7.When the irregular layout of beaconing nodes, emulation also can obtain similar conclusion.Compare the little and quite stable of CBACT Algorithm Error value with the IACT algorithm.Obviously, although select the method for weight node different,, selected enough weight triangles to carry out the location of nodes of locations equally.Therefore, has extraordinary bearing accuracy.
2) distance measuring noises changes affect positioning
Second simulating scheme studied distance measuring noises to affect positioning.At this moment on average can detect the beaconing nodes number and be made as 9.The bearing accuracy and the relation between the distance measuring noises of two kinds of algorithms are as shown in Figure 3, and the positioning error of Centroid algorithm and distance measuring noises significantly do not concern.CBACT algorithm, IACT algorithm and Lateration algorithm all are the increases along with distance measuring noises, and error is also increasing, but the positioning error of CBACT algorithm be significantly less than the back both.Be that the CBACT algorithm has better robustness.
3) comparison of CBACT algorithm and IACT Algorithm Error
When distance measuring noises is 20%, to the comparison (as shown in Figure 4) of the positioning error of CBACT algorithm and IACT algorithm.Compare with the IACT algorithm, it is little that the CBACT algorithm receives to monitor the influence of beaconing nodes number.
To the computational complexity problem that the IACT algorithm exists, the present invention proposes a kind of location algorithm of low computational complexity---based on the circulation three limit multiple measurement methods of circle.Through using more simple high weight triangle selection method, this algorithm has reduced the weight computing of the triangle in the IACT algorithm, under the prerequisite that does not influence bearing accuracy, with computation complexity by n 3Dropped to n 2Communication overhead when in addition, this algorithm is located is similar with the IACT algorithm.Therefore, compare with IACT, CBACT has further reduced the energy consumption of node under the prerequisite that does not reduce bearing accuracy.
(4) description of drawings
Fig. 1 is that algorithm complexity compares;
Fig. 2 can detect the beaconing nodes number positioning error is influenced;
Fig. 3 is that the distance measuring noises variation influences positioning error;
Fig. 4 is the comparison of CBACT algorithm and IACT Algorithm Error.
(5) embodiment
For example the present invention is done description in more detail below in conjunction with accompanying drawing:
A kind of circulation three limit multiple measurement methods of the weight triangle selection method based on circle, it comprises following concrete steps:
1. optional two node A and B ( Plant and select selection scheme), ask the length of side a of line segment AB, and calculate a 2
2. calculate xAB (x=cot α, α are the smallest angles of weight triangle, and α=arc cot (1.5), x set according to bearing accuracy) before node lays;
3. repeated for 1 and 2 steps; Calculate all limits (
Figure GSB00000469951400052
bar limit) square and all xAB;
4. optional three node A, B and C ( plants selection scheme); Difference corresponding sides a; B and c, wherein a is minor face;
5. if a 2+ c 2-b 2>0 and a 2+ b 2-c 2>0 and b≤xa, then triangle Δ ABC is a triangle with big weight;
6. calculate the polygonal summit of weight;
7. repeating step 4,5 and 6, calculate the polygonal summit of all weights;
8. utilize the weight gravity model appoach to calculate the weight centre of gravity place of l limit shape (total is selected l high weight triangle that satisfies condition), i.e. the estimated coordinates value of unknown node:
Figure GSB00000469951400054

Claims (1)

1. circulation three limit combined joint position measurement methods based on the weight triangle selection method of circle is characterized in that:
1) optional two node A and B ask the length of side a of line segment AB, and calculate a 2
2) calculate xAB, wherein x=cot α, α are that smallest angles, α=arccot (1.5), the x of weight triangle sets according to bearing accuracy before node lays;
3) repeat 1 and 2 and go on foot, calculate all limits square and all xAB;
4) optional three node A, B and C, the corresponding sides of node A are a, and the corresponding sides of Node B are b, and the corresponding sides of node C are c, and wherein a is minor face;
5) if a 2+ c 2-b 2>0 and a 2+ b 2-c 2>0 and b≤xa, then triangle Δ ABC is a triangle with big weight;
6) utilize the weight triangle that satisfies condition in the step 5) to calculate the polygonal summit of weight;
7) repeating step 4,5 and 6, calculate the polygonal summit of all weights;
8) utilize the weight gravity model appoach to calculate the weight centre of gravity place of l limit shape; Be the estimated coordinates value of unknown node:
Figure FSB00000426885500011
wherein l be the number of the high weight triangle that satisfies condition, m is the trilateration number of combinations of choosing after the weighted value ordering.
CN2008100641113A 2008-03-13 2008-03-13 Circulating trihedral combination measuring method of weight triangle selection method based on circle Expired - Fee Related CN101246211B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2008100641113A CN101246211B (en) 2008-03-13 2008-03-13 Circulating trihedral combination measuring method of weight triangle selection method based on circle

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2008100641113A CN101246211B (en) 2008-03-13 2008-03-13 Circulating trihedral combination measuring method of weight triangle selection method based on circle

Publications (2)

Publication Number Publication Date
CN101246211A CN101246211A (en) 2008-08-20
CN101246211B true CN101246211B (en) 2012-06-06

Family

ID=39946779

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2008100641113A Expired - Fee Related CN101246211B (en) 2008-03-13 2008-03-13 Circulating trihedral combination measuring method of weight triangle selection method based on circle

Country Status (1)

Country Link
CN (1) CN101246211B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108966120B (en) * 2018-06-09 2021-01-15 中国电子科技集团公司第五十四研究所 Combined trilateral positioning method and system for dynamic cluster network improvement

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101004448A (en) * 2007-01-18 2007-07-25 北京航空航天大学 Convex programming positioning method of triangle filtering of wireless sensor network

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101004448A (en) * 2007-01-18 2007-07-25 北京航空航天大学 Convex programming positioning method of triangle filtering of wireless sensor network

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
于宁 等.无线传感器网络定位算法研究.《传感技术学报》.2007,第20卷(第1期),187-192. *
余义斌 等.基于权重重心法的传感器网络节点定位.《计算机仿真》.2007,第24卷(第6期),296-300. *
余义斌.传感器网络定位算法及相关技术研究.《中国优秀博硕士学位论文全文数据库(博士)信息科技辑》.2007,I140-15. *

Also Published As

Publication number Publication date
CN101246211A (en) 2008-08-20

Similar Documents

Publication Publication Date Title
CN101965052B (en) Wireless sensing network node positioning method based on optimal beacon set
CN102123495A (en) Centroid location algorithm based on RSSI (Received Signal Strength Indication) correction for wireless sensor network
CN103249144B (en) A kind of wireless sensor network node locating method based on C type
CN103415072B (en) Based on the localization method estimating distance in a kind of radio sensing network
Yingxi et al. WSN node localization algorithm design based on RSSI technology
CN106353726A (en) Twice-weighted mass center determining method and system for indoor positioning
CN106767821A (en) A kind of map match localization method and system based on particle filter
CN107708202A (en) A kind of wireless sensor network node locating method based on DV Hop
CN104820204A (en) Weighted least square positioning method with reduced deviation
CN102264127B (en) Three-dimensional positioning method of Wireless Sensor Network based on degree of coplanarity
Liu et al. Trilateration positioning optimization algorithm based on minimum generalization error
JP7150229B1 (en) Target positioning method for wireless sensor networks based on RSS-AoA measurements
CN101246211B (en) Circulating trihedral combination measuring method of weight triangle selection method based on circle
He et al. A LSSVR three-dimensional WSN nodes location algorithm based on RSSI
CN102752850A (en) Range-free based device and method for screening network anchor nodes
Gansemer et al. 3D WLAN indoor positioning in multi-storey buildings
CN106772332B (en) A kind of rotary range measurement verification method
Matharu et al. An efficient approach for localization using trilateration algorithm based on received signal strength in wireless sensor network
Xie et al. An improved E-Min-Max localization algorithm in wireless sensor networks
Artemenko et al. A refinement scheme for location estimation process in indoor wireless sensor networks
Lu et al. A new kind of NDV-hop algorithm in wireless sensor network
CN103945528A (en) Single target locating method in wireless sensor network
Varga Localization techniques in wireless sensor networks
Xiao et al. A novel localization algorithm based on received signal strength for mobile wireless sensor networks
CN102209387B (en) Three-dimensional fast positioning method based on wireless sensor network (WSN) technology

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20120606

Termination date: 20180313