Change sensor topology when needed: how to efficiently use system resources in control and estimation over wireless networks
2007 (English)In: PROCEEDINGS OF THE 46TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-14: IEEE CONFERENCE ON DECISION AND CONTROL - PROCEEDINGS, IEEE , 2007, 5957-5964 p.Conference paper (Refereed)
New control paradigms are needed for large networks of wireless sensors and actuators in order to efficiently utilize system resources. In this paper we consider when feedback control loops are formed locally to detect, monitor, and counteract disturbances that hit a plant at random instances in time and space. A sensor node that detects a disturbance dynamically forms a local multi-hop tree of sensors and fuse the data into a state estimate. It is shown that the optimal estimator over a sensor tree is given by a Kalman filter of certain structure. The tree is optimized such that the overall transmission energy is minimized but guarantees a specified level of estimation accuracy. A sensor network reconfiguration algorithm is presented that leads to a suboptimal solution and has low computational complexity. A linear control law based on the state estimate is applied and it is argued that it leads to a closed-loop control system that minimizes a quadratic cost function. The sensor network reconfiguration and the feedback control law are illustrated on an example.
Place, publisher, year, edition, pages
IEEE , 2007. 5957-5964 p.
, IEEE conference on decision and control - proceedings, ISSN 0191-2216
IdentifiersURN: urn:nbn:se:kth:diva-81153ISI: 000255181703148ScopusID: 2-s2.0-62749172370ISBN: 978-1-4244-1497-0OAI: oai:DiVA.org:kth-81153DiVA: diva2:497171
IEEE CDC, New Orleans, LA, USA, DEC 12-14, 2007
© 2007 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Qc 201202162012-02-162012-02-102012-02-16Bibliographically approved