Stochastic Sensor Scheduling via Distributed Convex Optimization

In this paper, we propose a stochastic scheduling strategy for estimating the states of N discrete-time linear time invariant (DTLTI) dynamic systems, where only one system can be observed by the sensor at each time instant due to practical resource constraints. The idea of our stochastic strategy is that a system is randomly selected for observation at each time instant according to a pre-assigned probability distribution. We aim to find the optimal pre-assigned probability in order to minimize the maximal estimate error covariance among dynamic systems. We first show that under mild conditions, the stochastic scheduling problem gives an upper bound on the performance of the optimal sensor selection problem, notoriously difficult to solve. We next relax the stochastic scheduling problem into a tractable suboptimal quasi-convex form. We then show that the new problem can be decomposed into coupled small convex optimization problems, and it can be solved in a distributed fashion. Finally, for scheduling implementation, we propose centralized and distributed deterministic scheduling strategies based on the optimal stochastic solution and provide simulation examples.Comment: Proof errors and typos are fixed. One section is removed from last versio

Resilient Wireless Sensor Networks Using Topology Control: A Review

Wireless sensor networks (WSNs) may be deployed in failure-prone environments, and WSNs nodes easily fail due to unreliable wireless connections, malicious attacks and resource-constrained features. Nevertheless, if WSNs can tolerate at most losing k − 1 nodes while the rest of nodes remain connected, the network is called k − connected. k is one of the most important indicators for WSNs’ self-healing capability. Following a WSN design flow, this paper surveys resilience issues from the topology control and multi-path routing point of view. This paper provides a discussion on transmission and failure models, which have an important impact on research results. Afterwards, this paper reviews theoretical results and representative topology control approaches to guarantee WSNs to be k − connected at three different network deployment stages: pre-deployment, post-deployment and re-deployment. Multi-path routing protocols are discussed, and many NP-complete or NP-hard problems regarding topology control are identified. The challenging open issues are discussed at the end. This paper can serve as a guideline to design resilient WSNs

Sensor network coverage and data aggregation problem: solutions toward the maximum lifetime

In the coverage problem, an optimal solution is proposed for the maximum lifetime sensor scheduling problem, which could find the upper bound of a sensor network\u27s lifetime. This research reveals the relationship between the degree of redundancy in sensor deployment and achievable extension on network lifetime, which can be a useful guide for practical sensor network design --Introduction, page 4

An Efficient Analysis on Performance Metrics for optimized Wireless Sensor Network

Wireless Sensor Networks have the revolutionary significance in many new monitoring applications and self-organized systems. Based on the nature of application WSN are needed to support various levels of Quality of Services. Quality of service parameters are most significant aspect in WSN during data transmission from sensor nodes to sink. This paper surveys the factor on reliability, predictability, sustainability, optimal clustering and scheduling by analyzing various models existing in WSN. A network that satisfies all these Qos parameters ensures outstanding throughput in performance. We concluded by exploring some of the dimensions for research interest and addressed open issues ahead to enhance the performance of WSNs