The goal of this paper is to design the topology of a wireless sensor network observing a Markov random field in order to match the structure of the dependency graph of the observed field, under constraints on the energy spent to maintain the sensor network connectivity. The approach is important to enable the implementation of belief propagation algorithms at the network level, to achieve optimal decisions requiring simple message passing mechanisms among nearby nodes. Our main task is to recover the sparsity of the dependency graph and to replicate it at the sensor network level, under the constraint of limiting the transmit power necessary to establish the link among the nodes. To avoid the computational burden of the combinatorial problem associated to the topology design, we devise ad hoc relaxation techniques that allow us to achieve the solution through efficient algorithms based on difference of convex problems. © 2011 IEEE.

Energy preserving matching of sensor network topology to dependency graph of the observed field / SARDELLITTI, Stefania; BARBAROSSA, Sergio. - (2011), pp. 1-8. ((Intervento presentato al convegno 17th International Conference on Digital Signal Processing, DSP 2011 tenutosi a Corfu; Greece nel 6 July 2011 through 8 July 2011 [10.1109/icdsp.2011.6005018].

Energy preserving matching of sensor network topology to dependency graph of the observed field

SARDELLITTI, Stefania;BARBAROSSA, Sergio
2011

Abstract

The goal of this paper is to design the topology of a wireless sensor network observing a Markov random field in order to match the structure of the dependency graph of the observed field, under constraints on the energy spent to maintain the sensor network connectivity. The approach is important to enable the implementation of belief propagation algorithms at the network level, to achieve optimal decisions requiring simple message passing mechanisms among nearby nodes. Our main task is to recover the sparsity of the dependency graph and to replicate it at the sensor network level, under the constraint of limiting the transmit power necessary to establish the link among the nodes. To avoid the computational burden of the combinatorial problem associated to the topology design, we devise ad hoc relaxation techniques that allow us to achieve the solution through efficient algorithms based on difference of convex problems. © 2011 IEEE.
9781457702730
9781457702747
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/400345
 Attenzione

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

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