18,430 research outputs found
Decentralized sequential change detection using physical layer fusion
The problem of decentralized sequential detection with conditionally
independent observations is studied. The sensors form a star topology with a
central node called fusion center as the hub. The sensors make noisy
observations of a parameter that changes from an initial state to a final state
at a random time where the random change time has a geometric distribution. The
sensors amplify and forward the observations over a wireless Gaussian multiple
access channel and operate under either a power constraint or an energy
constraint. The optimal transmission strategy at each stage is shown to be the
one that maximizes a certain Ali-Silvey distance between the distributions for
the hypotheses before and after the change. Simulations demonstrate that the
proposed analog technique has lower detection delays when compared with
existing schemes. Simulations further demonstrate that the energy-constrained
formulation enables better use of the total available energy than the
power-constrained formulation in the change detection problem.Comment: 10 pages, two-column, 10 figures, revised based on feedback from
reviewers, accepted for publication in IEEE Trans. on Wireless Communication
On optimal quantization rules for some problems in sequential decentralized detection
We consider the design of systems for sequential decentralized detection, a
problem that entails several interdependent choices: the choice of a stopping
rule (specifying the sample size), a global decision function (a choice between
two competing hypotheses), and a set of quantization rules (the local decisions
on the basis of which the global decision is made). This paper addresses an
open problem of whether in the Bayesian formulation of sequential decentralized
detection, optimal local decision functions can be found within the class of
stationary rules. We develop an asymptotic approximation to the optimal cost of
stationary quantization rules and exploit this approximation to show that
stationary quantizers are not optimal in a broad class of settings. We also
consider the class of blockwise stationary quantizers, and show that
asymptotically optimal quantizers are likelihood-based threshold rules.Comment: Published as IEEE Transactions on Information Theory, Vol. 54(7),
3285-3295, 200
- …