Sökning: onr:"swepub:oai:DiVA.org:kth-111455" >
Distributed size es...
Distributed size estimation of dynamic anonymous networks
-
- Terelius, Håkan (författare)
- KTH,Reglerteknik,ACCESS Linnaeus Centre
-
- Varagnolo, Damiano (författare)
- KTH,Reglerteknik,ACCESS Linnaeus Centre
-
- Johansson, Karl Henrik (författare)
- KTH,Reglerteknik,ACCESS Linnaeus Centre
-
(creator_code:org_t)
- IEEE conference proceedings, 2012
- 2012
- Engelska.
-
Ingår i: 2012 IEEE 51st Annual Conference on Decision and Control (CDC). - : IEEE conference proceedings. - 9781467320641 ; , s. 5221-5227
- Relaterad länk:
-
http://control.disp....
-
visa fler...
-
http://ieeexplore.ie...
-
https://kth.diva-por... (primary) (Raw object)
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- We consider the problem of estimating the size of dynamic anonymous networks, motivated by network maintenance. The proposed algorithm is based on max-consensus information exchange protocols, and extends a previous algorithm for static anonymous networks. A regularization term is accounting for a-priori assumptions on the smoothness of the estimate, and we specifically consider quadratic regularization terms since they lead to closed-form solutions and intuitive design laws. We derive an explicit estimation scheme for a particular peer-to-peer service network, starting from its statistical model. To validate the accuracy of the algorithm, we perform numerical experiments and show how the algorithm can be implemented using finite precision arithmetics as well as small communication burdens
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering (hsv//eng)
Nyckelord
- anonymous networks
- distributed estimation
- dynamic networks
- size estimation
- sensor networks
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas