Convex Voronoi space-partitioning for coverage purposes in heterogeneous sensor networks

John Stergiopoulos, Antonios Tzes

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    This article addresses the problem of space-partitioning in heterogeneous sensor networks, where the nodes have uniform symmetric sensing patterns, though their maximum sensing distance differs. Inappropriateness of classical spatial Voronoi tessellation for coverage purposes is denoted, compared to the proposed space-partitioning technique, which takes into account this heterogeneity. Unlike weighted-Voronoi techniques, the latter's definition is reflected in a way that the assigned regions are convex sets, their construction is computationally-efficient, while special properties of Voronoi diagrams, which hold for homogeneous networks, are kept active. Simulation results confirm the efficacy of the proposed region-assignment scheme when dealing with heterogeneous networks, in contrast with classical Voronoi tessellation.

    Original languageEnglish (US)
    Title of host publication2009 European Control Conference, ECC 2009
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages2361-2366
    Number of pages6
    ISBN (Electronic)9783952417393
    StatePublished - Mar 26 2014
    Event2009 10th European Control Conference, ECC 2009 - Budapest, Hungary
    Duration: Aug 23 2009Aug 26 2009

    Other

    Other2009 10th European Control Conference, ECC 2009
    CountryHungary
    CityBudapest
    Period8/23/098/26/09

    Fingerprint

    Heterogeneous networks
    Sensor networks

    Keywords

    • Heterogeneous networks
    • Space-partitioning
    • Voronoi diagrams

    ASJC Scopus subject areas

    • Control and Systems Engineering

    Cite this

    Stergiopoulos, J., & Tzes, A. (2014). Convex Voronoi space-partitioning for coverage purposes in heterogeneous sensor networks. In 2009 European Control Conference, ECC 2009 (pp. 2361-2366). [7074758] Institute of Electrical and Electronics Engineers Inc..

    Convex Voronoi space-partitioning for coverage purposes in heterogeneous sensor networks. / Stergiopoulos, John; Tzes, Antonios.

    2009 European Control Conference, ECC 2009. Institute of Electrical and Electronics Engineers Inc., 2014. p. 2361-2366 7074758.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Stergiopoulos, J & Tzes, A 2014, Convex Voronoi space-partitioning for coverage purposes in heterogeneous sensor networks. in 2009 European Control Conference, ECC 2009., 7074758, Institute of Electrical and Electronics Engineers Inc., pp. 2361-2366, 2009 10th European Control Conference, ECC 2009, Budapest, Hungary, 8/23/09.
    Stergiopoulos J, Tzes A. Convex Voronoi space-partitioning for coverage purposes in heterogeneous sensor networks. In 2009 European Control Conference, ECC 2009. Institute of Electrical and Electronics Engineers Inc. 2014. p. 2361-2366. 7074758
    Stergiopoulos, John ; Tzes, Antonios. / Convex Voronoi space-partitioning for coverage purposes in heterogeneous sensor networks. 2009 European Control Conference, ECC 2009. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 2361-2366
    @inproceedings{d6ba722a54604e99a823b48b6b3e60b1,
    title = "Convex Voronoi space-partitioning for coverage purposes in heterogeneous sensor networks",
    abstract = "This article addresses the problem of space-partitioning in heterogeneous sensor networks, where the nodes have uniform symmetric sensing patterns, though their maximum sensing distance differs. Inappropriateness of classical spatial Voronoi tessellation for coverage purposes is denoted, compared to the proposed space-partitioning technique, which takes into account this heterogeneity. Unlike weighted-Voronoi techniques, the latter's definition is reflected in a way that the assigned regions are convex sets, their construction is computationally-efficient, while special properties of Voronoi diagrams, which hold for homogeneous networks, are kept active. Simulation results confirm the efficacy of the proposed region-assignment scheme when dealing with heterogeneous networks, in contrast with classical Voronoi tessellation.",
    keywords = "Heterogeneous networks, Space-partitioning, Voronoi diagrams",
    author = "John Stergiopoulos and Antonios Tzes",
    year = "2014",
    month = "3",
    day = "26",
    language = "English (US)",
    pages = "2361--2366",
    booktitle = "2009 European Control Conference, ECC 2009",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",

    }

    TY - GEN

    T1 - Convex Voronoi space-partitioning for coverage purposes in heterogeneous sensor networks

    AU - Stergiopoulos, John

    AU - Tzes, Antonios

    PY - 2014/3/26

    Y1 - 2014/3/26

    N2 - This article addresses the problem of space-partitioning in heterogeneous sensor networks, where the nodes have uniform symmetric sensing patterns, though their maximum sensing distance differs. Inappropriateness of classical spatial Voronoi tessellation for coverage purposes is denoted, compared to the proposed space-partitioning technique, which takes into account this heterogeneity. Unlike weighted-Voronoi techniques, the latter's definition is reflected in a way that the assigned regions are convex sets, their construction is computationally-efficient, while special properties of Voronoi diagrams, which hold for homogeneous networks, are kept active. Simulation results confirm the efficacy of the proposed region-assignment scheme when dealing with heterogeneous networks, in contrast with classical Voronoi tessellation.

    AB - This article addresses the problem of space-partitioning in heterogeneous sensor networks, where the nodes have uniform symmetric sensing patterns, though their maximum sensing distance differs. Inappropriateness of classical spatial Voronoi tessellation for coverage purposes is denoted, compared to the proposed space-partitioning technique, which takes into account this heterogeneity. Unlike weighted-Voronoi techniques, the latter's definition is reflected in a way that the assigned regions are convex sets, their construction is computationally-efficient, while special properties of Voronoi diagrams, which hold for homogeneous networks, are kept active. Simulation results confirm the efficacy of the proposed region-assignment scheme when dealing with heterogeneous networks, in contrast with classical Voronoi tessellation.

    KW - Heterogeneous networks

    KW - Space-partitioning

    KW - Voronoi diagrams

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

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

    M3 - Conference contribution

    SP - 2361

    EP - 2366

    BT - 2009 European Control Conference, ECC 2009

    PB - Institute of Electrical and Electronics Engineers Inc.

    ER -