A Novel Energy-Aware Target Tracking Method by Reducing Active Nodes in Wireless Sensor Networks

Energy consumption is one of the main challenges in wireless sensor networks. Additionally, in target tracking algorithms, it is expected to have a longer lifetime for the network, when a better prediction algorithm is employed, since it activates fewer sensors in the network. Most target tracking methods activate a large number of nodes in sensor networks. This paper proposes a new tracking algorithm reducing the number of active nodes in both positioning and tracking by predicting the target deployment area in the next time interval according to some factors including the previous location of the target, the current speed and acceleration of the target without reducing the tracking performance. The proposed algorithm activates the sensor nodes available in the target area by predicting the target position in the next time interval. The problem of target loss is also considered and solved in the proposed tracking algorithm. In the numerical analysis, the number of nodes involved in target tracking, energy consumption and the network lifetime are compared with other tracking algorithms to show superiority of the proposed algorithm.     

无线传感器网络自适应目标跟踪节点调度算法

在无线传感器网络中,设计合理的节点调度算法是提高网络感知能力、降低系统能耗的关键。在分析节点能耗模型的基础上,针对移动目标跟踪型网络应用,提出一种高能效的无线传感器网络自适应节点调度算法ANSTT。该算法根据节点对移动目标的感知能力,以及节点的相对剩余能量水平,自动调整节点工作模式。仿真实验表明,ANSTT算法在维持低感知延时、高目标感知率的同时,可有效降低系统能耗,延长网络寿命。     

Learning Automata Based Face-Aware Mobicast

Target tracking is one of the most popular applications of the wireless sensor networks. It can be accomplished using different approaches and algorithms, one of which is the spatiotemporal multicast protocol, called “mobicast”. In this protocol, it is assumed that the area around the moving target, called the delivery zone, is known at any given time during the operation of the network. The aim of the protocol is to awake sensor nodes, which will be within the delivery zone in the near future, to be prepared for tracking the approaching moving target. In this paper, we propose a novel mobicast algorithm, aiming at reducing the number of awakened sensor nodes. To this end, we equipped every sensor node with a learning automaton, which helps the node in determining the sensor nodes it must awaken. To evaluate the performance of the proposed algorithm, several experiments have been conducted. The results have shown that the proposed algorithm can significantly outperform other existing algorithms such as forward-zone constrained and FAR in terms of energy consumption, number of active nodes, number of exchanged packets and slack time.     

A Learning Automata Based Area Coverage Algorithm for Wireless Sensor Networks

One way to reduce energy consumption in wireless sensor networks is to reduce the number of active nodes in the network. When sensors are redundantly deployed, a subset of sensors should be selected to actively monitor the field （referred to as a ＂cover＂）, whereas the rest of the sensors should be put to sleep to conserve their batteries. In this paper, a learning automata based algorithm for energy-efficient monitoring in wireless sensor networks （EEMLA） is proposed. Each node in EEMLA algorithm is equipped with a learning automaton which decides for the node to be active or not at any time during the operation of the network. Using feedback received from neighboring nodes, each node gradually learns its proper state during the operation of the network. Experimental results have shown that the proposed monitoring algorithm in comparison to other existing methods such as Tian and LUC can better prolong the network lifetime.     

An adaptive target tracking method for 3D underwater wireless sensor networks

Today, underwater target tracking using underwater wireless sensor networks (UWSNs) is an essential part in many military and non-military applications. Most of moving target tracking studies in UWSNs are considered in two-dimensional space. However, most practical applications require to be implemented in three-dimensional space. In this paper an adaptive method based on Kalman filter for moving target tracking in three dimensional space using UWSNs is proposed. Since, energy protection is a vital task in UWSNs; the proposed method reduces the energy consumption of the entire network by a sleep/wake plan. In this plan only 60% of the closer nodes along the path of the moving target will be waked up using a sink activation message and participate in the tracking, while the other nodes remain in sleep state. At each stage of tracking, the location of the target is estimated using a 3D underwater target tracking algorithm with the trilateration method. Subsequently, the estimations and target tracking results are inserted into the Kalman filter as measuring model to produce the final result. Performance evaluation and simulations results indicated that the proposed method improves the average location error by 45%, average estimated velocity by 86%, and average energy consumption by 33% in comparison to the trilateration method. However, computation time is increased as a result of improving tracking accuracy; and tracking accuracy is lost about 20% due to saving energy. It was shown that the proposed method has been able to adaptively achieve a trade-off between tracking accuracy and energy consumption based on real-time user requirements. Such adaption can be controlled trough the sink node based on real-time requirements.     

二进制传感器网络加权目标跟踪算法研究

该文主要研究二进制传感器网络中加权目标跟踪算法的设计。针对已有算法中权值不能实时反映目标与感测节点之间距离关系的缺点,提出了距离加权和基于预测的距离加权目标跟踪算法。距离权值能够实时反映目标与各个感测节点间的距离关系,因此具有更高的跟踪精度。在距离加权算法中感测节点需要将感测信息和距离信息都传输到融合中心,这会增大感测节点的能量消耗。为了解决这个问题,文中提出一种基于预测的距离加权目标跟踪算法。该算法中感测节点不需要传输距离信息而只传输感测信息到融合中心从而减少了能耗。仿真结果表明,基于预测的距离加权算法比已有算法能够够精确地跟踪目标,在保证跟踪精度的同时减少了通信能耗。     

Distributed target localization using a progressive certainty map in visual sensor networks

Collaboration in visual sensor networks (VSNs) is essential not only to compensate for the processing, sensing, energy, and bandwidth limitations of each sensor node but also to improve the accuracy and robustness of the network. In this paper, we study target localization in VSNs, a challenging computer vision problem because of two unique features of cameras, including the extremely higher data rate and the directional sensing characteristics with limited field of view. Traditionally, the problem is solved by localizing the targets at the intersections of the back-projected 2D cones of each target. However, the existence of visual occlusion among targets would generate many false alarms. In this work, instead of resolving the uncertainty about target existence at the intersections, we identify and study the non-occupied areas in the cone and generate the so-called certainty map of non-existence of targets. As a result, after fusing inputs from a set of sensor nodes, the unresolved regions on the certainty map would be the location of targets. This paper focuses on the design of a light-weight, energy-efficient, and robust solution where not only each camera node transmits a very limited amount of data but that a limited number of camera nodes is involved. We propose a dynamic itinerary for certainty map integration where the entire map is progressively clarified from sensor to sensor. When the confidence of the certainty map is satisfied, targets are localized at the remaining unresolved regions in the certainty map. Based on results obtained from both simulation and real experiments, the proposed progressive method shows effectiveness in detection accuracy as well as energy and bandwidth efficiency.     

基于格拉布斯准则和改进粒子滤波算法的水下传感网目标跟踪

水下无线传感网络(UWSN)执行目标跟踪时,因为各个传感器节点测量值对目标状态估计的贡献不一样以及节点能量有限,所以探索一种好的节点融合权重方法和节点规划机制能够获得更好的跟踪性能。针对上述问题,该文提出一种基于Grubbs准则和互信息熵加权融合的分布式粒子滤波(PF)目标跟踪算法(GMIEW)。首先利用Grubbs准则对传感器节点所获得的信息进行分析检验,去除干扰信息和错误信息。其次,在粒子滤波的重要性权值计算的过程中,引入动态加权因子,采用传感器节点的测量值与目标状态之间的互信息熵,来反映传感器节点提供的目标信息量,从而获得各个节点相应的加权因子。最后,采用3维场景下的簇-树型网络拓扑结构,跟踪监测区域内的目标。实验结果显示,该算法可有效提高水下传感器网络测量数据对目标跟踪预测的准确度,降低跟踪误差。     

Distributed Energy Efficient Tracking in Hybrid wireless sensor network (DEETH)

In wireless sensor network (WSN), it is a complex task to track the target when it is moving randomly in an unknown environment. It also becomes difficult to cover a complete searching area because of the limited searching range and energy of sensor nodes as they are few in number. The author proposes a distributed energy efficient tracking in a hybrid WSN (DEETH) to track a randomly moving target in an unknown searching. Hybrid WSN that is proposed has both static sensor nodes (SSNs) and mobile sensor nodes (MSNs), which are deployed in the searching area. The MSNs move collectively using particle swarm techniques to search a target. The SSNs are deployed for tracking the presence of a target and giving this information to the base station. As per the information given by SSN, MSNs travel to the target and track it. Simulation results prove that proposed technique successfully tracks the target using less number of nodes and also less amount of energy.     

WSN中一种改进的目标跟踪方法

