60,729 research outputs found
Magneto-inductive Passive Relaying in Arbitrarily Arranged Networks
We consider a wireless sensor network that uses inductive near-field coupling
for wireless powering or communication, or for both. The severely limited range
of an inductively coupled source-destination pair can be improved using
resonant relay devices, which are purely passive in nature. Utilization of such
magneto-inductive relays has only been studied for regular network topologies,
allowing simplified assumptions on the mutual antenna couplings. In this work
we present an analysis of magneto-inductive passive relaying in arbitrarily
arranged networks. We find that the resulting channel has characteristics
similar to multipath fading: the channel power gain is governed by a
non-coherent sum of phasors, resulting in increased frequency selectivity. We
propose and study two strategies to increase the channel power gain of random
relay networks: i) deactivation of individual relays by open-circuit switching
and ii) frequency tuning. The presented results show that both methods improve
the utilization of available passive relays, leading to reliable and
significant performance gains.Comment: 6 pages, 9 figures. To be presented at the IEEE International
Conference on Communications (ICC), Paris, France, May 201
Optimal model-free prediction from multivariate time series
Forecasting a time series from multivariate predictors constitutes a
challenging problem, especially using model-free approaches. Most techniques,
such as nearest-neighbor prediction, quickly suffer from the curse of
dimensionality and overfitting for more than a few predictors which has limited
their application mostly to the univariate case. Therefore, selection
strategies are needed that harness the available information as efficiently as
possible. Since often the right combination of predictors matters, ideally all
subsets of possible predictors should be tested for their predictive power, but
the exponentially growing number of combinations makes such an approach
computationally prohibitive. Here a prediction scheme that overcomes this
strong limitation is introduced utilizing a causal pre-selection step which
drastically reduces the number of possible predictors to the most predictive
set of causal drivers making a globally optimal search scheme tractable. The
information-theoretic optimality is derived and practical selection criteria
are discussed. As demonstrated for multivariate nonlinear stochastic delay
processes, the optimal scheme can even be less computationally expensive than
commonly used sub-optimal schemes like forward selection. The method suggests a
general framework to apply the optimal model-free approach to select variables
and subsequently fit a model to further improve a prediction or learn
statistical dependencies. The performance of this framework is illustrated on a
climatological index of El Ni\~no Southern Oscillation.Comment: 14 pages, 9 figure
Robust Environmental Mapping by Mobile Sensor Networks
Constructing a spatial map of environmental parameters is a crucial step to
preventing hazardous chemical leakages, forest fires, or while estimating a
spatially distributed physical quantities such as terrain elevation. Although
prior methods can do such mapping tasks efficiently via dispatching a group of
autonomous agents, they are unable to ensure satisfactory convergence to the
underlying ground truth distribution in a decentralized manner when any of the
agents fail. Since the types of agents utilized to perform such mapping are
typically inexpensive and prone to failure, this results in poor overall
mapping performance in real-world applications, which can in certain cases
endanger human safety. This paper presents a Bayesian approach for robust
spatial mapping of environmental parameters by deploying a group of mobile
robots capable of ad-hoc communication equipped with short-range sensors in the
presence of hardware failures. Our approach first utilizes a variant of the
Voronoi diagram to partition the region to be mapped into disjoint regions that
are each associated with at least one robot. These robots are then deployed in
a decentralized manner to maximize the likelihood that at least one robot
detects every target in their associated region despite a non-zero probability
of failure. A suite of simulation results is presented to demonstrate the
effectiveness and robustness of the proposed method when compared to existing
techniques.Comment: accepted to icra 201
Extrinsic Jensen-Shannon Divergence: Applications to Variable-Length Coding
This paper considers the problem of variable-length coding over a discrete
memoryless channel (DMC) with noiseless feedback. The paper provides a
stochastic control view of the problem whose solution is analyzed via a newly
proposed symmetrized divergence, termed extrinsic Jensen-Shannon (EJS)
divergence. It is shown that strictly positive lower bounds on EJS divergence
provide non-asymptotic upper bounds on the expected code length. The paper
presents strictly positive lower bounds on EJS divergence, and hence
non-asymptotic upper bounds on the expected code length, for the following two
coding schemes: variable-length posterior matching and MaxEJS coding scheme
which is based on a greedy maximization of the EJS divergence.
As an asymptotic corollary of the main results, this paper also provides a
rate-reliability test. Variable-length coding schemes that satisfy the
condition(s) of the test for parameters and , are guaranteed to achieve
rate and error exponent . The results are specialized for posterior
matching and MaxEJS to obtain deterministic one-phase coding schemes achieving
capacity and optimal error exponent. For the special case of symmetric
binary-input channels, simpler deterministic schemes of optimal performance are
proposed and analyzed.Comment: 17 pages (two-column), 4 figures, to appear in IEEE Transactions on
Information Theor
- …