• DocumentCode
    1197695
  • Title

    Data fusion with minimal communication

  • Author

    Luo, Zhi-Quan ; Tsitsiklis, John N.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., McMaster Univ., Hamilton, Ont., Canada
  • Volume
    40
  • Issue
    5
  • fYear
    1994
  • fDate
    9/1/1994 12:00:00 AM
  • Firstpage
    1551
  • Lastpage
    1563
  • Abstract
    Two sensors obtain data vectors x and y, respectively, and transmit real vectors m&oarr;1(x) and m&oarr;2(y), respectively, to a fusion center. The authors obtain tight lower bounds on the number of messages (the sum of the dimensions of m&oarr;1 and m&oarr;2) that have to be transmitted for the fusion center to be able to evaluate a given function f&oarr;(x,y). When the function f&oarr; is linear, they show that these bounds are effectively computable. Certain decentralized estimation problems can be cast in the framework and are discussed in some detail. In particular, the authors consider the case where x and y are random variables representing noisy measurements and f&oarr;(x,y)=E[z|x,y], where z is a random variable to be estimated. Furthermore, it is established that a standard method for combining decentralized estimates of Gaussian random variables has nearly optimal communication requirements
  • Keywords
    communication complexity; minimisation; parameter estimation; protocols; random processes; sensor fusion; stochastic processes; Gaussian random variables; communication requirements; data vectors; decentralized estimation problems; fusion center; minimal communication; noisy measurements; number of messages; random variables; Complexity theory; Councils; Distributed computing; Laboratories; Military computing; Particle measurements; Protocols; Random variables; Sensor fusion; Tin;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.333867
  • Filename
    333867