目标跟踪作为无线传感器网络(WSN)的一项基本应用,已得到广泛研究。提出了一种改进的目标跟踪方法,该方法主要分为邻域检测、目标跟踪和目标修正3个阶段。节点通过获取对于目标的感知信息收益值来实现邻域检测。每个节点通过计算自己的节点权值来决定是否参与目标的跟踪。基于目标的运动趋势,通过发送数据报告来自适应地对目标进行修正。仿真实验表明,该算法减少了参与目标跟踪的节点数,节省了能量,与PM算法相比,该算法提高了目标跟踪的准确率。     

Energy-efficient collaborative target tracking algorithm using cost-reference particle filtering in wireless acoustic sensor networks

Target tracking is one of the most important applications of wireless sensor networks. Optimized computation and energy dissipation are critical requirements to save the limited resource of sensor nodes. A new robust and energy-efficient collaborative target tracking framework is proposed in this article. After a target is detected, only one active cluster is responsible for the tracking task at each time step. The tracking algorithm is distributed by passing the sensing and computation operations from one cluster to another. An event-driven cluster reforming scheme is also proposed for balancing energy consumption among nodes. Observations from three cluster members are chosen and a new class of particle filter termed cost-reference particle filter (CRPF) is introduced to estimate the target motion at the cluster head. This CRPF method is quite robust for wireless sensor network tracking applications because it drops the strong assumptions of knowing the probability distributions of the system process and observation noises. In simulation experiments, the performance of the proposed collaborative target tracking algorithm is evaluated by the metrics of tracking precision and network energy consumption.     

Energy‐Efficient Adaptive Dynamic Sensor Scheduling for Target Monitoring in Wireless Sensor Networks

Due to uncertainties in target motion and randomness of deployed sensor nodes, the problem of imbalance of energy consumption arises from sensor scheduling. This paper presents an energy‐efficient adaptive sensor scheduling for a target monitoring algorithm in a local monitoring region of wireless sensor networks. Owing to excessive scheduling of an individual node, one node with a high value generated by a decision function is preferentially selected as a tasking node to balance the local energy consumption of a dynamic clustering, and the node with the highest value is chosen as the cluster head. Others with lower ones are in reserve. In addition, an optimization problem is derived to satisfy the problem of sensor scheduling subject to the joint detection probability for tasking sensors. Particles of the target in particle filter algorithm are resampled for a higher tracking accuracy. Simulation results show this algorithm can improve the required tracking accuracy, and nodes are efficiently scheduled. Hence, there is a 41.67% savings in energy consumption.     

监测无线传感器网络休眠调度算法

休眠调度设计是无线传感器网络一种重要的通信节能方法。针对监测典型应用,为了实现长时间的监测应用要求,充分利用冗余部署提供的能量资源,提出了一种能量相关的分布式自适应休眠调度算法。算法利用极大独立集构建思想,结合节点层次级别、实时的能量消耗、连通度等信息动态选择连通支配节点集作为网络骨干,使得网络活跃节点数量最小化。仿真试验分析表明,算法能够有效地利用冗余节点提供的能量资源,扩展了网络的生命周期。     

基于备份节点无线传感器网络设计策略

在无线传感器网络中由于节点的规模大小有限，能源问题成为目前设计的重点。根据网络中节点的不同任务特征提出了一个对传感器节点进行备份的分布式算法，使得在网络中尽可能减少工作节点的参与从而降低能耗。实验结果证明了算法的可行性和正确性，同时还给出了在特定环境下为达到网络最大持续工作时间所需节点数量的范围区间。     

交通路灯监控系统的无线传感网链状路由算法

在交通路灯监控系统中为节省网络节点能耗和降低数据传输时延,提出一种无线传感网链状路由算法（CRASMS）。该算法根据节点和监控区域的信息将监控区域分成若干个簇区域,在每一个簇区域中依次循环选择某个节点为簇头节点,通过簇头节点和传感节点的通信建立簇内星型网络,最终簇头节点接收传感节点数据,采用数据融合算法降低数据冗余,通过簇头节点间的多跳路由将数据传输到Sink节点并将用户端的指令传输到被控节点。仿真结果表明：CRASMS算法保持了PEGASIS算法在节点能耗方面和LEACH算法在传输时延方面的优点,克服了PEGASIS 算法在传输时延方面和LEACH算法在节点能耗方面的不足,将网络平均节点能耗和平均数据传输时延保持在较低水平。在一定的条件下,CRASMS算法比LEACH和PEGASIS算法更优。     

