Прегледај по Аутор "Forcan, Jovana"
Сада се приказује 1 - 7 од 7
Резултати по страници
Опције сортирања
- СтавкаA Zonal Approach for Wide-Area Temporary Voltage Quality Assessment in a Smart Grid(MDPI, 2024) Forcan, Miodrag; Simović, Aleksandar; Jokić, Srđan; Forcan, JovanaWide-area voltage quality assessment represents one of the mandatory objectives for distribution system operators in the development of advanced distribution management systems supporting smart grid requirements. This paper introduces a zonal approach for wide-area temporary voltage quality evaluation in a distribution network. The concept of temporary voltage quality evaluation and assessment is recommended to incentivize active/online management of voltage quality issues. A decision support system based on simple deterministic rules is proposed for rating the voltage quality zones in a distribution network and making recommendations to the distribution system operator. Voltage RMS level, unbalance, and total harmonic distortion are considered voltage quality indices representing the inputs in the decision support system. Residential, commercial, and industrial load types are considered when setting the thresholds for voltage quality indices. The proposed zonal approach for the division of distribution networks in voltage quality zones is applied to the example of a typical European-type distribution network. The operation of a decision support system is tested using the developed distribution smart grid model. The following simulation case studies are conducted: loads with low power factors, manual voltage regulation at MV/LV transformers, unbalanced loads, integration of solar power plant, and nonlinear loads. The obtained simulation results reveal the benefits of the proposed voltage quality assessment approach. Cybersecurity challenges that may impact the proposed approach are addressed, including security vulnerabilities, data privacy, and resilience to cyber threats.
- СтавкаCloud-based System for Real-Time Reading of Smart Meters’ Data over 5G New Radio(2021) Forcan, Miodrag; Maksimović, Mirjana; Forcan, Jovana; Jokić, SrđanThe potential of the combined application of Cloud computing and the fifth generation of cellular network technology (5G) in Smart Grid (SG) could be revolutionary in terms of empowering the Advanced Metering Infrastructure (AMI). The model of a real-time 5G-based communication system for remote reading of Smart Meters’ data is developed and presented in this paper. Online monitoring of power demand has been performed using the Cloud-based platform ThingSpeak. The proposed 5G communication model and online monitoring function have been tested and validated using a power demand variation scenario in a well-known IEEE 13 node network. The obtained results confirm the model accuracy and reveal the potential of AMI based on realtime data transmission between Smart meters (SM) and Cloud computing platform using a 5G communication network.
- СтавкаMaker–Breaker domination number for Cartesian products of path graphs P2 and Pn(Maison de l'informatique et des mathematiques discretes, 2023) Forcan, Jovana; Qi, JiayueWe study the Maker–Breaker domination game played by Dominator and Staller on the vertex set of a given graph. Dominator wins when the vertices he has claimed form a dominating set of the graph. Staller wins if she makes it impossible for Dominator to win, or equivalently, she is able to claim some vertex and all its neighbours. Maker– Breaker domination number γMB(G) (γ′ M B(G)) of a graph G is defined to be the minimum number of moves for Dominator to guarantee his winning when he plays first (second). We investigate these two invariants for the Cartesian product of any two graphs. We obtain upper bounds for the Maker–Breaker domination number of the Cartesian product of two arbitrary graphs. Also, we give upper bounds for the Maker–Breaker domination number of the Cartesian product of the complete graph with two vertices and an arbitrary graph. Most importantly, we prove that γ′ M B(P2□Pn) = n for n ≥ 1, γMB(P2□Pn) equals n, n − 1, n − 2, for 1 ≤ n ≤ 4, 5 ≤ n ≤ 12, and n ≥ 13, respectively. For the disjoint union of P2□Pns, we show that γ′ M B(˙∪k i=1(P2□Pn)i) = k · n (n ≥ 1), and that γMB(˙∪k i=1(P2□Pn)i) equals k · n, k · n − 1, k · n − 2 for 1 ≤ n ≤ 4, 5 ≤ n ≤ 12, and n ≥ 13, respectively.
- СтавкаMaker–Breaker Games with Constraints(2021) Forcan, Jovana; Mikalački, MirjanaWe analyse the unbiased WalkerMaker–WalkerBreaker game, a variant of the well-known Maker–Breaker positional game where both players Maker and Breaker are constrained to choose their edges according to a walk. Here, we consider two standard graph games - the Connectivity game and the Hamilton Cycle game played on the edge set of the complete graph, Kn, on n vertices, and show how fast Walker-Maker can build desired spanning structures in these games.
- СтавкаMaker–Breaker total domination game on cubic graphs(2022) Forcan, Jovana; Mikalački, MirjanaWe study Maker–Breaker total domination game played by two players, Dominator and Staller, on the connected cubic graphs. Staller (playing the role of Maker) wins if she manages to claim an open neighbourhood of a vertex. Dominator wins otherwise (i.e. if he can claim a total dominating set of a graph). For certain graphs on n 6 vertices, we give the characterization on those which are Dominator’s win and those which are Staller’s win.
- СтавкаOn the WalkerMaker - WalkerBreaker games(2019) Forcan, Jovana; Mikalački, MirjanaWe study the unbiased WalkerMaker-WalkerBreaker games on the edge set of the complete graph on n vertices, Kn, a variant of well-known Maker{Breaker positional games, where both players have the restriction on the way of playing. Namely, each player has to choose her/his edges according to a walk. Here, we focus on two standard graph games { the Connectivity game and the Hamilton cycle game and show how quickly WalkerMaker can win both games.
- СтавкаSpanning Structures inWalker–Breaker Games(2022) Forcan, Jovana; Mikalački, MirjanaWe study the biased (2 : b) Walker–Breaker games, played on the edge set of the complete graph on n vertices, Kn. These games are a variant of the Maker–Breaker games with the restriction that Walker (playing the role of Maker) has to choose her edges according to a walk. We look at the two standard graph games – the Connectivity game and the Hamilton Cycle game and show that Walker can win both games even when playing against Breaker whose bias is of the order of magnitude n/ ln n.