CN101458323B - Dynamic node positioning method - Google Patents

Dynamic node positioning method Download PDF

Info

Publication number
CN101458323B
CN101458323B CN2009100760013A CN200910076001A CN101458323B CN 101458323 B CN101458323 B CN 101458323B CN 2009100760013 A CN2009100760013 A CN 2009100760013A CN 200910076001 A CN200910076001 A CN 200910076001A CN 101458323 B CN101458323 B CN 101458323B
Authority
CN
China
Prior art keywords
node
anchor
sample
unknown
coordinate
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
CN2009100760013A
Other languages
Chinese (zh)
Other versions
CN101458323A (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.)
Beihang University
Original Assignee
Beihang 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 Beihang University filed Critical Beihang University
Priority to CN2009100760013A priority Critical patent/CN101458323B/en
Publication of CN101458323A publication Critical patent/CN101458323A/en
Application granted granted Critical
Publication of CN101458323B publication Critical patent/CN101458323B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • 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

Abstract

The invention relates to a dynamic node positioning method. The method comprises the following steps: unknown node collects and stores T moment anchor node information; the anchor node information comprises the coordinate of an anchor node; the type of the anchor node is judged, when the anchor node is a two-hop anchor node, sample points are selected from a T-1 moment sample collection; when the anchor node is a one-hop anchor node, the unknown node measures and records the signal strength value of each one-hop node; the number of the one-jump anchor nodes is judged, when the number of the one-hop anchor nodes is equal to 1, the sample points are selected from the sample collection of T-1 moment; when the number of the one-hop anchor nodes is more than 1, the sampling area of the sample point is defined according to the coordinates and the signal strength values of all one-hop anchor nodes; a plurality of sample points are selected randomly from the sampling area as the sample collection of T moment; and finally, the sample points of the sampling collection are filtered. The method has the advantages of less iteration, less calculation amount, less node energy consumption and energy saving.

Description