Design and Implementation of Routing Algorithm to Enhance Network Lifetime in WBAN

Today’s era is the era of smart and remote applications exploiting advancement in sensors, cloud, Internet of things etc. Major application is in healthcare monitoring and support using wireless body area network (WBAN) in which sensor nodes sense vital physiological parameters and send to server through sink i.e. smart phone nowadays for seamless monitoring. The most significant issue in such applications is energy efficiency which leads to enhanced network life time that ensures uninterrupted seamless services. From source to sink data transmission may occur considering three different scenarios: source to sink single hop direct data transmission irrespective of in-between node distance, source to sink multi hop data transmission in which transmission range of source node is fixed at a threshold to find next forwarder node and transmission range of source node is incremented by affixed value until data gets transmitted to sink. In this work WBAN having different network configurations based on fixed or random positions of nodes have been simulated. Different scenarios with fixed and varying number of nodes are framed and simulated using MATLAB 2020a for performance evaluation of proposed algorithm in terms of energy consumption, network lifetime, path loss etc. due to data transmission from source to sink. Experimental results show that incremental approach is better than direct one in terms of energy consumption, path loss and network lifetime. While selecting transmission range of a source node, it is considered to keep Specific Absorption Rate (SAR) lower to reduce impact on human tissue.

     

Polytype target coverage scheme for heterogeneous wireless sensor networks using linear programming

Sensing coverage is one of fundamental problems in wireless sensor networks. In this paper, we investigate the polytype target coverage problem in heterogeneous wireless sensor networks where each sensor is equipped with multiple sensing units and each type of sensing unit can sense an attribute of multiple targets. How to schedule multiple sensing units of a sensor to cover multiple targets becomes a new challenging problem. This problem is formulated as an integer linear programming problem for maximizing the network lifetime. We propose a novel energy‐efficient target coverage algorithm to solve this problem based on clustering architecture. Being aware of the coverage capability and residual energy of sensor nodes, the clusterhead node in each cluster schedules the appropriate sensing units of sensor nodes that are in the active status to cover multiple targets in an optimal way. Extensive simulations have been carried out to validate the effectiveness of the proposed scheme. Copyright © 2012 John Wiley & Sons, Ltd.     

基于备份节点无线传感器网络设计策略

在无线传感器网络中由于节点的规模大小有限,能源问题成为目前设计的重点。根据网络中节点的不同任务特征提出了一个对传感器节点进行备份的分布式算法,使得在网络中尽可能减少工作节点的参与从而降低能耗。实验结果证明了算法的可行性和正确性,同时还给出了在特定环境下为达到网络最大持续工作时间所需节点数量的范围区间。     

Joint multiple target tracking and classification in collaborative sensor networks

We address the problem of jointly tracking and classifying several targets within a sensor network where false detections are present. In order to meet the requirements inherent to sensor networks such as distributed processing and low-power consumption, a collaborative signal processing algorithm is presented. At any time, for a given tracked target, only one sensor is active. This leader node is focused on a single target but takes into account the possible existence of other targets. It is assumed that the motion model of a given target belongs to one of several classes. This class-target dynamic association is the basis of our classification criterion. We propose an algorithm based on the sequential Monte Carlo (SMC) filtering of jump Markov systems to track the dynamic of the system and make the corresponding estimates. A novel class-based resampling scheme is developed in order to get a robust classification of the targets. Furthermore, an optimal sensor selection scheme based on the maximization of the expected mutual information is integrated naturally within the SMC target tracking framework. Simulation results are presented to illustrate the excellent performance of the proposed multitarget tracking and classification scheme in a collaborative sensor network.     

面向节点异构的能耗感知虚拟网络映射算法

在底层网络节点异构的环境中,能耗优化的虚拟网络映射问题并不是最小化工作节点和链路数。该文针对此问题,构建底层网络节点和链路的负载能耗模型,并以能耗最优为目标,建立虚拟网络映射问题的数学模型,提出一种能耗感知虚拟网络映射算法。该算法在节点映射阶段以最小化能耗和协调链路映射为原则,将虚拟节点映射至综合资源能力最大的底层节点上,并采用改进的能耗感知k最短路径法进行链路映射。仿真结果表明,该算法显著减少虚拟网络映射的能耗,且底层网络节点异构性越大,能耗优势更为明显。