<?xml version="1.0" encoding="UTF-8"?>
<xml><records><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Rafał Marjasz</style></author><author><style face="normal" font="default" size="100%">Krzysztof Grochla</style></author><author><style face="normal" font="default" size="100%">Anna Strzoda</style></author><author><style face="normal" font="default" size="100%">Zbigniew Łaskarzewski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Simulation Analysis of Packet Delivery Probability in LoRa Networks.</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2019</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-030-21952-9_7</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">1039</style></volume><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The LoRa communication standard allows to transmit data in radio networks over distances of few kilometers. Although the LoRa WAN protocol assumes the use of ALOHA channel access, due to the use of multiple channels and multiple spreading factors in LoRa networks the evaluation of collision probability is challenging. We present the simulation model allowing to estimate the per node probability of successful packet delivery ratio. The model is evaluated for different network topologies, based on random distribution of nodes or based on the real location of meters in sample smart city deployments. The results show that the packet delivery ratio varies significantly depending on the location of the end nodes in the network. Due to the higher spreading factor used, the collision probability is very low for nodes located near to the access point. The use of proposed simulation model allows to identify the nodes which experience high collision probability and react e.g. by reconfiguration.&lt;/p&gt;&#13;
</style></abstract><isbn><style face="normal" font="default" size="100%">978-3-030-21951-2</style></isbn><publisher><style face="normal" font="default" size="100%">Springer, Cham</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Krzysztof Grochla</style></author><author><style face="normal" font="default" size="100%">Rafał Marjasz</style></author><author><style face="normal" font="default" size="100%">Konrad Połys</style></author><author><style face="normal" font="default" size="100%">Anna Strzoda</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Kolizje pakietów w sieciach LoRa w zastosowaniach smart city</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2019</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Przegląd Telekomunikacyjny+ Wiadomości Telekomunikacyjne</style></secondary-title><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Michał Gorawski</style></author><author><style face="normal" font="default" size="100%">Krzysztof Grochla</style></author><author><style face="normal" font="default" size="100%">Rafał Marjasz</style></author><author><style face="normal" font="default" size="100%">Artur Frankiewicz</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Energy Minimization Algorithm for Estimation of Clock Skew and Reception Window Selection in Wireless Networks</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2021</style></year><pub-dates><date><style face="normal" font="default" size="100%">01/2021</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Sensors</style></secondary-title><urls><style face="normal" font="default" size="100%">https://www.mdpi.com/1424-8220/21/5/1768</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">https://doi.org/10.3390/s21051768</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">21</style></volume><section><style face="normal" font="default" size="100%">https://www.mdpi.com/</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The synchronization of time between devices is one of the more important and challenging problems in wireless networks. We discuss the problem of maximization of the probability of receiving a message from a device using a limited listening time window to minimize energy utilization. We propose a solution to two important problems in wireless networks of battery-powered devices: a method of establishing a connection with a device that has been disconnected from the system for a long time and developed unknown skew and also two approaches to follow-up clock synchronization using the confidence interval method. We start with the analysis of measurements of clock skew. The algorithms are evaluated using extensive simulations and we discuss the selection of parameters balancing between minimizing the energy utilization and maximizing the probability of reception of the message. We show that the selection of a time window of growing size requires less energy to receive a packet than using the same size of time window repeated multiple times. The shifting of reception windows can further decrease the energy cost if lower packet reception probability is acceptable. We also propose and evaluate an algorithm scaling the reception window size to the interval between the packet transmission&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Rafał Marjasz</style></author><author><style face="normal" font="default" size="100%">Anna Strzoda</style></author><author><style face="normal" font="default" size="100%">Konrad Połys</style></author><author><style face="normal" font="default" size="100%">Krzysztof Grochla</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Mitigation of LoRa interferences via dynamic channel weights</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2021</style></year><pub-dates><date><style face="normal" font="default" size="100%">10/2021</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">European Simulation and Modelling Conference (formelly European Simulation Multiconference) - ESM </style></secondary-title><urls><style face="normal" font="default" size="100%">https://www.researchgate.net/publication/356041519_Mitigation_of_LORA_Interferences_via_Dynamic_Channel_Weights</style></urls><pages><style face="normal" font="default" size="100%">150-154</style></pages><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The Low Power Wide Area Networks, such as LoRa (Long Range), allow communication over a large area with limited bandwidth and small data rates, using an unlicensed band. LoRa uses multiple channels, but the number of channels available is relatively narrow - e.g. 8 in most countries in Europe. The transmission is subject to interferences due to many other devices transmitting within the same frequencies. In this paper, we evaluate how strong the interferences' influence is by analysing the packet delivery rate in a large scale LoRa network. The measurements have been made over more than seven months and show noticeable variability in packet delivery rate per channel both in space and in time. We propose to estimate the scale of interferences through continuous observation of the number of delivered packets for every channel per LoRa gateway or per selected area. We also discuss how this estimation may mitigate the interferences by assigning the dynamic weights to the LoRa channel selection procedure. We created an algorithm that periodically updates the weights, and a simulation model to evaluate the algorithm. A significant improvement in the efficiency of package delivery is visible, from 12% to 49% less packet loss.&lt;/p&gt;&#13;
</style></abstract><publisher><style face="normal" font="default" size="100%">Eurosis</style></publisher><pub-location><style face="normal" font="default" size="100%">Rome</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Wojciech Kempa</style></author><author><style face="normal" font="default" size="100%">Rafał Marjasz</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Study on Transient Queue-Size Distribution in the Finite-Buffer Model with Batch Arrivals and Multiple Vacation Policy</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2021</style></year><pub-dates><date><style face="normal" font="default" size="100%">10/2021</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Entropy</style></secondary-title><urls><style face="normal" font="default" size="100%">https://doi.org/10.3390/e23111410</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.3390/e23111410</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">23</style></volume><issue><style face="normal" font="default" size="100%">11</style></issue><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Wojciech. Kempa</style></author><author><style face="normal" font="default" size="100%">Kamil Książek</style></author><author><style face="normal" font="default" size="100%">Rafał Marjasz</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">On Time-Dependent Queue-Size Distribution in a Model With Finite Buffer Capacity and Deterministic Multiple Vacations With Applications to LTE DRX Mechanism Modeling</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2021</style></year><pub-dates><date><style face="normal" font="default" size="100%">10/2021</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">IEEE Access</style></secondary-title><urls><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/9591613</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1109/ACCESS.2021.3123897</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">9</style></volume><section><style face="normal" font="default" size="100%">148374 - 148383</style></section><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Rafał Marjasz</style></author><author><style face="normal" font="default" size="100%">Konrad Połys</style></author><author><style face="normal" font="default" size="100%">Anna Strzoda</style></author><author><style face="normal" font="default" size="100%">Krzysztof Grochla</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Improving Delivery Ratio in LoRa Network</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2021</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 19th ACM International Symposium on Mobility Management and Wireless Access</style></secondary-title><urls><style face="normal" font="default" size="100%">https://dl.acm.org/doi/10.1145/3479241.3486698?cid=99659913397</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1145/3479241.3486698</style></electronic-resource-num><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The LoRa (Long Range) radio communication provides large coverage areas, low bandwidth, small data rates, and transmitting limited data sizes, with very low energy usage. Multiple transmission channels are used, but the number of channels available is fairly limited - e.g. 8 in most countries in Europe. The amount of interferences may be estimated by the continuous observation of the number of delivered packets and the received signal strength. We propose to aggregate and analyse those metrics per channel and geographical area. When the proportion of received packets per some of the areas decreases, it is subjected to heavier interferences than other parts of the network and should be used less intensively. Thus we propose to allocate the weights for each channel per geographic area and/or device, defining the probability of the channel usage. Furthermore, we created an algorithm that periodically updates the weights and a simulation model using OMNeT++, FloRa, taking into account possible packets collisions. The algorithm has been validated for both random and realistic network topologies. The simulation evaluations show a significant improvement in the package delivery efficiency, by almost 50% in scenarios with very high interference level simulated and by more than 13% in scenarios fed with real-life measurements of packet delivery probability changes in time.&lt;/p&gt;&#13;
</style></abstract><isbn><style face="normal" font="default" size="100%">9781450390798</style></isbn><publisher><style face="normal" font="default" size="100%">Association for Computing Machinery</style></publisher><pub-location><style face="normal" font="default" size="100%">New York, NY, USA</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Krzysztof Grochla</style></author><author><style face="normal" font="default" size="100%">Anna Strzoda</style></author><author><style face="normal" font="default" size="100%">Rafał Marjasz</style></author><author><style face="normal" font="default" size="100%">Przemysław Głomb</style></author><author><style face="normal" font="default" size="100%">Kamil Książek</style></author><author><style face="normal" font="default" size="100%">Zbigniew Łaskarzewski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Energy-Aware Algorithm for Assignment of Relays in LPWAN</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2022</style></year><pub-dates><date><style face="normal" font="default" size="100%">11/2022</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Transactions on Sensor Networks</style></secondary-title><urls><style face="normal" font="default" size="100%">https://dl.acm.org/doi/10.1145/3544561?cid=99659913397</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1145/3544561</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">18</style></volume><issue><style face="normal" font="default" size="100%">4</style></issue><section><style face="normal" font="default" size="100%">Article No. 60</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The Low Power Wide Area Networks allow maintaining connectivity with devices over a distance of a few kilometres. However, due&lt;br /&gt;&#13;
to the presence of obstacles the communication range in an urban environment may be shorter, which creates multiple blind spots or&lt;br /&gt;&#13;
areas with limited coverage. The nodes acting as relays may solve this problem by forwarding the data from other devices with poor&lt;br /&gt;&#13;
connectivity. We propose and investigate a novel algorithm that assigns devices to the relay role while keeping the battery constraints.&lt;br /&gt;&#13;
We define the algorithm, describe the simulation testbed, and present performance evaluation in several scenarios, including real-life&lt;br /&gt;&#13;
topologies of IoT networks. The proposed relay selection scheme allows increasing the lifetime of the network by selecting the relay&lt;br /&gt;&#13;
taking into account the current battery capacity. Additionally, it outperforms a previously proposed relay selection algorithm for LP&lt;br /&gt;&#13;
WAN, showing an average 4% decrease in transmission time and an order of magnitude lower computation complexity.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Anna Strzoda</style></author><author><style face="normal" font="default" size="100%">Rafał Marjasz</style></author><author><style face="normal" font="default" size="100%">Krzysztof Grochla</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">How Accurate is LoRa Positioning in Realistic Conditions?</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2022</style></year><pub-dates><date><style face="normal" font="default" size="100%">10/2022</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">ACM MSWIM 22 - The 25th International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, DIVANET Symposium</style></secondary-title><urls><style face="normal" font="default" size="100%">https://dl.acm.org/doi/10.1145/3551662.3561260?cid=99659913397</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1145/3551662.3561260</style></electronic-resource-num><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The LoRa communication technology has been developed for data transmission, but recent research papers showed that it could also be used to estimate the transmitting devices' location. The location can be found with reasonable accuracy, with median error as low as tens of meters; however, in many cases, it is evaluated in very optimistic transmission conditions, e.g. using line-of-sight communication and on a small data set. We estimate how LoRa localization performs in a realistic scenario, using an extensive data set of a telemetric network of a few thousand devices to calculate the location using the trilateration and estimate the error of the calculation. Within the analysed dataset the true-range multilateration provides highly inaccurate location estimation, with a median error of 588.64 m and an average error of 808.57 m. We argue that the LoRa localization in real-life conditions is ineffective, as the estimation of the distance between the node and the gateway changes heavily depending on the location of the node and radio channel attenuation.&lt;/p&gt;&#13;
</style></abstract><isbn><style face="normal" font="default" size="100%">9781450394826</style></isbn><publisher><style face="normal" font="default" size="100%">Association for Computing Machinery</style></publisher><pub-location><style face="normal" font="default" size="100%">New York, NY, USA</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Anna Strzoda</style></author><author><style face="normal" font="default" size="100%">Rafał Marjasz</style></author><author><style face="normal" font="default" size="100%">Krzysztof Grochla</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">LoRa Positioning in Verification of Location Data's Credibility</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2022</style></year><pub-dates><date><style face="normal" font="default" size="100%">12/2022</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems</style></secondary-title><urls><style face="normal" font="default" size="100%">https://www.infocommunications.hu/2022_4_8</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.36244/ICJ.2022.4.8</style></electronic-resource-num><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The LoRa is a novel radio communication technology&lt;br /&gt;&#13;
providing low power and a high range of data transmission.&lt;br /&gt;&#13;
The LoRa transmission may be used for a low-cost localization&lt;br /&gt;&#13;
to estimate the network nodes’ location. Some recent research&lt;br /&gt;&#13;
showed that the location could be found with reasonable accuracy,&lt;br /&gt;&#13;
with median error as low as tens of meters. Still, such results are&lt;br /&gt;&#13;
achieved in a controlled environment with low interferences. We&lt;br /&gt;&#13;
first evaluate the LoRa localization using an extensive data set&lt;br /&gt;&#13;
of a telemetric network of a few thousand devices. We show that&lt;br /&gt;&#13;
although the direct positioning based on trilateration provides&lt;br /&gt;&#13;
limited accuracy, the measurement of LoRa transmission may&lt;br /&gt;&#13;
be successfully used to evaluate the credibility of location information.&lt;br /&gt;&#13;
The information about which gateways received the data&lt;br /&gt;&#13;
and the RSSI measurements allow us to verify if the potential&lt;br /&gt;&#13;
coordinates of a location are accurate. We propose a metric for&lt;br /&gt;&#13;
location verification and estimate its credibility on a sample of&lt;br /&gt;&#13;
measurements from the LoRa telemetry network.&lt;/p&gt;&#13;
</style></abstract><publisher><style face="normal" font="default" size="100%">Infocommunications Journal</style></publisher><pub-location><style face="normal" font="default" size="100%">Nice, France</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Michał Gorawski</style></author><author><style face="normal" font="default" size="100%">Rafał Marjasz</style></author><author><style face="normal" font="default" size="100%">Krzysztof Grochla</style></author><author><style face="normal" font="default" size="100%">Artur Frankiewicz</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Comparative Analysis of Energy Consumption in Simulated LoRa Water Meter Reconfiguration vs. Real-world Readings</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2024</style></year><pub-dates><date><style face="normal" font="default" size="100%">08/2024</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">IFIP Networking</style></secondary-title><urls><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/10619861</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.23919/IFIPNetworking62109.2024.10619861</style></electronic-resource-num><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Detecting water leaks in distribution networks is crucial for conserving resources and preventing infrastructure damage. However, one of the most basic and significant challenges before employing any leak detection method is collecting data from the water distribution network. The sensors used for data collection are usually battery-powered; thus, the energy consumption of these devices is an essential factor. In this paper, we analyze the battery consumption of real devices placed in an operational water distribution network, and based on the obtained data, we perform a series of complex simulations to validate the preliminary assumptions we plan to use in further research of leak detection methods.&lt;/p&gt;&#13;
</style></abstract><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Thessaloniki</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Rafał Marjasz</style></author><author><style face="normal" font="default" size="100%">Krzysztof Grochla</style></author><author><style face="normal" font="default" size="100%">Konrad Połys</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Comprehensive Algorithm for Vertical Positioning in Multi-Building Environments as an Advancement in Indoor Floor-Level Detection</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2024</style></year><pub-dates><date><style face="normal" font="default" size="100%">06/2024</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Scientific Reports</style></secondary-title><urls><style face="normal" font="default" size="100%">https://www.nature.com/articles/s41598-024-64824-9</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">https://doi.org/10.1038/s41598-024-64824-9</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">14</style></volume><issue><style face="normal" font="default" size="100%">14034</style></issue><section><style face="normal" font="default" size="100%">1</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The proliferation of smartphones has catalyzed diverse services, mainly focusing on indoor localization to determine users’ and devices’ positions within buildings. Despite decades of exploration, the seamless integration of wireless technologies in tracking devices and users has become pivotal in various sectors, including health, industry, disaster management, building operations, and surveillance. Extensive research in laboratory and industrial settings, particularly in wireless sensor networks and robotics, has informed indoor localization techniques. This paper, referencing surveys and original literature reviews, proposes an innovative indoor location system amalgamating GPS and barometer readings. GPS identifies entry through doors, while barometer readings facilitate accurate floor-level tracking. The integration promises continuous real-time location updates, enhancing security, navigation, and emergency response. Notably, the algorithm is infrastructure-independent, relying on the smartphone’s barometer, and versatile, detecting elevator travel when Wi-Fi AP or LTE signals are available. Results indicate high accuracy, with building entry exceeding 93%, elevator recognition achieving 75% sensitivity and 97% specificity, and floor change detection surpassing 95% sensitivity and nearly 98% specificity (which translates to nearly 97% accuracy). This comprehensive solution, emphasizing the critical role of precise vertical positioning, signifies an advancement in tracking within urban structures.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Michał Gorawski</style></author><author><style face="normal" font="default" size="100%">Rafał Marjasz</style></author><author><style face="normal" font="default" size="100%">Krzysztof Grochla</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Performance evaluation of the secure multi-tenancy system for smart city IoT environment using open LDAP and Apache Kafka.</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2024</style></year><pub-dates><date><style face="normal" font="default" size="100%">06/2024</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">22nd International Industrial Simulation Conference</style></secondary-title><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Supporting multiple users and operators in a single IoT system is vital for large-scale commercial deployments. This involves servicing numerous network operators with one IT system and set of devices, ensuring each operator can manage, reconfigure, and change device settings securely. This paper evaluates a multi-tenancy solution in our test system (TS), utilizing Apache Kafka as a message broker and OpenLDAP as an authorizer. It describes the system design, methods to ensure data separation, security and results of performance evaluation in simulation.&lt;/p&gt;&#13;
</style></abstract><isbn><style face="normal" font="default" size="100%">978-9-492859-30-3</style></isbn><publisher><style face="normal" font="default" size="100%">EUROSIS-ETI</style></publisher><pub-location><style face="normal" font="default" size="100%">Valencia, Spain</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Rafał Marjasz</style></author><author><style face="normal" font="default" size="100%">Wojciech Kempa</style></author><author><style face="normal" font="default" size="100%">Viacheslav Kovtun</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Quantification of system resilience through stress testing using a predictive analysis of departure dynamics in a M^X/G/1/N queue with multiple vacation policy</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2025</style></year><pub-dates><date><style face="normal" font="default" size="100%">03/2025</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Scientific Reports</style></secondary-title><urls><style face="normal" font="default" size="100%"/></urls><electronic-resource-num><style face="normal" font="default" size="100%">https://doi.org/10.1038/s41598-025-95478-w</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">15</style></volume><issue><style face="normal" font="default" size="100%">10484</style></issue><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The study investigates the departure counting process in a finite-buffer queueing system with batch arrivals and multiple vacation policy, focusing on quantifying system resilience through stress testing and predictive analysis. A representation for the mixed double transform of the number of departures up to a fixed time moment is obtained in explicit form by applying an analytic approach based on integral equations and linear algebra. We perform a comparative analysis of numerical calculations and simulations made in OMNeT++ Discrete Event Simulator. The attached numerical study aims to understand how the queueing system copes under challenging conditions, examining the impact of various system parameters on the behaviour of the mean number of packets processed within a fixed time frame. Utilizing numerical experiments, the study analyzes the influence of vacation duration, initial buffer state, arrival intensity, and processing rate on the departure process. This enables the understanding of system recovery dynamics, particularly in how critical infrastructures can be optimized for resilience against disruptions. Results reveal significant dependencies between these parameters and the transient behaviour of the queueing system. Notably, the service speed parameter demonstrates the most substantial influence on the mean number of processed packets, followed by the arrival rate. Conversely, variations in vacation duration and initial packet count exhibit comparatively minor effects on system behaviour. Overall, the findings provide valuable insights into the dynamics of departure processes in finite-buffer queue systems with batch arrivals and multiple vacation policies, offering implications for system optimization, performance enhancement strategies, and resilience assessment in the face of potential system failures or disasters.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record></records></xml>
