CN102685772B - Tracking node selection method based on wireless all-around sensor network - Google Patents

Tracking node selection method based on wireless all-around sensor network Download PDF

Info

Publication number
CN102685772B
CN102685772B CN201210112292.9A CN201210112292A CN102685772B CN 102685772 B CN102685772 B CN 102685772B CN 201210112292 A CN201210112292 A CN 201210112292A CN 102685772 B CN102685772 B CN 102685772B
Authority
CN
China
Prior art keywords
node
moment
measured value
particle
tracking
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
CN201210112292.9A
Other languages
Chinese (zh)
Other versions
CN102685772A (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.)
Shanghai Institute of Microsystem and Information Technology of CAS
Original Assignee
Shanghai Institute of Microsystem and Information Technology of CAS
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 Shanghai Institute of Microsystem and Information Technology of CAS filed Critical Shanghai Institute of Microsystem and Information Technology of CAS
Priority to CN201210112292.9A priority Critical patent/CN102685772B/en
Publication of CN102685772A publication Critical patent/CN102685772A/en
Application granted granted Critical
Publication of CN102685772B publication Critical patent/CN102685772B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

The invention relates to a tracking node selection method based on a wireless all-around sensor network. The tracking node selection method comprises the following steps of: acquiring a transcendental state probability on the basis of particle filtering; obtaining a longest distance and a shorted distance from each node in a detection range to a target according to position and speed estimation at a previous moment and estimation factors; calculating a corresponding weight value of each particle with combination of a measurement value of the node, and weighting to obtain a reliable set of the measurement values of the nodes in the detection range; and selecting a reliable measurement value from the set as the basis for tracking estimation. The method can avoid possible tracking mistakes or target loss caused by mis-measurement.

Description

