Cooperative routing for distributed detection in large sensor networks

In this paper, the detection of a correlated Gaussian field using a large multi-hop sensor network is investigated. A cooperative routing strategy is proposed by introducing a new link metric that characterizes the detection error exponent. Derived from the Chernoff information and Schweppe's likelihood recursion, this link metric captures the contribution of a given link to the decay rate of error probability and has the form of the capacity of a Gaussian channel with the sender transmitting the innovation of its measurement. For one-dimensional Gauss-Markov fields, the link metric can be represented explicitly as a function of the link length. Cooperative routing is achieved using the Kalman data aggregation and shortest path routing. Numerical simulations show that cooperative routing can be significantly more energy efficient than noncooperative routing for the same detection performance.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2007-02
Language
ENG
Keywords

MULTIPLE SENSORS

Citation

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, v.25, no.2, pp.471 - 483

ISSN
0733-8716
DOI
10.1109/JSAC.2007.070221
URI
http://hdl.handle.net/10203/180
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
SungMisraTongEphremides07JSAC.pdf(838.86 kB)Download
  • Hit : 569
  • Download : 382
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 37 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0