|
|
Extension of Wireless Sensor Protocol
Nečasová, Klára ; Košař, Vlastimil (referee) ; Kořenek, Jan (advisor)
The aim of this thesis was to extend the wireless communication FIT protocol including mechanisms for adding new devices to the network, packet routing within the network and network reinitialization after device movement. The theoretical part of the work focuses on smart homes protocol Z-Wave, ZigBee and Thread. In the practical part, new protocol features have been designed and implemented. Moreover, various types of communication between devices also extend the FIT protocol. All new functionalities were carefully tested. Moreover, the tests focused on the influence of a distance and a device PCB antenna position on the success rate of unreliable and reliable communication. The results showed that the success rate of data transfer depends only on a distance between devices and a selected type of communication. The influence of obstacle made of a different material on received signal strength during data receiving was confirmed. The work also discusses dependency of energy consumption on transmitted data length and used communication protocol.
|
|
|
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.
|
|
|
Extension of Wireless Sensor Protocol
Nečasová, Klára ; Košař, Vlastimil (referee) ; Kořenek, Jan (advisor)
The aim of this thesis was to extend the wireless communication FIT protocol including mechanisms for adding new devices to the network, packet routing within the network and network reinitialization after device movement. The theoretical part of the work focuses on smart homes protocol Z-Wave, ZigBee and Thread. In the practical part, new protocol features have been designed and implemented. Moreover, various types of communication between devices also extend the FIT protocol. All new functionalities were carefully tested. Moreover, the tests focused on the influence of a distance and a device PCB antenna position on the success rate of unreliable and reliable communication. The results showed that the success rate of data transfer depends only on a distance between devices and a selected type of communication. The influence of obstacle made of a different material on received signal strength during data receiving was confirmed. The work also discusses dependency of energy consumption on transmitted data length and used communication protocol.
|
|
|
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.
|
guest ::
