 Research
 Open Access
 Published:
An improved target tracking scheme based on MCMPMC method for mobile wireless sensor networks
EURASIP Journal on Wireless Communications and Networking volume 2022, Article number: 74 (2022)
Abstract
Target tracking is crucial to many applications in wireless sensor networks (WSNs). Existing tracking schemes used in WSNs can basically be classified two categories, clustering and predicting. Considering network clustering consumes much energy for limitedenergy WSNs, a predicting target tracking scheme is proposed called MCMPMC (measurement compensationbased mixture population Monte Carlo) which tracks the target based on predicted locations in this work. Adaptive mixture PMC model for generating proposals varying from each iteration is proposed to guarantee sampling diversity. And also, extra measurements or observations generating method is introduced to compensate missed prediction locations or false estimations, avoiding tracking behavior degradation. Firstly, samples drawn from the proposals of next iteration can be generated by a mixture method to avoid sample degeneracy. Secondly, sample weights are jointly computed based on adaptive fusion of compensation measurement and true measurements. Thirdly, HTC method is combined to MCMPMC scheme to decrease energy consumption in WSNs. Then, the proposed method is verified through comprehensive experiments about tracking error, delay and consumption predictions. Moreover, performance comparisons of MCMPMC with other tracking schemes are also proposed.
Introduction
WSNs have been applied to many domains, such as environmental and habitat monitoring, precision agriculture, animal tracking, disaster rescue, military surveillance, the Internet of things, aging healthcare application and almost touch upon all aspects of our life [1,2,3]. Moving target tracking is a representative application of WSNs. Localization and tracking of moving target need to be supported by energy efficiency tracking technology. Although many advantages presented by WSNs, such as cheap, noninfrastructure, largescale, and longterm work, bring new perspective for tracking applications, the intrinsic characteristics of sensor nodes with limited energy, limited computation capacity, limited data process capacity [4], poor reliability, large scale, random distribution, and short communication distance also present great challenges to target tracking in WSNs.
Tracking could be defined as a process in which target states indicated the target position, movement and other kinematic behaviors are estimated through measurements available from various sensors or through establishing coherent relations of targets between successive events. Target tracking for unmanned systems in terrestrial, aerial or underwater environment, such as unmanned aerial vehicle (UAV), unattended air system (UAS) and autonomous underwater vehicle (AUV), mostly utilizes artificial intelligence, positional information collection and environmental understanding [5,6,7], considering 2D or 3D kinematic information [8, 9].
Classical tracking algorithms exist in most applications, such as Bayesian algorithm [10,11,12,13], Kalman filter [14, 15] and CLS algorithm [16]. Most of target tracking used in WSNs can basically be classified into two categories: clustering and predicting [17, 18]. In clustering method, cluster member nodes detect the target and send the data to cluster head node, and then the proximate location or behavior can be fused by cluster head to track the moving targets [19,20,21,22,23,24]. The most prominent characteristic of clustering method is that the network needs maintain coverage and network connectivity. Clustering, routing and connecting usually need to establish a plenty of communication between nodes, which can consume much energy [25]. In predicting method, the states indicated target position, movement and other kinematic behaviors are predicted based on the measurements available from various sensors. Less energy is consumed for predicting method for less communication need to be established between nodes.
There are also some other tracking methods, such as energybased auto regressive neural network [26, 27], deep learning method [28] and genetic algorithm [29]. Considering network clustering consumes much energy for limitedenergy WSNs, a predicting target tracking scheme is proposed in this work, called MCMPMC which tracks the target based on predicted locations. To guarantee the sample diversity, adaptive mixture PMC model for generating proposals varying from each iteration is presented. Supernumerary measurements generating method is introduced to compensate missing predicted locations or false estimations, avoiding tracking behavior degradation. And also, HTC scheme is performed at the beginning of each iteration to obtain the specific 1hop and 2hop neighbors of target or sensor nodes (including normal nodes and anchors), which can dramatically reduce energy consumption and time delay.
The rest of this paper is structured as follows. Section 2 gives a summary of related works and analysis premise of our model. A novel MCMPMC scheme is proposed in Sect. 3, after presenting the original PMC algorithm. Performance analysis models of MCMPMC accompanying with HTC scheme are also presented in Sect. 3. In Sect. 4, accurate analyses and validations of localization error, delay and consumption are presented, and performance comparisons of MCMPMC scheme with other tracking schemes are also proposed. Finally, results and discussion are presented in Sect. 5.
Related works
State and period are estimated based on the Bayesian tracking scheme after determining the sequence of Markovian states maximizing the probability given the measurements and the semihidden Markov model (SHMM) parameters in [11]. A multitarget Bayes filter with the target detection is developed in [12] by applying a method for target detection based on the rulebased track initiation technique, to enhance the capability of the marginal distribution Bayes (MDB) filter and the probability hypothesis density (PHD) filter on target detection.
A new pseudolinear Kalman filter (PLKF) for target tracking in 2Dplane is presented in [14], using AOA (angleofarrival), TDOA (time difference of arrival) and FDOA (frequency difference of arrival) measurements sensed by stationary sensors. A closedform PLKF is developed by rearranging measurement equations to compensate for the nonzero mean of the noise vector. A bias compensation PLKF (BCPLKF) estimator is presented to tackle the bias issue of PLKF, and an instrumental variablebased Kalman filter (IVKF) is presented to alleviate the bias by utilizing BCPLKF estimates instead of noisy measurements to compute the measurement matrix, in which the posterior Cramér–Rao lower bound (PCRLB) is derived for the nonlinear filtering problem. An improved strong tracking Kalman filter algorithm for tracking analysis is proposed in [15], in which a location is identified with the GPS and basic GSM with message setting. This KFbased scheme is outstanding for its realtime behavior.
An enhanced leastsquare algorithm (CLS) based on improved Bayesian scheme BELS is developed in [16] for moving target localization and tracking in WSNs, in which an improved Bayesian algorithm obtains a set of subrange probability based on target predictive locations, and forming a range joint probability matrix. The weight of every measurement is calculated and normalized based on the range probability matrix, and the correction value of the target prediction position is calculated according to the weighted leastsquare algorithm.
A distributed energy optimization method for target tracking is carried out using particle swarm optimization in [30]. This PEETT work is comprised of the estimation phase and prediction phase, in which clustering is performed using the maximum entropy method. And, grid exclusion is used for the coverage of nodes in the network. An IMMbased target tracking in WSN ITTWSN is proposed in [31], which adopts multiple models (velocity and acceleration) to handle both maneuvering and nonmaneuvering targets and multiple sensors to detect and identify the targets. This method can overcome some problems of the KF scheme, such as nonavailability of target data at regular intervals, missing of packets and identifying the target rather than just detecting the target. Energyefficient management approach of target tracking for WSNs is proposed in [32]. After comprehensive analyses of the structure of WSNs and energy consumption sources, two indicators, including target detection probability and tracking accuracy, are combined to be regarded as the constraints of the energy conserving objective function.
An innovative target tracking algorithm that combines learning regression tree approach and filtering methods using the RSSI metric is developed in [33] for the availability and low cost of RSSI.TS fuzzy model identification method based on physical membership function is proposed for maneuvering target tracking [34], separating inputs–outputs system spaces. A physical membership function with interpretability and physical meanings is proposed, and a hyperplaned FSC algorithm is utilized. Then, UKF is used to identify parameters and the physical membership function is used to fuse local models and estimate final states. After simplifying the existing approximate likelihood function where the distribution of the scaling factor is approximated by Gaussian one, a feasible weighting scheme is obtained and a novel particle filtering algorithm (NPFA) is proposed in [35]. A maneuvering target tracking scheme under measurement origin uncertainties is derived based on the approximation and propagation of the target state posterior distribution by combining Bayesian decision theory and suitable hypothesis merging procedures in [36], in which very low levels of track loss rate are obtained even for scenarios with high false alarm probability and trajectories with a high degree of maneuverability.
According to the complexity and uncertainty of the detection environment, a novel MCSMCPHD scheme is proposed in [37], which develops a compensatory measurement generating mechanism and presents a novel measurement compensationbased SMCPHD filter to avoid unreliable clustering. Similar missed detection and corrected strategy for target tracking is involved in [38], in which beta distribution is employed to describe unknown detection probability. And, beta gamma Gaussian inverse Wishart (BGGIW) mixture form accompanying with Poisson multiBernoulli mixture (PMBM) filter (BGGIWPMBM) is developed to enhance tracking behaviors. And also, missed detection problem for target tracking is also concerned in [39], besides the coalescence problem. A novel fusion framework for the Poisson multiBernoulli (PMB) filter based on the arithmetic average (AA) fusion is proposed, in which integrates both the advantages of the TOMB/P filter in dealing with missed detection and the advantages of the MOMB/P filter in dealing with coalescence. Bernoulli components in different multiBernoulli (MB) distributions are associated with each other by Kullback–Leibler divergence (KLD) minimization to fuse the different PMB distributions. The semantic probability hypothesis density (SPHD) filter is introduced in [40] to simultaneously track multiple classes of targets despite measurement uncertainty, including false positive detections, false negative detections, measurement noise and target misclassification.
An improved cardinalized probability hypothesis density (CPHD) filter is developed in [41], to estimate the timevarying target birth cardinality distribution (i.e., probability distribution on number of newborn targets appearing during one sampling time) at each processing step adopting a discrete kernel estimator in conjunction with the exponential weighted moving average scheme. Target birth intensity is updated according to the resulting estimated birth cardinality distribution, and estimated birth intensity and cardinality distribution can be employed by a tracker based on Gaussian mixture CPHD (GMCPHD) to modulate its filtering strength for target tracking.
Inspired by the missed detection and corrected strategy in [38] or compensation strategy [37], an improved MPLC filter accompanied by a measurement compensation scheme is proposed in this work. Original PMC algorithm [42, 43] is presented briefly, with its degradation performance because of its sample generating uncertainty and proposal generating uncertainty. And an adaptive mixture PMC model for generating proposals varying from each iteration is proposed to guarantee the sample diversity. Then, measurement compensation method is introduced to resolve the missed detection. For energyconstrained target tracking in WSNs, either clustering or lots of communication can consume much energy, which is not suitable for WSNs. So, information exchange with small packets exists only at the beginning of each iteration adopting the HTC scheme [44], accompanied by less consecutive communications between nodes or targets. And then, tracking performance, such as tracking error, delay and consumption, especially delay, is presented comprehensively taking parameters such as anchor rate \(\gamma\), node density \(\lambda_{0}\), proposal generating Poisson distribution parameter \(\lambda_{k}\) and location detection probability \(p_{{\text{D}}}\) into account. Moreover, performance comparisons between MCMPMC algorithm and other tracking schemes based on the system parameters, such as BELS [16], PEETT [30], ITTWSN [31] and MCSMCPHD [37]. These comparisons demonstrate that delay of MCMPMC scheme is superior to other predictbased tracking schemes, and the performance of tracking error and consumption also presents the superiority over other schemes when the numbers of mobile nodes and iterations are increased.
The main contributions of this paper are threefold. Firstly, the adaptive mixture PMC model (MPMC), generating proposals according to Poisson process varied from each iteration, is presented to guarantee the sample diversity. Secondly, the supernumerary measurements generating method is introduced to compensate for missing predicted locations or false estimations, avoiding tracking behavior degradation. Finally, the HTC scheme is performed at the beginning of each iteration to obtain the relative locations from specific 1hop and 2hop neighbors of target considered as the target states, which can dramatically reduce energy consumption and time delay.
Proposed tracking method
For limitedenergy WSNs, less computational cost and less complexity method for target tracking is anticipated. And then, communications between nodes or target can consume a lot of energy. So, MPMC scheme accompanying with no clustering and less communication is proposed.
Problem statement
Figure 1 shows target tracking overview in our WSN. Sensors (including normal sensors denoted as \(S\), and anchor sensors denoted as \(A\)) are randomly located \(20\,{\text{m}} \times 20\,{\text{m}}\) indoor area, according to a twodimensional Poisson distribution with a density of \(\lambda_{0}\), in which the ratio of anchors is \(\gamma\). A target, whose path is presented as a solid thick line, moves along with its maneuvering trajectory in WSN deployment area and is detected by sensor nodes (normal sensors or anchors), adopting an acceptable tracking strategy. The target, equipped a recognizable sensor, can also communicate with other sensors in this WSN. Because the clustering algorithm can consume much energy for WSN, the proposed method tracks the target without clustering but through establishing the 1hop and 2hop neighbor lists by HTC scheme [44]. In each sampling interval, nodes including the target can execute HTC algorithm to obtain its 1hop and 2hop neighbors. Each HTC request packet contains node ID, location and current moment. Receiving this request packet, nodes (including the target) can obtain distance information of their 1hop and 2hop neighbors. Consecutive position information obtained from request packet of the specific target is used to obtain the target’s velocity. Location and velocity information can be used for iterative MPMC filter to obtain target tracking. For example, target can obtain its 1hop and 2hop neighbors through performing HTC scheme in iteration \(k\). And then it can derive its relative locations to its neighbors [45]. MPMC filter can derive target tracking adopting \(N_{k}\) proposals within these locations, accompanied by measurements or observations detected by the target in this iteration \(k\).
The tracking environment for our indoor sensor networks is illustrated in Fig. 2. A wireless sensor is made of a transceiver, data processing center, data storage module and battery, in addition to a sensing unit, such as a PIR sensor (to detect the information of a target, equipped in normal sensors and anchors), a Global Positioning System (GPS) receiver (to identify the location of the sensor node equipped in anchor nodes). A target, a tracked object, equips a PIR sensor moving as a normal sensing node. All nodes can move randomly in our test room. Sensor nodes (including normal nodes and anchors) collect the object tracking information and transmit this information to anchor nodes. Simultaneously, location and tracking of the target can also be obtained from the information of its 1hop and 2hop neighbors through executing MCMPMC scheme. In the realistic target tracking scenario, the target is tracked and undergoes occasional maneuvers. That is, target may move with a linear trajectory (straight line or local straight line) and with a maneuver mode (random trajectory) at any time interval.
Maneuvering model
The target state is supposed to \(x_{k}\) at the time \(k\) in the state space \(X\), and the measurement or observation model is supposed to \(m_{k}\) in the measurement or observation space \(M\) under random finite set (RFS) models [37]. Then target state and measurement set can be represented by \(X_{k} \in F(X)\) and \(M_{k} \in F(M),\) respectively. System model and measurement model can be generally described as follows [25, 31]:
where \(x_{k}\) is the state vector at time \(k\) denoted as \(x_{k} = (x_{k} \, \dot{x}_{k} \, y_{k} \, \dot{y}_{k} \, \omega_{k} )^{T}\), \(F_{k}\) is target transition matrix, \(G_{k}\) is control input matrix, and \(q_{k}\) is process noise which follows a Gaussian distribution with zero mean and covariance \(Q_{k}\) defined as \(E[q_{k} q_{k}^{T} ]\). In the state vector representation, \(x_{k}\) and \(y_{k}\) are the states of target position, \(\dot{x}_{k}\) and \(\dot{y}_{k}\) are the states of target velocity, \(\omega_{k}\) is the turn rate. And \(m_{k}\) is the measurement at time \(k\) denoted as \(m_{k} = (x_{k} \, y_{k} \, \omega_{k} )^{T}\), which presents the measurement of position and turn angle of the target, \(H_{k}\) is measurement matrix, and \(v_{k}\) is measurement noise which also follows a Gaussian distribution with zero mean and covariance \(V_{k}\) defined as \(E[v_{k} v_{k}^{T} ]\). The process noise and measurement noise are mutually uncorrelated to each other.
Measurement matrix \(H_{k}\) can be demonstrate the position information of the target in \(x\) and \(y\) directions, which can be presented as,
MCMPMCbased tracking method
And now, an improved predicting method for target trackingbased MCMPMC method is proposed. In generally, both measurements and states of the target are inherent uncertain. According to Bayesian estimation theory, target state posterior probability density \(\pi_{k\left k \right.} (X_{k} \left {M_{1:k} } \right.)\) can be obtained by Bayes recursion as [43]
in which \(f_{{k\left {k  1} \right.}} (X_{k} \left {M_{1:k} } \right.)\) is the state transition density function based on current observations or measurements, \(\pi_{kk  1} (X_{k} \left {M_{1:k} } \right.)\) denotes the target probability density and \(\ell_{k} (M_{k} \left {X_{k} } \right.)\) denotes the target likelihood function, respectively. In many practical applications, the integrals in Bayes recursion of Eqs. 3 and 4 cannot be obtained in closed form or the computational complexity of the integrals grows sharply with samples increasing. So, the approximations should be proposed adopting importance sampling methods.
in which \(p_{{{\text{D}},k}} ({\mathbf{x}})\) is the target detection probability, \(\kappa_{k} (m)\) is the process clutter, \(g_{k} ({\mathbf{x}})\) is the new generating distribution of state samples from the proposals and \(\beta_{kk  1} (x\left y \right.)\) is the spawning distribution of state samples based on measurements.
In this work, an improved target tracking method based on MCMPMC scheme accompanied by HTC algorithm is presented elaborately to approximate or estimate the distribution of target states. PMC filter [43] is a wellknown iterative adaptive importance sampling technique, which is briefly described as follows.
At each iteration \(k\), it generates a set of samples \(\left\{ {{\mathbf{x}}_{k}^{i} } \right\}_{i = 1}^{N}\), where \(i\) denotes the sample index and \({\mathbf{x}}\) denotes the variable of interest which means the object state distribution in our tracking system. That is, sampling or resampling iterates once in each time interval. In order to obtain the samples, PMC algorithm makes use of a collection of proposal densities \(\left\{ {q_{k}^{i} ({\mathbf{x}})} \right\}_{i = 1}^{N}\), with each sample being drawn from a different proposal, \({\mathbf{x}}_{k}^{i} \sim q_{k}^{i} ({\mathbf{x}})\).Then, these samples are assigned an importance weight, respectively, denoted as \(w_{k}^{i} = \frac{{\pi ({\mathbf{x}}_{k}^{i} )}}{{q_{k}^{i} ({\mathbf{x}}_{k}^{i} \left {\mu_{k}^{i} } \right.,{\mathbf{C}}_{i} )}}\), in which \(\pi ({\mathbf{x}}_{k}^{i} )\) is the target posterior density function, \(\mu_{k}^{i}\) is the adaptive parameters of proposal densities in the sampling period \(k\) and \({\mathbf{C}}_{i}\) is the static parameters. After normalizing these importance weights, the unbiased convergent estimator can be obtained,
in which the parameter \(N\) and \(T\) refer to the maximum sample number and the maximum sampling period, respectively. PMC method performs multinomial resampling process by drawing \(N\) independent samples from the discrete probability random measurements, which is denoted as
in which \(\delta ( \cdot )\) is the Dirac delta function. This method proceeds iteratively, building a global importance sampling estimator using different proposals at every iteration. This can partially avoid the sample degeneracy phenomenon. That is, samples with negligible weights or relatively low weights can avoid to be removed directly.
The proposal in each iteration of \(k\), \(q_{k}^{i} ({\mathbf{x}})\), can be formed according to the behaviors of the previous \(q_{k  1}^{i} ({\mathbf{x}})\), or depending on the previous samples \({\mathbf{x}}_{k  1}^{1} ,...,{\mathbf{x}}_{k  1}^{N}\), or the joint dependence on them. To be clear, the relative previous or current locations of the target from its 1hop and 2hop neighbors can be considered as the samples in this locationbased tracking strategy [46]. There is a series of improved PMCbased resampling scheme to predict the variable distribution, such as DMPMC, GRPMC and LRPMC [43]. To avoid the sample degeneracy, deterministic mixture weighting method DMPMC is presented. GRPMC draws multiple samples generated by a proposal or mix band, instead of only one as done in PMC. And LRPMC performs the resampling independently for each proposal. These improved PMC schemes improve the diversity of the population for PMC.
Inspired by the timevarying target birth distribution in [41], an iterationvarying proposal generating scheme is proposed in this work. Moreover, measurement or observation remedy scheme is introduced to correct the missed detection issue. This improved MCMPMC scheme estimates target states, which is presented elaborately as follows.
Step 1 Tracking initialization
In the initial period of \(k = 1\), all nodes in the network, containing the target and sensing nodes (normal nodes and anchors), can establish their 1hop and 2hop neighbor lists (NL) and update these NLs every iteration stage adopting HTC scheme. Suppose that sample generation function of target state distribution can be complied with the Poisson distributions, that is, \(x_{1}^{i} \sim P(\lambda_{1} )\). And then, select the initial parameters defining the \(N\) proposals,
The adaptive parameters \(a_{1} = \left\{ {\lambda_{1}^{1} ,\lambda_{1}^{2} ,...,\lambda_{1}^{N} } \right\}\).
The corresponding set of static parameters, \(\left\{ {{\mathbf{C}}_{i} } \right\}_{i = 1}^{N}\).
The adaptive parameters in \(a_{1}\) are the means of \(E[\lambda_{1}^{i} ]\), which is \(\lambda_{1}^{1} ,\lambda_{1}^{2} ,...,\lambda_{1}^{N}\). And the parameters \(\left\{ {{\mathbf{C}}_{i} } \right\}_{i = 1}^{N}\) are the covariances of \(cov[a_{1}^{i} ]\), which is \(\lambda_{1} ,\lambda_{1} ,...,\lambda_{1}\).
Initial sample candidates generated by initial proposals can be denoted as \(SL_{{ {\text{1hop}}}}\) and \(SL_{{{\text{2hop}}}}\), which refers to locations between target and its 1hop possible neighbors and with 2hop possible neighbors, respectively, which can be seen in [38]. That the target obtains location information used for tracking state establishment can be seen from [39] elaborately.
Step 2 Mixture weighting and predicting
After initialization step, samples of target states \(x_{k}^{i} (i = 1,2,...,N_{k} )\) are generated from the proposals \(q_{k}^{i} ({\mathbf{x}})\) in iteration \(k\) according to the behaviors of the previous \(q_{k  1}^{i} ({\mathbf{x}})\) and measurements \(m_{k}\) of locations at the period \(k\). In PMC scheme, each sample is drawn from a different proposal. An improved DMPMC is proposed in [37], which considers the average of weighted mixture of all proposals around kernel iteration point as the kernel density approximation of target pdf. This simple mixture can mitigate sample degeneracy to a certain extent. But DMPMC brings weighted mixture only through obtaining the mean, without actually taking the sample diversity into account. And also, the minimum mean integrated square error (MISE) estimator is obtained based on the infinity of \(N\) (sample number) [37], while \(N\) is finite in our work.
A prominent feature of PMC method is that not only the number but also the distribution of the proposals in iteration \(k\) can be different from each other, without jeopardizing the validity [36]. Both the weights and component parameters of a mixture importance sampling density are jointly taken into account for MPMC scheme to obtain the adaptive mixture PMC scheme in [47]. The adaption of importance sampling density can be presented as weights combined with component density parameters in MPMC. Inspired from DMPMC and MPMC, a mixture weighting combined with sample generating process and measurement process is proposed in MCMPMC scheme, that is, proposals at the period \(k\) are generated based on the previous samples at the period \((k  1)\) sensed by 1hop and 2hop neighbors of the target and the current measurements \(m_{k}\). And then, the global current samples are generated from these proposals with a mixture weighting. In MCMPMC scheme, samples in iteration \(k\) are drawn from proposals \(q_{k}^{i} ({\mathbf{x}})\), which can be presented as
The proposal can be presented with a distribution of a Poisson process with a parameter \(\lambda_{j} (j = 1,2,...,n_{k} )\), with a probability of \(p_{1} ,p_{2} ,...,p_{{n_{k} }}\), respectively, in which the sum of \(p_{j}\) is 1, that is, \(\sum\nolimits_{j = 1}^{{n_{k} }} {p_{j} } = 1\). That is, several samples are drawn from different proposals with a mixture pattern rather than each sample being drawn from a specific proposal as in PMC. The distribution and the number of the proposals vary from one iteration to another. And then, weights of the mixture PMC can be derived as
in which \(\varphi (q_{k} \left {\lambda_{k} ,{\mathbf{C}}_{k} } \right.)\) is the density of Poisson distribution with mean value \(\lambda_{k}\) and covariance \({\mathbf{C}}_{k}\) at the condition of \({\text{q}}_{k}\) for iteration \(k\). And \({\text{f}}({\mathbf{x}}_{k}^{i} \left {\lambda_{k} ,{\mathbf{C}}_{k} } \right.)\) is the density function of generating samples sensed by 1hop and 2hop neighbors of the target according to the proposals for iteration \(k\). So, the probability distribution of target states can be derived based on the set of \(\{ {\mathbf{x}}_{k  1}^{i} ,{\text{w}}_{k  1}^{i} \}_{i = 1}^{{n_{k} }}\), which is presented as
And then, the probability distribution of target states can be predicted as
in which \({\tilde{\mathbf{x}}}_{{k\left {k  1} \right.}}^{i}\) is obtained according to the proposal distributions \(q_{k}^{i} ({\mathbf{x}})\) and measurements \(m_{k}\) of locations in the period \(k\),
Step 3 Update and resampling
According to updating strategy in Eq. 9 of PMC scheme, target state sample distributions can be updated based on Eq. 15 ~ 16.
in which weights are updated in Eq. 18. Two weight updating parts are contained in Eq. 18, whose first factor is the target weight of undetected probability which is denoted as \(w_{k,c}^{i}\) and the second factor is that of detected probability which is denoted as \(w_{{\text{k,t}}}^{{\text{i}}}\).
When the value of \(p_{{{\text{D}},k}} ({\mathbf{x}})\), shown in Eq. 18, is not equal to 1, that is, the target may not be detected in iteration \(k\) with the probability of \((1  p_{{{\text{D}},k}} ({\mathbf{x}}))\). \(p(S_{1} \left {x_{k}^{i} } \right.)\) and \(p(S_{2} \left {x_{k}^{i} } \right.)\) refers to the probability of state sample within in 1hop and 2hop area of target, respectively, which is used to obtain the target distribution. Target states may be falsely estimated under undetected occasions, especially for the smaller value of \(p_{{{\text{D}},k}}\). The undetected target can increase tracking time and tracking energy, and consequently result in poor tracking performance.
Comprehensive analyses for tracking performance degradation because of undetected target were proposed in [38], and the number of measurements is increased to resolve this undetected target problem as related, called as measurement compensatory MPMC (MCMPMC) method.
The predicted state estimation of \(\hat{X}_{k,p}\) and its measurement set \(\hat{M}_{k  1,p}\) can be computed by Eqs. 23 and 24, based on \(\hat{X}_{k  1,t}\) and process noise and measurement noise.
Target is detected successfully meaning that one of predicted measurement \(\hat{M}_{k,p}\) (footnote \(p\) denotes prediction) is very close to the true measurement \(M_{k,t}\) (footnote \(t\) denotes true), which is detected by anchors or normal sensors for the location or state information.
in which \(N_{t}\) is the number of true measurements \(M_{k,t}\), \(\gamma_{th}\) is a threshold and \({\text{P}}_{k}\) is called as Prediction covariance.
Compensatory measurement set can be computed according to Eqs. 23–26.
The missing detection weight of \(w_{k,c}^{i}\) in Eq. 20 can be rewritten as Eq. 27, which is the compensatory weight of \(\tilde{x}_{k,c}^{i}\).
in which \(N_{c}\) is the number of compensatory measurements \(\overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\frown}$}}{M}_{{\text{k,c}}}\). And then, the predicted weight of Eq. 18 can be computed as follows:
Step 4 Target state estimations
And then, the estimations of target states are computed according to true measurements and compensatory measurements as Eq. 26,
Mixture weights can present more valid estimators with less variance, which improve the diversity of the population of PMC algorithm. Also, the whole mixture of observations can match well with the targets than each observation separately.
At each time interval, state error can be obtained from Eq. 27 referred from [45], in which \(x_{k}^{iest}\) is the estimated state and \(x_{k}^{i}\) is the actual one, which are the distances between target and sensors.
Tracking delay is also an important character in our timecritical tracking system, and we always attempt to improve the behavior of delay in order to obtain the realtime monitoring and tracking. In MCMPMC scheme, delay contains two parts \(T_{k}^{{j({\text{HTC}})}}\) and \(T_{k}^{{j({\text{MCMPMC}})}}\). The estimation of time delay in communication can be referred as [48],
Tracking consumption is the most important metric in energyconstrained WSNs. Average cost can be presented in two parts \(E_{k}^{{i({\text{HTC}})}}\) and \(E_{k}^{{i({\text{MCMPMC}})}}\), which refers to the cost of performing HTC scheme and MCMPMC scheme in iteration, respectively.
Simulation results
In this section, extensive simulations are presented to validate the accuracy of MCMPMC method, which are derived based on different parameters such as detection probability \(P_{{\text{D}}}\), anchors’ ratio \(\gamma\), node density \(\lambda_{0}\), adaptive sample number \(N_{k}\) etc., using NS2 simulator according to previous analyses. Simulation setup is similar to that of PMCL, following each data package exchange means as [49].
The target is assumed to move in the twodimensional scenario (0, 20) × (0, 20) m^{2} for 100 sampling period, with three true maneuvering trajectories. Target moving velocity \(v\) plays an important role in target tracking performance, and higher velocity brings performance degradation of tracking. The maximum velocity is set 6 m/s. The sensor’s sampling period is set to 1 s.
And also, performance comparisons between MCMPMC method and other tracking schemes, such as BELS [16], PEETT [30], ITTWSN [31] and MCSMCPHD [37], are proposed. Communication and computation parameters for all these schemes are similarly set as shown in Table 1, and simulation scenes are set to the similar installation.
True target trajectories in this test are shown in Fig. 3, maneuvering trajectories including straightline trajectories and crossover trajectories. It is worth noting that the relationship of \(N_{k}\) with the sum of \(N_{c}\) and \(N_{t}\) plays an important role in tracking behaviors. That is, if the sum of \(N_{c}\) and \(N_{t}\) is larger than \(N_{k}\), there are not enough samples to participate in tracking, leading to once more iterations and then more delay or energy. While the sum of \(N_{c}\) and \(N_{t}\) is smaller than \(N_{k}\), there are some remaining samples to be selected.
Target tracking error
Tracking accuracy is an important performance for obtaining the target in WSNs. As related in Sect. 3.3, tracking error in MCMPMC is mostly related to sample number \(N_{k}\) in iteration \(k\), node density \(\lambda_{0}^{{}}\), detected probability \(p_{{\text{D}}}\), iteration period \(K\), and anchor rate \(\gamma\), which is shown in Eq. 33. With node density \(\lambda_{0}\) increasing, tracking error decreases shown in Fig. 4a–c. All predicted locations are detected and correctly managed, and it can obtain higher tracking accuracy.
Nodes, concluding anchors and target, are assumed to locate randomly uniformly over indoor room according to Poisson distribution with a density of \(\lambda_{0}\), and all nodes can move in maneuvering mode. The number of \(N_{k}\) is less than the sum of \(N_{c}\) and \(N_{t}\), which leads to tracking participated samples less than the sum of true samples and compensation samples. And so, actual samples are not enough to exact tracking the target, which leads to much error such as \(N_{k} = 30\) and \(N_{k} = 50\) in Fig. 4d–f. With the increasing of \(p_{{\text{D}}}\), error decreases much. And with normal nodes increasing, the samples observed by known anchors increases, leading to more accuracy shown in Fig. 4a, b. And when \(\lambda > 0.06\), error can reach stable values.
Tracking error for line part of trajectory 2 is less than that of maneuvering trajectory for predicted computation increasing, as shown in Fig. 4a–f. With the increasing of iteration, the error decreases. Proposal generating distribution for each iteration follows Poisson process, and \(\lambda_{k}\) of iteration period \(k\) is adaptive with each other.
Localization delay
Delay is also an important character in tracking system, especially for our timecritical system. And we always attempt to improve the behavior of delay in order to obtain the realtime monitoring.
With node density \(\lambda_{0}\) increasing, tracking delay decreases as shown in Fig. 5a–c. With the number of normal nodes increasing, the target can contact its 1hop and 2hop neighbors with higher probability to establish HTL which contains tracking samples. And also, the target needs to redetect the relative location when \(p_{{\text{D}}}\) is low, which consumes much time such as \(p_{{\text{D}}} = 0.8\) and \(p_{{\text{D}}} = 0.9\). With the increasing of \(\lambda_{0}\), delay decreases for \(p_{{\text{D}}} = 0.8\) and \(p_{{\text{D}}} = 0.9\), while delay increases for \(p_{{\text{D}}} = 0.96\) and \(p_{D} = 1\) when \(\lambda_{0} > 0.06\), especially for trajectory 2 and trajectory 3 shown in Fig. 5b, c. Detected samples carry enough information for tracking the target, and lots of remained samples are required to be processed, which consumes much extra time. More valid samples of target states exchange sensed target location and moving information, more time consumes.
With the iteration increasing at \(k \le 60\), delay increases sharply while increases slowly for \(k > 60\). Delay maintains at a relatively high stable value at iteration 80 when \(N_{k}\) is more than 60. The preset of \(N_{k}\) is higher, delay will be lower as regular, but delay is higher at \(N_{k} > 60\) when iteration period is higher than 80, as shown in Fig. 5d–f.
Localization consumptions
In most analyses of tracking consumption, computational cost and communication cost are both taken into account for energylimited WSNs [50, 51], which include energy consumption for performing HTC scheme and MCMPMC scheme. Nodes obtain their HTLs through transmitting small packages of HTC Pair Request, HTC Information Exchange, HTC Information Notification and HTC information Confirmation. These small package exchanges can consume some relatively low energy. Besides these small package exchanging, MCMPMC cost small computational energy for its computation of missing detection and its correction.
With node density \(\lambda\) increasing, localization consumption decreases shown in Fig. 6a–f. Cost is a stable value for anchor rate \(\lambda_{0} > 0.07\) for trajectory 1, while increases again for \(\lambda_{0} > 0.06\) as trajectory 2 and 3 shown in Fig. 6a–c. Maneuvering mode involves the randomly turn, which brings nodes much sensing energy and identifying energy.
And also, localization consumption decreases with the iteration \(N_{k}\) increasing. Energy consumed for \(N_{k} = 30\) is lower than that of \(N_{k} = 50\). Similar to delay, energy consumption decreases for \(p_{{\text{D}}} = 0.8\) and \(p_{{\text{D}}} = 0.9\) the increasing of \(\lambda_{0}\), while energy consumption increases for \(p_{{\text{D}}} = 0.96\) and \(p_{{\text{D}}} = 1\) when \(\lambda_{0} > 0.06\), especially for trajectory 2 and trajectory 3, as shown in Fig. 6b, c.
Tracking performance such as accuracy, delay and consumption depends on the network parameters such as detection probability \(p_{{\text{D}}}\) and samples \(N_{k}\) for a great extent, and node density \(\lambda_{0}\) and anchor rate \(\gamma\) likewise. With increasing detection probability \(p_{{\text{D}}}\), the target identification probability increases. And also, the increasing number of nodes including anchors can bring about more samples, avoiding low weighted samples fading away. But too many nodes or too many samples can also lead to inferior performance for too much information sensed by samples need to be fused and exchanged, leading to much energy and delay cost.
Performance comparisons
Experiment results shown above are comprehensive for applications, and we can present that MCMPMC scheme can bring about expectant behaviors for our target tracking. And also, we can compare the performance metrics of MCMPMC mechanism with those of other target tracking schemes, such as BELS [16], PEETT [30], ITTWSN [31] and MCSMCPHD [37].
BELS [16] is based on improved Bayesian scheme and enhanced leastsquare (CLS) algorithm. Subrange probability is obtained based on target predictive location, forming a range joint probability matrix which is updated in a dormant state in order to save energy in WSNs. The main energysaving strategies in BELS scheme conclude that it introduces a geometric model to localize and track the target and fuses the distribution and true attributes of the measurement data to form a range joint probability matrix. BELS improves the tracking performance of delay and energy.
PEETT [30] adopts particle swarm optimization, comprising of estimation and prediction phase. It is a clusteringbased target tracking scheme, which performs clustering by adopting the maximum entropy method. PEETT scheme costs much energy on clustering.
An IMM based target tracking in WSN ITTWSN is proposed in [31], which adopts multiple models (velocity and acceleration) to handle both maneuvering and nonmaneuvering targets and multiple sensors to detect and identify the targets. This tracking scheme overcomes the problem of location error and missing detection, and saves much energy.
MCSMCPHD scheme [37], SMCPHD denoted in simulation Figs. 7, 8 and 9, develops a compensatory measurement generating mechanism and presents a novel measurement compensationbased SMCPHD filter to track target, avoiding unreliable clustering. This is a highefficiency target tracking scheme, not applying to track the target for WSNs. We can attempt to apply this scheme in WSNs, and derive that this tracking scheme has the same highefficiency tracking.
MCMPMC scheme is used for timecritical, low mobile velocity monitoring and detection application, in which minimized delay is the most important target, and localization accuracy likewise. Delay performance metrics of MCMPMC scheme accompanying with HTC algorithm are improved over other schemes, while error and energy efficiency are improved over others on the conditions of more node density and more iterations.
Through tracking comparisons as shown in Fig. 7a–c, we can obtain that these tracking schemes can exactly track the target. Some errors appear when tracking the beginning. Most tracking positions of tracking schemes are in accordance with target true positions, and the most error within 5.1%11.5%.
Tracking error comparisons are shown in Fig. 8a–f. With node density \(\lambda_{0}\) increasing, tracking error decreases. And tracking error of SMCPHD is higher than that of MCMPLC when \(\lambda_{0} > 0.03\) for trajectory 1, \(\lambda_{0} > 0.04\) for trajectory 2. With iteration periods increasing, tracking error decreases.
Tracking delay comparisons are shown in Fig. 9a–f. With node density \(\lambda_{0}\) increasing, tracking delay decreases. But delay increases for MCMPMC scheme when \(\lambda_{0} > 0.06\) shown in Fig. 9a, for much valid information sensed by nodes including anchors exchanges. Valid samples are enough to predict the states of target, and redundant samples sensing can consume much energy and time. With iteration periods increasing, tracking delay increases.
Tracking energy consumption comparisons are shown in Fig. 10a–f. With node density \(\lambda_{0}\) increasing, tracking consumption decreases. But energy consumption increases for MCMPMC scheme when \(\lambda_{0} > 0.06\) shown in Fig. 10a–c, for the same reason of delay increasing as Fig. 9a. With iteration periods increasing, tracking error decreases.
Results and discussion
In this paper, we have presented a predictionbased target tracking scheme MCMPMC for mobile sensor networks, accompanied by an HTC algorithm. At first, the original statistical PMC scheme is denoted briefly. Then, an improved locationbased tracking scheme adopted MPMC scheme is elaborately proposed, combined with a measurement compensation strategy to resolve the problem of missing detection or false measurement. Firstly, the mixture weighted method used for proposal generating is introduced to avoid sample degeneracy and maintain the diversity of samples. Secondly, inspired by the missing detection or correction of MCSMCPHD scheme, a measurement compensation method is proposed to enhance the tracking performance. Thirdly, the HTC scheme is introduced to decrease the communication cost and delay for exchanging tracking information with small packages at the beginning of each iteration. Tracking performance such as tracking error, delay and consumption, especial delay, is presented based on the statistical point of view taking parameters such as anchor rate \(\gamma\), node density \(\lambda_{0}\), mixture nodes \(N_{k}\) and detected probability \(p_{{\text{D}}}\) into account. Comprehensive simulations are presented to verify the behaviors based on the straightline trajectory and maneuvering trajectory. Moreover, performance comparisons between MCMPMC algorithm and other tracking schemes are made.
Multiple target tracking used for largescale crab aquaculture sensor networks is studied in the future based on the MCMPMC scheme. In aquaculture networks, the tracking scheme can take not only the positions of objects into account as in this work, but also take the appearance of objects into account in future works [52]. We can also apply MCMPMC tracking method to track other aquatic products underwater.
Availability of data and materials
All data generated or analyzed during this study are included in this published article.
Abbreviations
 MCMPMC:

