Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
