haku: @keyword computational complexity / yhteensä: 6
viite: 1 / 6
« edellinen | seuraava »
| Tekijä: | Tong Alvarez, Marcos |
| Työn nimi: | Weak models of wireless distributed computing Comparison between radio networks and population protocols |
| Julkaisutyyppi: | Diplomityö |
| Julkaisuvuosi: | 2016 |
| Sivut: | 85 s. + liitt. 27 Kieli: eng |
| Koulu/Laitos/Osasto: | Perustieteiden korkeakoulu |
| Oppiaine: | Foundations of Advanced Computing (SCI3014) |
| Valvoja: | Suomela, Jukka |
| Ohjaaja: | Martinez, Remberto |
| Elektroninen julkaisu: | http://urn.fi/URN:NBN:fi:aalto-201608263085 |
| Sijainti: | P1 Ark Aalto 5798 | Arkisto |
| Avainsanat: | theory of computing distributed algorithms computational complexity weak models radio networks population protocols |
| Tiivistelmä (eng): | This thesis compares weak distributed computing models that are suit- able for extremely limited wireless networks. The comparison is mainly between multiple variations of radio networks and population protocols. The analysis is based on model features, computability and algorithmic complexity. The thesis analyses essential and optional model features, and organizes the models accordingly. It discusses the applicability of results from stronger models to radio network models, including impossibility results, algorithms and their runtime. It analyzes different radio network algorithms for the classical problems in terms of their features, and it discusses their applicability to other radio network models. It reviews the fundamental differences between population protocols and radio networks. Lastly, the comparative analysis summarizes fundamental differences and separating features. |
| ED: | 2016-09-04 |
INSSI tietueen numero: 54297
+ lisää koriin
« edellinen | seuraava »
INSSI