Dynamic node positioning method
Technical field
The present invention relates to the localization method of sensor node in a kind of wireless sensor network, particularly a kind of dynamic node positioning method.
Background technology
Along with the develop rapidly of the communication technology, embedded computing technique, microprocessing and sensing technology and increasingly mature; Wireless sensor network (WirelessSensor Networks is called for short WSN) with perception, computing power and communication capacity begins to receive extensive concern.Concerning great majority are used, have only the data that combined positional information, sensor to obtain just to be of practical significance.In addition, the self poisoning of node can also be applied to the research of wireless sensor network protocols, for example designs based on the method for routing of node location information to improve router efficiency etc.Therefore node self poisoning problem is one of important problems in the wireless sensor network.According to location mechanism, the localization method of existing wireless sensor network can be divided into two big types: based on the localization method of range finding (range-based) technology and the localization method of non-distance measuring (range-free).Need the information such as distance or angle between measured node based on the localization method (like TOA, AOA, TDOA etc.) of ranging technology, like computing node positions such as trilateration, triangulations.Though this method can obtain more accurate location, the hardware facility of network has been proposed higher requirement, in position fixing process, need to produce a large amount of calculating and communication overhead simultaneously.The localization method of non-distance measuring (like Centroid, DV-Hop, APIT etc.) need not distance and angle information, only realizes the location of node according to network connectivty etc.Though this method has the advantage of aspects such as low cost, low power consumption, only be applicable to the node locating of static wireless sensor network.
For the node locating problem of dynamic radio sensor network, prior art has proposed a kind of Monte Carlo localization method (Monte Carlo localization is called for short MCL).The Monte Carlo localization method mainly comprises three parts: initial phase, forecast period and filtration stage; Initial phase is in whole network range, to select M sample point at random; Forecast period is according to motion model forecast sample point the next position; Filtration stage is to filter sample according to observation information, if remaining legal sample number is less than predefined hits, then carries out the resampling operation.Research shows; Though the Monte Carlo localization method has high orientation precision; But since this method for the frequency in sampling that obtains effective sample too much and the sampling accuracy rate very low, make that this method exists that iterations is many, calculated amount greatly, defective such as node energy consumption is big.
Summary of the invention
The purpose of this invention is to provide a kind of dynamic node positioning method, have advantages such as iterations is few, calculated amount is little, node energy consumption is little, energy-conservation.
To achieve these goals, the invention provides a kind of dynamic node positioning method, comprising:
Step 1, unknown node collection and storage T be anchor node information constantly, and said anchor node information comprises the coordinate of anchor node;
The type of step 2, judgement anchor node, when anchor node was a jumping anchor node, execution in step 3 when anchor node is two jumping anchor nodes, was chosen sample point, execution in step 7 from T-1 sample set constantly;
The signal strength values of each jumping anchor node is measured and write down to step 3, unknown node;
Step 4, judge that one jumps the quantity of anchor node, when one jump anchor node quantity greater than 1 the time, execution in step 5, when one jump anchor node quantity when equaling 1, from T-1 sample set constantly, choose sample point, execution in step 7;
Step 5, one jump the coordinate of anchor nodes and the sample area that signal strength values is confirmed sample point according to all, said sample area be the reflection unknown node with all jumping anchor nodes between the zone of distance relation;
Step 6, in the said sample area several sample points of picked at random as T sample set constantly;
Step 7, the sample point in the sample set is carried out filtration treatment, the effective sample point that retain sample is concentrated;
Whether step 8, judgement sample concentrate the quantity of effective sample point less than predefined hits, are execution in step 6 then, otherwise execution in step 9;
Step 9, estimation T be the coordinate of unknown node constantly.
Said step 9 comprises: calculate the mean value of all sample point coordinates in the sample set, as the coordinate of T moment unknown node.
Said step 7 comprises:
Step 71, according to all one jump anchor nodes coordinate confirm first restricted area of unknown node, according to all two jump anchor nodes coordinate confirm second restricted area of unknown node;
Step 72, the sample point in the sample set is carried out filtration treatment, remove the sample point that is positioned in the sample set beyond said first restricted area and second restricted area, the effective sample point that retain sample is concentrated.
Confirm that according to the coordinate of all jumping anchor nodes first restricted area of unknown node comprises in the said step 71: the region of confirming all unknown node according to the coordinate of all jumping anchor nodes; The region of said unknown node be with one jump anchor node coordinate be that the center of circle, radius are the border circular areas of R, wherein R is the communication radius of unknown node; Calculate the overlapping region of the region of all unknown node, as first restricted area of unknown node.
Confirm that according to the coordinate of all two jumping anchor nodes second restricted area of unknown node comprises in the said step 71: the region of confirming all unknown node according to the coordinate of all two jumping anchor nodes; The region of said unknown node be with two jump anchor nodes coordinate be that the center of circle, radius are the annular region between the circle of R and the circle that radius is 2R, wherein R is the communication radius of unknown node; Calculate the overlapping region of the region of all unknown node, as second restricted area of unknown node.
On the technique scheme basis, said step 5 comprises:
Step 51, according to all one jump anchor nodes signal strength values confirm the distance relation between unknown node and all jumping anchor nodes;
Step 52, according to all one jump anchor nodes coordinate, through the perpendicular bisector between the anchor node a plurality of zones with range performance are set;
Step 53, the distance relation of jumping between the anchor node according to unknown node and all are selected the zone of distance relation between reflection unknown node and all jumping anchor nodes, as the sample area of sample point in said a plurality of zones with range performance.
The present invention proposes a kind of dynamic node positioning method; Signal strength values through a jumping anchor node is confirmed sample area; Effectively increased the accuracy rate that sample point is sampled at initial phase and forecast period; Reduced the frequency in sampling that obtains effective sample point, realized reducing iterations, reducing the purpose that node energy consumes, made the present invention have advantages such as calculated amount is little, energy-conservation.Compare with prior art Monte Carlo dynamic positioning method; The signal strength values of the anchor node that the present invention listens in initial phase and forecast period utilization is confirmed the sample area of sample point; Make unknown node in the sample set of a certain moment generation of forecast period, more effective sample point arranged; Reduced the number of the invalid sample point that filtration stage need get rid of, thereby saved unknown node because of energy that repeatedly iteration consumed.The present invention need not to add the accurate location that any new hardware can be realized node in the dynamic radio sensor network, has broad application prospects.
Description of drawings
Fig. 1 is the process flow diagram of dynamic node positioning method of the present invention;
Fig. 2 confirms the synoptic diagram of unknown node and two anchor node distance relations for the present invention;
Fig. 3 confirms the process flow diagram of the sample area of sample point for the present invention;
Fig. 4 confirms the synoptic diagram of the sample area of sample point for the present invention;
Fig. 5 jumps the synoptic diagram that anchor node is confirmed the unknown node region for the present invention according to one;
Fig. 6 jumps the synoptic diagram that anchor node is confirmed the unknown node region for the present invention according to two;
Fig. 7 carries out the process flow diagram of filtration treatment to the sample point in the sample set for the present invention;
Fig. 8 confirms the synoptic diagram of first restricted area of unknown node for the present invention;
Fig. 9 confirms the synoptic diagram of second restricted area of unknown node for the present invention.
Embodiment
Through accompanying drawing and embodiment, technical scheme of the present invention is done further detailed description below.
Fig. 1 is the process flow diagram of dynamic node positioning method of the present invention, comprising:
Step 1, unknown node collection and storage T be anchor node information constantly, and said anchor node information comprises the coordinate of anchor node;
The type of step 2, judgement anchor node, when anchor node was a jumping anchor node, execution in step 3 when anchor node is two jumping anchor nodes, was chosen sample point, execution in step 7 from T-1 sample set constantly;
The signal strength values of each jumping anchor node is measured and write down to step 3, unknown node;
Step 4, judge that one jumps the quantity of anchor node, when one jump anchor node quantity greater than 1 the time, execution in step 5, when one jump anchor node quantity when equaling 1, from T-1 sample set constantly, choose sample point, execution in step 7;
Step 5, one jump the coordinate of anchor nodes and the sample area that signal strength values is confirmed sample point according to all, said sample area be the reflection unknown node with all jumping anchor nodes between the zone of distance relation;
Step 6, in the said sample area several sample points of picked at random as T sample set constantly;
Step 7, the sample point in the said sample set is carried out filtration treatment, the effective sample point that retain sample is concentrated.
Along with the development of wireless sensor network technology, node can obtain the signal strength values (RSSI) of anchor node broadcast singal easily.For this reason, the present invention proposes a kind of technical scheme of utilizing the sample area of this signal strength values restriction sample point, confirm the distance relation of unknown node and anchor node through the signal strength values of anchor node.Radio signal propagation has following characteristic usually: acceptance point is near more from transmit leg, and the signal intensity that records is strong more; Acceptance point from transmit leg far away more, the signal intensity that records more a little less than.Fig. 2 confirms that for the present invention the synoptic diagram of unknown node and two anchor node distance relations, anchor node wherein are one and jump anchor node.As shown in Figure 2, can obtain two perpendicular bisectors between the anchor node according to the coordinate of the first anchor node A and the second anchor node B, promptly straight line L3 is the perpendicular bisector between the first anchor node A and the second anchor node B, straight line L3 is divided into two zones with plane domain.Can know according to the perpendicular bisector theorem; Any 1 o'clock distance to the first anchor node A and the second anchor node B on the straight line L3 equates; In straight line L3 one side (like the right side) zone any 1 o'clock to the distance of the second anchor node B less than distance to the first anchor node A, in straight line L3 opposite side (like the left side) zone any 1 o'clock to the distance of the first anchor node A less than distance to the second anchor node B.Therefore straight line L3 two zones that plane domain is divided uniquely in the reflecting regional arbitrarily a bit with the distance relation of the first anchor node A and the second anchor node B.If a some P is all arranged in each zone, some P is PA to the distance of the first anchor node A, and some P is PB to the distance of the second anchor node B, and then two zones have following characteristic:
Zone one: PA＞PB; Zone two: PB＞PA.
The signal strength values of supposing the signal arrival unknown node N of first anchor node A broadcasting is RSSI A, the signal strength values that the signal of second anchor node B broadcasting arrives unknown node N is RSSI B, and RSSI A＜RSSI BThen according to the characteristic of radio signal propagation; The distance relation that can infer N to two anchor node of unknown node is: unknown node N to the first anchor node A apart from NA＞unknown node N to the second anchor node B apart from NB; According to the distance relation of N to two anchor node of unknown node and the characteristic in aforementioned two zones, can finally infer the zone at unknown node N place.Among Fig. 2, the zone at unknown node N place is the right side of straight line L3.In like manner; Suppose that unknown node can listen to a n jumping anchor node; Can do a perpendicular bisector between per two one jumping anchor nodes, a n jumping anchor node can be made n (n-1)/2 perpendicular bisector altogether, will be divided into a plurality of zones to plane domain; It is three kinds that these zones are divided into: point, line segment, polygon, the quantity of point are n 4/ 8-n 3/ 4-n 2/ 8+n/4, the quantity of line is n 4/ 8-n 3/ 4+n 2/ 4, the quantity of face is n 4/ 8-n 3/ 4+3n 2/ 8-n/4+1, each polygon have the characteristic of distance relation between above-mentioned reflection unknown node and the anchor node equally.
Specific to the present invention, during the moment, the unknown node collection is storage anchor node information also at T, and anchor node comprises that one jumps anchor node and two jumping anchor nodes, and anchor node information comprises that one jumps the coordinate of anchor node and the coordinate of two jumping anchor nodes.Unknown node is judged the type of anchor node; When judging anchor node is two when jumping anchor nodes, then from T-1 sample set constantly, chooses several sample points, and the sample point in the sample set is carried out filtration treatment; Remove the invalid sample point in the sample set, the effective sample point that retain sample is concentrated.When judging anchor node is one when jumping anchor node, and unknown node is measured and write down each and one jumps the signal strength values of anchor node, and judges that further one jumps the quantity of anchor node.When the quantity of a jumping anchor node equals 1, then from T-1 sample set constantly, choose several sample points, the sample point in the sample set is carried out filtration treatment, remove the invalid sample point in the sample set, the effective sample point that retain sample is concentrated.When one jump anchor node quantity greater than 1 the time; According to the coordinate of all jumping anchor nodes and the sample area that signal strength values is confirmed sample point; This sample area be the reflection unknown node with all one jump distance relation between the anchor node the zone, a picked at random M sample point carries out filtration treatment as the T sample set in the moment to the sample point in the sample set in this sample area afterwards; Remove the invalid sample point in the sample set, the effective sample point that retain sample is concentrated.Because the present invention utilizes the signal strength values of a jumping anchor node to confirm sample area, therefore effectively increased the accuracy rate of sample point sampling.
Fig. 3 confirms the process flow diagram of the sample area of sample point for the present invention.In technical scheme shown in Figure 1, step 5 comprises:
Step 51, according to all one jump anchor nodes signal strength values confirm the distance relation between unknown node and all jumping anchor nodes;
Step 52, according to all one jump anchor nodes coordinate, through the perpendicular bisector between the anchor node a plurality of zones with range performance are set;
Step 53, the distance relation of jumping between the anchor node according to unknown node and all are selected the zone of distance relation between reflection unknown node and all jumping anchor nodes, as the sample area of sample point in said a plurality of zones with range performance.
Fig. 4 confirms the synoptic diagram of the sample area of sample point for the present invention, and jumping anchor nodes with three one is example.At first confirm the distance relation between unknown node and the anchor node according to the signal strength values of anchor node.The signal strength values of supposing the signal arrival unknown node N of first anchor node A broadcasting is RSSI A, the signal strength values that the signal of second anchor node B broadcasting arrives unknown node N is RSSI B, the signal strength values that the signal of the 3rd anchor node C broadcasting arrives unknown node N is RSSI C, and RSSI A＜RSSI C＜RSSI BThen, can infer that the distance relation of N to three anchor node of unknown node is according to the characteristic of radio signal propagation: unknown node N to the first anchor node A apart from NA＞unknown node N to the three anchor node C apart from NC＞unknown node N to the second anchor node B apart from NB.
According to the coordinate of anchor node, a plurality of zones with range performance are set then through the perpendicular bisector between the anchor node.As shown in Figure 4; Coordinate according to the first anchor node A, the second anchor node B and the 3rd anchor node C can obtain three perpendicular bisectors between the anchor node; Straight line L1 is the perpendicular bisector between the second anchor node B and the 3rd anchor node C, and straight line L2 is the perpendicular bisector between the first anchor node A and the 3rd anchor node C, and straight line L3 is the perpendicular bisector between the first anchor node A and the second anchor node B; Straight line L1, straight line L2 and straight line L3 intersect on one point, and plane domain is divided into six zones.Can know according to the perpendicular bisector theorem; Any 1 o'clock distance to the second anchor node B and the 3rd anchor node C on the straight line L1 equates; In straight line L1 one side (like the right side) zone any 1 o'clock to the distance of the second anchor node B greater than distance to the 3rd anchor node C, in straight line L1 opposite side (like the left side) zone any 1 o'clock to the distance of the second anchor node B less than distance to the 3rd anchor node C; In like manner, any 1 o'clock distance to the first anchor node A and the 3rd anchor node C on the straight line L2 equates that any 1 o'clock distance to the first anchor node A and the second anchor node B on the straight line L3 equates.Therefore straight line L1, straight line L2 and straight line L3 six zones that plane domain is divided uniquely in the reflecting regional arbitrarily a bit with the distance relation of the first anchor node A, the second anchor node B and the 3rd anchor node C.If a some P is all arranged in each zone, some P is PA to the distance of the first anchor node A, and some P is PB to the distance of the second anchor node B, and the distance of some P to the three anchor node C is PC, and then six zones have following characteristic:
Zone one: PA＞PB＞PC; Zone two: PA＞PC＞PB; Zone three: PB＞PC＞PA;
Zone four: PB＞PA＞PC; Zone five: PC＞PA＞PB; Zone six: PC＞PB＞PA.
At last; Distance relation according to N to three anchor node of unknown node; In six zones with range performance, select the zone that can reflect distance relation between unknown node and three anchor nodes, and should the zone as the sample area X1 (shadow region among Fig. 4) of sample point.
After obtaining T sample set constantly, the present invention carries out filtration treatment as filtercondition to the sample point in the sample set according to the region of unknown node, to obtain the effective sample point.The communication range of supposing unknown node is the center of circle for the coordinate with unknown node, is the border circular areas of radius with the communication radius R of unknown node.Fig. 5 jumps the synoptic diagram that anchor node is confirmed the unknown node region for the present invention according to one.As shown in Figure 5;, unknown node N can't obtain the information of two jumping anchor nodes if can only listening to the information of a jumping anchor node A1; Explain that one jumps and should satisfy d＜R apart from d between anchor node A1 and unknown node N, then the region of unknown node N is that the coordinate with this jumping anchor node A1 is the center of circle, is the zone that circular D1 was comprised of radius with the communication radius R of unknown node.Fig. 6 jumps the synoptic diagram that anchor node is confirmed the unknown node region for the present invention according to two.As shown in Figure 6;, unknown node N can't obtain the information of a jumping anchor node if can only listening to the information of two jumping anchor node A2; Explain that two jump and should satisfy R＜d＜2R apart from d between anchor node A2 and unknown node N, then unknown node N region is that the coordinate with this two jumpings anchor node A2 is that the center of circle, radius are the annular region (being that radius is greater than R but less than the annular region of 2R) between the circular D1 of R and the circular D2 that radius is 2R.
Fig. 7 carries out the process flow diagram of filtration treatment to the sample point in the sample set for the present invention.In technical scheme shown in Figure 1, step 7 comprises:
Step 71, according to all one jump anchor nodes coordinate confirm first restricted area of unknown node, according to all two jump anchor nodes coordinate confirm second restricted area of unknown node;
Step 72, the sample point in the said sample set is carried out filtration treatment, remove the sample point that is positioned in the sample set beyond said first restricted area and second restricted area, the effective sample point that retain sample is concentrated.
Fig. 8 confirms the synoptic diagram of first restricted area of unknown node for the present invention, and jumping anchor nodes with three one is example.As shown in Figure 8; Suppose that the first anchor node A, the second anchor node B and the 3rd anchor node C are that one of unknown node N jumps anchor node; Because unknown node N can obtain three one coordinates of jumping anchor node, so unknown node N can confirm the region of unknown node N with respect to each jumping anchor node according to the coordinate of each jumping anchor node.Particularly, first region of unknown node N is that the coordinate with the first anchor node A is the center of circle, and radius is the border circular areas of R; Second region of unknown node N is that the coordinate with the second anchor node B is the center of circle, and radius is the border circular areas of R; The 3rd region of unknown node N is that the coordinate with the 3rd anchor node C is the center of circle, and radius is the border circular areas of R.After having confirmed three regions of unknown node N, just can calculate the overlapping region of three regions, and with the first restricted area Y1 (in Fig. 8 shadow region) of this overlapping region as unknown node.
Fig. 9 confirms the synoptic diagram of second restricted area of unknown node for the present invention, and jumping anchor nodes with three two is example.As shown in Figure 9; Suppose that the first anchor node A, the second anchor node B and the 3rd anchor node C are that two of unknown node N jumps anchor node; Because unknown node N can obtain three two coordinates of jumping anchor node, so unknown node N can confirm the region of unknown node N with respect to each two jumping anchor node according to the coordinate of each two jumping anchor node.Particularly, first region of unknown node N is that the coordinate with the first anchor node A is the center of circle, and radius is the annular region between the circle of R and the circle that radius is 2R; Second region of unknown node N is that the coordinate with the second anchor node B is the center of circle, and radius is the annular region between the circle of R and the circle that radius is 2R; The 3rd region of unknown node N is that the coordinate with the 3rd anchor node C is the center of circle, and radius is the annular region between the circle of R and the circle that radius is 2R.After having confirmed three regions of unknown node N, just can calculate the overlapping region of three regions, and with this overlapping region as the sample point second sample area Y2 (shadow region among Fig. 9).
Technique scheme specified one jump anchor node quantity greater than 1, two jump anchor nodes quantity greater than the processing procedure of confirming the unknown node restricted area at 1 o'clock according to the coordinate of anchor node; In the practical application, can not guarantee each constantly unknown node can both obtain more than two one jump anchor node or more than two two jump anchor nodes information.Therefore, on the technique scheme basis, dynamic node positioning method of the present invention also comprise when one jump anchor node quantity equal 1, two jump anchor nodes the technical scheme of quantity when equaling 1.Particularly; When the quantity of a jumping anchor node equals 1; Explain that one jumps anchor node in the communication zone of unknown node; Therefore the present invention can according to this one jump anchor node coordinate confirm first restricted area of unknown node, this first restricted area be with this one jump anchor node coordinate be the center of circle, be the border circular areas of radius with the communication radius R of unknown node.When the quantity of two jumping anchor nodes equals 1; Explain that two jump anchor node in the annular region of unknown node; Therefore the present invention can according to this two jump anchor node coordinate confirm second restricted area of unknown node, this second restricted area be with this two jump anchor node coordinate be that the center of circle, radius are the annular region between the circle of R and the circle that radius is 2R.
This shows that the process that the present invention carries out filtration treatment to the sample point in the sample set is a unknown node according to jumping the process that information that anchor node and two jumping anchor nodes obtain removes the invalid sample point of prediction error from own one.Wherein one jump anchor node and be meant the anchor node that unknown node can directly listen to, two jump that anchor nodes are meant that unknown node can not directly listen to but anchor node that their a hop neighbor node can listen to.After utilizing one to jump information acquisition first restricted area and second restricted area of anchor node and two jumping anchor nodes; The invalid sample point of prediction error is the sample point that is positioned at beyond this first restricted area and second restricted area; Sample point through these are ineligible filters out, and just can make to keep effective sample point in the sample set.
On aforementioned techniques scheme basis, dynamic node positioning method of the present invention also comprises resampling and localization step.Particularly; After the sample point in the sample set is carried out filtration treatment; If the number of samples in the sample set is less than predefined hits; To repeat sampling so and filter two stages, i.e. execution in step 6 (in sample area, choosing several sample points) again is till the number of sample point satisfies the sample set capacity.According to the coordinate of all sample point estimation T moment unknown node in the sample set, accomplish dynamic node positioning method of the present invention at last.In the practical application, can adopt several different methods to utilize the coordinate of the coordinate estimation unknown node of all sample points in the sample set, the present invention adopts the coordinate of the mean value of all sample point coordinates in the calculating sample set as T moment unknown node.
Can find out from technique scheme; Because the present invention utilizes the signal strength values of a jumping anchor node to confirm sample area; Effectively increased the accuracy rate that sample point is sampled at initial phase and forecast period; Utilize the restricted area of anchor node information acquisition to remove invalid sample point simultaneously, guaranteed the accuracy rate of sample point sampling, therefore reduced the frequency in sampling that obtains effective sample point; Realized reducing iterations, reducing the purpose that node energy consumes, made the present invention have advantages such as calculated amount is little, energy-conservation.
Concrete treatment scheme through dynamic node positioning method of the present invention further specifies technical scheme of the present invention below.The time of hypothesis is separated into a plurality of time quantums; Unknown node all can be reorientated self-position at each time quantum; The present invention is through confirming sample area at initial phase and forecast period adding restrictive condition, with the accuracy rate of effective increase sample point sampling.At first, the jumping anchor node or two that unknown node acquisition T self can listen to is constantly jumped the information of anchor nodes, and these anchor node information comprise that at least one jumps the coordinate of anchor node or two jumping anchor nodes.Because unknown node stochastic distribution and communication range are limited, can not guarantee that each moment unknown node can both obtain one and jump the information of anchor node or two jumping anchor nodes, so in the practical application, can divide following situation to position processing.
(1) unknown node can listen to one and jump anchor node, and the quantity of a jumping anchor node is 1
This situation explanation one is jumped and should be satisfied d＜R apart from d between anchor node and unknown node, and wherein R is the communication radius of unknown node.To current time is initialization constantly, i.e. T=0, the sample area of then estimating sample point for this one jump anchor node coordinate be the center of circle, be the border circular areas of radius with R, afterwards in this sample area a picked at random M sample point as the sample set of predicted position.In T＞0 constantly, then choose sample point according to T-1 sample set constantly.Coordinate according to a jumping anchor node carries out filtration treatment to the sample point in the sample set afterwards, estimates the coordinate of unknown node at last according to the mean value of effective sample point coordinate in the sample set.
(2) unknown node can listen to one and jump anchor node, and the quantity of a jumping anchor node is greater than 1
When one jump anchor node quantity greater than 1 the time; Earlier confirm the distance relation between unknown node and the anchor node according to the signal strength values of anchor node; The back is according to the coordinate of anchor node; Through the perpendicular bisector between the anchor node a plurality of zones with range performance are set,, in a plurality of zones with range performance, select the zone that to reflect distance relation between unknown node and the anchor node at last according to the distance relation of unknown node to three anchor node; And as the sample area of sample point, subsequently in this sample area a picked at random M sample point as the sample set of predicted position.Coordinate according to a jumping anchor node carries out filtration treatment to the sample point in the sample set afterwards, estimates the coordinate of unknown node at last according to the mean value of effective sample point coordinate in the sample set.
(3) unknown node can't listen to one jump anchor node but can obtain two jump anchor nodes information
This situation explanation two is jumped and should be satisfied R＜d＜2R apart from d between anchor nodes and unknown node.To current time is the initialization moment; Be T=0; The sample area of then estimating sample point for this two jump anchor node coordinate be the center of circle, radius is the circular annular region between the circle of R and 2R, afterwards in this sample area a picked at random M sample point as the sample set of predicted position.In T＞0 constantly, then choose sample point according to T-1 sample set constantly.Coordinate according to two jumping anchor nodes carries out filtration treatment to the sample point in the sample set, estimates the coordinate of unknown node at last according to the mean value of effective sample point coordinate in the sample set.
(4) unknown node both can't listen to one and jump the information that anchor node also can't obtain two jumping anchor nodes
For current time is initialization constantly, i.e. T=0, unknown node will be in the network distributed areas picked at random M sample point as the sample set of forecast period.In T＞0 constantly, then choose sample point according to T-1 sample set constantly.
One of ordinary skill in the art will appreciate that: all or part of step that realizes said method embodiment can be accomplished through the relevant hardware of programmed instruction; Aforesaid program can be stored in the computer read/write memory medium; This program the step that comprises said method embodiment when carrying out; And aforesaid storage medium comprises: various media that can be program code stored such as ROM, RAM, magnetic disc or CD.
What should explain at last is: above embodiment is only unrestricted in order to technical scheme of the present invention to be described; Although the present invention is specified with reference to preferred embodiment; Those of ordinary skill in the art is to be understood that; Can make amendment or be equal to replacement technical scheme of the present invention, and not break away from the spirit and the scope of technical scheme of the present invention.

