Wireless sensor networks in motion : clustering algorithms for service discovery and provisioning

The evolution of computer technology follows a trajectory of miniaturization\ud and diversification. The technology has developed from mainframes (large computers used by many people) to personal computers (one computer per person)\ud and recently, embedded computers (many computers per person). One of the\ud smallest embedded computers is a wireless sensor node, which is a batterypowered\ud miniaturized device equipped with processing capabilities, memory,\ud wireless communication and sensors that can sense the physical parameters of\ud the environment. A collection of sensor nodes that communicate through the\ud wireless interface form a Wireless Sensor Network (WSN), which is an ad-hoc,\ud self organizing network that can function unattended for long periods of time.\ud Although traditionally WSNs have been regarded as static sensor arrays\ud used mainly for environmental monitoring, recently, WSN applications have\ud undergone a paradigm shift from static to more dynamic environments, where\ud nodes are attached to moving objects, people or animals. Applications that\ud use WSNs in motion are broad, ranging from transport and logistics to animal\ud monitoring, health care and military, just to mention a few.\ud These application domains have a number of characteristics that challenge\ud the algorithmic design of WSNs. Firstly, mobility has a negative effect on\ud the quality of the wireless communication and the performance of networking\ud protocols. Nevertheless, it has been shown that mobility can enhance the functionality of the network by exploiting the movement patterns of mobile objects. Secondly, the heterogeneity of devices in a WSN has to be taken into account for increasing the network performance and lifetime. Thirdly, the WSN services should ideally assist the user in an unobtrusive and transparent way. Fourthly, energy-efficiency and scalability are of primary importance to prevent the network performance degradation. This thesis focuses on the problems and enhancements brought in by networ mobility, while also accounting for heterogeneity, transparency, energy efficiency and scalability. We propose a set of algorithms that enable WSNs to self-organize efficiently in the presence of mobility, adapt to and even exploit dynamics to increase the functionality of the network. Our contributions include an algorithm for motion detection, a set of clustering algorithms that can be used to handle mobility efficiently, and a service discovery protocol that enables dynamic user access to the WSN functionality