1,728 research outputs found
Block-sparsity-based localization in wireless sensor networks
In this paper, we deal with the localization problem in wireless sensor networks, where a target sensor location must
be estimated starting from few measurements of the power present in a radio signal received from sensors with
known locations. Inspired by the recent advances in sparse approximation, the localization problem is recast as a
block-sparse signal recovery problem in the discrete spatial domain. In this paper, we develop different
RSS-fingerprinting localization algorithms and propose a dictionary optimization based on the notion of the
coherence to improve the reconstruction efficiency. The proposed protocols are then compared with traditional
fingerprinting methods both via simulation and on-field experiments. The results prove that our methods outperform
the existing ones in terms of the achieved localization accuracy
Sampling of graph signals via randomized local aggregations
Sampling of signals defined over the nodes of a graph is one of the crucial
problems in graph signal processing. While in classical signal processing
sampling is a well defined operation, when we consider a graph signal many new
challenges arise and defining an efficient sampling strategy is not
straightforward. Recently, several works have addressed this problem. The most
common techniques select a subset of nodes to reconstruct the entire signal.
However, such methods often require the knowledge of the signal support and the
computation of the sparsity basis before sampling. Instead, in this paper we
propose a new approach to this issue. We introduce a novel technique that
combines localized sampling with compressed sensing. We first choose a subset
of nodes and then, for each node of the subset, we compute random linear
combinations of signal coefficients localized at the node itself and its
neighborhood. The proposed method provides theoretical guarantees in terms of
reconstruction and stability to noise for any graph and any orthonormal basis,
even when the support is not known.Comment: IEEE Transactions on Signal and Information Processing over Networks,
201
- …