Energy-efficient adaptive sensor scheduling for target tracking in wireless sensor networks

Sensor scheduling is essential to collaborative target tracking in wireless sensor networks (WSNs). In the existing works for target tracking in WSNs, such as the information-driven sensor query (IDSQ), the tasking sensors are scheduled to maximize the information gain while minimizing the resource cost based on the uniform sampling intervals, ignoring the changing of the target dynamics and the specific desirable tracking goals. This paper proposes a novel energyefficient adaptive sensor scheduling approach that jointly selects tasking sensors and determines their associated sampling intervals according to the predicted tracking accuracy and tracking energy cost. At each time step, the sensors are scheduled in alternative tracking mode, namely, the fast tracking mode with smallest sampling interval or the tracking maintenance mode with larger sampling interval, according to a specified tracking error threshold. The approach employs an extended Kalman filter (EKF)-based estimation technique to predict the tracking accuracy and adopts an energy consumption model to predict the energy cost. Simulation results demonstrate that, compared to a non-adaptive sensor scheduling approach, the proposed approach can save energy cost significantly without degrading the tracking accuracy.     

面向目标跟踪的传感器网络睡眠调度协议

移动目标跟踪是无线传感器网络中的一项重要应用,将睡眠调度机制引入到目标跟踪算法中可以大大降低能耗。针对目标跟踪的实际需求,提出一种面向目标跟踪的传感器网络睡眠调度协议。根据目标跟踪不同阶段,分别设计了目标跟踪前和跟踪过程中传感器节点的睡眠调度机制;另外给出了目标丢失时,如何唤醒节点继续跟踪目标的调度策略。结果表明:该算法能够在保证跟踪质量的同时,降低跟踪能耗。     

Novel sensor scheduling and energy-efficient quantization for tracking target in wireless sensor networks

This paper focuses on sensor scheduling and information quantization issues for target tracking in wireless sensor networks (WSNs). To reduce the energy consumption of WSNs, it is essential and effective to select the next tasking sensor and quantize the WSNs data. In existing works, sensor scheduling’ goals include maximizing tracking accuracy and minimizing energy cost. In this paper, the integration of sensor scheduling and quantization technology is used to balance the tradeoff between tracking accuracy and energy consumption. The main characteristic of the proposed schemes includes a novel filtering process of scheduling scheme, and a compressed quantized algorithm for extended Kalman filter (EKF). To make the algorithms more efficient, the proposed platform employs a method of decreasing the threshold of sampling intervals to reduce the execution time of all operations. A real tracking system platform for testing the novel sensor scheduling and the quantization scheme is developed. Energy consumption and tracking accuracy of the platform under different schemes are compared finally.     

一种基于无线传感器网络的分布式处理目标跟踪系统

系统使用超声波传感器和扩展卡尔曼滤波对无线传感器网络中的移动单目标进行定位跟踪.节点嵌入式应用程序采用TinyOS/nesC[1]编程实现,采用Labview进行应用层开发.为了优化网络的能耗以延长网络寿命,提出了两种在分布式传感器网络中局部节点自适应选择任务节点[2]的方法.实验结果验证了扩展卡尔曼算法的正确性,并比较了这两种任务节点选择调度方法的跟踪性能,得出了基于候选节点协方差矩阵最小迹的任务节点选择调度方式在目标丢失率和跟踪精度综合考虑的基础上性能更优.     

WSNs下一种自适应多传感器协同目标跟踪策略*

对WSNs中机动目标跟踪问题提出一种自适应多传感器协同跟踪策略.该策略能根据目标的移动位置,动态地唤醒无线传感器网络中部分传感器节点形成分簇,并选择合适的簇首和采样间隔进行目标跟踪.簇内节点通过协作感知以及测量信息融合,提高了跟踪精度,同时自适应可变采样间隔节约了通信能量和计算资源,满足了跟踪系统的实时性要求.提出了传感器网络能量均衡分配的指标,提高了网络的可靠性.由于模型的非线性和目标运动的机动性,采用IMM滤波器进行目标状态估计.仿真结果表明,与NSSS和DGSS相比,跟踪精度明显提高;与DCSS相比,在保证一定跟踪精度的同时,节约了能量消耗.     

Auction-based adaptive sensor activation algorithm for target tracking in wireless sensor networks

