scholarly journals Distributed Robust Filtering for Wireless Sensor Networks with Markov Switching Topologies and Deception Attacks

Sensors ◽  
2020 ◽  
Vol 20 (7) ◽  
pp. 1948
Author(s):  
Fengzeng Zhu ◽  
Xu Liu ◽  
Jiwei Wen ◽  
Linbo Xie ◽  
Li Peng

This paper is concerned with the distributed full- and reduced-order l 2 - l ∞ state estimation issue for a class of discrete time-invariant systems subjected to both randomly occurring switching topologies and deception attacks over wireless sensor networks. Firstly, a switching topology model is proposed which uses homogeneous Markov chain to reflect the change of filtering networks communication modes. Then, the sector-bound deception attacks among the communication channels are taken into consideration, which could better characterize the filtering network communication security. Additionally, a random variable obeying the Bernoulli distribution is used to describe the phenomenon of the randomly occurring deception attacks. Furthermore, through an adjustable parameter E, we can obtain full- and reduced-order l 2 - l ∞ state estimator over sensor networks, respectively. Sufficient conditions are established for the solvability of the addressed switching topology-dependent distributed filtering design in terms of certain convex optimization problem. The purpose of solving the problem is to design a distributed full- and reduced-order filter such that, in the presence of deception attacks, stochastic external interference and switching topologies, the resulting filtering dynamic system is exponentially mean-square stable with prescribed l 2 - l ∞ performance index. Finally, a simulation example is provided to show the effectiveness and flexibility of the designed approach.

2012 ◽  
Vol 2012 ◽  
pp. 1-21 ◽  
Author(s):  
Jin Zhu ◽  
Liang Tang ◽  
Hongsheng Xi ◽  
Zhenghuan Zhang

This paper investigates reliability analysis of wireless sensor networks whose topology is switching among possible connections which are governed by a Markovian chain. We give the quantized relations between network topology, data acquisition rate, nodes' calculation ability, and network reliability. By applying Lyapunov method, sufficient conditions of network reliability are proposed for such topology switching networks with constant or varying data acquisition rate. With the conditions satisfied, the quantity of data transported over wireless network node will not exceed node capacity such that reliability is ensured. Our theoretical work helps to provide a deeper understanding of real-world wireless sensor networks, which may find its application in the fields of network design and topology control.


Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
R. Sakthivel ◽  
V. Nithya ◽  
Yong-Ki Ma ◽  
Chao Wang

In this study, the problem of finite-time nonfragile dissipative-based filter design for wireless sensor networks that is described by discrete-time systems with time-varying delay is investigated. Specifically, to reduce the energy consumption of wireless sensor networks, it is assumed that the signal is not transmitted at each instant and the transmission process is stochastic. By constructing a suitable Lyapunov-Krasovskii functional and employing discrete-time Jensen’s inequality, a new set of sufficient conditions is established in terms of linear matrix inequalities such that the augmented filtering system is stochastically finite-time bounded with a prescribed dissipative performance level. Meanwhile, the desired dissipative-based filter gain matrices can be determined by solving an optimization problem. Finally, two numerical examples are provided to illustrate the effectiveness and the less conservatism of the proposed filter design technique.


2020 ◽  
Vol 16 (5) ◽  
pp. 155014772092047
Author(s):  
Jiao Zhang ◽  
Jianfeng Lu

This article focuses on the evaluation of geometric dilution of precision for three-dimensional angle-of-arrival target localization in wireless sensor networks. We calculate a general analytical expression for the geometric dilution of precision for three-dimensional angle-of-arrival target localization. Unlike the existing works in the literature, in this article, no assumptions are made regarding the observation ranges, noise variances, or the number of sensors in the derivation of the geometric dilution of precision. Necessary and sufficient conditions regarding the existence of geometric dilution of precision are also derived, which can be readily used to evaluate the observability of three-dimensional angle-of-arrival target localization in wireless sensor networks. Moreover, a concise procedure is also presented to calculate the geometric dilution of precision when it exists. Finally, several examples are used to illustrate our results, and it is shown that the performance of the proposed regular deployment configurations of angle-of-arrival sensors is better than the one with random deployment patterns.


2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Chuan Ji ◽  
Wuneng Zhou ◽  
Huashan Liu

This paper focuses on the average consensus problem for the wireless sensor networks (WSNs) with fixed and Markovian switching, undirected and connected network topologies in the noise environment. Event-based protocol is applied to each sensor node to reach the consensus. An event triggering strategy is designed based on a Lyapunov function. Under the event trigger condition, some sufficient conditions for average consensus in mean square are obtained. Finally, some numerical simulations are given to illustrate the effectiveness of the results derived in this paper.


Sign in / Sign up

Export Citation Format

Share Document