2008
DOI: 10.1080/17445760801930948
|View full text |Cite
|
Sign up to set email alerts
|

Cluster-based service discovery for heterogeneous wireless sensor networks

Abstract: 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 neighb… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
27
0
1

Year Published

2010
2010
2023
2023

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 40 publications
(28 citation statements)
references
References 35 publications
0
27
0
1
Order By: Relevance
“…The actor nodes function as the permanent clusterheads and the structure allows multi-hop clusters, which is different than most of the existing clustering algorithms for mobile ad hoc networks (eg. [21], [22], [23], [24]). KHOPCA [25] is a multi-hop clustering scheme consisting of a set of simple and easy-to-implement locally acting rules, which has an approach similar to our algorithm, but it does not fully satisfy the specific requirements of our scenario such as predetermined clusterheads.…”
Section: Related Workmentioning
confidence: 99%
“…The actor nodes function as the permanent clusterheads and the structure allows multi-hop clusters, which is different than most of the existing clustering algorithms for mobile ad hoc networks (eg. [21], [22], [23], [24]). KHOPCA [25] is a multi-hop clustering scheme consisting of a set of simple and easy-to-implement locally acting rules, which has an approach similar to our algorithm, but it does not fully satisfy the specific requirements of our scenario such as predetermined clusterheads.…”
Section: Related Workmentioning
confidence: 99%
“…[10] [15] It has multilevel heterogeneity like two level heterogeneity. It selects the cluster head on the basis of same as by calculating the energy of the node and the total of the system.…”
Section: Intra Cluster Topologymentioning
confidence: 99%
“…Many of the algorithms are proposed for clustering in heterogeneous network. Following are the some algorithm for clustering: EEHC [15], DEEC [16], DBEC 17] and CBSD [18].…”
Section: Introductionmentioning
confidence: 99%