Cluster-based service discovery for heterogeneous wireless sensor networks

Share/Save/Bookmark

Marin-Perianu, R.S. and Scholten, J. and Havinga, P.J.M. and Hartel, P.H. (2008) Cluster-based service discovery for heterogeneous wireless sensor networks. International Journal of Parallel, Emergent and Distributed Systems, 23 (4). pp. 325-346. ISSN 1744-5760

[img]PDF
Restricted to UT campus only
: Request a copy
269Kb
Abstract:We propose an energy-efficient service discovery protocol for heterogeneous wireless sensor networks that interact with the users in open and dynamic environments. 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 minimising 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 theoretically and through simulations our proposed clustering algorithm with distributed mobility-adaptive clustering (DMAC). To validate our simulations we implement the proposed solution on resource-constraint sensor nodes and we measure the performance of the protocol running on different testbeds.
Item Type:Article
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/62292
Official URL:http://dx.doi.org/10.1080/17445760801930948
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 255944