|
|
Performance of Anchor-Free Localization in Wireless Sensor Network
Nováček, Aleš ; Morávek, Patrik (referee) ; Šimek, Milan (advisor)
Many applications that use senzor data from a wireless senzor network require corresponding node position information as well, information from the senzors is useful only if node location information is also available. There are many ways to get information about location of senzor, but some are expensive and inefficient. My work presents fully decentralized algorithm AFL (anchor-free localization) for localization of wireless sensors. Aim of my master´s thesis is to describe main features and advantages of AFL and to create program that simulates localization process.
|
|
|
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.
|
|
|
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.
|
|
|
Performance of Anchor-Free Localization in Wireless Sensor Network
Nováček, Aleš ; Morávek, Patrik (referee) ; Šimek, Milan (advisor)
Many applications that use senzor data from a wireless senzor network require corresponding node position information as well, information from the senzors is useful only if node location information is also available. There are many ways to get information about location of senzor, but some are expensive and inefficient. My work presents fully decentralized algorithm AFL (anchor-free localization) for localization of wireless sensors. Aim of my master´s thesis is to describe main features and advantages of AFL and to create program that simulates localization process.
|
guest ::
