Distributed estimation for adaptive sensor selection in wireless sensor networks

Wireless sensor networks (WSNs) are usually deployed for monitoring systems with the distributed detection and estimation of sensors. Sensor selection in WSNs is considered for target tracking. A distributed estimation scenario is considered based on the extended information filter. A cost function using the geometrical dilution of precision measure is derived for active sensor selection. A consensus-based estimation method is proposed in this paper for heterogeneous WSNs with two types of sensors. The convergence properties of the proposed estimators are analyzed under time-varying inputs. Accordingly, a new adaptive sensor selection (ASS) algorithm is presented in which the number of active sensors is adaptively determined based on the absolute local innovations vector. Simulation results show that the tracking accuracy of the ASS is comparable to that of the other algorithms.     

Sensor selection strategies for state estimation in energy constrained wireless sensor networks

Wireless Sensor Networks (WSNs) enable a wealth of new applications where remote estimation is essential. Individual sensors simultaneously sense a dynamic process and transmit measured information over a shared channel to a central base station. The base station computes an estimate of the process state by means of a Kalman filter. In this paper we assume that, at each time step, only a subset of all sensors are selected to send their observations to the fusion center due to channel capacity constraints or limited energy budget. We propose a multi-step sensor selection strategy to schedule sensors to transmit for the next T steps of time with the goal of minimizing an objective function related to the Kalman filter error covariance matrix. This formulation, in a relaxed convex form, defines an unified framework to solve a large class of optimization problems over energy constrained WSNs. We offer some numerical examples to further illustrate the efficiency of the algorithm.     

CROSS: A probabilistic constrained random sensor selection scheme in wireless sensor networks

Due to the application-specific nature of wireless sensor networks, the sensitivity to coverage and data reporting latency varies depending on the type of applications. In light of this, algorithms and protocols should be application-aware to achieve the optimum use of highly limited resources in sensors and hence to increase the overall network performance. This paper proposes a probabilistic constrained random sensor selection (CROSS) scheme for application-aware sensing coverage with a goal to maximize the network lifetime. The CROSS scheme randomly selects in each round (approximately) k data-reporting sensors which are sufficient for a user/application-specified desired sensing coverage (DSC) maintaining a minimum distance between any pair of the selected k sensors. We exploit the Poisson sampling technique to force the minimum distance. Consequently, the CROSS improves the spatial regularity of randomly selected k sensors and hence the fidelity of satisfying the DSC in each round, and the connectivity among the selected sensors increase. To this end, we also introduce an algorithm to compute the desired minimum distance to be forced between any pair of sensors. Finally, we present the probabilistic analytical model to measure the impact of the Poisson sampling technique on selecting k sensors, along with the optimality of the desired minimum distance computed by the proposed algorithm.     

On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage

In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measurements are then exchanged among all the sensors. What is the sensor schedule that results in the minimum error covariance? We describe a stochastic sensor selection strategy that is easy to implement and is computationally tractable. The problem described above comes up in many domains out of which we discuss two. In the sensor selection problem, there are multiple sensors that cannot operate simultaneously (e.g., sonars in the same frequency band). Thus measurements need to be scheduled. In the sensor coverage problem, a geographical area needs to be covered by mobile sensors each with limited range. Thus from every position, the sensors obtain a different view-point of the area and the sensors need to optimize their trajectories. The algorithm is applied to these problems and illustrated through simple examples.     

基于Bayes与多层Bayes估计的WSN链路选择算法

无线传感器网络（WSN）节点能量有限,采用传统的链路选择的方法（经验法）进行链路选择,需要发送大量的数据包作为测试样本,这在WSN中是不合适的。设计了两种基于Bayes估计与一种基于多层Bayes估计的WSN链路选择算法,分别记为BLSP-B1、BLSP-B2、BLSP-HE。仿真实验发现,在小样本的条件下,BLSP-B1、BLSP-B2、BLSP-HE选择高质量的链路的概率比经验法要高出10%～20%,其中BLSP-HE算法最稳健,性能较好。     

In-network wireless sensor network query processors: State of the art,challenges and future directions

