SearcharxivSearch

arXiv subjects

Julian Karoliny

Publications and source records attributed to Julian Karoliny.

5 recordsLinked to original sources

Automated Testbed for Repeatable Evaluation of Ultra-Wideband Localization Performance

Testing Ultra-Wideband (UWB) systems is challenging, as multiple devices need to coordinate over lossy links and the systems' behavior is influenced by timing, synchronization, and environmental factors. Traditional testing is often insufficient to capture these complex interactions, highlighting the need for an overarching testbed infrastructure that can manage devices, control the environment, and make measurements and test scenarios repeatable. In this work, we present a highly automated testbed architecture built on Robot Operating System Version 2, integrating device management with environmental control and measurement systems. It includes an optical reference system, a controllable Autonomous Guided Vehicle to position devices within the environment, and time synchronization via Network Time Protocol (NTP). The testbed achieves a Root Mean Squared Error of 4.8 mm for positioning repeatability and 0.493$\deg$ for the orientation, and our NTP-based synchronization approach achieves a timing accuracy of below 1 ms. All testbed functionality can be controlled remotely through simple Python scripts to allow automated orchestration tasks such as conducting complex measurement scenarios. We demonstrate this with a measurement campaign on UWB localization, showing how it enables repeatable, observable, and fully controlled wireless experiments.

eess.SP

Insights from Publishing Open Data in Industry-Academia Collaboration

Effective data management and sharing are critical success factors in industry-academia collaboration. This paper explores the motivations and lessons learned from publishing open data sets in such collaborations. Through a survey of participants in a European research project that published 13 data sets, and an analysis of metadata from almost 281 thousand datasets in Zenodo, we collected qualitative and quantitative results on motivations, achievements, research questions, licences and file types. Through inductive reasoning and statistical analysis we found that planning the data collection is essential, and that only few datasets (2.4%) had accompanying scripts for improved reuse. We also found that authors are not well aware of the importance of licences or which licence to choose. Finally, we found that data with a synthetic origin, collected with simulations and potentially mixed with real measurements, can be very meaningful, as predicted by Gartner and illustrated by many datasets collected in our research project.

cs.SE

Predicting the Channel Access of Bluetooth Low Energy

Bluetooth Low Energy (BLE) is one of the key enablers for low-power and low-cost applications in consumer electronics and the Internet of Things. The latest features such as audio and direction finding will introduce more and more devices that rely on BLE for communication. However, like many other wireless standards, BLE relies on the unlicensed 2.4 GHz frequency band where the spectrum is already very crowded and a channel access without collisions with other devices is difficult to guarantee. For applications with high reliability requirements, it will be beneficial to actively consider channel access from other devices or standards. In this work, we present an approach to estimate the connection parameters of multiple BLE connections outside our control and knowledge by passively listening to the channel. With this, we are able to predict future channel access of these BLE connections that can be used by other wireless networks to avoid collisions. We show the applicability of our algorithm with measurements from which we are able to identify unknown BLE connections, reconstruct their specific connection parameters, and predict their future channel access.

cs.IT

RSSI-Based Machine Learning with Pre- and Post-Processing for Cell-Localization in IWSNs

Industrial wireless sensor networks are becoming crucial for modern manufacturing. If the sensors in those networks are mobile, the position information, besides the sensor data itself, can be of high relevance. E.g. this position information can increase the trustability of a wireless sensor measurement by assuring that the sensor is not physically removed, off track, or otherwise compromised. In certain applications, localization information at cell-level, whether the sensor is inside or outside a room or cell, is sufficient. For this, localization using Received Signal Strength Indicator (RSSI) measurements is very popular since RSSI values are available in almost all existing technologies and no direct interaction with the mobile sensor node and its communication in the network is needed. For this scenario, we propose methods to improve the robustness and accuracy of common machine learning classifiers, by using features based on short-term moments and a second classification stage using Hidden Markov Models. With the data from an extensive measurement campaign, we show the applicability of our method and achieve a cell-level localization accuracy of 93.5\%.

cs.IT

RSSI-Based Location Classification Using a Particle Filter to Fuse Sensor Estimates

For Cyper-Physical Production Systems (CPPS), localization is becoming increasingly important as wireless and mobile devices are considered an integral part. While localizing targets in a wireless communication system based on the Received Signal Strength Indicators (RSSIs) is a usual solution, it is limited by sensor quality. We consider the scenario of a car moving in and out of a chamber and propose to use a particle filter for sensor fusion, allowing us to incorporate non-idealities in our model and achieve a high-quality position estimate. Then, we use Machine Learning (ML) to classify the vehicle position. Our results show that the location output of the particle filter is a better input to the classifiers than the raw RSSI data, and we achieve improved accuracy while simultaneously reducing the number of features that the ML has to consider. We also compare the performance of multiple ML algorithms and show that SVMs provide the overall best performance for the given task.

cs.IT