Estimation on graphs from relative measurements
Authors:
- Prabib BarooahPBPrabib Barooah
- Joao P. HespanhaJHJoao P. Hespanha
- 16 July 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems
- Vol. 27 (4) , 57-74
Abstract
Large-scale sensor networks give rise to estimation problems that have a rich graphical structure. We studied one of these problems in terms of how such an estimate can be efficiently computed in a distributed manner as well as how the quality of an optimal estimate scales with the size of the network. Two distributed algorithms are presented to compute the optimal estimates that are scalable and robust to communication failures. In designing these algorithms, we found the literature on parallel computation to be a rich source of inspiration.Keywords
This publication has 19 references indexed in Scilit:
- ExScal: Elements of an Extreme Scale Wireless Sensor Network2006
- Distributed Optimal Estimation from Relative Measurements for Localization and Time Synchronization2006
- Estimation from relative measurements: error bounds from electrical analogy2005
- Energy Efficiency of the IEEE 802.15.4 Standard in Dense Wireless Microsensor Networks: Modeling and Improvement Perspectives2005
- Error characteristics of ad hoc positioning systems (aps)2004
- Multipath Routing in Mobile Ad Hoc Networks: Issues and Challenges2004
- Application of the lattice Green’s function for calculating the resistance of an infinite network of resistorsAmerican Journal of Physics, 2000
- Emerging challenges: Mobile networking for “Smart Dust”Journal of Communications and Networks, 2000
- On the resistance between two points on a gridAmerican Journal of Physics, 1994
- The electrical resistance of a graph captures its commute and cover times1989