Claims (5)

1. a dynamic node positioning method is characterized in that, comprising:
Step 1, unknown node collection and storage T be anchor node information constantly, and said anchor node information comprises the coordinate of anchor node;
The type of step 2, judgement anchor node, when anchor node was a jumping anchor node, execution in step 3 when anchor node is two jumping anchor nodes, was chosen sample point, execution in step 7 from T-1 sample set constantly;
The signal strength values of each jumping anchor node is measured and write down to step 3, unknown node;
Step 4, judge that one jumps the quantity of anchor node, when one jump anchor node quantity greater than 1 the time, execution in step 5, when one jump anchor node quantity when equaling 1, from T-1 sample set constantly, choose sample point, execution in step 7;
Step 5, according to all one jump anchor nodes signal strength values confirm the distance relation between unknown node and all jumping anchor nodes; Coordinate according to all jumping anchor nodes is provided with a plurality of zones with range performance through the perpendicular bisector between the anchor node; The distance relation of jumping between the anchor node according to unknown node and all is selected the zone of distance relation between reflection unknown node and all jumping anchor nodes, as the sample area of sample point in said a plurality of zones with range performance;
Step 6, in the said sample area several sample points of picked at random as T sample set constantly;
Step 7, the sample point in the sample set is carried out filtration treatment, the effective sample point that retain sample is concentrated;
Whether step 8, judgement sample concentrate the quantity of effective sample point less than predefined hits, are execution in step 6 then, otherwise execution in step 9;
Step 9, estimation T be the coordinate of unknown node constantly.
2. dynamic node positioning method according to claim 1 is characterized in that, said step 9 comprises: calculate the mean value of all sample point coordinates in the sample set, as the coordinate of T moment unknown node.
3. dynamic node positioning method according to claim 1 is characterized in that, said step 7 comprises:
Step 71, according to all one jump anchor nodes coordinate confirm first restricted area of unknown node, according to all two jump anchor nodes coordinate confirm second restricted area of unknown node;
Step 72, the sample point in the sample set is carried out filtration treatment, remove the sample point that is positioned in the sample set beyond said first restricted area and second restricted area, the effective sample point that retain sample is concentrated.
4. dynamic node positioning method according to claim 3; It is characterized in that; Confirm that according to the coordinate of all jumping anchor nodes first restricted area of unknown node comprises in the said step 71: the region of confirming all unknown node according to the coordinate of all jumping anchor nodes; The region of said unknown node be with one jump anchor node coordinate be that the center of circle, radius are the border circular areas of R, wherein R is the communication radius of unknown node; Calculate the overlapping region of the region of all unknown node, as first restricted area of unknown node.
5. dynamic node positioning method according to claim 3; It is characterized in that; Confirm that according to the coordinate of all two jumping anchor nodes second restricted area of unknown node comprises in the said step 71: the region of confirming all unknown node according to the coordinate of all two jumping anchor nodes; The region of said unknown node be with two jump anchor nodes coordinate be that the center of circle, radius are the annular region between the circle of R and the circle that radius is 2R, wherein R is the communication radius of unknown node; Calculate the overlapping region of the region of all unknown node, as second restricted area of unknown node.
CN2009100760013A 2009-01-04 2009-01-04 Dynamic node positioning method Expired - Fee Related CN101458323B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2009100760013A CN101458323B (en) 2009-01-04 2009-01-04 Dynamic node positioning method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2009100760013A CN101458323B (en) 2009-01-04 2009-01-04 Dynamic node positioning method

