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.
|Publisher||IEEE Computer Society Press|
|Workshop||Sixth International Workshop on Wireless Local Networks|
|Period||14/11/06 → 16/11/06|
|Other||14-16 Nov 2006|
- CAES-PS: Pervasive Systems