No Arabic abstract
This paper considers state estimation of linear systems using analog amplify and forwarding with multiple sensors, for both multiple access and orthogonal access schemes. Optimal state estimation can be achieved at the fusion center using a time varying Kalman filter. We show that in many situations, the estimation error covariance decays at a rate of $1/M$ when the number of sensors $M$ is large. We consider optimal allocation of transmission powers that 1) minimizes the sum power usage subject to an error covariance constraint and 2) minimizes the error covariance subject to a sum power constraint. In the case of fading channels with channel state information the optimization problems are solved using a greedy approach, while for fading channels without channel state information but with channel statistics available a sub-optimal linear estimator is derived.
Technological advances have made wireless sensors cheap and reliable enough to be brought into industrial use. A major challenge arises from the fact that wireless channels introduce random packet dropouts. Power control and coding are key enabling technologies in wireless communications to ensure efficient communications. In the present work, we examine the role of power control and coding for Kalman filtering over wireless correlated channels. Two estimation architectures are considered: In the first, the sensors send their measurements directly to a single gateway. In the second scheme, wireless relay nodes provide additional links. The gateway decides on the coding scheme and the transmitter power levels of the wireless nodes. The decision process is carried out on-line and adapts to varying channel conditions in order to improve the trade-off between state estimation accuracy and energy expenditure. In combination with predictive power control, we investigate the use of multiple-description coding, zero-error coding and network coding and provide sufficient conditions for the expectation of the estimation error covariance matrix to be bounded. Numerical results suggest that the proposed method may lead to energy savings of around 50 %, when compared to an alternative scheme, wherein transmission power levels and bit-rates are governed by simple logic. In particular, zero-error coding is preferable at time instances with high channel gains, whereas multiple-description coding is superior for time instances with low gains. When channels between the sensors and the gateway are in deep fades, network coding improves estimation accuracy significantly without sacrificing energy efficiency.
We consider the problem of oblivious transfer (OT) over OFDM and MIMO wireless communication systems where only the receiver knows the channel state information. The sender and receiver also have unlimited access to a noise-free real channel. Using a physical layer approach, based on the properties of the noisy fading channel, we propose a scheme that enables the transmitter to send obliviously one-of-two files, i.e., without knowing which one has been actually requested by the receiver, while also ensuring that the receiver does not get any information about the other file.
In this paper, we investigate the state estimation problem over multiple Markovian packet drop channels. In this problem setup, a remote estimator receives measurement data transmitted from multiple sensors over individual channels. By the method of Markovian jump linear systems, an optimal stationary estimator that minimizes the error variance in the steady state is obtained, based on the mean-square (MS) stabilizing solution to the coupled algebraic Riccati equations. An explicit necessary and sufficient condition is derived for the existence of the MS stabilizing solution, which coincides with that of the standard Kalman filter. More importantly, we provide a sufficient condition under which the MS detectability with multiple Markovian packet drop channels can be decoupled, and propose a locally optimal stationary estimator but computationally more tractable. Analytic sufficient and necessary MS detectability conditions are presented for the decoupled subsystems subsequently. Finally, numerical simulations are conducted to illustrate the results on the MS stabilizing solution, the MS detectability, and the performance of the optimal and locally optimal stationary estimators.
A hybrid communication network with a common analog signal and an independent digital data stream as input to each node in a multiple access network is considered. The receiver/base-station has to estimate the analog signal with a given fidelity, and decode the digital streams with a low error probability. Treating the analog signal as a common state process, we set up a joint state estimation and communication problem in a Gaussian multiple access channel (MAC) with additive state. The transmitters have non-causal knowledge of the state process, and need to communicate independent data streams in addition to facilitating state estimation at the receiver. We first provide a complete characterization of the optimal trade-off between mean squared error distortion performance in estimating the state and the data rates for the message streams from two transmitting nodes. This is then generalized to an N-sender MAC. To this end, we show a natural connection between the state-dependent MAC model and a hybrid multi-sensor network in which a common source phenomenon is observed at N transmitting nodes. Each node encodes the source observations as well as an independent message stream over a Gaussian MAC without any state process. The receiver is interested estimating the source and all the messages. Again the distortion-rate performance is characterized.
We consider the problem of minimizing the age of information when a source can transmit status updates over two heterogeneous channels. Our work is motivated by recent developments in 5G mmWave technology, where transmissions may occur over an unreliable but fast (e.g., mmWave) channel or a slow reliable (e.g., sub-6GHz) channel. The unreliable channel is modeled as a time-correlated Gilbert-Elliot channel at a high rate when the channel is in the ON state. The reliable channel provides a deterministic but lower data rate. The scheduling strategy determines the channel to be used for transmission in each time slot, aiming to minimize the time-average age of information (AoI). The optimal scheduling problem is formulated as a Markov Decision Process (MDP), which is challenging to solve because super-modularity does not hold in a part of the state space. We address this challenge and show that a multi-dimensional threshold-type scheduling policy is optimal for minimizing the age. By exploiting the structure of the MDP and analyzing the discrete-time Markov chains (DTMCs) of the threshold-type policy, we devise a low-complexity bisection algorithm to compute the optimal thresholds. We compare different scheduling policies using numerical simulations.