Return to search

Vyhledávání nejvzdálenějšího prvku v bezdrátové senzorové síti / Detection of Farthest Node in Wireless Sensor Networks

Master’s thesis in the first part focuses on the effectiveness of communication in the selection of reference nodes during the anchor-free localization in WSN. In this part two anchor-free localization algorithms AFL and CRP are explored. Knowledge learned on the selection of reference nodes and communication complexities of these algorithms are used in the second part. The second part is aimed at eliminating weaknesses in communication and subsequently proposed a new algorithm for selection of references. The principle of the newly proposed algorithm CASRU (Centralized Algorithm for Selection of Reference Nodes) is based on the principle of CRP. CASRU algorithm builds logical tree structure and then filters the communication through it. New algorithm achieves much greater success in the selection in randomly distributed networks while reducing the amount of communication load.

Identiferoai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:218926
Date January 2011
CreatorsPfudl, Tomáš
ContributorsMorávek, Patrik, Šimek, Milan
PublisherVysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií
Source SetsCzech ETDs
LanguageCzech
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/masterThesis
Rightsinfo:eu-repo/semantics/restrictedAccess

Page generated in 0.002 seconds