18,101 research outputs found
Effects of Spatial Randomness on Locating a Point Source with Distributed Sensors
Most studies that consider the problem of estimating the location of a point
source in wireless sensor networks assume that the source location is estimated
by a set of spatially distributed sensors, whose locations are fixed. Motivated
by the fact that the observation quality and performance of the localization
algorithm depend on the location of the sensors, which could be randomly
distributed, this paper investigates the performance of a recently proposed
energy-based source-localization algorithm under the assumption that the
sensors are positioned according to a uniform clustering process. Practical
considerations such as the existence and size of the exclusion zones around
each sensor and the source will be studied. By introducing a novel performance
measure called the estimation outage, it will be shown how parameters related
to the network geometry such as the distance between the source and the closest
sensor to it as well as the number of sensors within a region surrounding the
source affect the localization performance.Comment: 7 Pages, 5 Figures, To appear at the 2014 IEEE International
Conference on Communications (ICC'14) Workshop on Advances in Network
Localization and Navigation (ANLN), Invited Pape
One-bit Distributed Sensing and Coding for Field Estimation in Sensor Networks
This paper formulates and studies a general distributed field reconstruction
problem using a dense network of noisy one-bit randomized scalar quantizers in
the presence of additive observation noise of unknown distribution. A
constructive quantization, coding, and field reconstruction scheme is developed
and an upper-bound to the associated mean squared error (MSE) at any point and
any snapshot is derived in terms of the local spatio-temporal smoothness
properties of the underlying field. It is shown that when the noise, sensor
placement pattern, and the sensor schedule satisfy certain weak technical
requirements, it is possible to drive the MSE to zero with increasing sensor
density at points of field continuity while ensuring that the per-sensor
bitrate and sensing-related network overhead rate simultaneously go to zero.
The proposed scheme achieves the order-optimal MSE versus sensor density
scaling behavior for the class of spatially constant spatio-temporal fields.Comment: Fixed typos, otherwise same as V2. 27 pages (in one column review
format), 4 figures. Submitted to IEEE Transactions on Signal Processing.
Current version is updated for journal submission: revised author list,
modified formulation and framework. Previous version appeared in Proceedings
of Allerton Conference On Communication, Control, and Computing 200
Pairwise Quantization
We consider the task of lossy compression of high-dimensional vectors through
quantization. We propose the approach that learns quantization parameters by
minimizing the distortion of scalar products and squared distances between
pairs of points. This is in contrast to previous works that obtain these
parameters through the minimization of the reconstruction error of individual
points. The proposed approach proceeds by finding a linear transformation of
the data that effectively reduces the minimization of the pairwise distortions
to the minimization of individual reconstruction errors. After such
transformation, any of the previously-proposed quantization approaches can be
used. Despite the simplicity of this transformation, the experiments
demonstrate that it achieves considerable reduction of the pairwise distortions
compared to applying quantization directly to the untransformed data
Modulation Diversity in Fading Channels with Quantized Receiver
In this paper, we address the design of codes which achieve modulation
diversity in block fading single-input single-output (SISO) channels with
signal quantization at receiver and low-complexity decoding. With an
unquantized receiver, coding based on algebraic rotations is known to achieve
modulation coding diversity. On the other hand, with a quantized receiver,
algebraic rotations may not guarantee diversity. Through analysis, we propose
specific rotations which result in the codewords having equidistant
component-wise projections. We show that the proposed coding scheme achieves
maximum modulation diversity with a low-complexity minimum distance decoder and
perfect channel knowledge. Relaxing the perfect channel knowledge assumption we
propose a novel training/estimation and receiver control technique to estimate
the channel. We show that our coding/training/estimation scheme and minimum
distance decoding achieve an error probability performance similar to that
achieved with perfect channel knowledge
- …