By Topic

Error Exponents for the Detection of Gauss–Markov Signals Using Randomly Spaced Sensors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Misra, S. ; Army Res. Lab., Adelphi, MD ; Lang Tong

We derive the Neyman-Pearson error exponent for the detection of Gauss-Markov signals using randomly spaced sensors. We assume that the sensor spacings, d 1,d 2,..., are drawn independently from a common density fd(.), and we treat both stationary and nonstationary Markov models. Error exponents are evaluated using specialized forms of the strong law of large numbers, and are seen to take on algebraically simple forms involving the parameters of the Markov processes and expectations over fd(.) of certain functions of d 1. These expressions are evaluated explicitly when fd(.) corresponds to i) exponentially distributed sensors with placement density lambda; ii) equally spaced sensors; and iii) the proceeding cases when sensors fail (or equivalently, are asleep) with probability q. Many insights follow. For example, we determine the optimal lambda as a function of q in the nonstationary case. Numerical simulations show that the error exponent predicts trends of the simulated error rate accurately even for small data sizes.

Published in:

Signal Processing, IEEE Transactions on  (Volume:56 ,  Issue: 8 )