Sensing capacity for Markov random fields

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

[1]  R. Gallager Information Theory and Reliable Communication , 1968 .

[2]  Anna Scaglione,et al.  On the Interdependence of Routing and Data Compression in Multi-Hop Sensor Networks , 2002, MobiCom '02.

[3]  M. Vetterli,et al.  Power-bandwidth-distortion scaling laws for sensor networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[4]  O. F. Cook The Method of Types , 1898 .

[5]  Stan Z. Li,et al.  Markov Random Field Modeling in Image Analysis , 2001, Computer Science Workbench.

[6]  Pradeep K. Khosla,et al.  Sensing capacity for discrete sensor network applications , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[7]  S. Sitharama Iyengar,et al.  Coding theory framework for target location in distributed sensor networks , 2001, Proceedings International Conference on Information Technology: Coding and Computing.

[8]  Pramod K. Varshney,et al.  Distributed Detection and Data Fusion , 1996 .

[9]  Pradeep K. Khosla,et al.  Sensing capacity for target detection , 2004, Information Theory Workshop.

[10]  Imre Csisźar,et al.  The Method of Types , 1998, IEEE Trans. Inf. Theory.

[11]  Mingyan Liu,et al.  Data-gathering wireless sensor networks: organization and capacity , 2003, Comput. Networks.