Publications (2)

Publication Number Publication Date
CN101458323A CN101458323A (en) 2009-06-17
CN101458323B true CN101458323B (en) 2012-01-18

Family

ID=40769299

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2009100760013A Expired - Fee Related CN101458323B (en) 2009-01-04 2009-01-04 Dynamic node positioning method

Country Status (1)

Country Link
CN (1) CN101458323B (en)

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102083201A (en) * 2009-11-30 2011-06-01 北京时代凌宇科技有限公司 Positioning method and device based on wireless sensor network
CN102164408B (en) * 2011-03-16 2013-05-29 河海大学常州校区 Wireless sensor network annular positioning method based on transmission delay and improvement method thereof
CN102621524A (en) * 2012-03-07 2012-08-01 东南大学 High-precision positioning method for hectometer-level area based on time difference of arrival
CN103869280A (en) * 2014-03-25 2014-06-18 许昌学院 Efficient positioning method and device with local topology and beacon location messages combined
CN107071735A (en) * 2017-04-24 2017-08-18 兰州交通大学 A kind of mobile node Monte Carlo localization method based on sequential
CN108966120B (en) * 2018-06-09 2021-01-15 中国电子科技集团公司第五十四研究所 Combined trilateral positioning method and system for dynamic cluster network improvement
CN109212473B (en) * 2018-10-12 2020-09-15 广州杰赛科技股份有限公司 Positioning method, device, equipment, system and storage medium
CN109379702B (en) * 2018-12-17 2020-08-11 北京理工大学 Three-dimensional sensor network node positioning method and system
CN113573406B (en) * 2021-07-05 2022-04-29 江南大学 Fingerprint information positioning method based on wireless signal strength

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2888079A1 (en) * 2005-06-30 2007-01-05 Alcatel Sa METHOD OF TRANSFERRING, BY DOUBLE DATA TRANSMISSION, A COMMUNICATION INVOLVING A MOBILE NODE IN A MICRO OR MACRO MOBILITY SITUATION IN AN IP COMMUNICATION NETWORK WITH HIERARCHICAL MOBILITY MANAGEMENT
US20070076638A1 (en) * 2005-10-05 2007-04-05 Honeywell International Inc. Localization for low cost sensor network
WO2007044352A1 (en) * 2005-10-05 2007-04-19 Honeywell International Inc. Localization identification system for wirless devices
CN101004448A (en) * 2007-01-18 2007-07-25 北京航空航天大学 Convex programming positioning method of triangle filtering of wireless sensor network
CN101221236A (en) * 2008-02-02 2008-07-16 北京航空航天大学 Node self-locating method based on sampling of wireless sensor network in three-dimensional space
CN101241177A (en) * 2008-03-11 2008-08-13 北京航空航天大学 Wireless sensor network positioning system facing to three dimensional space

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2888079A1 (en) * 2005-06-30 2007-01-05 Alcatel Sa METHOD OF TRANSFERRING, BY DOUBLE DATA TRANSMISSION, A COMMUNICATION INVOLVING A MOBILE NODE IN A MICRO OR MACRO MOBILITY SITUATION IN AN IP COMMUNICATION NETWORK WITH HIERARCHICAL MOBILITY MANAGEMENT
US20070076638A1 (en) * 2005-10-05 2007-04-05 Honeywell International Inc. Localization for low cost sensor network
WO2007044352A1 (en) * 2005-10-05 2007-04-19 Honeywell International Inc. Localization identification system for wirless devices
CN101004448A (en) * 2007-01-18 2007-07-25 北京航空航天大学 Convex programming positioning method of triangle filtering of wireless sensor network
CN101221236A (en) * 2008-02-02 2008-07-16 北京航空航天大学 Node self-locating method based on sampling of wireless sensor network in three-dimensional space
CN101241177A (en) * 2008-03-11 2008-08-13 北京航空航天大学 Wireless sensor network positioning system facing to three dimensional space

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
曾凡仔等.无线传感器网络的节点定位方法.《通信学报》.2008,第29卷(第11期),62-66. *
王超等.无线传感器网络中一种基于双重限制区域的节点定位算法.《2008通信理论与技术新发展——第十三届全国青年通信学术会议论文集(下)》.2008,1839-1844. *

