The goal of this work is to propose a distributed detection method for a network of radars interchanging their measurements through pulse-position modulation. The proposed approach does not need the presence of a fusion center and it is then fully decentralized. The approach is robust against node failures, as the only requirement to get the network gain is that the whole network remains connected, i.e., for every pair of nodes, there is a path, possibly composed of multiple hops, joining them. The decentralized approach is based on a distributed consensus mechanism. However, when conventional consensus algorithms are implemented over realistic channels, the receiver noise gives rise to an error on the final decision statistic that linearly increases with time. We avoid this inconvenient by properly modifying the consensus algorithm to make it suitable for communications over noisy channels. We analyze the performance of the proposed system considering the presence of both observation and communication noise present in the interaction among the radars. In particular, we show that even with a non-coherent integration, the whole system is able to achieve a sensitivity gain equal to the number of radars. © 2008 IEEE.
Radar sensor networks with distributed detection capabilities / Pescosolido, Loreto; Barbarossa, Sergio; Scutari, Gesualdo. - (2008), pp. 1-6. (Intervento presentato al convegno 2008 IEEE Radar Conference, RADAR 2008 tenutosi a Rome; Italy nel 26 May 2008 through 30 May 2008) [10.1109/radar.2008.4720927].
Radar sensor networks with distributed detection capabilities
PESCOSOLIDO, Loreto;BARBAROSSA, Sergio;SCUTARI, GESUALDO
2008
Abstract
The goal of this work is to propose a distributed detection method for a network of radars interchanging their measurements through pulse-position modulation. The proposed approach does not need the presence of a fusion center and it is then fully decentralized. The approach is robust against node failures, as the only requirement to get the network gain is that the whole network remains connected, i.e., for every pair of nodes, there is a path, possibly composed of multiple hops, joining them. The decentralized approach is based on a distributed consensus mechanism. However, when conventional consensus algorithms are implemented over realistic channels, the receiver noise gives rise to an error on the final decision statistic that linearly increases with time. We avoid this inconvenient by properly modifying the consensus algorithm to make it suitable for communications over noisy channels. We analyze the performance of the proposed system considering the presence of both observation and communication noise present in the interaction among the radars. In particular, we show that even with a non-coherent integration, the whole system is able to achieve a sensitivity gain equal to the number of radars. © 2008 IEEE.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.