.png){kind=icon}
.png){kind=icon}
Return
Distributed Detection Over Channels with Memory
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2015.2495205.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, we investigate distributed detection over channels with memory. We model the wireless channel between each sensor and the fusion center by a two state Markov chain and derive the optimal fusion rule. We demonstrate the improved detection performance of the derived fusion rule for burst error channels, over a channel aware fusion rule for a memoryless channel and the Chair-Varshney fusion rule. We further show that when the number of sensor decisions is large, as well as when the channel is memoryless, the derived fusion rule reduces to the well known counting rule.
Keywords:
Burst-error channel
channel-aware decision fusion
distributed detection
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W