Sensing Capacity for Markov Random Fields

Yaron Rachlin, R. Negi, and Pradeep Khosla
International Symposium on Information Theory (ISIT) 2005, 2005.


Download
  • Adobe portable document format (pdf) (171KB)
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

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
Number of pages: 5
Note: to appear

Text Reference
Yaron Rachlin, R. Negi, and Pradeep Khosla, "Sensing Capacity for Markov Random Fields," International Symposium on Information Theory (ISIT) 2005, 2005.

BibTeX Reference
@inproceedings{Rachlin_2005_5025,
   author = "Yaron Rachlin and R. Negi and Pradeep Khosla",
   title = "Sensing Capacity for Markov Random Fields",
   booktitle = "International Symposium on Information Theory (ISIT) 2005",
   year = "2005",
   Notes = "to appear"
}