Cluster-based service discovery for heterogeneous wireless sensor networks

    Research output: Contribution to journalArticleAcademicpeer-review

    20 Citations (Scopus)

    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.
    Original languageUndefined
    Article number10.1080/17445760801930948
    Pages (from-to)325-346
    Number of pages22
    JournalInternational journal of parallel, emergent and distributed systems
    Volume23
    Issue number4
    DOIs
    Publication statusPublished - Aug 2008

    Keywords

    • EWI-12701
    • IR-62292
    • METIS-255944

    Cite this

    @article{0aaa8b86975e4d31b6f4cac850bedbee,
    title = "Cluster-based service discovery for heterogeneous wireless sensor networks",
    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.",
    keywords = "EWI-12701, IR-62292, METIS-255944",
    author = "{Marin Perianu}, Raluca and Johan Scholten and Havinga, {Paul J.M.} and Hartel, {Pieter H.}",
    note = "10.1080/17445760801930948",
    year = "2008",
    month = "8",
    doi = "10.1080/17445760801930948",
    language = "Undefined",
    volume = "23",
    pages = "325--346",
    journal = "International journal of parallel, emergent and distributed systems",
    issn = "1744-5760",
    publisher = "Taylor & Francis",
    number = "4",

    }

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

    In: International journal of parallel, emergent and distributed systems, Vol. 23, No. 4, 10.1080/17445760801930948, 08.2008, p. 325-346.

    Research output: Contribution to journalArticleAcademicpeer-review

    TY - JOUR

    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.

    N1 - 10.1080/17445760801930948

    PY - 2008/8

    Y1 - 2008/8

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

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

    KW - EWI-12701

    KW - IR-62292

    KW - METIS-255944

    U2 - 10.1080/17445760801930948

    DO - 10.1080/17445760801930948

    M3 - Article

    VL - 23

    SP - 325

    EP - 346

    JO - International journal of parallel, emergent and distributed systems

    JF - International journal of parallel, emergent and distributed systems

    SN - 1744-5760

    IS - 4

    M1 - 10.1080/17445760801930948

    ER -