Pith. sign in

REVIEW 1 cited by

Exploiting Spatial Correlation in Energy Constrained Distributed Detection

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1509.04119 v1 pith:6H7WTVQZ submitted 2015-09-14 cs.IT math.IT

classification cs.ITmath.IT
keywords correlationnetworkenergyprocessspatialclusterclustersconsider
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We consider the detection of a correlated random process immersed in noise in a wireless sensor network. Each node has an individual energy constraint and the communication with the processing central units are affected by the path loss propagation effect. Guided by energy efficiency concerns, we consider the partition of the whole network into clusters, each one with a coordination node or \emph{cluster head}. Thus, the nodes transmit their measurements to the corresponding cluster heads, which after some processing, communicate a summary of the received information to the fusion center, which takes the final decision about the state of the nature. As the network has a fixed size, communication within smaller clusters will be less affected by the path loss effect, reducing energy consumption in the information exchange process between nodes and cluster heads. However, this limits the capability of the network of beneficially exploiting the spatial correlation of the process, specially when the spatial correlation coherence of the process is of the same scale as the clusters size. Therefore, a trade-off is established between the energy efficiency and the beneficial use of spatial correlation. The study of this trade-off is the main goal of this paper. We derive tight approximations of the false alarm and miss-detection error probabilities under the Neyman-Pearson framework for the above scenario. We also consider the application of these results to a particular network and correlation model obtaining closed form expressions. Finally, we validate the results for more general network and correlation models through numerical simulations.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On Analog Gradient Descent Learning over Multiple Access Fading Channels

    cs.LG 2019-08 conditional novelty 6.0 of 10

    The GBMA algorithm lets distributed nodes transmit analog gradients over a fading multiple access channel without power control, and provably approaches centralized gradient descent convergence as the number of nodes grows.

Pith tools