We propose an energy-efficient service discovery protocol for 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. We compare theoretically and by simulation the impact of the chosen clustering algorithm on the service discovery protocol.
|Title of host publication||Sixth International Workshop on Wireless Local Networks|
|Place of Publication||Piscataway|
|Publisher||IEEE Computer Society|
|Number of pages||8|
|Publication status||Published - Nov 2006|
|Publisher||IEEE Computer Society Press|
- CAES-PS: Pervasive Systems