There has been growing interest in the Mobile WSN applications where mobility is the fundamental characteristic of the sensor nodes. Mobility poses many challenges to the routing protocols used in such applications. In this thesis we evaluate the performance of Collection Tree Protocol as applied in mobile WSN scenarios. The simulation study shows CTP performs poorly in mobile scenario because of the frequent tree re-generation resulting from node movements. We compare Collection Tree Protocol with reactive ad hoc network routing protocols. The simulation results show that collection tree protocol performs better than reactive MANET protocols in terms of data delivery ratio and control overhead under low traffic rates. The end-to-end delay obtained in case of reactive protocols is also higher compared to that obtained when using CTP, which is due to their route discovery process. This thesis presents an improved data collection protocol Fixed Node Aided CTP based on the analysis of CTP. The protocol introduces the concept of fixed aided routing into CTP. It is shown that our enhanced CTP outperforms CTP in terms of data delivery ratio and control overhead chosen as performance metrics. / UOIT

Wireless Sensor Networks (WSNs) are ad-hoc wireless networks for small form-factor embedded nodes with limited memory, processing and energy resources. Certain applications, like industrial automation and real-time process monitoring requires time synchronized reliable network protocol. Current work for WSNs provides either time synchronized with low reliability (WirelessHART) or reliable network without time synchronization (Collection Tree Protocol). The Collection Tree Protocol (CTP) provides the reliability from 94.7% to 99.9% for CSMA-CA based MAC layer. This paper addresses channel hopping, a class of frequency diverse communication protocol in which subsequent packets are sent over different frequency channels. Channel hopping combats external interference and persistent multipath fading, two of the main causes of failure along a communication link. Channel hopping technique leads to a high reliable and efficient protocol which is specified by HART Communication Foundation and named as WirelessHART. WirelessHART Data-Link layer designed based on TDMA and CSMA-CA mechanism. By implementing the CTP over WirelessHART Data-Link layer, the reliability of the network protocol can be improved compare to actual CTP standard implementation. This thesis describes the design and implementation of Collection Tree Protocol over WirelessHART Data-Link layer. The implementation is done using TinyOS, nesC programming language using Crossbow TelosB CC2420 radio chip nodes. The results and experiments show the evaluation of the system prototype.

This thesis describes the possibilities of wireless sensor networks in monitoring buildings and summarizes the most common use of wireless sensor networks in practice. There are also described communication protocols needed for communication between each node and properties of topology of created network. Importance is lay on implementation of fully dynamic network with automatic network topology establishment. The application is designed for the TinyOS operating system and hardware platforms MICAz and IRIS, and its task is to establish the topology and send the data obtained from sensors to base station. The implemented protocol is based on the Collection Tree Protocol protocol and using best effort delivery is able to establish a dynamic topology. Further there is described  the method of storage and subsequent graphical and textual representation of data collected.