A kind of tracking node selecting method based on wireless omnidirectional sensor network
Technical field
The present invention relates to wireless sensor network technology field, particularly relate to a kind of tracking node selecting method based on wireless omnidirectional sensor network, be applicable to utilize omnidirectional's transducer tracing process interior joint such as shock sensor, sound transducer, radio-frequency antenna to select.
Background technology
Internet of Things (Internet of Things) represents the following direction with development communication technologies that calculates, and is considered to after computer, Internet, the third time development tide in information industry field.Internet of Things be one can (Anytime), place (Anyplace) at any time, realize the dynamic network that any object (Anything) is interconnected, it include between PC, interpersonal, interconnected between thing and people, between thing and thing.Internet of Things comprises sensing layer, network layer and application layer 3 levels.Wireless sensor network (WSN) is one of key technology of sensing layer employing.
In the application study of WSN, target locating is an important research direction.The sensor model of target locating is based on sound transducer, shock sensor, radio-frequency antenna etc. mostly.In tracing process, in fact due to multi-path jamming, block, the factor such as environment, cause indivedual signal value obtained to depart from actual value comparatively large, become mistake and measure, and mistake to measure be not that certain noise causes.If do not consider that in target locating the mistake that may exist is measured, the mistake of target information is very easily caused to estimate even track rejection.
Summary of the invention
Technical problem to be solved by this invention is to provide a kind of tracking node selecting method based on wireless omnidirectional sensor network, the trail-and-error avoiding mistake measurement to bring or track rejection.
The technical solution adopted for the present invention to solve the technical problems is: provide a kind of tracking node selecting method based on wireless omnidirectional sensor network, comprise the following steps:
(1) on the basis of particle filter, prior state probabilities is obtained;
(2) utilize the position of previous moment, velocity estimation and the estimation factor, obtain each node in investigative range to the maximum distance of target and minimum distance;
(3) measured value in conjunction with node itself calculates the corresponding weights of each particle, and weighting obtains the set of investigative range interior nodes measurement reliability;
(4) from described set, select reliable measured value to estimate foundation as tracking.
The method of Bayesian Estimation is adopted to obtain prior state probabilities in described step (1).
Three measured values are selected to estimate foundation as tracking in described step (4).
Beneficial effect
Owing to have employed above-mentioned technical scheme, the present invention compared with prior art, there is following advantage and good effect: the present invention is on particle filter basis, adopt Bayesian Estimation, obtain prior probability, utilize the position of previous moment, velocity estimation and the estimation factor, obtain each node in investigative range to target farthest and minimum distance, measured value again in conjunction with node itself calculates the corresponding weights of each particle, then weighting obtains the set of scope interior nodes measurement reliability, from this set, select reliable measured value to estimate foundation as tracking, thus can when there is erroneous measurements, select reliable node measurement value as tracking foundation, thus the trail-and-error avoiding mistake measurement to bring or track rejection.
Accompanying drawing explanation
Fig. 1 is flow chart of the present invention;
Fig. 2 is measurement point and maneuvering target graph of a relation in embodiment of the present invention;
Fig. 3 is the potential range schematic diagram of measurement point and maneuvering target in embodiment of the present invention.
Embodiment
Below in conjunction with specific embodiment, set forth the present invention further.Should be understood that these embodiments are only not used in for illustration of the present invention to limit the scope of the invention.In addition should be understood that those skilled in the art can make various changes or modifications the present invention, and these equivalent form of values fall within the application's appended claims limited range equally after the content of having read the present invention's instruction.
Embodiments of the present invention relate to a kind of tracking node selecting method based on wireless omnidirectional sensor network, as shown in Figure 1, comprise the following steps:
(1) on the basis of particle filter, prior state probabilities is obtained;
(2) utilize the position of previous moment, velocity estimation and the estimation factor, obtain each node in investigative range to the maximum distance of target and minimum distance;
(3) measured value in conjunction with node itself calculates the corresponding weights of each particle, and weighting obtains the set of investigative range interior nodes measurement reliability;
(4) from described set, select reliable measured value to estimate foundation as tracking.
Specifically, k moment prior state probabilities p (x is first obtained k| y 1:k-1), wherein, x krepresent status switch, y krepresent and measure sequence, y 1:krepresent the measurement sequence in 1 to k moment.
Under measurement functions is nonlinear situation, according to bayesian criterion, known by particle filter sequential sampling, posterior probability density function is
p ( x 0 : k | y 1 : k ) = Σ i = 1 N p ω k i δ ( x 0 : k - x 0 : k ( i ) )
Wherein N prepresent population, represent that k moment i-th particle is to x ksample value, represent corresponding weighted value, δ () represents Dirac function.
Known by Bayes' theorem:
p(x 0:k|y 1:k-1)=p(x k|x 0:k-1)p(x 0:k-1|y 1:k-1)
Above formula can be expressed as:
p ( x 0 : k | y 1 : k - 1 )
= p ( x k | x 0 : k - 1 ) Σ i - 1 N p ω k - 1 δ ( x 0 : k - 1 - x 0 : k - 1 ( i ) )
= Σ i - 1 N p ω k - 1 p ( x k ( i ) | x 0 : k - 1 ) δ ( x 0 : k - 1 - x 0 : k - 1 ( i ) )
Prior probability p (x k| y 1:k-1) be p (x 0:k| y 1:k-1) marginal density, i.e. p (x 0:k| y 1:k-1)=∫ ∫ .. ∫ p (x 0:k| y 1:k-1) dx 0dx 1... dx k-1, thus prior state probabilities p (x k| y 1:k-1) can be expressed as
p ( x k | y 1 : k - 1 ) = Σ i = 1 N p ω k - 1 i ( x k | x k - 1 ( i ) )
Do uniform variable motion for maneuvering target, the relation of k moment measured node and maneuvering target can represent with Fig. 2.It is trusted area that definition may detect maneuvering target region, and the node definition in trusted area is trusted node.In figure, dash area represents that maneuvering target is at the possible range of movement of subsequent time, with target speed and estimate factor-related.According to mathematical knowledge, by abstract for the relation of k moment measured node and maneuvering target for being r with radius 1, r 2be θ with angle 1, θ 2fan-shaped relevant, wherein r 1, r 2be respectively node to disembark the possible minimum and ultimate range of moving-target, θ 1, θ 2for node measurement is to the minimum and maximum deflection of maneuvering target.Omnidirectional's sensor signal value and distance dependent.If make θ 1, θ 2value meaningful, then need the set considering whole trusted node, and verify all combinations, amount of calculation can be caused so huge.If only consider radius r 1, r 2, then only need to consider individual node measured value z k,m, only need less amount of calculation.Therefore, the relation of k moment measured node and maneuvering target can abstract be further Fig. 3, only relevant with distance radius, have nothing to do with angle.
The Position And Velocity of k-1 moment maneuvering target is known, and the scope that may occur for measured node k moment maneuvering target is then as shown in Fig. 3 dash area.R 1and r 2the sample value of value and each particle i and measured value and node m relevant, be defined as follows
r 1 , k i , m = | | ( x k - 1 i , y k - 1 i ) - ( locx ( m ) , locy ( m ) ) | | - ζ ns | | ( x · k - 1 i , y · k - 1 i ) | |
r 2 , k i , m = | | ( x k - 1 i , y k - 1 i ) - ( locx ( m ) , locy ( m ) ) | | - ζ ns | | ( x · k - 1 i , y · k - 1 i ) | |
Wherein the estimated coordinates that i-th particle k-1 phase carves target, be the estimating speed that i-th particle k-1 phase carves target, (locx (m), locy (m)) is the coordinate of measured node, ζ nsestimate the factor, ζ ns> 1.
The reliability definition of the signal received by above formula node m is
p ( m ) = ∫ ∫ D m p ( x k | y 1 : k - 1 ) dx k dy k
= Σ i = 1 N s ω k - 1 i Φ ( x k - 1 ( i ) , D m , z k , m )
be defined as follows
From above formula, if think that the measured value that measured node obtains is reliable, then if think that measured value is clutter measured value, and the degree that measured value departs from is larger, less.
The k moment gathers C k={ m|z k, m> η ns, 0 < m < N s, wherein η nsthreshold value, relevant with the investigative range of node.Know from three-point fix, the location that realize maneuvering target needs the measured value of 3 nodes, thus according to formula set of computations C kin the p (m) of all nodes, choose three measured values as locating information foundation according to the size of p (m).
Be not difficult to find, the present invention is on particle filter basis, adopt Bayesian Estimation, obtain prior probability, utilize the position of previous moment, velocity estimation and the estimation factor, obtain each node in investigative range to target farthest and minimum distance, measured value again in conjunction with node itself calculates the corresponding weights of each particle, then weighting obtains the set of scope interior nodes measurement reliability, from this set, select reliable measured value to estimate foundation as tracking, thus can when there is erroneous measurements, select reliable node measurement value as tracking foundation, thus the trail-and-error avoiding mistake measurement to bring or track rejection.

Claims (1)

1., based on a tracking node selecting method for wireless omnidirectional sensor network, it is characterized in that, comprise the following steps:
(1) on the basis of particle filter, prior state probabilities is obtained;
First k moment prior state probabilities p (x is obtained k| y 1:k-1), wherein, x krepresent status switch, y krepresent and measure sequence, y 1:krepresent the measurement sequence in 1 to k moment, under measurement functions is nonlinear situation, according to bayesian criterion, known by particle filter sequential sampling, posterior probability density function is wherein N prepresent population, represent that k moment i-th particle is to x ksample value, represent corresponding weighted value, δ () represents Dirac function, is known by Bayes' theorem: p (x 0:k| y 1:k-1)=p (x k| x 0:k-1) p (x 0:k-1| y 1:k-1), above formula is expressed as:
p(x 0:k|y 1:k-1)
Prior probability p (x k| y 1:k-1) be p (x 0:k| y 1:k-1) marginal density, i.e. p (x 0:k| y 1:k-1)=∫ ∫ .. ∫ p (x 0:k| y 1:k-1) dx 0dx 1... dx k-1, thus prior state probabilities p (x k| y 1:k-1) be expressed as
(2) utilize the position of previous moment, velocity estimation and the estimation factor, obtain each node in investigative range to the maximum distance of target and minimum distance;
Minimum distance
Maximum distance
Wherein the estimated coordinates of i-th particle k-1 moment target, be the estimating speed of i-th particle k-1 moment target, (locx (m), locy (m)) is the coordinate of measured node, ζ nsestimate the factor, ζ ns> 1;
(3) measured value in conjunction with node itself calculates the corresponding weights of each particle, and weighting obtains the set of investigative range interior nodes measurement reliability;
The reliability definition of the signal that node m receives is:
be defined as follows
From above formula, if think that the measured value that measured node obtains is reliable, then if think that measured value is clutter measured value, and the degree that measured value departs from is larger, less, the k moment gathers C k={ m|z k,m> η ns, 0 < m < N s, wherein η nsthreshold value, relevant with the investigative range of node;
(4) from described set, select reliable measured value to estimate foundation as tracking; Know from three-point fix, the location that realize maneuvering target needs the measured value of 3 nodes, thus according to formula set of computations C kin the p (m) of all nodes, choose three measured values as locating information foundation according to the size of p (m).
CN201210112292.9A 2012-04-17 2012-04-17 Tracking node selection method based on wireless all-around sensor network Expired - Fee Related CN102685772B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210112292.9A CN102685772B (en) 2012-04-17 2012-04-17 Tracking node selection method based on wireless all-around sensor network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210112292.9A CN102685772B (en) 2012-04-17 2012-04-17 Tracking node selection method based on wireless all-around sensor network

Publications (2)

Publication Number Publication Date
CN102685772A CN102685772A (en) 2012-09-19
CN102685772B true CN102685772B (en) 2014-12-24

Family

ID=46816999

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210112292.9A Expired - Fee Related CN102685772B (en) 2012-04-17 2012-04-17 Tracking node selection method based on wireless all-around sensor network

Country Status (1)

Country Link
CN (1) CN102685772B (en)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103390107B (en) * 2013-07-24 2016-08-10 深圳大学 A kind of method for tracking target based on dirac weighted sum and Target Tracking System
CN104063615B (en) * 2014-07-03 2017-02-15 深圳大学 Target tracking method and tracking system based on variable coefficient alpha-beta filter
CN105608317B (en) * 2015-12-18 2018-06-26 上海集成电路研发中心有限公司 A kind of digital filter apparatus and method based on linear system
CN106332004A (en) * 2016-08-25 2017-01-11 电子科技大学 Mobile wireless sensor network node localization method based on multipath fading channel
US10694485B2 (en) * 2018-08-15 2020-06-23 GM Global Technology Operations LLC Method and apparatus for correcting multipath offset and determining wireless station locations
CN112197762B (en) * 2020-09-25 2023-05-23 中国直升机设计研究所 Outdoor maneuvering target position estimation method based on o' clock direction

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101102225A (en) * 2007-07-26 2008-01-09 北京航空航天大学 Management method of wireless sensor network nodes
CN101162482A (en) * 2007-11-20 2008-04-16 南京邮电大学 Gauss cooperated based on node and semi-particle filtering method
CN101610567A (en) * 2009-07-10 2009-12-23 华南理工大学 A kind of dynamic group scheduling method based on wireless sensor network
CN102395200A (en) * 2011-11-17 2012-03-28 苏州大学 Node positioning method in wireless sensor network and apparatus thereof

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8179251B2 (en) * 2009-09-30 2012-05-15 Mitsubishi Electric Research Laboratories, Inc. Method and network for determining positions of wireless nodes while minimizing propagation of positioning errors

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101102225A (en) * 2007-07-26 2008-01-09 北京航空航天大学 Management method of wireless sensor network nodes
CN101162482A (en) * 2007-11-20 2008-04-16 南京邮电大学 Gauss cooperated based on node and semi-particle filtering method
CN101610567A (en) * 2009-07-10 2009-12-23 华南理工大学 A kind of dynamic group scheduling method based on wireless sensor network
CN102395200A (en) * 2011-11-17 2012-03-28 苏州大学 Node positioning method in wireless sensor network and apparatus thereof

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
一种基于参考节点选择模型的无线传感器网络定位算法;李敏等;《传感技术学报》;20110228;第24卷(第2期);全文 *
无线传感器网络中目标定位的节点选择策略;邓克波等;《信息与控制》;20090228;第38卷(第1期);正文第1-3节 *

Also Published As

Publication number Publication date
CN102685772A (en) 2012-09-19

Similar Documents

Publication Publication Date Title
CN102685772B (en) Tracking node selection method based on wireless all-around sensor network
Jondhale et al. Kalman filtering framework-based real time target tracking in wireless sensor networks using generalized regression neural networks
US11751057B2 (en) Security-enhanced deep learning fingerprint-based indoor localization
Bokareva et al. Wireless sensor networks for battlefield surveillance
CN105717505B (en) The data correlation method of multiple target tracking is carried out using Sensor Network
US8374624B2 (en) Location measurement method based on predictive filter
CN103729859B (en) A kind of probability nearest neighbor domain multi-object tracking method based on fuzzy clustering
Rahman et al. RSS-based indoor localization algorithm for wireless sensor network using generalized regression neural network
CN105676181B (en) Underwater movement objective Extended Kalman filter tracking based on distributed sensor energy ratio
Khan et al. Localization performance evaluation of extended Kalman filter in wireless sensors network
CN109581281B (en) Moving target positioning method based on arrival time difference and arrival frequency difference
Song et al. Localized approximation method using inertial compensation in WSNs
Gallicchio et al. User movements forecasting by reservoir computing using signal streams produced by mote-class sensors
CN108882171B (en) CSI-based personnel trajectory tracking method
Niu et al. WTrack: HMM-based walk pattern recognition and indoor pedestrian tracking using phone inertial sensors
Guo et al. Passive tracking in heavy clutter with sensor location uncertainty
Gumaida et al. An efficient algorithm for wireless sensor network localization based on hierarchical structure poly-particle swarm optimization
Li et al. Intelligent fusion of information derived from received signal strength and inertial measurements for indoor wireless localization
Ye et al. Local HMM for indoor positioning based on fingerprinting and displacement ranging
Zhou et al. A Robust Detection and Optimization Approach for Delayed Measurements in UWB Particle-Filter-Based Indoor Positioning
Fontaine et al. Transfer Learning for UWB error correction and (N) LOS classification in multiple environments
KR101726677B1 (en) Wireless sensor network device and method for controlling the same
Li et al. An indoor hybrid localization approach based on signal propagation model and fingerprinting
Dong et al. Study of RSSI accuracy for outdoor sensor localization
Wang et al. Robust tracking algorithm for wireless sensor networks based on improved particle filter

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

Granted publication date: 20141224

CF01 Termination of patent right due to non-payment of annual fee