IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v15y2022i9p2969-d796726.html
   My bibliography  Save this article

Application of Doubly Connected Dominating Sets to Safe Rectangular Smart Grids

Author

Listed:
  • Joanna Cyman

    (Institute of Applied Mathematics, Faculty of Applied Physics and Mathematics, Gdańsk University of Technology, Narutowicza 11/12, 80-233 Gdańsk, Poland
    These authors contributed equally to this work.)

  • Joanna Raczek

    (Department of Algorithms and Systems Modelling, Faculty of Electronics, Telecommunications and Informatics, Gdańsk University of Technology, Narutowicza 11/12, 80-233 Gdańsk, Poland
    These authors contributed equally to this work.)

Abstract

Smart grids, together with the Internet of Things, are considered to be the future of the electric energy world. This is possible through a two-way communication between nodes of the grids and computer processing. It is necessary that the communication is easy and safe, and the distance between a point of demand and supply is short, to reduce the electricity loss. All these requirements should be met at the lowest possible cost. In this paper, we study a two-dimensional rectangular grid graph which is considered to be a model of a smart grid; nodes of the graph represent points and devices of the smart grid, while links represent possible ways of communication and energy transfer. We consider the problem of choosing the lowest possible number of locations (nodes, points) of the grid which could serve as energy sources (or a source of different resources) to other nodes in such a way that we ensure reduction in electricity loss and provide safe communication and resistance to failures and increases in energy demand.Therefore, we study minimum doubly connected dominating sets in grid graphs. We show that the proposed solutions are the best possible in terms of the number of source points for the case of narrow grid graphs and we give upper and lower bounds for the case of wide grid graphs.

Suggested Citation

  • Joanna Cyman & Joanna Raczek, 2022. "Application of Doubly Connected Dominating Sets to Safe Rectangular Smart Grids," Energies, MDPI, vol. 15(9), pages 1-12, April.
    • Handle: RePEc:gam:jeners:v:15:y:2022:i:9:p:2969-:d:796726
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/15/9/2969/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1996-1073/15/9/2969/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Boris Brimkov & Derek Mikesell & Logan Smith, 2019. "Connected power domination in graphs," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 292-315, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mostafa M. Fouda & Mohamed I. Ibrahem, 2023. "Secure and Efficient Communication in Smart Grids," Energies, MDPI, vol. 16(15), pages 1-2, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Prosenjit Bose & Valentin Gledel & Claire Pennarun & Sander Verdonschot, 2020. "Power domination on triangular grids with triangular and hexagonal shape," Journal of Combinatorial Optimization, Springer, vol. 40(2), pages 482-500, August.
    2. Prosenjit Bose & Valentin Gledel & Claire Pennarun & Sander Verdonschot, 0. "Power domination on triangular grids with triangular and hexagonal shape," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-19.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jeners:v:15:y:2022:i:9:p:2969-:d:796726. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.