Designing sensor networks with decentralized and autonomous decisions capabilities, i.e., without the need to send all the collected data to a fusion center, is a big challenge that is receiving considerable attention. One of the major drawbacks of distributed algorithms is their iterative nature. This makes them prone to an energy consumption that depends on the convergence time and on the power transmitted by each node to guarantee the network connectivity. Furthermore, in a realistic environment, the interaction among sensor is inevitably corrupted by noise which affects the final decision. In this work, we describe decentralized algorithms for implementing various processing tasks, from spatial smoothing to distributed decision, characterized by fast convergence properties, for a given network topology, and resilience against inter-sensor communication noise. © 2008 IEEE.

Distributed Processing Algorithms for Wireless Sensor Networks Having Fast Convergence and Robustness Against Coupling Noise / BARBAROSSA, Sergio; T., BATTISTI; PESCOSOLIDO, Loreto; SARDELLITTI, Stefania; SCUTARI, GESUALDO. - (2008), pp. 1-6. ((Intervento presentato al convegno 2008 IEEE International Symposium on Spread Spectrum Techniques and Applications tenutosi a Bologna; Italy nel August 25 - 28, 2008. [10.1109/ISSSTA.2008.7].

Distributed Processing Algorithms for Wireless Sensor Networks Having Fast Convergence and Robustness Against Coupling Noise

BARBAROSSA, Sergio;PESCOSOLIDO, Loreto;SARDELLITTI, Stefania;SCUTARI, GESUALDO
2008

Abstract

Designing sensor networks with decentralized and autonomous decisions capabilities, i.e., without the need to send all the collected data to a fusion center, is a big challenge that is receiving considerable attention. One of the major drawbacks of distributed algorithms is their iterative nature. This makes them prone to an energy consumption that depends on the convergence time and on the power transmitted by each node to guarantee the network connectivity. Furthermore, in a realistic environment, the interaction among sensor is inevitably corrupted by noise which affects the final decision. In this work, we describe decentralized algorithms for implementing various processing tasks, from spatial smoothing to distributed decision, characterized by fast convergence properties, for a given network topology, and resilience against inter-sensor communication noise. © 2008 IEEE.
9781424422036
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: http://hdl.handle.net/11573/357656
 Attenzione

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

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