In wireless sensor networks (WSNs), energy is valuable because it is scarce. This causes their life time to be determined by their ability to use the available energy in an effective and frugal manner. In most of the earlier sensor network applications, the main requirement consisted mainly of data collection but transmitting all of the raw data out of the network may be prohibitively expensive (in terms of communication) or impossible at given data collection rates.In the last decade, the use of the database paradigm has emerged as a feasible solution to manage data in a WSN context. There are various sensor network query processors (SNQPs) (implementing in-network declarative query processing) that provide data reduction, aggregation, logging, and auditing facilities. These SNQPs view the wireless sensor network as a distributed database over which declarative query processor can be used to program a WSN application with much less effort. They allow users to pose declarative queries that provide an effective and efficient means to obtain data about the physical environment, as users would not need to be concerned with how sensors are to acquire the data, or how nodes transform and/or transmit the data.This paper surveys novel approaches of handling query processing by the current SNQP literature, the expressiveness of their query language, the support provided by their compiler/optimizer to generate efficient query plans and the kind of queries supported. We introduce the challenges and opportunities of research in the field of in-network sensor network query processing as well as illustrate the current status of research and future research scopes in this field.     

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.     

Sensor selection for received signal strength-based source localization in wireless sensor networks

Generally, localization is a nonlinear problem, while linearization is used to simplify this problem. Reasonable approximations could be achieved when signal-to-noise ratio (SNR) is large enough. Energy is a critical resource in wireless sensor networks, and system lifetime needs to be prolonged through the use of energy efficient strategies during system operation. In this paper, a closed-form solution for received signal strength (RSS)-based source localization in wireless sensor network (WSN) is obtained...     

Pattern recognition for detecting distributed node exhaustion attacks in wireless sensor networks

Malicious attacks when launched by the adversary-class against sensor nodes of a wireless sensor network, can disrupt routine operations of the network. The mission-critical nature of these networks signifies the need to protect sensory resources against all such attacks. Distributed node exhaustion attacks are such attacks that may be launched by the adversarial class from multiple ends of a wireless sensor network against a set of target sensor nodes. The intention of such attacks is the exhaustion of the victim’s limited energy resources. As a result of the attack, the incapacitated data-generating legitimate sensor nodes are replaced with malicious nodes that will involve in further malicious activity against sensory resources. One such activity is the generation of fictitious sensory data to misguide emergency response systems to mobilize unwanted contingency activity. In this paper, a model is proposed for such an attack based on network traffic flow. In addition, a distributed mechanism for detecting such attacks is also defined. Specific network topology-based patterns are defined to model normal network traffic flow, and to facilitate differentiation between legitimate traffic packets and anomalous attack traffic packets. The performance of the proposed attack detection scheme is evaluated through simulation experiments, in terms of the size of the sensor resource set required for participation in the detection process for achieving a desired level of attack detection accuracy. The results signify the need for distributed pattern recognition for detecting distributed node exhaustion attacks in a timely and accurate manner.     

Interacting multiple model and sensor selection algorithms for manoeuvring target tracking in wireless sensor networks with multiplicative noise

This article addresses the problem of tracking a manoeuvring target in a wireless sensor network (WSN) consisting of distance-measuring sensor nodes. In order to cope with target manoeuvres, an interacting multiple model (IMM) filter is applied to estimate the position and velocity of the target. The distance-dependent measurement error of sensors is formulated as both additive and multiplicative noise in the observation equation. To deal with nonlinearities in the process and observation equations and also to solve the problem of multiplicative measurement noise, a new particle filter (PF)-based IMM approach is developed. Furthermore, the multiple-model posterior Cramér-Rao lower bound (PCRLB) is derived in the presence of both additive and multiplicative noise and it is used to perform a sensor selection algorithm to reduce energy consumption in WSN nodes. Simulation results show the effectiveness of the proposed IMMPF and sensor selection algorithms in target tracking.     

可充电无线传感网络能量均衡路由算法

针对可充电无线传感网络中的能量均衡路由问题,提出在稳定功率无线充电和监测数据收集网络场景下的多路径路由算法和机会路由算法,以实现网络的能量均衡。首先,通过电磁传播理论构建了无线传感节点的充电和接收功率关系模型;然后,考虑网络中无线传感节点的发送能耗和接收能耗,基于上述充电模型将网络能量均衡的路由问题转化为网络节点运行时间的最大最小化问题,通过线性规划得到的各链路流量用以指导路由中数据流量分配;最后,考虑一种更加现实的低功耗的场景,并提出了一种基于机会路由的能量均衡路由算法。实验结果表明,与最短路径路由（SPR）和期望周期最短路由（EDC）算法相比较,所提出的两种路由算法均能有效提高采集能量的利用率和工作周期内的网络生命周期。     