Also Published As

Publication number Publication date
CN101458323A (en) 2009-06-17

Similar Documents

Publication Publication Date Title
CN101458323B (en) Dynamic node positioning method
CN103139863B (en) Method of target tracking and energy consumption optimization of dynamic cluster mechanism of wireless sensor network
CN101458324A (en) Node positioning method based on limitation region
CN101477187B (en) Three-dimensional space wireless sensor network non-range positioning system and method thereof
CN102883429B (en) Method and device for tracking move object in sensor network based on directional antenna
Bhuiyan et al. Prediction-based energy-efficient target tracking protocol in wireless sensor networks
CN103052128A (en) Wireless sensor network-based energy-efficient collaborative scheduling method
CN101778472A (en) Distributed panel-point positioning method for wireless sensor network
CN101126805A (en) Tri-dimensional node positioning method and system based on sphere
Kiyani et al. DCSE: A dynamic clustering for saving energy in wireless sensor network
CN101252495A (en) Wireless sensor network local type node managing method
Yu et al. A hierarchical MDS-based localization algorithm for wireless sensor networks
Alaybeyoglu et al. Tracking fast moving targets in wireless sensor networks
Ren et al. Energy efficient tracking in uncertain sensor networks
WO2015062088A1 (en) Method and device for positioning location of terminal
AbdelSalam et al. A lightweight skeleton construction algorithm for self-organizing sensor networks
CN112379328A (en) Robust TDOA (time difference of arrival) positioning method with low power consumption and robust median filter
Shah et al. Energy efficient mobile user tracking system with node activation mechanism using wireless sensor networks
CN105764028A (en) Wireless sensor network node positioning method
Hosseini et al. Designing a clustering and prediction-based protocol for target tracking in wireless sensor networks (WSNs)
Alaybeyoglu et al. A distributed wakening based target tracking protocol for wireless sensor networks
Qi et al. SMTS: a swarm intelligence-inspired sensor wake-up control method for multi-target sensing in wireless sensor networks
Wang et al. Study on Range-Free Node Localization Algorithm of Internet of Vehicles
Bhuvaneswari et al. Optimal transmission power selection under energy constraints for sensor network localization
Han et al. Reference node selection algorithm based on trilateration and performance analysis in indoor 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
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: 20120118

Termination date: 20170104