Near-optimal distributed detection in balanced binary relay trees

Zhang, Z, Chong, E, Pezeshki, A, Moran, B and Howard, S 2017, 'Near-optimal distributed detection in balanced binary relay trees', IEEE Transactions on Control of Network Systems, vol. 4, no. 4, pp. 826-837.


Document type: Journal Article
Collection: Journal Articles

Title Near-optimal distributed detection in balanced binary relay trees
Author(s) Zhang, Z
Chong, E
Pezeshki, A
Moran, B
Howard, S
Year 2017
Journal name IEEE Transactions on Control of Network Systems
Volume number 4
Issue number 4
Start page 826
End page 837
Total pages 12
Publisher IEEE
Abstract We study the distributed detection problem in a balanced binary relay tree, where the leaves of the tree are sensors generating binary messages. The root of the tree is a fusion center that makes an overall decision. Every other node in the tree is a relay node that fuses binary messages from its two child nodes into a new binary message and sends it to the parent node at the next level. We assume that the relay nodes at the same level use identical fusion rule. The goal is to find a string of fusion rules used at all the levels in the tree that maximizes the reduction in the total error probability between the leaf nodes and the fusion center. We formulate this problem as a deterministic dynamic program and express the optimal strategy in terms of Bellman's equation. Moreover, we use the notion of string-submodularity to show that the reduction in the total error probability is a string-submodular function. Consequentially, we show that the greedy strategy, which only maximizes the level-wise reduction in the total error probability, performs at least within a factor (1 - 1/e) of the optimal strategy in terms of reduction in the total error probability, even if the nodes and links in the trees are subject to random failures.
Subject Electrical and Electronic Engineering not elsewhere classified
Keyword(s) Bayesian social learning
Distributed detection
Greedy strategy
Submodular function
DOI - identifier 10.1109/TCNS.2016.2562507
Copyright notice © 2016 IEEE
ISSN 2325-5870
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 1 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 0 times in Scopus Article
Altmetric details:
Access Statistics: 3 Abstract Views  -  Detailed Statistics
Created: Tue, 26 Mar 2019, 09:36:00 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us