We propose a decentralized, sequential and adaptive hypothesis test in sensor networks, which extends Chernoff's test to a decentralized setting. We show that the proposed test achieves the same asymptotic optimality of the original one, minimizing the expected cost required to reach a decision plus the expected cost of making a wrong decision, when the observation cost per unit time tends to zero. We also show that the proposed test is parsimonious in terms of communications. Namely, in the regime of vanishing observation cost per unit time, the expected number of channel uses required by each sensor to complete the test converges to four.
Decentralized Chernoff Test in Sensor Networks
A. Rangi,M. Franceschetti,S. Maranò
Published 2018 in International Symposium on Information Theory
ABSTRACT
PUBLICATION RECORD
- Publication year
2018
- Venue
International Symposium on Information Theory
- Publication date
2018-06-01
- Fields of study
Computer Science, Engineering
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-27 of 27 references · Page 1 of 1
CITED BY
Showing 1-6 of 6 citing papers · Page 1 of 1