Cart (Loading....) | Create Account
Close category search window
 

Distributed Tracking in Multihop Sensor Networks With Communication Delays

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
$31 $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)
Rahman, R. ; Boston Univ., Boston ; Alanyali, M. ; Saligrama, V.

We describe distributed tracking of a nonlinear dynamical system via networked sensors. The sensors communicate with each other by means of a multihop protocol over a communication network. We derive in-network processing algorithms to deal with arbitrary network topology and then extend these results to account for communication delays and packet losses. We show that these algorithms are optimal in the linear setting and achieve centralized performance. The proposed techniques differ from existing techniques in two important aspects: a) there is no designated leader/fusion node and each sensor attempts to optimally track the system trajectory based on its local observations and time-dependent information available from other sensors in the network; b) the message computation at each sensor is structurally identical. Consequently, the sensor network can be queried at any time and at any node to obtain optimal estimates for the state of the dynamical system. We then present two multihop protocols - one based on gossip and another token-based - for distributed implementation of the in-network processing techniques. We show several advantages of token-based schemes over gossip protocols: a) message complexity is significantly smaller for achieving the same performance; b) they are well-suited for situations where target and network data aggregation time-scales are comparable; and c) they are well-suited for random geometric graphs with nodes having small communication-connectivity radius - a scenario typical of ad-hoc wireless networks. This is because they can fuse data only from the set of nodes that can be visited in any time period.

Published in:

Signal Processing, IEEE Transactions on  (Volume:55 ,  Issue: 9 )

Date of Publication:

Sept. 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.