无线传感器网络中用于目标跟踪的节点规划算法

摘要

Considering target tracking problem in Wireless Sensor Networks(WSNs) with limited energy, it is quite necessary to decide which sensors should and how to take part in the tracking process because the quality of data from each sensor is different from each other. A new sensor scheduling algorithm based on leader agent is proposed, which considers communication cost both in data aggregation and in leader agents transition. Error matrix from the tracking process is used to select the optimal sensor set to get the best tracking performance under certain communication constraint. As the constraint optimization problem is very complex, Gauss-Seidel and convex relaxation methods are used to make the problem solvable in a time complexity of O(N3). The experimental results show that the proposed algorithm performs better compared with the reference algorithm under the same communication constraint.%利用无线传感器网络进行目标跟踪时，由于各传感器节点的能量有限，数据蕴含的有效信息又各不相同，因此有必要规划参与目标跟踪的节点集和参与方式，以降低系统开销。本文提出了一种新的基于领导节点的节点规划算法，综合考虑收集数据和领导节点迁移过程中的通信开销，以最大化目标跟踪的性能。求解中以跟踪过程中的误差矩阵作为目标度量，采用高斯-赛德尔(Gauss-Seidel)和凸松弛等方法，使得复杂的带约束优化问题能够在接近O(N3)的时间复杂度内得到求解。仿真结果表明，与对比算法相比，本算法在相同的通信能量约束下能够达到更好的跟踪性能。