pith. sign in

arxiv: cs/0508054 · v1 · pith:JFK45X3Pnew · submitted 2005-08-10 · 💻 cs.IT · math.IT

Sensing Capacity for Markov Random Fields

classification 💻 cs.IT math.IT
keywords sensingnetworksensorcapacitymarkovrandomacrosssensors
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.