Error exponents for decentralized detection in tree networks

DOI10.1007/978-0-387-68845-9_3MaRDI QIDQ3004401zbMATH OpenOpenAlexFDO

Authors Wee Peng Tay, John N. Tsitsiklis

Publication date 1 June 2011

Published in Networked Sensing Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-0-387-68845-9_3

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13)

Recommendations

• Data Fusion Trees for Detection: Does Architecture Matter?
• Decentralized detection by a large number of sensors
• scientific article; zbMATH DE number 1760594
• Decentralized sequential detection with a fusion center performing the sequential test
• On Error Exponents in Hypothesis Testing

Cited in

(6)

• On Error Exponents in Hypothesis Testing
• Data Fusion Trees for Detection: Does Architecture Matter?
• Decentralized sequential detection with a fusion center performing the sequential test
• Error exponents for distributed detection of Markov sources
• Closed-Form Error Exponent for the Neyman–Pearson Fusion of Dependent Local Decisions in a One-Dimensional Sensor Network
• Detection Performance of the Majority Dominance Rule in m -Ary Relay Trees With Node and Link Failures

This page was built for publication: Error exponents for decentralized detection in tree networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004401)