8,262 research outputs found
Spatial Whitening Framework for Distributed Estimation
Designing resource allocation strategies for power constrained sensor network
in the presence of correlated data often gives rise to intractable problem
formulations. In such situations, applying well-known strategies derived from
conditional-independence assumption may turn out to be fairly suboptimal. In
this paper, we address this issue by proposing an adjacency-based spatial
whitening scheme, where each sensor exchanges its observation with their
neighbors prior to encoding their own private information and transmitting it
to the fusion center. We comment on the computational limitations for obtaining
the optimal whitening transformation, and propose an iterative optimization
scheme to achieve the same for large networks. We demonstrate the efficacy of
the whitening framework by considering the example of bit-allocation for
distributed estimation.Comment: 4 pages, 2 figures, this paper has been presented at CAMSAP 2011;
Proc. 4th Intl. Workshop on Computational Advances in Multi-Sensor Adaptive
Processing (CAMSAP 2011), San Juan, Puerto Rico, Dec 13-16, 201
Amorphous Placement and Retrieval of Sensory Data in Sparse Mobile Ad-Hoc Networks
Abstract—Personal communication devices are increasingly being equipped with sensors that are able to passively collect information from their surroundings – information that could be stored in fairly small local caches. We envision a system in which users of such devices use their collective sensing, storage, and communication resources to query the state of (possibly remote) neighborhoods. The goal of such a system is to achieve the highest query success ratio using the least communication overhead (power). We show that the use of Data Centric Storage (DCS), or directed placement, is a viable approach for achieving this goal, but only when the underlying network is well connected. Alternatively, we propose, amorphous placement, in which sensory samples are cached locally and informed exchanges of cached samples is used to diffuse the sensory data throughout the whole network. In handling queries, the local cache is searched first for potential answers. If unsuccessful, the query is forwarded to one or more direct neighbors for answers. This technique leverages node mobility and caching capabilities to avoid the multi-hop communication overhead of directed placement. Using a simplified mobility model, we provide analytical lower and upper bounds on the ability of amorphous placement to achieve uniform field coverage in one and two dimensions. We show that combining informed shuffling of cached samples upon an encounter between two nodes, with the querying of direct neighbors could lead to significant performance improvements. For instance, under realistic mobility models, our simulation experiments show that amorphous placement achieves 10% to 40% better query answering ratio at a 25% to 35% savings in consumed power over directed placement.National Science Foundation (CNS Cybertrust 0524477, CNS NeTS 0520166, CNS ITR 0205294, EIA RI 0202067
Beamforming for Magnetic Induction based Wireless Power Transfer Systems with Multiple Receivers
Magnetic induction (MI) based communication and power transfer systems have
gained an increased attention in the recent years. Typical applications for
these systems lie in the area of wireless charging, near-field communication,
and wireless sensor networks. For an optimal system performance, the power
efficiency needs to be maximized. Typically, this optimization refers to the
impedance matching and tracking of the split-frequencies. However, an important
role of magnitude and phase of the input signal has been mostly overlooked.
Especially for the wireless power transfer systems with multiple transmitter
coils, the optimization of the transmit signals can dramatically improve the
power efficiency. In this work, we propose an iterative algorithm for the
optimization of the transmit signals for a transmitter with three orthogonal
coils and multiple single coil receivers. The proposed scheme significantly
outperforms the traditional baseline algorithms in terms of power efficiency.Comment: This paper has been accepted for presentation at IEEE GLOBECOM 2015.
It has 7 pages and 5 figure
Decision Fusion with Unknown Sensor Detection Probability
In this correspondence we study the problem of channel-aware decision fusion
when the sensor detection probability is not known at the decision fusion
center. Several alternatives proposed in the literature are compared and new
fusion rules (namely 'ideal sensors' and 'locally-optimum detection') are
proposed, showing attractive performance and linear complexity. Simulations are
provided to compare the performance of the aforementioned rules.Comment: To appear in IEEE Signal Processing Letter
- …