Hypothesis testing over cascade channels

Abstract

Binary hypothesis testing over single and parallel cascade channels is considered where sensors communicate with dedicated relays, and these relays with a single final receiver. All relays as well as the final receiver decide on the binary hypothesis governing the joint probability distribution of the observations at the sensors, relays, and final receiver. The quantity of interest is the set of feasible type-II error exponents that allow for the type-I error probabilities to vanish asymptotically as the observation length increases. A coding scheme is proposed and the corresponding set of feasible type-II error exponents is analyzed by means of a modified Han-type analysis that can account for distributed decisions based on different codebooks and for nodes forwarding their decisions to other nodes. The obtained exponent region is optimal in some special cases.

Balanced Performance Between Energy-Delay and Bit Error Rate in UAV Relay Networks

“…The R node requires oneslot processing to forward the received data to the S a and S b node during the second time slots, i.e. n= 2, 3, 4,...N [37]. Then, the information-causality constrain is obtained as:…”

A Strong Converse Theorem for Hypothesis Testing Against Independence over a Two-Hop Network

“…Recall that in the first remark of Theorem 2, we provide an exact characterization of the rate-exponent region for any such that . The converse proof follows from Theorem 2 and the achievability part was given in ([ 20 ] (Corollary 1)). Combining the first remark of Theorem 2 and Proposition 1, we provide an exact characterization of for any such that .…”