The observations gathered by the individual nodes of a sensor network may be unreliable due to malfunctioning, observation noise or low battery level. Global reliability is typically recovered by collecting all the measurements in a fusion center which takes proper decisions. However, centralized networks are more vulnerable and prone to congestion around the sink nodes. To relax the congestion problem, decrease the network vulnerability and improve the network efficiency, it is appropriate to bring the decisions at the lowest possible level. In this paper, we propose a distributed algorithm allowing each node to improve the reliability of its own reading thanks to the interaction with the other nodes, assuming that the field monitored by the network is a smooth function. In mathematical terms, this only requires that the useful field belongs to a subspace of dimension smaller than the number of nodes. Although fully decentralized, the proposed algorithm is globally optimal, in the sense that it performs the projection of the overall set of observations onto the signal subspace through an iterative decentralized algorithms, that requires minimum convergence time, for any given node coverage. ©2009 IEEE.

DISTRIBUTED SIGNAL SUBSPACE PROJECTION ALGORITHMS WITH MAXIMUM CONVERGENCE RATE FOR SENSOR NETWORKS WITH TOPOLOGICAL CONSTRAINTS / Barbarossa, Sergio; Scutari, Gesualdo; T., Battisti. - (2009), pp. 2893-2896. (Intervento presentato al convegno IEEE International Conference on Acoustics, Speech and Signal Processing tenutosi a Taipei; Taiwan, Province of China nel APR 19-24, 2009) [10.1109/icassp.2009.4960228].

DISTRIBUTED SIGNAL SUBSPACE PROJECTION ALGORITHMS WITH MAXIMUM CONVERGENCE RATE FOR SENSOR NETWORKS WITH TOPOLOGICAL CONSTRAINTS

BARBAROSSA, Sergio;SCUTARI, GESUALDO;
2009

Abstract

The observations gathered by the individual nodes of a sensor network may be unreliable due to malfunctioning, observation noise or low battery level. Global reliability is typically recovered by collecting all the measurements in a fusion center which takes proper decisions. However, centralized networks are more vulnerable and prone to congestion around the sink nodes. To relax the congestion problem, decrease the network vulnerability and improve the network efficiency, it is appropriate to bring the decisions at the lowest possible level. In this paper, we propose a distributed algorithm allowing each node to improve the reliability of its own reading thanks to the interaction with the other nodes, assuming that the field monitored by the network is a smooth function. In mathematical terms, this only requires that the useful field belongs to a subspace of dimension smaller than the number of nodes. Although fully decentralized, the proposed algorithm is globally optimal, in the sense that it performs the projection of the overall set of observations onto the signal subspace through an iterative decentralized algorithms, that requires minimum convergence time, for any given node coverage. ©2009 IEEE.
2009
IEEE International Conference on Acoustics, Speech and Signal Processing
distributed projection; sensor networks
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
DISTRIBUTED SIGNAL SUBSPACE PROJECTION ALGORITHMS WITH MAXIMUM CONVERGENCE RATE FOR SENSOR NETWORKS WITH TOPOLOGICAL CONSTRAINTS / Barbarossa, Sergio; Scutari, Gesualdo; T., Battisti. - (2009), pp. 2893-2896. (Intervento presentato al convegno IEEE International Conference on Acoustics, Speech and Signal Processing tenutosi a Taipei; Taiwan, Province of China nel APR 19-24, 2009) [10.1109/icassp.2009.4960228].
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/186083
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 29
  • ???jsp.display-item.citation.isi??? 22
social impact