Abstract:
This paper computes the sensing capacity of a sensor network, with sensors of limited range, sensing a two-dimensional Markov random field, by modeling the sensing operation as an encoder. Sensor observations are dependent across sensors, and the sensor network output across different states of the environment is neither identically nor independently distributed. Using a random coding argument, based on the theory of types, we prove a lower bound on the sensing capacity of the network, which characterizes the ability of the sensor network to distinguish among environments with Markov structure, to within a desired accuracy.
Notes:
to appear
copied = false, 2000);
">
@conference{Rachlin-2005-16966,
author = {Yaron Rachlin And R. Negi And Pradeep Khosla},
title = {Sensing Capacity for Markov Random Fields},
booktitle = {Proceedings of International Symposium on Information Theory (ISIT '05)},
year = {2005},
month = {September},
pages = {132 - 136},
}
author = {Yaron Rachlin And R. Negi And Pradeep Khosla},
title = {Sensing Capacity for Markov Random Fields},
booktitle = {Proceedings of International Symposium on Information Theory (ISIT '05)},
year = {2005},
month = {September},
pages = {132 - 136},
}