CN108882198B - Mean value positioning method for unknown sensor nodes of wireless sensor network - Google Patents
Mean value positioning method for unknown sensor nodes of wireless sensor network Download PDFInfo
- Publication number
- CN108882198B CN108882198B CN201810884680.6A CN201810884680A CN108882198B CN 108882198 B CN108882198 B CN 108882198B CN 201810884680 A CN201810884680 A CN 201810884680A CN 108882198 B CN108882198 B CN 108882198B
- Authority
- CN
- China
- Prior art keywords
- line
- unknown node
- node
- straight line
- unknown
- 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
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/38—Services specially adapted for particular environments, situations or purposes for collecting sensor information
-
- 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
- G01S5/0278—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 involving statistical or probabilistic considerations
-
- 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
- G01S5/06—Position of source determined by co-ordinating a plurality of position lines defined by path-difference measurements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/80—Services using short range communication, e.g. near-field communication [NFC], radio-frequency identification [RFID] or low energy communication
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- General Physics & Mathematics (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Probability & Statistics with Applications (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a wireless sensor network positioning technology, in particular to a mean value positioning method for unknown sensor nodes of a wireless sensor network. The problems of low positioning accuracy and complex algorithm of the conventional positioning algorithm based on distance measurement are solved. The method of the invention firstly uses the signal intensity value received between the nodes to be converted into the distance value between the nodes, uses any 3 beacon nodes A, B, C around the unknown node to calculate the three possible coordinates of the unknown node through the common edge proportion theorem, and calculates the mean value as the coordinate of the unknown node to complete the coordinate positioning of the unknown node. The method improves the precision of the algorithm, reduces the complexity of the algorithm, reduces the energy consumption of the node, and prolongs the life cycle of the node.
Description
Technical Field
The invention relates to a wireless sensor network positioning technology, in particular to a mean value positioning method of unknown sensor nodes of a wireless sensor network, which is mainly used for acquiring accurate position information of the unknown sensor nodes of the wireless sensor network.
Background
In recent years, the technology of the internet of things continuously obtains new achievements, and the wireless sensor network serving as one of the bottom important technologies of the internet of things has become a research hotspot when being applied to the fields of national defense and military, environmental monitoring, traffic management, medical treatment and health, manufacturing industry, disaster resistance and emergency rescue and the like. The accurate position information obtained through the positioning algorithm is an important content of the wireless sensor network.
The positioning algorithm is classified into a non-ranging-based positioning algorithm (e.g., DV-HOP algorithm) and a ranging-based positioning algorithm. The positioning accuracy of the ranging-based positioning algorithm is higher than that of the non-ranging-based positioning algorithm. Some algorithms related to the positioning algorithm based on the distance measurement include a trilateral positioning algorithm, a trilateral centroid positioning algorithm, a particle swarm positioning algorithm and the like. These existing algorithms either have low positioning accuracy (e.g., centroid location algorithms) or are too complex (e.g., particle swarm location algorithms) because they require a large number of iterative operations.
Disclosure of Invention
The invention solves the problems of low positioning accuracy and complex algorithm of the existing positioning algorithm based on distance measurement, and provides a mean positioning method for unknown sensor nodes of a wireless sensor network.
The invention is realized by adopting the following technical scheme: the mean value positioning method of the unknown sensor nodes of the wireless sensor network is realized by the following steps:
z1: the unknown node P receives signals of surrounding beacon nodes and converts the received signal strength value into a distance value between the unknown node and the beacon nodes; the conversion here uses the well-known log-constant wireless signal propagation model.
Z2: setting the number of beacon nodes of the unknown node P for receiving signals as m, wherein m is more than or equal to 3, and taking any 3 beacon nodes with non-collinear positions as a group, wherein k groups are shared;
z3: sequentially calculating the coordinates of the unknown node P from the first group of beacons to the kth group of beacons to obtain k coordinates which are respectively expressed as (x)P1,yP1),……(xPk,yPk) (ii) a Selecting the u-th group of beacon nodes, setting the value of u to be 1 to k, setting the group of beacon nodes to be A, B, C, and calculating the u-th coordinate (x) of the unknown node PPu,yPu) Is one of the k coordinates; the 3 beacons A, B, C divide the entire plane into four regions:
region 1: a delta ABC region;
region 2: removing the residual area of the delta ABC area and the opposite angle area of the delta ABC area in the area of the angle BAC;
region 3: removing the residual area of the delta ABC area and the opposite angle area of the delta ABC area from the area of the angle ACB;
region 4: removing the residual area of the delta ABC area and the opposite angle area of the delta ABC area in the region of the angle ABC;
z4: coordinates A (x) of the u-th group of three beacons A, B, C are collectedA,yA),B(xB,yB),C(xC,yC) (ii) a MeterCalculating distance L between beacon node A and beacon node BAB(ii) a Calculating the distance L between the beacon node B and the beacon node CBC(ii) a Calculating the distance L between the beacon node A and the beacon node CAC(ii) a The distance between the unknown node P and the beacon node a obtained according to the step Z1 is denoted as LPAAnd the distance between the unknown node P and the beacon node B is recorded as LPB(ii) a Distance L between unknown node P and beacon node CPC;
Z5: judging the relative positions of the unknown node P, the beacon node A, the beacon node B and the beacon node C:
a) judging whether the unknown node P is on the straight line AB, the straight line BC and the straight line AC:
when L isAB=LPA+LPBOr LAB=|LPA-LPBI, the unknown node P is located on the straight line AB,
when L isAB=LPA+LPBWhen the unknown node P is located between the line segments AB
LAB=LPA-LPBWhen the unknown node P is positioned on the extension line of the line segment AB
LAB=LPB-LPAWhen the unknown node P is located on the extension line of the line BA
When L isAC=LPC+LPAOr LAC=|LPC-LPAI, the unknown node P is located on the straight line AC,
when L isAC=LPC+LPAWhen the unknown node P is located on the line segment AC
When L isAC=LPC-LPAWhen the unknown node P is positioned on the extension line of the line segment CA
When L isAC=LPA-LPCWhen the unknown node P is positioned on the line segment AC extension line
When L isBC=LPC+LPBOr LBC=|LPC-LPBI, the unknown node P is located on the straight line BC,
when L isBC=LPC+LPBWhile the unknown node P is located on the segment BC
When L isBC=LPC-LPBWhen the unknown node P is positioned on the extension line of the segment CB
When L isBC=LPB-LPCWhen the unknown node P is located on the extension line of the segment BC
b) When the point P is not on the straight line AB, the straight line BC, or the straight line AC,
satisfies the formula SΔABC=SΔPAB+SΔPAC+SΔPBCThe unknown node P is located in the delta ABC area, and the unknown node P is located in the area 1;
satisfies the formula SΔPAB+SΔPAC=SΔABC+SΔPBCOr satisfies the formula SΔPBC=SΔPAB+SΔABC+SΔPACThe unknown node P is positioned in a region except a delta ABC region in the < BAC region and a diagonal region thereof, and the unknown node P is positioned in a region 2;
satisfies the formula SΔPAC+SΔPBC=SΔABC+SΔPABOr satisfies the formula SΔPAB=SΔPAC+SΔABC+SΔPBCThe unknown node P is positioned in a region except a delta ABC region in a < ACB region and a diagonal region thereof, and the unknown node P is positioned in a region 3;
satisfies the formula SΔPBC+SΔPAB=SΔABC+SΔPACOr satisfies the formula SΔPAC=SΔPBC+SΔABC+SΔPABThe unknown node P is positioned in a region of the & lt ABC region except the residual region of the delta ABC region and the opposite vertex region, and the unknown node P is positioned in a region 4;
wherein S is the area of the corresponding triangle calculated by adopting a Helen formula, and three letters in the subscript of S are three vertexes of the triangle;
z6: u-th coordinate (x) of unknown node PPu,yPu) The calculation formula of (a) is as follows:
a) when point P is on line AB, line BC, line AC,
when L isAB=LPA+LPBOr LAB=|LPA-LPBWhen, the unknown node is P bitOn the straight line AB, the line a,
when L isAB=LPA+LPBWhen the unknown node P is located between the line segments AB, the u-th coordinate (x) of the unknown node PPu,yPu)
When L isAB=LPA-LPBWhen the unknown node P is located on the extension line of the line segment AB, the u-th coordinate (x) of the unknown node PPu,yPu)
When L isAB=LPB-LPAWhen the unknown node P is located on the extension line of the line BA, the u-th coordinate (x) of the unknown node PPu,yPu)
When L isAC=LPC+LPAOr LAC=|LPC-LPAI, the unknown node P is located on the straight line AC,
when L isAC=LPC+LPAWhen the unknown node P is located on the line segment AC, the u-th coordinate (x) of the unknown node PPu,yPu)
When L isAC=LPC-LPAWhen the unknown node P is positioned on the extension line of the line segment CA, the u-th coordinate (x) of the unknown node PPu,yPu)
When L isAC=LPA-LPCWhen the unknown node P is positioned on the extension line of the line segment AC, the u-th coordinate (x) of the unknown node PPu,yPu)
When L isBC=LPC+LPBOr LBC=|LPC-LPBI, the unknown node P is located on the straight line BC,
when L isBC=LPC+LPBThen, the unknown node P is located on the segment BC, and the u-th coordinate (x) of the unknown node PPu,yPu)
When L isBC=LPC-LPBWhen the unknown node P is positioned on the extension line of the segment CB, the u-th coordinate (x) of the unknown node PPu,yPu)
When L isBC=LPB-LPCWhen the unknown node P is located on the extension line of the segment BC, the u-th coordinate (x) of the unknown node PPu,yPu)
b) When the point P is not on the straight line AB, the straight line BC, or the straight line AC,
let A ' be the intersection point of the straight line PA and the straight line BC, B ' be the intersection point of the straight line BP and the straight line AC, and C ' be the intersection point of the straight line PC and the straight line AB;
kBCa sign representing the slope of the straight line BC, wherein k is set when the slope of the straight line BC is equal to or greater than 0BCIf the slope of the straight line BC is less than 0, k is 1BC=-1;kABA sign representing the slope of the straight line AB, and k is set when the slope of the straight line AB is 0 or moreABIf the slope of the straight line AB is less than 0, k is 1AB=-1;kACThe sign of the slope of the line AC ifGreater than or equal to 0, then kACIf the slope of the straight line AC is less than 0, k is 1AC=-1。
1) When the unknown node P is located in the region 1, it is available by the princess proportion theorem (at least in the publication with the title "three-line coordinates and triangle feature points", published by the harabine university of industry press, the author wuyuchen, and the publication date 2015, 04 months) in detail):
a' is crossed by a straight line PA and a straight line BC, and the following components are provided:
the coordinates of point a' are expressed as:
line PB intersects line AC at B' with:
the coordinates of point B' are expressed as:
line PC intersects line AB at C', with:
the coordinates of point C' are expressed as:
2) when the unknown node P is located in the area 2, the following can be obtained by using the common edge proportion theorem:
line PA intersects line BC at A' with:
the coordinates of point a' are expressed as:
line PB intersects line AC at B' with:
the coordinates of point B' are expressed as:
line PC intersects line AB at C', with:
the coordinates of point C' are expressed as:
3) when the unknown node P is located in the area 3, the following can be obtained by using the common edge proportion theorem:
line PA intersects line BC at A' with:
the coordinates of point a' are expressed as:
line PB intersects line AC at B' with:
the coordinates of point B' are expressed as:
line PC intersects line AB at C', with:
the coordinates of point C' are expressed as:
4) when the unknown node P is located in the area 4, the following can be obtained by using the common edge proportion theorem:
line PA intersects line BC at A' with:
the coordinates of point a' are expressed as:
line PB intersects line AC at B' with:
the coordinates of point B' are expressed as:
line PC intersects line AB with C', having:
the coordinates of point C' are expressed as:
let the intersection point of the straight line AA 'and the straight line BB' be (x)Pu1,yPu1) The intersection of line AA 'and line CC' is (x)Pu2,yPu2) The intersection of the straight line BB 'and the straight line CC' is (x)Pu3,yPu3);
U-th coordinate (x) of unknown node PPu,yPu):
Z7 coordinate value optimization
K coordinates (x) of unknown node P are obtainedP1,yP1),……(xPk,yPk) The abscissa average value and the ordinate average value of (a) are used as coordinates of the optimized unknown node P.
The method of the invention firstly uses the signal intensity value received between the nodes to be converted into the distance value between the nodes, uses any 3 beacon nodes A, B, C around the unknown node to calculate the three possible coordinates of the unknown node through the common edge proportion theorem, and calculates the mean value as the coordinate of the unknown node to complete the coordinate positioning of the unknown node. The method improves the precision of the algorithm, reduces the complexity of the algorithm, reduces the energy consumption of the node, and prolongs the life cycle of the node.
Drawings
FIG. 1 is a schematic diagram of the method of the present invention.
Detailed Description
The mean value positioning method of the unknown sensor nodes of the wireless sensor network is realized by the following steps:
z1: the unknown node P receives signals of surrounding beacon nodes and converts the received signal strength value into a distance value between the unknown node and the beacon nodes; the conversion here uses the well-known log-constant wireless signal propagation model.
Z2: setting the number of beacon nodes of the unknown node P for receiving signals as m, wherein m is more than or equal to 3, and taking any 3 beacon nodes with non-collinear positions as a group, wherein k groups are shared;
z3: sequentially calculating the coordinates of the unknown node P from the first group of beacons to the kth group of beacons to obtain k coordinates which are respectively expressed as (x)P1,yP1),……(xPk,yPk) (ii) a Selecting the u-th group of beacon nodes, setting the value of u to be 1 to k, setting the group of beacon nodes to be A, B, C, and calculating the u-th coordinate (x) of the unknown node PPu,yPu) Is one of the k coordinates; the 3 beacons A, B, C divide the entire plane into four regions:
region 1: a delta ABC region;
region 2: removing the residual area of the delta ABC area and the opposite angle area of the delta ABC area in the area of the angle BAC;
region 3: removing the residual area of the delta ABC area and the opposite angle area of the delta ABC area from the area of the angle ACB;
region 4: removing the residual area of the delta ABC area and the opposite angle area of the delta ABC area in the region of the angle ABC;
z4: coordinates A (x) of the u-th group of three beacons A, B, C are collectedA,yA),B(xB,yB),C(xC,yC) (ii) a Calculating the distance L between the beacon node A and the beacon node BAB(ii) a Calculating the distance L between the beacon node B and the beacon node CBC(ii) a Calculating the distance L between the beacon node A and the beacon node CAC(ii) a The unknown node P-to-node information obtained according to the step Z1The distance between the marking points A is marked as LPAAnd the distance between the unknown node P and the beacon node B is recorded as LPB(ii) a Distance L between unknown node P and beacon node CPC;
Z5: judging the relative positions of the unknown node P, the beacon node A, the beacon node B and the beacon node C:
a) judging whether the unknown node P is on the straight line AB, the straight line BC and the straight line AC:
when L isAB=LPA+LPBOr LAB=|LPA-LPBI, the unknown node P is located on the straight line AB,
when L isAB=LPA+LPBWhen the unknown node P is located between the line segments AB
LAB=LPA-LPBWhen the unknown node P is positioned on the extension line of the line segment AB
LAB=LPB-LPAWhen the unknown node P is located on the extension line of the line BA
When L isAC=LPC+LPAOr LAC=|LPC-LPAI, the unknown node P is located on the straight line AC,
when L isAC=LPC+LPAWhen the unknown node P is located on the line segment AC
When L isAC=LPC-LPAWhen the unknown node P is positioned on the extension line of the line segment CA
When L isAC=LPA-LPCWhen the unknown node P is positioned on the line segment AC extension line
When L isBC=LPC+LPBOr LBC=|LPC-LPBI, the unknown node P is located on the straight line BC,
when L isBC=LPC+LPBWhile the unknown node P is located on the segment BC
When L isBC=LPC-LPBWhen the unknown node P is positioned on the extension line of the segment CB
When L isBC=LPB-LPCWhen the unknown node P is located on the line segmentOn BC extension line
b) When the point P is not on the straight line AB, the straight line BC, or the straight line AC,
satisfies the formula SΔABC=SΔPAB+SΔPAC+SΔPBCThe unknown node P is located in the delta ABC area, and the unknown node P is located in the area 1;
satisfies the formula SΔPAB+SΔPAC=SΔABC+SΔPBCOr satisfies the formula SΔPBC=SΔPAB+SΔABC+SΔPACThe unknown node P is positioned in a region except a delta ABC region in the < BAC region and a diagonal region thereof, and the unknown node P is positioned in a region 2;
satisfies the formula SΔPAC+SΔPBC=SΔABC+SΔPABOr satisfies the formula SΔPAB=SΔPAC+SΔABC+SΔPBCThe unknown node P is positioned in a region except a delta ABC region in a < ACB region and a diagonal region thereof, and the unknown node P is positioned in a region 3;
satisfies the formula SΔPBC+SΔPAB=SΔABC+SΔPACOr satisfies the formula SΔPAC=SΔPBC+SΔABC+SΔPABThe unknown node P is positioned in a region of the & lt ABC region except the residual region of the delta ABC region and the opposite vertex region, and the unknown node P is positioned in a region 4;
wherein S is the area of the corresponding triangle calculated by adopting a Helen formula, and three letters in the subscript of S are three vertexes of the triangle;
z6: u-th coordinate (x) of unknown node PPu,yPu) The calculation formula of (a) is as follows:
a) when point P is on line AB, line BC, line AC,
when L isAB=LPA+LPBOr LAB=|LPA-LPBI, the unknown node P is located on the straight line AB,
when L isAB=LPA+LPBWhen the unknown node P is located between the line segments AB, the u-th coordinate (x) of the unknown node PPu,yPu)
When L isAB=LPA-LPBWhen the unknown node P is located on the extension line of the line segment AB, the u-th coordinate (x) of the unknown node PPu,yPu)
When L isAB=LPB-LPAWhen the unknown node P is located on the extension line of the line BA, the u-th coordinate (x) of the unknown node PPu,yPu)
When L isAC=LPC+LPAOr LAC=|LPC-LPAI, the unknown node P is located on the straight line AC,
when L isAC=LPC+LPAWhen the unknown node P is located on the line segment AC, the u-th coordinate (x) of the unknown node PPu,yPu)
When L isAC=LPC-LPAWhen the unknown node P is positioned on the extension line of the line segment CA, the u-th coordinate (x) of the unknown node PPu,yPu)
When L isAC=LPA-LPCWhen the unknown node P is positioned on the extension line of the line segment AC, the u-th coordinate (x) of the unknown node PPu,yPu)
When L isBC=LPC+LPBOr LBC=|LPC-LPBI, the unknown node P is located on the straight line BC,
when L isBC=LPC+LPBThen, the unknown node P is located on the segment BC, and the u-th coordinate (x) of the unknown node PPu,yPu)
When L isBC=LPC-LPBWhen the unknown node P is positioned on the extension line of the segment CB, the u-th coordinate (x) of the unknown node PPu,yPu)
When L isBC=LPB-LPCWhen the unknown node P is located on the extension line of the segment BC, the u-th coordinate (x) of the unknown node PPu,yPu)
b) When the point P is not on the straight line AB, the straight line BC, or the straight line AC,
let A ' be the intersection point of the straight line PA and the straight line BC, B ' be the intersection point of the straight line BP and the straight line AC, and C ' be the intersection point of the straight line PC and the straight line AB;
kBCa sign representing the slope of the straight line BC, wherein k is set when the slope of the straight line BC is equal to or greater than 0BCIf the slope of the straight line BC is less than 0, k is 1BC=-1;kABA sign representing the slope of the straight line AB, and k is set when the slope of the straight line AB is 0 or moreABIf the slope of the straight line AB is less than 0, k is 1AB=-1;kACA sign representing the slope of the straight line AC, wherein k is set when the slope of the straight line AC is equal to or greater than 0ACIf the slope of the straight line AC is less than 0, k is 1AC=-1。
1) When the unknown node P is located in the region 1, it is available by the princess proportion theorem (at least in the publication with the title "three-line coordinates and triangle feature points", published by the harabine university of industry press, the author wuyuchen, and the publication date 2015, 04 months) in detail):
a' is crossed by a straight line PA and a straight line BC, and the following components are provided:
the coordinates of point a' are expressed as:
line PB intersects line AC at B' with:
the coordinates of point B' are expressed as:
line PC intersects line AB at C', with:
the coordinates of point C' are expressed as:
2) when the unknown node P is located in the area 2, the following can be obtained by using the common edge proportion theorem: line PA intersects line BC at A' with:
the coordinates of point a' are expressed as:
line PB intersects line AC at B' with:
the coordinates of point B' are expressed as:
line PC intersects line AB at C', with:
the coordinates of point C' are expressed as:
3) when the unknown node P is located in the area 3, the following can be obtained by using the common edge proportion theorem:
line PA intersects line BC at A' with:
the coordinates of point a' are expressed as:
line PB intersects line AC at B' with:
the coordinates of point B' are expressed as:
line PC intersects line AB at C', with:
the coordinates of point C' are expressed as:
4) when the unknown node P is located in the area 4, the following can be obtained by using the common edge proportion theorem:
line PA intersects line BC at A' with:
the coordinates of point a' are expressed as:
line PB intersects line AC at B' with:
the coordinates of point B' are expressed as:
line PC intersects line AB with C', having:
the coordinates of point C' are expressed as:
let the intersection point of the straight line AA 'and the straight line BB' be (x)Pu1,yPu1) The intersection of line AA 'and line CC' is (x)Pu2,yPu2) The intersection of the straight line BB 'and the straight line CC' is (x)Pu3,yPu3);
U-th coordinate (x) of unknown node PPu,yPu):
Z7 coordinate value optimization
K coordinates (x) of unknown node P are obtainedP1,yP1),……(xPk,yPk) The abscissa average value and the ordinate average value of (a) are used as coordinates of the optimized unknown node P.
Claims (1)
1. A mean value positioning method for unknown sensor nodes of a wireless sensor network is characterized by comprising the following steps:
z1: the unknown node P receives signals of surrounding beacon nodes and converts the received signal strength value into a distance value between the unknown node and the beacon nodes; the conversion here uses the well-known log-constant wireless signal propagation model;
z2: setting the number of beacon nodes of the unknown node P for receiving signals as m, wherein m is more than or equal to 3, and taking any 3 beacon nodes with non-collinear positions as a group, wherein k groups are shared;
z3: sequentially calculating the coordinates of the unknown node P from the first group of beacon nodes to the kth group of beacon nodes to obtain k coordinates in total, and respectively representing the k coordinatesIs (x)P1,yP1),……(xPk,yPk) (ii) a Selecting the u-th group of beacon nodes, setting the value of u to be 1 to k, setting the group of beacon nodes to be A, B, C, and calculating the u-th coordinate (x) of the unknown node PPu,yPu) Is one of the k coordinates; the 3 beacons A, B, C divide the entire plane into four regions:
region 1: a delta ABC region;
region 2: removing the residual area of the delta ABC area and the opposite angle area of the delta ABC area in the area of the angle BAC;
region 3: removing the residual area of the delta ABC area and the opposite angle area of the delta ABC area in the region of the angle ABC;
region 4: removing the residual area of the delta ABC area and the opposite angle area of the delta ABC area from the area of the angle ACB;
z4: coordinates A (x) of the u-th group of three beacons A, B, C are collectedA,yA),B(xB,yB),C(xC,yC) (ii) a Calculating the distance L between the beacon node A and the beacon node BAB(ii) a Calculating the distance L between the beacon node B and the beacon node CBC(ii) a Calculating the distance L between the beacon node A and the beacon node CAC(ii) a The distance between the unknown node P and the beacon node a obtained according to the step Z1 is denoted as LPAAnd the distance between the unknown node P and the beacon node B is recorded as LPB(ii) a Distance L between unknown node P and beacon node CPC;
Z5: judging the relative positions of the unknown node P, the beacon node A, the beacon node B and the beacon node C:
a) judging whether the unknown node P is on the straight line AB, the straight line BC and the straight line AC:
when L isAB=LPA+LPBOr LAB=|LPA-LPBI, the unknown node P is located on the straight line AB,
when L isAB=LPA+LPBWhen the unknown node P is located between the line segments AB
LAB=LPA-LPBWhen the unknown node P is positioned on the extension line of the line segment AB
LAB=LPB-LPAWhen the unknown node P is located on the extension line of the line BA
When L isAC=LPC+LPAOr LAC=|LPC-LPAI, the unknown node P is located on the straight line AC,
when L isAC=LPC+LPAWhen the unknown node P is located on the line segment CA
When L isAC=LPC-LPAWhen the unknown node P is positioned on the extension line of the line segment CA
When L isAC=LPA-LPCWhen the unknown node P is positioned on the line segment AC extension line
When L isBC=LPC+LPBOr LBC=|LPC-LPBI, the unknown node P is located on the straight line BC,
when L isBC=LPC+LPBWhen the unknown node P is located on the line segment CB
When L isBC=LPC-LPBWhen the unknown node P is positioned on the extension line of the segment CB
When L isBC=LPB-LPCWhen the unknown node P is located on the extension line of the segment BC
b) When the point P is not on the straight line AB, the straight line BC, or the straight line AC,
satisfies the formula SΔABC=SΔPAB+SΔPAC+SΔPBCThe unknown node P is located in the delta ABC area, and the unknown node P is located in the area 1;
satisfies the formula SΔPAB+SΔPAC=SΔABC+SΔPBCOr satisfies the formula SΔPBC=SΔPAB+SΔABC+SΔPACThe unknown node P is positioned in a region except a delta ABC region in the < BAC region and a diagonal region thereof, and the unknown node P is positioned in a region 2;
satisfies the formula SΔPBC+SΔPAB=SΔABC+SΔPACOr satisfies the formula SΔPAC=SΔPBC+SΔABC+SΔPABThe unknown node P is positioned in the region of < ABC except the residual region of delta ABC and the opposite angle region thereofIn the area, the unknown node P is in the area 3;
satisfies the formula SΔPAC+SΔPBC=SΔABC+SΔPABOr satisfies the formula SΔPAB=SΔPAC+SΔABC+SΔPBCThe unknown node P is positioned in a region of the < ACB region except the delta ABC region and the opposite vertex region thereof, and the unknown node P is positioned in a region 4;
wherein S is the area of the corresponding triangle calculated by adopting a Helen formula, and three letters in the subscript of S are three vertexes of the triangle;
z6: u-th coordinate (x) of unknown node PPu,yPu) The calculation formula of (a) is as follows:
a) when point P is on line AB, line BC, line AC,
when L isAB=LPA+LPBOr LAB=|LPA-LPBI, the unknown node P is located on the straight line AB,
when L isAB=LPA+LPBWhen the unknown node P is located between the line segments AB, the u-th coordinate (x) of the unknown node PPu,yPu)
When L isAB=LPA-LPBWhen the unknown node P is located on the extension line of the line segment AB, the u-th coordinate (x) of the unknown node PPu,yPu)
When L isAB=LPB-LPAWhen the unknown node P is located on the extension line of the line BA, the u-th coordinate (x) of the unknown node PPu,yPu)
When L isAC=LPC+LPAOr LAC=|LPC-LPAI, the unknown node P is located on the straight line AC,
when L isAC=LPC+LPAThen, the unknown node P is located on the line segment CA, and the u-th coordinate (x) of the unknown node PPu,yPu)
When L isAC=LPC-LPAWhen the unknown node P is positioned on the extension line of the line segment CA, the u-th coordinate (x) of the unknown node PPu,yPu)
When L isAC=LPA-LPCWhen the unknown node P is positioned on the extension line of the line segment AC, the u-th coordinate (x) of the unknown node PPu,yPu)
When L isBC=LPC+LPBOr LBC=|LPC-LPBI, the unknown node P is located on the straight line BC,
when L isBC=LPC+LPBWhen the unknown node P is located on the line segment CB, the u-th coordinate (x) of the unknown node P isPu,yPu)
When L isBC=LPC-LPBWhen the unknown node P is positioned on the extension line of the segment CB, the u-th coordinate (x) of the unknown node PPu,yPu)
When L isBC=LPB-LPCWhen the unknown node P is located on the line segment BCOn the long line, the u-th coordinate (x) of the unknown node PPu,yPu)
b) When the point P is not on the straight line AB, the straight line BC, or the straight line AC,
let A ' be the intersection point of the straight line PA and the straight line BC, B ' be the intersection point of the straight line AC and the straight line BP, and C ' be the intersection point of the straight line AB and the straight line PC;
kBCa sign representing the slope of the straight line BC, wherein k is set when the slope of the straight line BC is equal to or greater than 0BCIf the slope of the straight line BC is less than 0, k is 1BC=-1;kABA sign representing the slope of the straight line AB, and k is set when the slope of the straight line AB is 0 or moreABIf the slope of the straight line AB is less than 0, k is 1AB=-1;kCAA sign representing the slope of the straight line CA, wherein k is the same as or greater than 0CAIf the slope of the straight line CA is less than 0, k is 1CA=-1。
1) When the unknown node P is located in the area 1, the following can be obtained by using the common edge proportion theorem:
a' is crossed by a straight line PA and a straight line BC, and the following components are provided:
the coordinates of point a' are expressed as:
line PB intersects line AC at B' with:
the coordinates of point B' are expressed as:
line PC intersects line AB at C', with:
the coordinates of point C' are expressed as:
2) when the unknown node P is located in the area 2, the following can be obtained by using the common edge proportion theorem:
line PA intersects line BC at A' with:
the coordinates of point a' are expressed as:
line PB intersects line AC at B' with:
the coordinates of point B' are expressed as:
line PC intersects line AB at C', with:
the coordinates of point C' are expressed as:
3) when the unknown node P is located in the area 3, the following can be obtained by using the common edge proportion theorem:
line PA intersects line CB at A', with:
the coordinates of point a' are expressed as:
line PB intersects line CA at B' and has:
the coordinates of point B' are expressed as:
line PC intersects line AB at C', with:
the coordinates of point C' are expressed as:
4) when the unknown node P is located in the area 4, the following can be obtained by using the common edge proportion theorem:
line PA intersects line BC at A' with:
the coordinates of point a' are expressed as:
line PB intersects line CA at B' and has:
the coordinates of point B' are expressed as:
line PC intersects line AB with C', having:
the coordinates of point C' are expressed as:
let the intersection point of the straight line AA 'and the straight line BB' be (x)Pu1,yPu1) The intersection of line AA 'and line CC' is (x)Pu2,yPu2) The intersection of the straight line BB 'and the straight line CC' is (x)Pu3,yPu3);
U-th coordinate (x) of unknown node PPu,yPu):
Z7 coordinate value optimization
K coordinates (x) of unknown node P are obtainedP1,yP1),……(xPk,yPk) The abscissa average value and the ordinate average value of (a) are used as coordinates of the optimized unknown node P.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810884680.6A CN108882198B (en) | 2018-08-06 | 2018-08-06 | Mean value positioning method for unknown sensor nodes of wireless sensor network |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810884680.6A CN108882198B (en) | 2018-08-06 | 2018-08-06 | Mean value positioning method for unknown sensor nodes of wireless sensor network |
Publications (2)
Publication Number | Publication Date |
---|---|
CN108882198A CN108882198A (en) | 2018-11-23 |
CN108882198B true CN108882198B (en) | 2021-02-09 |
Family
ID=64307505
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201810884680.6A Expired - Fee Related CN108882198B (en) | 2018-08-06 | 2018-08-06 | Mean value positioning method for unknown sensor nodes of wireless sensor network |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN108882198B (en) |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101715232A (en) * | 2009-11-20 | 2010-05-26 | 西安电子科技大学 | Positioning method of weighted wireless sensor network nodes based on RSSI and LQI |
CN102123495A (en) * | 2011-01-13 | 2011-07-13 | 山东大学 | Centroid location algorithm based on RSSI (Received Signal Strength Indication) correction for wireless sensor network |
CN105407529A (en) * | 2015-12-04 | 2016-03-16 | 河海大学 | Fuzzy C-means cluster based wireless sensor network node location algorithm |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR100789914B1 (en) * | 2006-09-29 | 2008-01-02 | 한국전자통신연구원 | Method and apparatus for range based localization with adaptive neighborhood selection in wireless sensor networks |
CN103929717A (en) * | 2014-04-29 | 2014-07-16 | 哈尔滨工程大学 | Wireless sensor network positioning method based on weight Voronoi diagrams |
CN106054127B (en) * | 2016-05-20 | 2018-05-29 | 太原理工大学 | Wireless sensor network intelligently corrects distance-measuring and positioning method |
CN106019219B (en) * | 2016-05-20 | 2018-05-29 | 太原理工大学 | Wireless sensor network intelligent distance-measuring localization method |
CN105824007B (en) * | 2016-05-20 | 2018-05-01 | 太原理工大学 | Wireless sensor network distance measurement localization method |
CN106170151B (en) * | 2016-07-05 | 2019-03-08 | 重庆邮电大学 | The unknown node localization method adaptively moved based on cooperation anchor node |
-
2018
- 2018-08-06 CN CN201810884680.6A patent/CN108882198B/en not_active Expired - Fee Related
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101715232A (en) * | 2009-11-20 | 2010-05-26 | 西安电子科技大学 | Positioning method of weighted wireless sensor network nodes based on RSSI and LQI |
CN102123495A (en) * | 2011-01-13 | 2011-07-13 | 山东大学 | Centroid location algorithm based on RSSI (Received Signal Strength Indication) correction for wireless sensor network |
CN105407529A (en) * | 2015-12-04 | 2016-03-16 | 河海大学 | Fuzzy C-means cluster based wireless sensor network node location algorithm |
Also Published As
Publication number | Publication date |
---|---|
CN108882198A (en) | 2018-11-23 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN108668256B (en) | Distance difference positioning method for unknown sensor nodes of wireless sensor network | |
CN101860959B (en) | Locating method of wireless sensor network based on RSSI (Received Signal Strength Indicator) | |
CN104684081B (en) | The Localization Algorithm for Wireless Sensor Networks of anchor node is selected based on distance cluster | |
CN109559310A (en) | Power transmission and transformation inspection image quality evaluating method and system based on conspicuousness detection | |
CN108053824A (en) | A kind of patrol rescue unmanned plane and its method of work based on voice signal | |
CN110062459A (en) | Method and system for positioning unknown node in wireless sensor network | |
CN101820676B (en) | Sensor node positioning method | |
CN103582118B (en) | A kind of wireless sensor network node positioning method based on RSSI | |
CN108848559A (en) | The localization method of the unknown sensor node of wireless sensor network | |
CN104363649B (en) | The WSN node positioning methods of UKF with Prescribed Properties | |
CN106714296A (en) | Indoor positioning method based on steepest descent method | |
CN112135249A (en) | RSSI-based weighted centroid positioning algorithm improvement method | |
WO2022170933A1 (en) | Error correction method and apparatus for laser ranging, electronic device, and storage medium | |
CN108882198B (en) | Mean value positioning method for unknown sensor nodes of wireless sensor network | |
CN105824007B (en) | Wireless sensor network distance measurement localization method | |
CN106054127B (en) | Wireless sensor network intelligently corrects distance-measuring and positioning method | |
CN112055305A (en) | Two-circle intersection point positioning method for unknown sensor nodes of wireless sensor network | |
CN104023390A (en) | WSN node positioning method based on combination of PSO and UKF | |
CN108966344B (en) | Positioning method for unknown sensor nodes of wireless sensor network | |
CN105352459B (en) | A kind of method for surveying side forward intersection measuring point | |
CN103759807B (en) | A kind of airport noise monitoring device based on Internet of Things framework | |
CN104121917B (en) | A kind of method and apparatus of automatic discovery newly building bridge | |
CN106922017A (en) | Localization method and terminal | |
Feng et al. | An RSSI-based device-free localization system for smart wards | |
CN106019219B (en) | Wireless sensor network intelligent distance-measuring localization method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
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: 20210209 Termination date: 20210806 |