Wireless sensor nodes attached to everyday objects and worn by people are able to collaborate and actively assist users in their activities. We propose a method through which wireless sensor nodes organize spontaneously into clusters based on a common context. Provided that the confidence of sharing a common context varies in time, the algorithm takes into account a window-based history of believes. We approximate the behaviour of the algorithm using a Markov chain model and we analyse theoretically the cluster stability. We compare the theoretical results with simulations, by making use of three sets of experimental data reported from field tests. The results show the tradeoff between the time history necessary to achieve a certain stability and the responsiveness of the clustering algorithm.
|Place of Publication||Enschede|
|Publisher||Distributed and Embedded Security (DIES)|
|Number of pages||18|
|Publication status||Published - Sep 2007|
|Name||CTIT Technical Report Series|
|Publisher||Centre for Telematics and Information Technology, University of Twente|
- CAES-PS: Pervasive Systems
Marin Perianu, R., Lombriser, C., Havinga, P. J. M., Scholten, J., & Tröster, G. (2007). Tandem: A Context-Aware Method for Spontaneous Clustering of Dynamic Wireless Sensor Nodes. (CTIT Technical Report Series; No. LNCS4549/TR-CTIT-07-66). Enschede: Distributed and Embedded Security (DIES).