Cluster-based service discovery for heterogeneous wireless sensor networks

Research output: Book/ReportReportProfessional

115 Downloads (Pure)

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 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.
Original languageUndefined
Place of PublicationEnschede
PublisherDistributed and Embedded Security (DIES)
Number of pages35
Publication statusPublished - 30 Jan 2007

Publication series

NameCTIT Technical Report Series
PublisherCentre for Telematics and Information Technology, University of Twente
No.TR-CTIT-07-05
ISSN (Print)1381-3625

Keywords

  • EWI-9260
  • IR-66943
  • CAES-PS: Pervasive Systems
  • METIS-242154

Cite this

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).
Marin Perianu, Raluca ; Scholten, Johan ; Havinga, Paul J.M. ; Hartel, Pieter H. / Cluster-based service discovery for heterogeneous wireless sensor networks. Enschede : Distributed and Embedded Security (DIES), 2007. 35 p. (CTIT Technical Report Series; TR-CTIT-07-05).
@book{5f8e907858254dd0b6c48a1067f036f1,
title = "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 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.",
keywords = "EWI-9260, IR-66943, CAES-PS: Pervasive Systems, METIS-242154",
author = "{Marin Perianu}, Raluca and Johan Scholten and Havinga, {Paul J.M.} and Hartel, {Pieter H.}",
year = "2007",
month = "1",
day = "30",
language = "Undefined",
series = "CTIT Technical Report Series",
publisher = "Distributed and Embedded Security (DIES)",
number = "TR-CTIT-07-05",

}

Marin Perianu, R, Scholten, J, Havinga, PJM & Hartel, PH 2007, Cluster-based service discovery for heterogeneous wireless sensor networks. CTIT Technical Report Series, no. TR-CTIT-07-05, Distributed and Embedded Security (DIES), Enschede.

Cluster-based service discovery for heterogeneous wireless sensor networks. / Marin Perianu, Raluca; Scholten, Johan; Havinga, Paul J.M.; Hartel, Pieter H.

Enschede : Distributed and Embedded Security (DIES), 2007. 35 p. (CTIT Technical Report Series; No. TR-CTIT-07-05).

Research output: Book/ReportReportProfessional

TY - BOOK

T1 - Cluster-based service discovery for heterogeneous wireless sensor networks

AU - Marin Perianu, Raluca

AU - Scholten, Johan

AU - Havinga, Paul J.M.

AU - Hartel, Pieter H.

PY - 2007/1/30

Y1 - 2007/1/30

N2 - 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.

AB - 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.

KW - EWI-9260

KW - IR-66943

KW - CAES-PS: Pervasive Systems

KW - METIS-242154

M3 - Report

T3 - CTIT Technical Report Series

BT - Cluster-based service discovery for heterogeneous wireless sensor networks

PB - Distributed and Embedded Security (DIES)

CY - Enschede

ER -

Marin Perianu R, Scholten J, Havinga PJM, Hartel PH. Cluster-based service discovery for heterogeneous wireless sensor networks. Enschede: Distributed and Embedded Security (DIES), 2007. 35 p. (CTIT Technical Report Series; TR-CTIT-07-05).