Show simple item record

dc.contributor.advisorAntić, Dragan
dc.contributor.otherMitić, Darko
dc.contributor.otherNikolić, Vlastimir
dc.contributor.otherMilojković, Marko
dc.contributor.otherNikolić, Saša S.
dc.creatorStanković, Maja S.
dc.date.accessioned2024-02-07T15:04:22Z
dc.date.available2024-02-07T15:04:22Z
dc.date.issued2023
dc.identifier.urihttp://eteze.ni.ac.rs/application/showtheses?thesesId=8642
dc.identifier.urihttps://fedorani.ni.ac.rs/fedora/get/o:2097/bdef:Content/download
dc.identifier.urihttps://plus.cobiss.net/cobiss/sr/sr/bib/131590921
dc.identifier.urihttps://nardus.mpn.gov.rs/handle/123456789/22213
dc.description.abstractThis Ph. dissertation is devoted to the problem of distributed macro-calibration of large sensor networks which is of great importance for large scale systems control, Cyber-physical Systems and Internet of Things. The main contribution of the thesis is the proposal of a novel algorithm for distributed blind macro-calibration which offers a practically efficient solution by ensuring asymptotic consensus of the corrected sensor gains and offsets. The algorithm is based on independent recursive gain corrections using the instrumental variable algorithm derived from the mean-square value of the corrected signal increment measurements, working in parallel with recursive offset corrections using a gradient algorithm derived from the mean-square value of the corrected signal measurements themselves. It is proved that the corrected gains and offsets converge in the mean-square sense and with probability one to consensus for large classes of signals and communication networks. It is also proved that the proposed algorithm converges in the mean-square sense and with probability one in the presence of communication and mesurement noises for both synchronous and asynchronous communications. Convergence in the mean-square sense and with probability one is proved for an original nonlinear calibration algorithm which is robust with respect to the noise contaminated by sporadic large realizations. It is also proved that a suitable choice of a reference sensor enables getting convergence of all the corrected gains and offsets to a priori chosen reference values. The theoretical results are practically verified by numerous characteristic simulations which confirm all the derived conclusions.en
dc.formatapplication/pdf
dc.languagesr
dc.publisherУниверзитет у Нишу, Електронски факултетsr
dc.rightsopenAccessen
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/
dc.sourceУниверзитет у Нишуsr
dc.subjectMrežni sistemi upravljanja, kalibracija senzorskih mreža, distribuirana stohastička aproksimacija, dinamički konsenzus, brzina konvergencije, statistička robusnostsr
dc.subjectNetworked control systems, calibration of sensor networks, distributed stochastic approximation, dynamic consensus, convergence rate, statistical robustnessen
dc.titleDistribuirana kalibracija senzorskih mreža u velikim sistemima upravljanja zasnovana na konsenzususr
dc.typedoctoralThesis
dc.rights.licenseBY-NC-ND
dc.identifier.fulltexthttp://nardus.mpn.gov.rs/bitstream/id/159431/Doctoral_thesis_14910.pdf
dc.identifier.fulltexthttp://nardus.mpn.gov.rs/bitstream/id/159432/Stankovic_Maja_S.pdf
dc.identifier.rcubhttps://hdl.handle.net/21.15107/rcub_nardus_22213


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record