TY - BOOK ID - 7617133 TI - Optimal Sensor Networks Scheduling in Identification of Distributed Parameter Systems PY - 2012 VL - 425 SN - 01708643 SN - 3642282296 364228230X PB - Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, DB - UniCat KW - Mechanical Engineering KW - Engineering & Applied Sciences KW - Mechanical Engineering - General KW - Distributed parameter systems. KW - Computer scheduling. KW - Sensor networks. KW - Networks, Sensor KW - Electronic data processing KW - Processor scheduling (Electronic data processing) KW - Scheduling of electronic data processing KW - Systems, Distributed parameter KW - Scheduling KW - Engineering. KW - System theory. KW - Control engineering. KW - Control. KW - Systems Theory, Control. KW - Detectors KW - Context-aware computing KW - Multisensor data fusion KW - Production scheduling KW - Time-sharing computer systems KW - Control theory KW - Engineering systems KW - System analysis KW - Systems theory. KW - Control and Systems Theory. KW - Systems, Theory of KW - Systems science KW - Science KW - Control engineering KW - Control equipment KW - Engineering instruments KW - Automation KW - Programmable controllers KW - Philosophy UR - https://www.unicat.be/uniCat?func=search&query=sysid:7617133 AB - Sensor networks have recently come into prominence because they hold the potential to revolutionize a wide spectrum of both civilian and military applications. An ingenious characteristic of sensor networks is the distributed nature of data acquisition. Therefore they seem to be ideally prepared for the task of monitoring processes with spatio-temporal dynamics which constitute one of most general and important classes of systems in modelling of the real-world phenomena. It is clear that careful deployment and activation of sensor nodes are critical for collecting the most valuable information from the observed environment. Optimal Sensor Network Scheduling in Identification of Distributed Parameter Systems discusses the characteristic features of the sensor scheduling problem, analyzes classical and recent approaches, and proposes a wide range of original solutions, especially dedicated for networks with mobile and scanning nodes. Both researchers and practitioners will find the case studies, the proposed algorithms, and the numerical examples to be invaluable. ER -