Home > Search Results: keywords:"Selekce referencí"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Detection of Farthest Node in Wireless Sensor Networks
 Pfudl, Tomáš ; Morávek, Patrik (referee) ; Šimek, Milan (advisor)
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.
Detailed record
Detection of Farthest Node in Wireless Sensor Networks
 Pfudl, Tomáš ; Morávek, Patrik (referee) ; Šimek, Milan (advisor)
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.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English