In distributed sensor networks, the tradeoff between application performance and resource consumption is a fundamental issue. In this paper, we analyze the tradeoff in the context of localization problems. In particular, the localization performance is characterized using the Cramer-Rao lower bound which reflects the performance limit in the family of unbiased estimators. For a variety of dista...

In many practical parameter estimation problems, a model selection is made prior to estimation. In this paper, we consider the problem of estimating an unknown parameter of a selected population, where the population is chosen from a population set by using a predetermined selection rule. Since the selection step may have an important impact on subsequent estimation, ignoring it could lead to b...

In this paper, we consider the Bayesian Cramer-Rao bound (BCRB) for the dynamical estimation of multi-path Rayleigh channel complex gains in data-aided (DA) and non-data-aided (NDA) OFDM systems. This bound is derived in an on-line and off-line scenarios for time-invariant and time-varying complex gains within one OFDM symbol, assuming the availability of prior information. In NDA context, wher...

We show that there exist ordered orthogonal arrays, whose sizes deviate from the Rao bound by a factor is polynomial in parameters of array. The proof nonconstructive and based on probabilistic method due to Kuperberg, Lovett Peled.