Measurement compensation mixture population Monte Carlo
 WSNs:

Wireless sensor networks
 HTC:

Hidden terminal couple
 UAV:

Unmanned aerial vehicle
 UAS:

Unattended air system
 AUV:

Autonomous underwater vehicle
 CLS:

Classical least square
 SHMM:

Semihidden Markov model
 MDB:

Marginal distribution Bayes
 PHD:

Probability hypothesis density
 PLKF:

Pseudolinear Kalman filter
 AOA:

Angle of arrival
 TDOA:

Time difference of arrival
 FDOA:

Frequency difference of arrival
 IVKF:

Instrumental variablebased Kalman filter
 PEETT:

Particle energyefficient target tracking
 ITTWSN:

IMMbased target tracking in WSN
 NPFA:

Novel particle filtering algorithm
 BGGIW:

Beta gamma Gaussian inverse Wishart
 PMBM:

Poisson multiBernoulli mixture
 KLD:

Kullback–Leibler divergence
 SPHD:

Semantic probability hypothesis density
 CPHD:

Cardinalized probability hypothesis density
References
W.Z. Guo, N.X. Xiong, H.C. Chao, S. Hussain, G.L. Chen, Design and analysis of selfadapted task scheduling strategies in wireless sensor networks. Sensors. 11(7), 6533–6554 (2011)
Y. Lu, S.Q. Wu, Z.J. Fang, N.X. Xiong, S. Yoon, D.S. Park, Exploring finger vein based personal authentication for secure IoT. Future Gener. Comput. Syst. 77, 149–160 (2017)
Y.L. Yao, N.X. Xiong, J.H. Park, L. Ma, J.F. Liu, Privacypreserving max/min query in twotiered wireless sensor networks. Comput. Math. Appl. 65(9), 1318–1325 (2013)
H.J. Cheng, Z. Xie, Y.S. Shi, N.X. Xiong, Multistep data prediction in wireless sensor networks based on onedimensional CNN and bidirectional LSTM. IEEE Access. 7, 117883–117896 (2019)
M. Kumar, S. Mondal, Recent developments on target tracking problems: a review. Ocean Eng. 236(15), 1–20 (2021)
A.I. Hentati, L.C. Fouratia, J. Rezgui, Cooperative UAVs framework for Mobile Target Search and tracking. Comput. Electr. Eng. 101, 1–13 (2022)
J. Kim, Hybrid TOA–DOA techniques for maneuvering underwater target tracking using the sensor nodes on the sea surface. Ocean Eng. 242(15), 1–6 (2021)
Y. Wang, Y.L. Bai, X.G. Wang, Y.Z. Shan, Y.T. Shui, N.G. Cui, Y. Li, Eventbased distributed bias compensation pseudomeasurement information filter for 3D bearingonly target tracking. Aerosp. Sci. Technol. 117, 1–9 (2021)
M. Ebrahimi, M. Ardeshiri, S.A. Khanghah, Bearingonly 2D maneuvering target tracking using smart interacting multiple model filter. Digit. Signal Process.. 126(30), 1–10 (2022)
A. Dhital, P. Closas, C. FernándezPrades, Bayesian filtering for indoor localization and tracking in wireless sensor networks. EURASIP J. Wirel. Commun. Netw. 19, 1–14 (2012)
E. Ozatay, U. Ozguner, D. Filev, J. Michelini, Bayesian traffic light parameter tracking based on semihidden Markov models. IEEE Trans. Intell. Transp. Syst. 17(11), 2998–3008 (2016)
Z.X. Liu, Y.N. Zou, W.X. Xie, L.Q. Li, Multitarget Bayes filter with the target detection. Signal Process. 140, 69–76 (2017)
H.B. Zhang, J.J. Liu, A.C. Pang, A Bayesian network model for data losses and faults in medical body sensor networks. Comput. Netw. 143(9), 166–175 (2018)
J.Q. Liu, G. Guo, Pseudolinear Kalman filters for target tracking using hybrid measurements. Signal Process. 188, 1–23 (2021)
K.M. Alaaudeen, T. Aruna, G. Ananthi, An improved strong tracking Kalman filter algorithm for realtime vehicle tracking. Mater. Today Proc.. 664, 931–939 (2022)
T. Wang, X. Wang, W. Shi, Z.M. Zhao, Z.X. He, T.S. Xia, Target localization and tracking based on improved Bayesian enhanced leastsquares algorithm in wireless sensor networks. Comput. Netw. 167(11), 1–16 (2020)
N.Q. Thu, T.Q. Vinh, N.T. Quan, A lowlatency communication protocol for target tracking in wireless sensor networks. EURASIP J. Wirel. Commun. Netw. 33, 1–15 (2016)
A.A. Doavi, B.H. Parvan, Methods for target tracking in sensor networks with energyefficient approach. Int. J. Comput. Sci. Netw. Solut. 2(10), 8–20 (2014)
F. Delavernhe, C. Lersteau, A. Rossi, M. Sevaux, Robust scheduling for target tracking using wireless sensor networks. Comput. Oper. Res. 116, 1–14 (2020)
Z.B. Wang, W. Lou, Z. Wang, J.C. Ma, H.L. Chen, A novel mobility management scheme for target tracking in clusterbased sensor networks. Distrib Comput. Sens. Syst. 2010, 172–186 (2010)
P.M. Yan, S.B. Yao, Q.Y. Zhu, T. Zhang, W.N. Cui, Realtime detection and tracking of infrared small targets based on grid fast density peaks searching and improved KCF. Infrared Phys. Technol. 123, 1–6 (2022)
C. Lersteau, A. Rossi, M. Sevaux, Minimum energy target tracking with coverage guarantee in wireless sensor networks. Eur. J. Oper. Res. 265, 882–894 (2018)
A.M. Khedr, W. Osamy, Effective target tracking mechanism in a selforganizing wireless sensor network. J. Parallel Distrib. Comput. 71(10), 1318–1326 (2011)
H. Mahboubi, W. Masoudimansour, A.G. Aghdam, C. SayrafianPour, Maximum lifetime strategy for target monitoring with controlled node mobility in sensor networks with obstacles. IEEE Trans. Autom. Control 61(11), 3493–3508 (2016)
X.M. Wang, Q.L. Li, N.X. Xiong, Y. Pan, Ant colony optimizationbased locationaware routing for wireless sensor networks, in International Conference on Wireless Algorithms, Systems, and Applications (2008), pp. 109–120
J. Munjani, M. Joshi, A nonconventional lightweight auto regressive neural network for accurate and energy efficient target tracking in wireless sensor network. ISA Trans. 115, 12–31 (2021)
C. Gao, J.K. Yan, S.H. Zhou, P.K. Varshney, Long shortterm memorybased deep recurrent neural networks for target tracking. Inf. Sci. 502(10), 279–296 (2019)
Y.Q. Cui, Y. He, T.T. Tang, Y. Liu, A new target tracking filter based on deep learning. Chin. J. Aeronaut. 35(5), 11–24 (2022)
Y. Jiang, G.X. Tong, H.N. Yin, N.X. Xiong, A pedestrian detection method based on genetic algorithm for optimize XGBoost training parameters. IEEE Access. 7, 118310–118321 (2019)
J.R. Parvin, C. Vasanthanayaki, Particle swarm optimizationbased energy efficient target tracking in WSNs. Measurement 147, 1–8 (2019)
S. Vsauhi, V. Vaidehi, Target tracking using interactive multiple model for wireless sensor network. Inf. Fusion 27, 41–53 (2016)
C. Peng, G.G. Xu, G.L. Shan, Y.P. Zhang, A new energy efficient management approach for wireless sensor networks in target tracking. Def. Technol. 17(3), 932–947 (2021)
H. Ahmadi, F. Viani, R. Bouallegue, An accurate prediction method for moving target localization and tracking in wireless sensor networks. Ad Hoc Netw. 70(1), 14–22 (2018)
L.Y. Meng, L.Q. Li, Maneuvering target tracking using TS fuzzy model of physical membership function. Arab. J. Sci. Eng. 47(3), 3889–3898 (2022)
X. Zhang, Z.B. Yan, Y.Q. Chen, Y.H. Yuan, A novel particle filter for extended target tracking with random hypersurface model. Appl. Comput. 425(15), 1–13 (2022)
M.L. De Souzaa, A.G. Guimarães, E.L. Pinto, A novel algorithm for tracking a maneuvering target in clutter. Digit. Signal Process. 126(30), 1–10 (2022)
C.A. Xu, L.B. Yao, Y. Liu, H. Su, H.Y. Wang, X.Q. Gu, A novel SMCPHD filter for multitarget tracking without clustering. Displays 71, 1–7 (2022)
S.Y. Wu, Y.S. Zhou, Y. Xie, Q.T. Xue, Robust Poisson multiBernoulli mixture filter using adaptive birth distributions for extended targets. Digit. Signal Process. 126(6), 1–15 (2022)
Z.Z. Su, H.B. Ji, C. Tian, Y.Q. Zhang, A robust Poisson multiBernoulli filter for multitarget tracking based on arithmetic average fusion. Chin. J. Aeronaut. 5, 1–12 (2022)
J. Chen, Z.T. Xie, P. Dames, The semantic PHD filter for multiclass target tracking: From theory to practice. Robot. Auton. Syst. 149, 1–14 (2022)
Q. Huang, L. Xie, H.Y. Su, Estimations of timevarying birth cardinality distribution and birth intensity in Gaussian mixture CPHD filter for multitarget tracking. Signal Process. 190(1), 1–20 (2022)
O. Cappé, A. Guillin, J.M. Marin, C.P. Robert, Population Monte Carlo. J. Comput. Graph. Stat. 13(4), 907–929 (2004)
V. Elvia, L. Martino, D. Luengo, M.F. Bugallo, Improving population Monte Carlo: alternative weighting and resampling schemes. Signal Process. 131, 77–91 (2017)
J.P. Zhu, C.F. Lv, Z.S. Tao, Performance analyses and improvements for IEEE 802.15.4 CSMA/CA scheme in wireless multihop sensor networks based on HTC algorithm. Int. J. Distrib. Sens. Netw. 2013, 1–21 (2013)
C.F. Lv, J.P. Zhu, Z.S. Tao, An improved localization scheme based on PMCL method for largescale mobile wireless aquaculture sensor networks. Arab. J. Sci. Eng. 2018, 1–20 (2018)
A.G. Chekol, M.S. Fufa, A survey on next location prediction techniques, applications, and challenges. EURASIP J. Wirel. Commun. Netw. 29, 1–24 (2022)
O. Cappé, R. Douc, A. Guillin, J.M. Marin, C.P. Robert, Adaptive importance sampling in general mixture classes. Stat. Comput. 18, 447–459 (2008)
G.Q. Xu, H.P. Bai, J. Xing, T. Luo, N.X. Xiong, X.C. Cheng, S.Y. Liu, X. Zheng, SGPBFT: a secure and highly efficient distributed blockchain PBFT consensus algorithm for intelligent Internet of vehicles. J. Parallel Distrib. Comput. 164, 1–11 (2022)
F. Xia, R.N. Hao, J. Li, N.X. Xiong, L.T. Yang, Y. Zhang, Adaptive GTS allocation in IEEE 802.15.4 for realtime wireless sensor networks. J. Syst. Archit. 59(10), 1231–1242 (2013)
C. Lin, Y.X. He, N.X. Xiong, An energyefficient dynamic power management in wireless sensor networks, in 2006 Fifth International Symposium on Parallel and Distributed Computing (2006), pp. 1–7
R. Wan, N. Xiong, An energyefficient sleep scheduling mechanism with similarity measure for wireless sensor networks. HCIS 8(1), 1–22 (2018)
Y.Z. Zhou, Y.X. Zhang, H. Liu, N.X. Xiong, A.V. Vasilakos, A baremetal and asymmetric partitioning approach to client virtualization. IEEE Trans. Serv. Comput. 7(1), 40–53 (2012)
Acknowledgements
This research work is supported by the National Natural Science Foundation of China (No.61362017, No.61365007) and Starting Foundation of Shanghai Ocean University (No. A2020300100344, No. A2020300100343).
Funding
This research work is supported by the National Natural Science Foundation of China (No.61362017, No.61365007) and Starting Foundation of Shanghai Ocean University (No. A2020300100344, No. A2020300100343).
Author information
Authors and Affiliations
Contributions
CL carried out the MCMPMC tracking scheme, accompanied by HTC transmission scheme, and helped to draft the manuscript. JZ carried out most of the simulation experiments. ZT carried out the defects of original tracking scheme and drafted the manuscript. YP took part in experimental platform establishment and project inspection throughout the work. All authors contributed to the work. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Lv, C., Zhu, J., Tao, Z. et al. An improved target tracking scheme based on MCMPMC method for mobile wireless sensor networks. J Wireless Com Network 2022, 74 (2022). https://doi.org/10.1186/s13638022021588
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13638022021588
Keywords
 Target tracking
 WSNs
 MCMPMC scheme
 HTC scheme
 Tracking delay