Services in Wireless Sensor Networks: Modelling and Optimisation for the Efficient Discovery of Services [Paperback]

In recent years, originally static and single purpose Wireless Sensor Networks have moved towards applications that need support for mobility and multiple purposes. These heterogeneous applications and services demand for a framework which distributes and discovers the various services, so that other pieces of equipment can use them. Markus Becker studies, extends, analytically models, simulates and employs the so called Trickle algorithm in measurements in a Wireless Sensor Network test bed for the service distribution. The obtained results apply to the application of the Trickle algorithm at lower protocol layers, e.g. for routing, as well. Given application delay requirements, the author derives the realizable distances and number of nodes for two network topologies from the 95 percentiles obtained by simulation.Wireless Sensor Networks.- Service Distribution.- Trickle Algorithm.- Simulation, Analytical Modelling and Measurements.Markus Becker completed his doctoral degree at the Communication Networks Group of TZI (Center for Communication and Information Technology), University of Bremen, Germany. His research interests include wireless sensor networks, Internet, protocols, simulation and logistical applications.

In recent years, originally static and single purpose Wireless Sensor Networks have moved towards applications that need support for mobility and multiple purposes. These heterogeneous applications and services demand for a framework which distributes and discovers the various services, so that other pieces of equipment can use them. Markus Becker studies, extends, analytically models, simulates and employs the so called Trickle algorithm in measurements in a Wireless Sensor Network testbed for the service distribution. The obtained results apply to the application of the Trickle algorithm at lower protocol layers, e.?g. for routing, as well. Given application delay requirements, the author derives the realizable distances and number of nodes fl#„