Due to the severe resource constraints in wireless sensor networks (WSNs), designing an efficient target tracking algorithm for WSNs in terms of energy efficiency and high tracking quality becomes a challenging issue. WSNs usually provide centralized information, e.g., the locations and directions of a target, choosing sensors around the target, etc. However, some ready strategies may not be used directly because of high communication costs to get the responses for tracking tasks from a central server and low quality of tracking. In this paper, we propose a fully distributed algorithm, an auction-based adaptive sensor activation algorithm (AASA), for target tracking in WSNs. Clusters are formed ahead of the target movements in an interesting way where the process of cluster formation is due to a predicted region (PR) and cluster members are chosen from the PR via an auction mechanism. On the basis of PR calculation, only the nodes in the PR are activated and the rest of the nodes remain in the sleeping state. To make a trade-off between energy efficiency and tracking quality, the radius of PR and the number of nodes are adaptively adjusted according to current tracking quality. Instead of fixed interval (usually used in existing work), tracking interval is also dynamically adapted. Extensive simulation results, compared to existing work, show that AASA achieves high performance in terms of quality of tracking, energy efficiency, and network lifetime.     

WSNs下一种自适应多传感器协同目标跟踪策略*

对WSNs中机动目标跟踪问题提出一种自适应多传感器协同跟踪策略。该策略能根据目标的移动位置,动态地唤醒无线传感器网络中部分传感器节点形成分簇,并选择合适的簇首和采样间隔进行目标跟踪。簇内节点通过协作感知以及测量信息融合,提高了跟踪精度,同时自适应可变采样间隔节约了通信能量和计算资源,满足了跟踪系统的实时性要求。提出了传感器网络能量均衡分配的指标,提高了网络的可靠性。由于模型的非线性和目标运动的机动性,采用IMM滤波器进行目标状态估计。仿真结果表明,与NSSS和DGSS相比,跟踪精度明显提高;与DCSS相比     

基于无线传感器网络的战场目标跟踪

基于无线传感器网络,对目标定位跟踪应用进行了研究。在对目标定位跟踪时,如何既保证跟踪精度又能有效降低能量消耗,针对这个问题,提出了一种简便的加权坐标质心定位方法,通过对目标的定位,给出了一种基于测量信息的跟踪方法,方法实现简单。性能分析表明:提出的定位跟踪方法能有效地降低能量消耗,延长节点和网络寿命,基本可以满足战场目标跟踪需求。     

基于灰色马尔可夫模型的无线传感器网络目标跟踪算法

基于预测的目标跟踪是无线传感器网络目标定位与跟踪中很重要的一种方法,但在实际环境中由于目标运动模式的动态变化等原因,传统预测算法对目标位置的预测往往不准确。为了克服以上不足,提出了一种基于灰色马尔可夫模型的目标跟踪（GMMTT）算法。将具有震荡特点的Markov模型引入到分段灰色预测中,使目标定位既能获得较好的精度,又能适应目标运动模式的变化。预测得到目标位置后,当前跟踪节点将跟踪信息传送到目标下一时刻将要到达的预测区域,提前唤醒该区域内的节点,用尽可能少的节点实现目标有效的跟踪。实验结果表明：GMMTY算法在跟踪概率和跟踪精度方面具有较好的性能。     

Collaborative signal processing for target tracking in distributed wireless sensor networks

Target tracking, especially visual target tracking, in complex situations is challenging, which is always performed in single-view system. Because of the conflict between resolution and tracking range, however, single-view tracking is not robust and accurate. This paper presents a distributed multi-view tracking system using collaborative signal processing (CSP) in distributed wireless sensor networks (DWSNs). In the proposed tracking system, target detection and classification algorithms are based on single-node processing and target tracking is performed in sink node, whereas target localization algorithm is carried out by CSP between multisensor. For conquering the disadvantages of client/server based centralized data fusion, a progressive distributed data fusion are proposed. Finally, an indoor target tracking experiment is illustrated, and then tracking performance, execution time and energy consumption of progressive distributed data fusion are compared with client/server based centralized data fusion. Experimental results demonstrate that the CSP based distributed multi-view tracking system in DWSNs can accomplish multi-target extraction, classification, localization, tracking and association quickly and accurately with little congestion, energy consumption and execution time.     

Cooperative distributed target tracking algorithm in mobile wireless sensor networks

The paper proposes a cooperative distributed target tracking algorithm in mobile wireless sensor networks.There are two main components in the algorithm:distributed sensor-target assignment and sensor motion control.In the key idea of the sensor-target assignment,sensors are considered as autonomous agents and the defined objective function of each sensor concentrates on two fundamental factors:the tracking accuracy and the tracking cost.Compared with the centralized algorithm and the noncooperative distrib...     

面向目标跟踪的传感器网络调度方法

对面向移动目标跟踪任务的传感器网络调度方法进行了研究。从单任务跟踪精度和总体任务完成情况两方面设计调度指标,采用扩展卡尔曼滤波器实现目标跟踪并计算跟踪精度,进而建立了该问题的混合整数调度模型。针对模型复杂度较高的特征,提出一种基于局部解空间跳出机制的改进型遗传算法并进行求解。仿真结果表明该算法针对该问题具有较高的求解性能。     