无线传感器网络中节点选择机制综述*

节点选择是保证无线传感器网络满足系统QoS需求的最重要问题之一,一种性能较好的节点选择机制可以在保证数据精度的前提下延长网络生命周期。针对WSN节点选择问题进行了描述及分类,着重研究了几类当前具有代表性的节点选择机制,并分析比较了各自的性能及缺点;最后对节点选择的进一步研究方向进行了展望。     

无线传感器网络中的Sybil攻击

研究了无线传感网中Sybil攻击的检测与防范,提出了一种多节点协作的基于接收信号强度(RSS)的检测机制CRSD。它的基本思想是Sybil节点所创建的不同身份,其网络位置是相同且无法改变的。CRSD通过多节点协作确定不同身份的网络位置,将出现位置相同的多个身份归为Sybil攻击。仿真实验表明无防范时Sybil攻击显著降低了系统吞吐量,而CRSD能检测出Sybil节点从而有效地保护了系统性能。     

Optimizing in-network aggregate queries in wireless sensor networks for energy saving

This study proposes a method of in-network aggregate query processing to reduce the number of messages incurred in a wireless sensor network. When aggregate queries are issued to the resource-constrained wireless sensor network, it is important to efficiently perform these queries. Given a set of multiple aggregate queries, the proposed approach shares intermediate results among queries to reduce the number of messages. When the sink receives multiple queries, it should be propagated these queries to a wireless sensor network via existing routing protocols. The sink could obtain the corresponding topology of queries and views each query as a query tree. With a set of query trees collected at the sink, it is necessary to determine a set of backbones that share intermediate results with other query trees (called non-backbones). First, it is necessary to formulate the objective cost function for backbones and non-backbones. Using this objective cost function, it is possible to derive a reduction graph that reveals possible cases of sharing intermediate results among query trees. Using the reduction graph, this study first proposes a heuristic algorithm BM (standing for Backbone Mapping). This study also develops algorithm OOB (standing for Obtaining Optimal Backbones) that exploits a branch-and-bound strategy to obtain the optimal solution efficiently. This study tests the performance of these algorithms on both synthesis and real datasets. Experimental results show that by sharing the intermediate results, the BM and OOB algorithms significantly reduce the total number of messages incurred by multiple aggregate queries, thereby extending the lifetime of sensor networks.     

A distributed energy-efficient clustering protocol for wireless sensor networks

Minimizing energy dissipation and maximizing network lifetime are among the central concerns when designing applications and protocols for sensor networks. Clustering has been proven to be energy-efficient in sensor networks since data routing and relaying are only operated by cluster heads. Besides, cluster heads can process, filter and aggregate data sent by cluster members, thus reducing network load and alleviating the bandwidth. In this paper, we propose a novel distributed clustering algorithm where cluster heads are elected following a three-way message exchange between each sensor and its neighbors. Sensor’s eligibility to be elected cluster head is based on its residual energy and its degree. Our protocol has a message exchange complexity of O(1) and a worst-case convergence time complexity of O(N). Simulations show that our algorithm outperforms EESH, one of the most recently published distributed clustering algorithms, in terms of network lifetime and ratio of elected cluster heads.     

无线传感器网络的设计与部署

首先分析了无线传感器网络与传统无线自组织网络的区别,从侧面阐述了无线传感器网络的特点。接着,讨论了对无线传感器网络设计与部署具有指导意义的无线传感器网络的评价指标。最后,从无线传感器节点到无线传感器网络、从个体到整体、从微观到宏观,较为全面地讨论了无线传感器网络的设计与部署问题,为无线传感器网络的实际应用提供了有价值的参考。     

传感器网络中鲁棒状态信息融合抗差卡尔曼滤波器

研究了无线传感器网络中的分布式鲁棒状态信息融合问题. 在局部状态估计层, 基于鲁棒统计学理论提出了适用于噪声相关情况的抗差(扩展)卡尔曼滤波器. 在融合中心层, 针对局部估计相关未知性和不完整性, 给出了不依赖于互协方差阵的稳健航迹融合方法—–内椭球逼近法. 仿真结果证实了算法的有效性: 所提出的抗差卡尔曼滤波器在野值存在情况下, 性能退化远低于传统卡尔曼滤波器(28.6%比428.6%); 所提出的内椭球逼近法获得比协方并交叉法更好的融合估计性能, 且不需要局部估计相关性的先验知识.