We propose an energy-efficient service discovery protocol for heterogeneous wireless sensor networks. Our solution exploits a cluster overlay, where the clusterhead nodes form a distributed service registry. A service lookup results in visiting only the clusterhead nodes. We aim for minimizing the communication costs during discovery of services and maintenance of a functional distributed service registry. To achieve these objectives we propose a clustering algorithm which makes decisions based on 1-hop neighbourhood information, avoids chain reactions and constructs a set of sparsely distributed clusterheads. We analyse how the properties of the clustering structure influence the performance of the service discovery protocol, by comparing our proposed clustering algorithm with DMAC. We evaluate the performance and the tradeoffs between the cluster-based service discovery approaches and the traditional flood-based solutions. We investigate the level of network heterogeneity where clustering is feasible for implementation in a wireless sensor network. Our analysis shows that cluster-based solutions are best suited for heterogeneous dense networks, with limited dynamics.
|Place of Publication||Enschede|
|Publisher||Distributed and Embedded Security (DIES)|
|Number of pages||35|
|Publication status||Published - 30 Jan 2007|
|Name||CTIT Technical Report Series|
|Publisher||Centre for Telematics and Information Technology, University of Twente|
- CAES-PS: Pervasive Systems
Marin Perianu, R., Scholten, J., Havinga, P. J. M., & Hartel, P. H. (2007). Cluster-based service discovery for heterogeneous wireless sensor networks. (CTIT Technical Report Series; No. TR-CTIT-07-05). Enschede: Distributed and Embedded Security (DIES).