一种面向目标跟踪的无线传感器网络分簇算法

用于目标跟踪的无线传感器网络(WSNs)一般采用分簇的系统架构,针对高密度的WSNs,设计了基于节点度数的分簇算法(CAND),该算法引入由具有相似度数的节点组成的虚拟节点的概念.组成虚拟节点的多个节点按分配的TDMA时隙轮流充当簇首.仿真实验表明:该算法在满足目标跟踪的前提下,能有效地减少簇的更新,延长整个网络的寿命.     

能量有效的无线传感器网络协同覆盖

在节点随机分布的无线传感器网络目标覆盖中,考虑到单个节点有时难以完成对目标的感知,利用节点的概率感知模型和漏检率的概念,提出了节点协同覆盖的思想,并建立了协同覆盖模型;详细分析并推导了协同覆盖感知概率、节点数目和节点参与协同覆盖的最低感知概率之间的关系;在协同覆盖模型的基础上,考虑节点能量消耗的因素,设计了优化网络使用寿命的协同覆盖算法ECTC;仿真结果表明,该算法在改善网络感知概率的同时,延长了网络的使用寿命。     

Target tracking based on the extended H-infinity filter in wireless sensor networks

In this paper, we propose a new target tracking approach for wireless sensor networks (WSNs) by using the extended H-infinity filter. First, the extended H-infinity filter for nonlinear discrete-time systems is deduced through the Krein space analysis scheme. Then, the proposed extended H-infinity filtering algorithm is applied to target tracking in wireless sensor networks. Finally, experiments are conducted through a small wireless sensor network test-bed. Both experimental and simulation results illustrate that the extended H-infinity filtering algorithm is more accurate to track a moving target in wireless sensor networks than using the extended Kalman filter in the case of having no knowledge of the statistics of the environment and the target to be tracked.     

无线传感器网络中移动目标的定位与跟踪

对侵入无线传感器网络中的目标,提出了一种移动节点和静态节点相结合的定位与跟踪方式.静态节点可以发现侵入传感器网络中的目标,移动节点与静态节点配合进一步确定目标的具体位置.仿真实验验证表明:该方法可以减少大规模的频繁移动节点,不需要过多地对移动节点的选择和运动进行特别复杂的计算,具有较好的定位精度和鲁棒性,对多目标的定位与跟踪研究有一定的启发作用.     

保持覆盖的无线传感器网络簇内节点调度方法

为了延长无线传感器网络的生命周期,提高节点能量利用效率,将簇与节点调度相结合,提出了保持覆盖的无线传感器网络簇内节点调度。首先将网络分簇,然后每个簇内的节点,按节点号自小到大的顺序依次计算每个节点与簇内邻居节点的距离,并判断所有距离小于监测半径的邻居节点能否对自己实现圆周覆盖,从而判断自己是否是冗余节点。利用Matlab仿真表明,一方面该算法可以有效减少网络的能量消耗,延长网络生命周期;另一方面该算法的调度效率与网络节点密度以及节点监测半径都有密切关系。     

基于改进粒子滤波器的WSNs目标跟踪算法

提出了一种适用于无线传感器网络(WSNs)的目标跟踪算法,该算法基于改进型粒子滤波器(PF),根据当前的预测值优化PF的方向值,从而保证精确地预测到目标的移动方向;修改了目标突发变化引起的粒子滤波器预测误差,能够很好地跟踪目标移动过程中的异常、突发的移动变化.仿真结果表明:该目标跟踪算法采用新的粒子滤波器之后,可以获得...     

基于无线传感器网络的同时定位与跟踪

研究无线传感器网络在位置信息不确定时,同时定位无线传感器网络节点并跟踪移动目标。利用RSSI测量节点对之间的距离,多维定标技术根据距离矩阵完成传感器网络的初始定位。估计与更新阶段提出了压缩EKF滤波确定传感器节点位置和目标位置。仿真结果显示:算法在较低的网络覆盖率下有较高的定位和跟踪准确度,在初始定位误差为5m时,节点和跟踪误差均小于3m,特别是在长距离的跟踪任务中有很好的精度和实时性。     

Effective target tracking mechanism in a self-organizing wireless sensor network

Target tracking is an important sensing application of wireless sensor networks. In these networks, energy, computing power, and communication bandwidth are scarce. We have considered a random heterogeneous wireless sensor network, which has several powerful nodes for data aggregation/relay and large number of energy-constrained sensor nodes that are deployed randomly to cover a given target area. In this paper, a cooperative approach to detect and monitor the path of a moving object using a minimum subset of nodes while maintaining coverage and network connectivity is proposed. It is tested extensively in a simulation environment and compared with other existing methods. The results of our experiments clearly indicate the benefits of our new approach in terms of energy consumption.