000			03067nam a22004455i 4500
001			978-3-642-28230-0
003			DE-He213
005			20170628035653.0
007			cr nn 008mamaa
008			120222s2012 gw | s |||| 0|eng d
020			_a9783642282300 _9978-3-642-28230-0
024	7		_a10.1007/978-3-642-28230-0 _2doi
050		4	_aTJ212-225
072		7	_aTJFM _2bicssc
072		7	_aTEC004000 _2bisacsh
082	0	4	_a629.8 _223
100	1		_aPatan, Maciej. _eauthor.
245	1	0	_aOptimal Sensor Networks Scheduling in Identification of Distributed Parameter Systems _h[electronic resource] / _cby Maciej Patan.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2012.
300			_aXIV, 294p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aLecture Notes in Control and Information Sciences, _x0170-8643 ; _v425
505	0		_aIntroduction -- Experimental design in sensor scheduling -- Sensor activation for scanning networks -- Resource aware mobile sensor routing -- Decentralized sensor scheduling using randomized gossip algorithms -- Combinatorial approach to sensor activation -- Sensor location under parametric and location uncertainty -- Sensor network design for fault diagnosis in DPSs -- Extensions toward challenging problems of network scheduling -- Conclusions and further research directions.
520			_aSensor 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.
650		0	_aEngineering.
650		0	_aSystems theory.
650	1	4	_aEngineering.
650	2	4	_aControl.
650	2	4	_aSystems Theory, Control.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642282294
830		0	_aLecture Notes in Control and Information Sciences, _x0170-8643 ; _v425
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-642-28230-0
912			_aZDB-2-ENG
999			_c25704 _d25704