Artículo

An Exponentially-Tight Approximate Factorization of the Joint PDF of Statistical Dependent Measurements in Wireless Sensor Networks

Maya, Juan Augusto Icon; Rey Vega, Leonardo Javier Icon; Lopez Tonellotto, Mariana Andrea

Otros responsables

Fecha

01/2024

Editorial

Institute of Electrical and Electronics Engineers

Revista

IEEE Open Journal of the Communications Society

Título del libro

Nombre del evento

Fecha del evento

Institución organizadora

ISSN

2644-125X

eISSN

ISBN

Idioma

Inglés

Tipo del evento

Clasificación temática

Resumen

We consider the distributed detection problem of a temporally correlated random radio source signal using a wireless sensor network capable of measuring the energy of the received signals. It is well-known that optimal tests in the Neyman-Pearson setting are based on likelihood ratio tests (LRT), which, in this set-up, evaluate the quotient between the probability density functions (PDF) of the measurements when the source signal is present and absent. When the source is present, the computation of the joint PDF of the energy measurements at the nodes is a challenging problem. This is due to the statistical dependence introduced to the received signals by the propagation through fading channels of the radio signal emitted by the source. We deal with this problem using the characteristic function of the (intractable) joint PDF, and proposing an approximation to it. We derive bounds for the approximation error in two wireless propagation scenarios, slow and fast fading, and show that the proposed approximation is exponentially tight with the number of nodes when the time-bandwidth product is sufficiently high. The approximation is used as a substitute of the exact joint PDF for building an approximate LRT, which performs better than other well-known detectors, as verified by Monte Carlo simulations.

Colecciones

Aprobación

Revisión

Complementado por

Referenciado por

Licencia Creative Commons

Excepto donde se indique lo contrario, la licencia de este ítem se describe como by-nc-sa