17,968 research outputs found
People-Sensing Spatial Characteristics of RF Sensor Networks
An "RF sensor" network can monitor RSS values on links in the network and
perform device-free localization, i.e., locating a person or object moving in
the area in which the network is deployed. This paper provides a statistical
model for the RSS variance as a function of the person's position w.r.t. the
transmitter (TX) and receiver (RX). We show that the ensemble mean of the RSS
variance has an approximately linear relationship with the expected total
affected power (ETAP). We then use analysis to derive approximate expressions
for the ETAP as a function of the person's position, for both scattering and
reflection. Counterintuitively, we show that reflection, not scattering, causes
the RSS variance contours to be shaped like Cassini ovals. Experimental tests
reported here and in past literature are shown to validate the analysis
Extended Object Tracking: Introduction, Overview and Applications
This article provides an elaborate overview of current research in extended
object tracking. We provide a clear definition of the extended object tracking
problem and discuss its delimitation to other types of object tracking. Next,
different aspects of extended object modelling are extensively discussed.
Subsequently, we give a tutorial introduction to two basic and well used
extended object tracking approaches - the random matrix approach and the Kalman
filter-based approach for star-convex shapes. The next part treats the tracking
of multiple extended objects and elaborates how the large number of feasible
association hypotheses can be tackled using both Random Finite Set (RFS) and
Non-RFS multi-object trackers. The article concludes with a summary of current
applications, where four example applications involving camera, X-band radar,
light detection and ranging (lidar), red-green-blue-depth (RGB-D) sensors are
highlighted.Comment: 30 pages, 19 figure
Medians and Beyond: New Aggregation Techniques for Sensor Networks
Wireless sensor networks offer the potential to span and monitor large
geographical areas inexpensively. Sensors, however, have significant power
constraint (battery life), making communication very expensive. Another
important issue in the context of sensor-based information systems is that
individual sensor readings are inherently unreliable. In order to address these
two aspects, sensor database systems like TinyDB and Cougar enable in-network
data aggregation to reduce the communication cost and improve reliability. The
existing data aggregation techniques, however, are limited to relatively simple
types of queries such as SUM, COUNT, AVG, and MIN/MAX. In this paper we propose
a data aggregation scheme that significantly extends the class of queries that
can be answered using sensor networks. These queries include (approximate)
quantiles, such as the median, the most frequent data values, such as the
consensus value, a histogram of the data distribution, as well as range
queries. In our scheme, each sensor aggregates the data it has received from
other sensors into a fixed (user specified) size message. We provide strict
theoretical guarantees on the approximation quality of the queries in terms of
the message size. We evaluate the performance of our aggregation scheme by
simulation and demonstrate its accuracy, scalability and low resource
utilization for highly variable input data sets
Optimizing Associative Information Transfer within Content-addressable Memory
Original article can be found at: http://www.oldcitypublishing.com/IJUC/IJUC.htmlPeer reviewe
Distributed Adaptive Learning with Multiple Kernels in Diffusion Networks
We propose an adaptive scheme for distributed learning of nonlinear functions
by a network of nodes. The proposed algorithm consists of a local adaptation
stage utilizing multiple kernels with projections onto hyperslabs and a
diffusion stage to achieve consensus on the estimates over the whole network.
Multiple kernels are incorporated to enhance the approximation of functions
with several high and low frequency components common in practical scenarios.
We provide a thorough convergence analysis of the proposed scheme based on the
metric of the Cartesian product of multiple reproducing kernel Hilbert spaces.
To this end, we introduce a modified consensus matrix considering this specific
metric and prove its equivalence to the ordinary consensus matrix. Besides, the
use of hyperslabs enables a significant reduction of the computational demand
with only a minor loss in the performance. Numerical evaluations with synthetic
and real data are conducted showing the efficacy of the proposed algorithm
compared to the state of the art schemes.Comment: Double-column 15 pages, 10 figures, submitted to IEEE Trans. Signal
Processin
Stationary and Mobile Target Detection using Mobile Wireless Sensor Networks
In this work, we study the target detection and tracking problem in mobile
sensor networks, where the performance metrics of interest are probability of
detection and tracking coverage, when the target can be stationary or mobile
and its duration is finite. We propose a physical coverage-based mobility
model, where the mobile sensor nodes move such that the overlap between the
covered areas by different mobile nodes is small. It is shown that for
stationary target scenario the proposed mobility model can achieve a desired
detection probability with a significantly lower number of mobile nodes
especially when the detection requirements are highly stringent. Similarly,
when the target is mobile the coverage-based mobility model produces a
consistently higher detection probability compared to other models under
investigation.Comment: 7 pages, 12 figures, appeared in INFOCOM 201
Multi-agents adaptive estimation and coverage control using Gaussian regression
We consider a scenario where the aim of a group of agents is to perform the
optimal coverage of a region according to a sensory function. In particular,
centroidal Voronoi partitions have to be computed. The difficulty of the task
is that the sensory function is unknown and has to be reconstructed on line
from noisy measurements. Hence, estimation and coverage needs to be performed
at the same time. We cast the problem in a Bayesian regression framework, where
the sensory function is seen as a Gaussian random field. Then, we design a set
of control inputs which try to well balance coverage and estimation, also
discussing convergence properties of the algorithm. Numerical experiments show
the effectivness of the new approach
- ā¦