By Topic

Performance analysis of distributed tracking with consensus on noisy time-varying graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yongxiang Ruan ; Dept. of Electr. & Comput., Eng., Univ. of New Mexico, Albuquerque, NM, USA ; Jayaweera, S.K. ; Mosquera, C.

This paper considers a problem of distributed tracking with consensus on a time-varying graph with noisy communications links. A distributed tracking with consensus algorithm is proposed to handle a time-varying network topology in which every node generates own local tracking estimates and communicates over noisy links. The conditions on the connectivity graph are established so that distributed consensus can be achieved in the presence of noisy communication links when the graph topology is time-varying. The steady-state performance of the proposed distributed tracking with consensus algorithm is analyzed and compared with that of distributed local Kalman filtering with centralized fusion. Simulation results and performance analysis of the proposed algorithm are also given.

Published in:

Advanced satellite multimedia systems conference (asma) and the 11th signal processing for space communications workshop (spsc), 2010 5th

Date of Conference:

13-15 Sept. 2010