• DocumentCode
    2265525
  • Title

    Sensing capacity for Markov random fields

  • Author

    Rachlin, Yaron ; Negi, Rohit ; Khosla, Pradeep

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA
  • fYear
    2005
  • fDate
    4-9 Sept. 2005
  • Firstpage
    132
  • Lastpage
    136
  • 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
  • Keywords
    Markov processes; distributed sensors; random codes; type theory; random coding argument; sensing capacity; sensor network; two-dimensional Markov random field; type theory; Bandwidth; Capacitive sensors; Computer networks; Constraint theory; Decoding; Markov random fields; Noise level; Sampling methods; Sensor phenomena and characterization; Working environment noise;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
  • Conference_Location
    Adelaide, SA
  • Print_ISBN
    0-7803-9151-9
  • Type

    conf

  • DOI
    10.1109/ISIT.2005.1523308
  • Filename
    1523308