Прегледај по Аутор "Forcan, Jovana"

Сада се приказује 1 - 5 од 5
  • Сличица
    Ставка
    Cloud-based System for Real-Time Reading of Smart Meters’ Data over 5G New Radio
    (2021) Forcan, Miodrag; Maksimović, Mirjana; Forcan, Jovana; Jokić, Srđan
    The 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 Games with Constraints
    (2021) Forcan, Jovana; Mikalački, Mirjana
    We 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, Mirjana
    We 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, Mirjana
    We 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, Mirjana
    We 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.