Convex Voronoi-inspired space partitioning for heterogeneous networks

A coverage-oriented approach

Y. Stergiopoulos, Antonios Tzes

    Research output: Contribution to journalArticle

    Abstract

    This study addresses the problem of space-partitioning in heterogeneous sensor networks, where the nodes have uniform symmetric sensing patterns, although their maximum distance differs. Emphasis is given in the inappropriateness of classical spatial Voronoi tessellation for coverage purposes, compared to the proposed space-partitioning technique, which takes into account this heterogeneity. The latter's definition is reflected in a way that the assigned regions are convex sets (contrary to weighted Voronoi diagrams), their construction is computationally efficient, while special properties of Voronoi diagrams, which hold for homogeneous networks, are kept active. The proposed Voronoi definition degenerates into the classical one when the sensing radii of the nodes are equal. Examples are provided in order to emphasise in the efficacy of the proposed region-assignment scheme when dealing with heterogeneous networks, in contrast with classical Voronoi tessellation.

    Original languageEnglish (US)
    Pages (from-to)2802-2812
    Number of pages11
    JournalIET Control Theory and Applications
    Volume4
    Issue number12
    DOIs
    StatePublished - Dec 1 2010

    Fingerprint

    Voronoi Tessellation
    Voronoi
    Voronoi Diagram
    Heterogeneous networks
    Heterogeneous Networks
    Partitioning
    Coverage
    Sensing
    Vertex of a graph
    Convex Sets
    Sensor networks
    Sensor Networks
    Efficacy
    Assignment
    Radius

    ASJC Scopus subject areas

    • Control and Systems Engineering
    • Human-Computer Interaction
    • Computer Science Applications
    • Control and Optimization
    • Electrical and Electronic Engineering

    Cite this

    Convex Voronoi-inspired space partitioning for heterogeneous networks : A coverage-oriented approach. / Stergiopoulos, Y.; Tzes, Antonios.

    In: IET Control Theory and Applications, Vol. 4, No. 12, 01.12.2010, p. 2802-2812.

    Research output: Contribution to journalArticle

    @article{c0f428cbd2c044f9a679f56ad220a47f,
    title = "Convex Voronoi-inspired space partitioning for heterogeneous networks: A coverage-oriented approach",
    abstract = "This study addresses the problem of space-partitioning in heterogeneous sensor networks, where the nodes have uniform symmetric sensing patterns, although their maximum distance differs. Emphasis is given in the inappropriateness of classical spatial Voronoi tessellation for coverage purposes, compared to the proposed space-partitioning technique, which takes into account this heterogeneity. The latter's definition is reflected in a way that the assigned regions are convex sets (contrary to weighted Voronoi diagrams), their construction is computationally efficient, while special properties of Voronoi diagrams, which hold for homogeneous networks, are kept active. The proposed Voronoi definition degenerates into the classical one when the sensing radii of the nodes are equal. Examples are provided in order to emphasise in the efficacy of the proposed region-assignment scheme when dealing with heterogeneous networks, in contrast with classical Voronoi tessellation.",
    author = "Y. Stergiopoulos and Antonios Tzes",
    year = "2010",
    month = "12",
    day = "1",
    doi = "10.1049/iet-cta.2009.0298",
    language = "English (US)",
    volume = "4",
    pages = "2802--2812",
    journal = "IET Control Theory and Applications",
    issn = "1751-8644",
    publisher = "Institution of Engineering and Technology",
    number = "12",

    }

    TY - JOUR

    T1 - Convex Voronoi-inspired space partitioning for heterogeneous networks

    T2 - A coverage-oriented approach

    AU - Stergiopoulos, Y.

    AU - Tzes, Antonios

    PY - 2010/12/1

    Y1 - 2010/12/1

    N2 - This study addresses the problem of space-partitioning in heterogeneous sensor networks, where the nodes have uniform symmetric sensing patterns, although their maximum distance differs. Emphasis is given in the inappropriateness of classical spatial Voronoi tessellation for coverage purposes, compared to the proposed space-partitioning technique, which takes into account this heterogeneity. The latter's definition is reflected in a way that the assigned regions are convex sets (contrary to weighted Voronoi diagrams), their construction is computationally efficient, while special properties of Voronoi diagrams, which hold for homogeneous networks, are kept active. The proposed Voronoi definition degenerates into the classical one when the sensing radii of the nodes are equal. Examples are provided in order to emphasise in the efficacy of the proposed region-assignment scheme when dealing with heterogeneous networks, in contrast with classical Voronoi tessellation.

    AB - This study addresses the problem of space-partitioning in heterogeneous sensor networks, where the nodes have uniform symmetric sensing patterns, although their maximum distance differs. Emphasis is given in the inappropriateness of classical spatial Voronoi tessellation for coverage purposes, compared to the proposed space-partitioning technique, which takes into account this heterogeneity. The latter's definition is reflected in a way that the assigned regions are convex sets (contrary to weighted Voronoi diagrams), their construction is computationally efficient, while special properties of Voronoi diagrams, which hold for homogeneous networks, are kept active. The proposed Voronoi definition degenerates into the classical one when the sensing radii of the nodes are equal. Examples are provided in order to emphasise in the efficacy of the proposed region-assignment scheme when dealing with heterogeneous networks, in contrast with classical Voronoi tessellation.

    UR - http://www.scopus.com/inward/record.url?scp=78650783263&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=78650783263&partnerID=8YFLogxK

    U2 - 10.1049/iet-cta.2009.0298

    DO - 10.1049/iet-cta.2009.0298

    M3 - Article

    VL - 4

    SP - 2802

    EP - 2812

    JO - IET Control Theory and Applications

    JF - IET Control Theory and Applications

    SN - 1751-8644

    IS - 12

    ER -