5 June 2018 in Proceedings of the IEEE
In this paper, an overview of recent developments in received-signal-strength (RSS)-based localization in wireless sensor networks is presented. Several important practical issues and their solutions are discussed. To save communication bandwidth and sensor energy, a maximum-likelihood estimator based on quantized data is presented along with its corresponding Cramér.Rao lower bound (CRLB) and optimal quantizer design schemes. For further system resource savings, an iterative sensor selection approach is presented to activate only the most informative sensors, by maximizing the mutual information or minimizing the posterior CRLB at each iteration. For a resource constrained WSN with imperfect wireless channels, channel-aware target localization is described, where the channel model is incorporated into the localization scheme itself, thereby improving performance without increasing communication overhead. Another practical issue involving the presence of malicious sensors called Byzantines is discussed and mitigation schemes are provided. A recent coding-theory-based approach which is both computationally inexpensive and robust to such malicious attacks is also discussed.
12 February 2018 in IEEE Transactions on Aerospace and Electronic Systems
In this paper, we propose a few sparsity-promoting approaches for sensor selection in wireless sensor networks (WSNs) to reach the optimal tradeoff between the tracking performance and the sensing-communication cost. The proposed framework is valid for general nonlinear target tracking without explicit linearization and not restricted to any specific estimator. We formulate the sensor selection problem as the design of a sparse selection vector. The cardinality of the selection vector is added as a sparsity-promoting penalty term to the cost function where the conditional posterior Cramér-Rao lower bound is used as the criterion for sensor selection. To cope with large-scale WSNs, by combining iterative reweighted ℓ 1 -norm minimization with the accelerated proximal gradient method and the alternating direction method of multipliers (ADMM), we develop two efficient sensor selection algorithms, respectively. We further develop a low-complexity distributed version of the ADMM where each sensor makes a local sensor selection decision. We test the proposed algorithms by simulations based on an extended Kalman filter using analog data and a particle filter using quantized data, respectively, which provide valuable insights and demonstrate the proposed algorithms' performance.
20 June 2024 in IEEE Transactions on Signal Processing
In this paper, to reduce the time and manpower to fine-tune an extended Kalman filter (EKF), we propose a new learning framework, EKFNet, for automatically estimating the best process and measurement noise covariance parameters for an EKF from real measurement data. The EKFNet is trained end-to-end by using backpropagation through time (BPTT) over the EKF. The forward operation of EKFNet is the same as the normal EKF operation which will be used during the tracking process. During the offline training, the EKFNet uses the BPTT for passing the gradient flow to each time step and optimizing the unknown noise statistic parameters. The proposed method can choose among several optimization criteria, such as maximizing the likelihood, minimizing the measurement residual error, or minimizing the posterior state estimation error either with or without the ground truth data. The proposed method’s performance is demonstrated using real GPS data, which outperforms an existing method and a manually tuned EKF.