Searcharxiv⌕ Search

arXiv subjects

Azadeh Vosoughi

Publications and source records attributed to Azadeh Vosoughi.

28 records · Page 2Linked to original sources

Switching Control of Linear Time-Varying Networked Control Systems with Sparse Observer-Controller Networks

In this paper we provide a set of stability conditions for linear time-varying networked control systems with arbitrary topologies using a piecewise quadratic switching stabilization approach with multiple quadratic Lyapunov functions. We use this set of stability conditions to provide a novel iterative low-complexity algorithm that must be updated and optimized in discrete time for the design of a sparse observer-controller network, for a given plant network with an arbitrary topology. We employ distributed observers by utilizing the output of other subsystems to improve the stability of each observer. To avoid unbounded growth of controller and observer gains, we impose bounds on the norms of the gains.

math.OC↗

On the Combined Effect of Directional Antennas and Imperfect Spectrum Sensing upon Ergodic Capacity of Cognitive Radio Systems

We consider a cognitive radio system, consisting of a primary transmitter (PUtx), a primary receiver (PUrx), a secondary transmitter (SUtx), and a secondary receiver (SUrx). The secondary users (SUs) are equipped with steerable directional antennas. We assume the SUs and primary users (PUs) coexist and the SUtx knows the geometry of network. We find the ergodic capacity of the channel between SUtx and SUrx , and study how spectrum sensing errors affect the capacity. In our system, the SUtx first senses the spectrum and then transmits data at two power levels, according to the result of sensing. The optimal SUtx transmit power levels and the optimal directions of SUtx transmit antenna and SUrx receive antenna are obtained by maximizing the ergodic capacity, subject to average transmit power and average interference power constraints. To study the effect of fading channel, we considered three scenarios: 1) when SUtx knows fading channels between SUtx and PUrx, PUtx and SUrx, SUtx and SUrx, 2) when SUtx knows only the channel between SUtx and SUrx, and statistics of the other two channels, and, 3) when SUtx only knows the statistics of these three fading channels. For each scenario, we explore the optimal SUtx transmit power levels and the optimal directions of SUtx and SUrx antennas, such that the ergodic capacity is maximized, while the power constraints are satisfied.

eess.SP↗

On Power Allocation for Distributed Detection with Correlated Observations and Linear Fusion

We consider a binary hypothesis testing problem in an inhomogeneous wireless sensor network, where a fusion center (FC) makes a global decision on the underlying hypothesis. We assume sensors observations are correlated Gaussian and sensors are unaware of this correlation when making decisions. Sensors send their modulated decisions over fading channels, subject to individual and/or total transmit power constraints. For parallel-access channel (PAC) and multiple-access channel (MAC) models, we derive modified deflection coefficient (MDC) of the test statistic at the FC with coherent reception.We propose a transmit power allocation scheme, which maximizes MDC of the test statistic, under three different sets of transmit power constraints: total power constraint, individual and total power constraints, individual power constraints only. When analytical solutions to our constrained optimization problems are elusive, we discuss how these problems can be converted to convex ones. We study how correlation among sensors observations, reliability of local decisions, communication channel model and channel qualities and transmit power constraints affect the reliability of the global decision and power allocation of inhomogeneous sensors.

eess.SP↗

On Distributed Linear Estimation With Observation Model Uncertainties

We consider distributed estimation of a Gaussian source in a heterogenous bandwidth constrained sensor network, where the source is corrupted by independent multiplicative and additive observation noises, with incomplete statistical knowledge of the multiplicative noise. For multi-bit quantizers, we derive the closed-form mean-square-error (MSE) expression for the linear minimum MSE (LMMSE) estimator at the FC. For both error-free and erroneous communication channels, we propose several rate allocation methods named as longest root to leaf path, greedy and integer relaxation to (i) minimize the MSE given a network bandwidth constraint, and (ii) minimize the required network bandwidth given a target MSE. We also derive the Bayesian Cramer-Rao lower bound (CRLB) and compare the MSE performance of our proposed methods against the CRLB. Our results corroborate that, for low power multiplicative observation noises and adequate network bandwidth, the gaps between the MSE of our proposed methods and the CRLB are negligible, while the performance of other methods like individual rate allocation and uniform is not satisfactory.

cs.IT↗

On M-ary Distributed Detection for Power Constraint Wireless Sensor Networks

We consider a wireless sensor network (WSN), consisting of several sensors and a fusion center (FC), which is tasked with solving an M-ary hypothesis testing problem. Sensors make M-ary decisions and transmit their digitally modulated decisions over orthogonal channels, which are subject to Rayleigh fading and noise, to the FC. Adopting Bayesian optimality criterion, we consider training and non-training based distributed detection systems and investigate the effect of imperfect channel state information (CSI) on the optimal maximum a posteriori probability (MAP) fusion rules and optimal power allocation between sensors, when the sum of training and data symbol transmit powers is fixed. We consider J-divergence criteria to do power allocation between sensors. The theoretical results show that J-divergence for coherent reception will be maximized if total training power be half of total power, however for non coherent reception, optimal training power which maximize J-divergence is zero. The simulated results also show that probability of error will be minimized if training power be half of total power for coherent reception and zero for non coherent reception.

cs.IT↗

A New Statistical Model of Electroencephalogram Noise Spectra for Real-time Brain-Computer Interfaces

$Objective$: A characteristic of neurological signal processing is high levels of noise from sub-cellular ion channels up to whole-brain processes. In this paper, we propose a new model of electroencephalogram (EEG) background periodograms, based on a family of functions which we call generalized van der Ziel--McWhorter (GVZM) power spectral densities (PSDs). To the best of our knowledge, the GVZM PSD function is the only EEG noise model which has relatively few parameters, matches recorded EEG PSD's with high accuracy from 0 Hz to over 30 Hz, and has approximately $1/f^θ$ behavior in the mid-frequencies without infinities. $Methods$: We validate this model using three approaches. First, we show how GVZM PSDs can arise in population of ion channels in maximum entropy equilibrium. Second, we present a class of mixed autoregressive models, which simulate brain background noise and whose periodograms are asymptotic to the GVZM PSD. Third, we present two real-time estimation algorithms for steady-state visual evoked potential (SSVEP) frequencies, and analyze their performance statistically. $Results$: In pairwise comparisons, the GVZM-based algorithms showed statistically significant accuracy improvement over two well-known and widely-used SSVEP estimators. $Conclusion$: The GVZM noise model can be a useful and reliable technique for EEG signal processing. $Significance$: Understanding EEG noise is essential for EEG-based neurology and applications such as real-time brain-computer interfaces (BCIs), which must make accurate control decisions from very short data epochs. The GVZM approach represents a successful new paradigm for understanding and managing this neurological noise.

q-bio.NC↗

Synchronization in Networked Systems with Parameter Mismatch: Adaptive Decentralized and Distributed Controls

Here, we study the ultimately bounded stability of network of mismatched systems using Lyapunov direct method. We derive an upper bound on the norm of the error of network states from its average states, which it achieves in finite time. Then, we devise a decentralized compensator to asymptotically pin the network of mismatched systems to a desired trajectory. Next, we design distributed estimators to compensate for the mismatched parameters performances of adaptive decentralized and distributed compensations are analyzed. Our analytical results are verified by several simulations in a network of globally connected Lorenz oscillators.

eess.SY↗

Distributed Binary Detection over Fading Channels: Cooperative and Parallel Architectures

This paper considers the problem of binary distributed detection of a known signal in correlated Gaussian sensing noise in a wireless sensor network, where the sensors are restricted to use likelihood ratio test (LRT), and communicate with the fusion center (FC) over bandwidth-constrained channels that are subject to fading and noise. To mitigate the deteriorating effect of fading encountered in the conventional parallel fusion architecture, in which the sensors directly communicate with the FC, we propose new fusion architectures that enhance the detection performance, via harvesting cooperative gain (so-called decision diversity gain). In particular, we propose: (i) cooperative fusion architecture with Alamouti's space-time coding (STC) scheme at sensors, (ii) cooperative fusion architecture with signal fusion at sensors, and (iii) parallel fusion architecture with local threshold changing at sensors. For these schemes, we derive the LRT and majority fusion rules at the FC, and provide upper bounds on the average error probabilities for homogeneous sensors, subject to uncorrelated Gaussian sensing noise, in terms of signal-to-noise ratio (SNR) of communication and sensing channels. Our simulation results indicate that, when the FC employs the LRT rule, unless for low communication SNR and moderate/high sensing SNR, performance improvement is feasible with the new fusion architectures. When the FC utilizes the majority rule, such improvement is possible, unless for high sensing SNR.

cs.IT↗

Bounded Stability in Networked Systems with Parameter Mismatch and Adaptive Decentralized Estimation

Here, we study the ultimately bounded stability of network of mismatched systems using Lyapunov direct method. The upper bound on the error of oscillators from the center of the neighborhood is derived. Then the performance of an adaptive compensation via decentralized control is analyzed. Finally, the analytical results for a network of globally connected Lorenz oscillators are verified.

eess.SY↗

On Distributed Vector Estimation for Power and Bandwidth Constrained Wireless Sensor Networks

We consider distributed estimation of a Gaussian vector with a linear observation model in an inhomogeneous wireless sensor network, where a fusion center (FC) reconstructs the unknown vector, using a linear estimator. Sensors employ uniform multi-bit quantizers and binary PSK modulation, and communicate with the FC over orthogonal power- and bandwidth-constrained wireless channels. We study transmit power and quantization rate (measured in bits per sensor) allocation schemes that minimize mean-square error (MSE). In particular, we derive two closed-form upper bounds on the MSE, in terms of the optimization parameters and propose coupled and decoupled resource allocation schemes that minimize these bounds. We show that the bounds are good approximations of the simulated MSE and the performance of the proposed schemes approaches the clairvoyant centralized estimation when total transmit power or bandwidth is very large. We study how the power and rate allocation are dependent on sensors observation qualities and channel gains, as well as total transmit power and bandwidth constraints. Our simulations corroborate our analytical results and illustrate the superior performance of the proposed algorithms.

cs.IT↗