Stabilization of Networked Switched Systems Under DoS Attacks.

This article studies the stability issue of networked switched systems (NSSs) under denial-of-service (DoS) attacks. To address this issue, the derived limitations imposed on both the frequency of DoS attacks on each subsystem and the upper limit of attack duration that each subsystem can tolerate are mode-dependent, which is more efficient and flexible than the current results for NSSs. Moreover, we reveal the relationship between the upper bound of the average maximum tolerable attack duration associated with the corresponding subsystem and the actual mode-dependent average dwell time. Furthermore, we identify that the total tolerable DoS attack duration as a percentage of the system runtime in this article can be higher than existing results. Finally, an example is given to demonstrate the effectiveness of our work.

Dynamic Indoor Localization Using Maximum Likelihood Particle Filtering.

A popular approach for solving the indoor dynamic localization problem based on WiFi measurements consists of using particle filtering. However, a drawback of this approach is that a very large number of particles are needed to achieve accurate results in real environments. The reason for this drawback is that, in this particular application, classical particle filtering wastes many unnecessary particles. To remedy this, we propose a novel particle filtering method which we call maximum likelihood particle filter (MLPF). The essential idea consists of combining the particle prediction and update steps into a single one in which all particles are efficiently used. This drastically reduces the number of particles, leading to numerically feasible algorithms with high accuracy. We provide experimental results, using real data, confirming our claim.

Fingerprinting-Based Indoor Localization Using Interpolated Preprocessed CSI Phases and Bayesian Tracking.

Indoor positioning using Wi-Fi signals is an economic technique. Its drawback is that multipath propagation distorts these signals, leading to an inaccurate localization. An approach to improve the positioning accuracy consists of using fingerprints based on channel state information (CSI). Following this line, we propose a new positioning method which consists of three stages. In the first stage, which is run during initialization, we build a model for the fingerprints of the environment in which we do localization. This model permits obtaining a precise interpolation of fingerprints at positions where a fingerprint measurement is not available. In the second stage, we use this model to obtain a preliminary position estimate based only on the fingerprint measured at the receiver's location. Finally, in the third stage, we combine this preliminary estimation with the dynamical model of the receiver's motion to obtain the final estimation. We compare the localization accuracy of the proposed method with other rival methods in two scenarios, namely, when fingerprints used for localization are similar to those used for initialization, and when they differ due to alterations in the environment. Our experiments show that the proposed method outperforms its rivals in both scenarios.

Efficient Approximation of Head-Related Transfer Functions in Subbands for Accurate Sound Localization.

Head-related transfer functions (HRTFs) describe the acoustic filtering of incoming sounds by the human morphology and are essential for listeners to localize sound sources in virtual auditory displays. Since rendering complex virtual scenes is computationally demanding, we propose four algorithms for efficiently representing HRTFs in subbands, i.e., as an analysis filterbank (FB) followed by a transfer matrix and a synthesis FB. All four algorithms use sparse approximation procedures to minimize the computational complexity while maintaining perceptually relevant HRTF properties. The first two algorithms separately optimize the complexity of the transfer matrix associated to each HRTF for fixed FBs. The other two algorithms jointly optimize the FBs and transfer matrices for complete HRTF sets by two variants. The first variant aims at minimizing the complexity of the transfer matrices, while the second one does it for the FBs. Numerical experiments investigate the latency-complexity trade-off and show that the proposed methods offer significant computational savings when compared with other available approaches. Psychoacoustic localization experiments were modeled and conducted to find a reasonable approximation tolerance so that no significant localization performance degradation was introduced by the subband representation.

Distributed weighted least-squares estimation with fast convergence for large-scale systems.

In this paper we study a distributed weighted least-squares estimation problem for a large-scale system consisting of a network of interconnected sub-systems. Each sub-system is concerned with a subset of the unknown parameters and has a measurement linear in the unknown parameters with additive noise. The distributed estimation task is for each sub-system to compute the globally optimal estimate of its own parameters using its own measurement and information shared with the network through neighborhood communication. We first provide a fully distributed iterative algorithm to asymptotically compute the global optimal estimate. The convergence rate of the algorithm will be maximized using a scaling parameter and a preconditioning method. This algorithm works for a general network. For a network without loops, we also provide a different iterative algorithm to compute the global optimal estimate which converges in a finite number of steps. We include numerical experiments to illustrate the performances of the proposed methods.