Energy-Efficient Cluster-Based Service Discovery in Wireless Sensor Networks

Research output: Book/ReportReportProfessional

20 Citations (Scopus)
56 Downloads (Pure)

Abstract

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.
Original languageUndefined
Place of PublicationEnschede
PublisherCentrum voor Telematica en Informatie Technologie
Number of pages12
Publication statusPublished - Jun 2006

Publication series

NameCTIT technical reports series
PublisherCentre for Telematics and Information Technology, University of Twente
No.06-43
ISSN (Print)1381-3625

Keywords

  • EWI-3691
  • METIS-237398
  • IR-66003
  • CAES-PS: Pervasive Systems

Cite this

Marin Perianu, R., Scholten, J., Havinga, P. J. M., & Hartel, P. H. (2006). Energy-Efficient Cluster-Based Service Discovery in Wireless Sensor Networks. (CTIT technical reports series; No. 06-43). Enschede: Centrum voor Telematica en Informatie Technologie.
Marin Perianu, Raluca ; Scholten, Johan ; Havinga, Paul J.M. ; Hartel, Pieter H. / Energy-Efficient Cluster-Based Service Discovery in Wireless Sensor Networks. Enschede : Centrum voor Telematica en Informatie Technologie, 2006. 12 p. (CTIT technical reports series; 06-43).
@book{6127cd4e2d8343f4a79e118ce8199a35,
title = "Energy-Efficient Cluster-Based Service Discovery in Wireless Sensor Networks",
abstract = "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.",
keywords = "EWI-3691, METIS-237398, IR-66003, CAES-PS: Pervasive Systems",
author = "{Marin Perianu}, Raluca and Johan Scholten and Havinga, {Paul J.M.} and Hartel, {Pieter H.}",
year = "2006",
month = "6",
language = "Undefined",
series = "CTIT technical reports series",
publisher = "Centrum voor Telematica en Informatie Technologie",
number = "06-43",

}

Marin Perianu, R, Scholten, J, Havinga, PJM & Hartel, PH 2006, Energy-Efficient Cluster-Based Service Discovery in Wireless Sensor Networks. CTIT technical reports series, no. 06-43, Centrum voor Telematica en Informatie Technologie, Enschede.

Energy-Efficient Cluster-Based Service Discovery in Wireless Sensor Networks. / Marin Perianu, Raluca; Scholten, Johan; Havinga, Paul J.M.; Hartel, Pieter H.

Enschede : Centrum voor Telematica en Informatie Technologie, 2006. 12 p. (CTIT technical reports series; No. 06-43).

Research output: Book/ReportReportProfessional

TY - BOOK

T1 - Energy-Efficient Cluster-Based Service Discovery in Wireless Sensor Networks

AU - Marin Perianu, Raluca

AU - Scholten, Johan

AU - Havinga, Paul J.M.

AU - Hartel, Pieter H.

PY - 2006/6

Y1 - 2006/6

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

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

KW - EWI-3691

KW - METIS-237398

KW - IR-66003

KW - CAES-PS: Pervasive Systems

M3 - Report

T3 - CTIT technical reports series

BT - Energy-Efficient Cluster-Based Service Discovery in Wireless Sensor Networks

PB - Centrum voor Telematica en Informatie Technologie

CY - Enschede

ER -

Marin Perianu R, Scholten J, Havinga PJM, Hartel PH. Energy-Efficient Cluster-Based Service Discovery in Wireless Sensor Networks. Enschede: Centrum voor Telematica en Informatie Technologie, 2006. 12 p. (CTIT technical reports series; 06-43).