arXiv subjects

Zoran Utkovski

Publications and source records attributed to Zoran Utkovski.

At least 19 recordsLinked to original sources

arXiv2024

An Age of Information Characterization of SPS

We derive a closed-form approximation of the stationary distribution of the Age of Information (AoI) of the semi-persistent scheduling (SPS) protocol which is a core part of NR-V2X, an important standard for vehicular communications. While prior works have studied the average AoI under similar assumptions, in this work we provide a full statistical characterization of the AoI by deriving an approximation of its probability mass function. As result, besides the average AoI, we are able to evaluate the age-violation probability, which is of particular relevance for safety-critical applications in vehicular domains, where the priority is to ensure that the AoI does not exceed a predefined threshold during system operation. The study reveals complementary behavior of the age-violation probability compared to the average AoI and highlights the role of the duration of the reservation as a key parameter in the SPS protocol. We use this to demonstrate how this crucial parameter should be tuned according to the performance requirements of the application.

eess.SP↗

arXiv2024

Advancements in UWB: Paving the Way for Sovereign Data Networks in Healthcare Facilities

Ultra-Wideband (UWB) technology re-emerges as a groundbreaking ranging technology with its precise micro-location capabilities and robustness. This paper highlights the security dimensions of UWB technology, focusing in particular on the intricacies of device fingerprinting for authentication, examined through the lens of state-of-the-art deep learning techniques. Furthermore, we explore various potential enhancements to the UWB standard that could realize a sovereign UWB data network. We argue that UWB data communication holds significant potential in healthcare and ultra-secure environments, where the use of the common unlicensed 2.4~GHz band-centric wireless technology is limited or prohibited. A sovereign UWB network could serve as an alternative, providing secure localization and short-range data communication in such environments.

cs.NI↗

arXiv2024

Evolution of the 5G New Radio Two-Step Random Access towards 6G Unsourced MAC

This report summarizes some considerations on possible evolutions of grant-free random access in the next generation of the 3GPP wireless cellular standard. The analysis is carried out by mapping the problem to the recently-introduced unsourced multiple access channel (UMAC) setup. By doing so, the performance of existing solutions can be benchmarked with information-theoretic bounds, assessing the potential gains that can be achieved over legacy 3GPP schemes. The study focuses on the two-step random access (2SRA) protocol introduced by Release 16 of the 5G New Radio standard, investigating its applicability to support large MTC / IoT terminal populations in a grant-free fashion. The analysis shows that the existing 2SRA scheme may not succeed in providing energy-efficient support to large user populations. Modifications to the protocol are proposed that enable remarkable gains in both energy and spectral efficiency while retaining a strong resemblance to the legacy protocol.

cs.IT↗

arXiv2024

Optimized Detection with Analog Beamforming for Monostatic Integrated Sensing and Communication

In this paper, we formalize an optimization framework for analog beamforming in the context of monostatic integrated sensing and communication (ISAC), where we also address the problem of self-interference in the analog domain. As a result, we derive semidefinite programs to approach detection-optimal transmit and receive beamformers, and we devise a superiorized iterative projection algorithm to approximate them. Our simulations show that this approach outperforms the detection performance of well-known design techniques for ISAC beamforming, while it achieves satisfactory self-interference suppression.

eess.SP↗

arXiv2024

Neuromorphic Wireless Device-Edge Co-Inference via the Directed Information Bottleneck

An important use case of next-generation wireless systems is device-edge co-inference, where a semantic task is partitioned between a device and an edge server. The device carries out data collection and partial processing of the data, while the remote server completes the given task based on information received from the device. It is often required that processing and communication be run as efficiently as possible at the device, while more computing resources are available at the edge. To address such scenarios, we introduce a new system solution, termed neuromorphic wireless device-edge co-inference. According to it, the device runs sensing, processing, and communication units using neuromorphic hardware, while the server employs conventional radio and computing technologies. The proposed system is designed using a transmitter-centric information-theoretic criterion that targets a reduction of the communication overhead, while retaining the most relevant information for the end-to-end semantic task of interest. Numerical results on standard data sets validate the proposed architecture, and a preliminary testbed realization is reported.

cs.LG↗

arXiv2023

BiSPARCs for Unsourced Random Access in Massive MIMO

This paper considers the massive MIMO unsourced random access problem in a quasi-static Rayleigh fading setting. The proposed coding scheme is based on a concatenation of a "conventional" channel code (such as, e.g., LDPC) serving as an outer code, and a sparse regression code (SPARC) serving as an inner code. The scheme combines channel estimation, single-user decoding, and successive interference cancellation in a novel way. The receiver performs joint channel estimation and SPARC decoding via an instance of a bilinear generalized approximate message passing (BiGAMP) based algorithm, which leverages the intrinsic bilinear structure that arises in the considered communication regime. The detection step is followed by a per-user soft-input-soft-output (SISO) decoding of the outer channel code in combination with a successive interference cancellation (SIC) step. We show via numerical simulation that the resulting scheme achieves stat-of-the-art performance in the massive connectivity setting, while attaining comparatively low implementation complexity.

eess.SP↗

arXiv2022

Constant Weight Codes with Gabor Dictionaries and Bayesian Decoding for Massive Random Access

This paper considers a general framework for massive random access based on sparse superposition coding. We provide guidelines for the code design and propose the use of constant-weight codes in combination with a dictionary design based on Gabor frames. The decoder applies an extension of approximate message passing (AMP) by iteratively exchanging soft information between an AMP module that accounts for the dictionary structure, and a second inference module that utilizes the structure of the involved constant-weight code. We apply the encoding structure to (i) the unsourced random access setting, where all users employ a common dictionary, and (ii) to the "sourced" random access setting with user-specific dictionaries. When applied to a fading scenario, the communication scheme essentially operates non-coherently, as channel state information is required neither at the transmitter nor at the receiver. We observe that in regimes of practical interest, the proposed scheme compares favorably with state-of-the art schemes, in terms of the (per-user) energy-per-bit requirement, as well as the number of active users that can be simultaneously accommodated in the system. Importantly, this is achieved with a considerably smaller size of the transmitted codewords, potentially yielding lower latency and bandwidth occupancy, as well as lower implementation complexity.

cs.IT↗

arXiv2022

Open or not open: Are conventional radio access networks more secure and trustworthy than Open-RAN?

The Open RAN architecture is a promising and future-oriented architecture. It is intended to open up the radio access network (RAN) and enable more innovation and competition in the market. This will lead to RANs for current 5G networks, but especially for future 6G networks, evolving from the current highly integrated, vendor-specific RAN architecture towards disaggregated architectures with open interfaces that will enable to better tailor RAN solutions to the requirements of 5G and 6G applications. However, the introduction of such an open architecture substantially broadens the attack possibilities when compared to conventional RANs. In the past, this has often led to negative headlines that in summary have associated Open RAN with faulty or inadequate security. In this paper, we analyze what components are involved in an Open RAN deployment, how to assess the current state of security, and what measures need to be taken to ensure secure operation.

cs.CR↗

arXiv2021

Transfer Learning in Multi-Agent Reinforcement Learning with Double Q-Networks for Distributed Resource Sharing in V2X Communication

This paper addresses the problem of decentralized spectrum sharing in vehicle-to-everything (V2X) communication networks. The aim is to provide resource-efficient coexistence of vehicle-to-infrastructure(V2I) and vehicle-to-vehicle(V2V) links. A recent work on the topic proposes a multi-agent reinforcement learning (MARL) approach based on deep Q-learning, which leverages a fingerprint-based deep Q-network (DQN) architecture. This work considers an extension of this framework by combining Double Q-learning (via Double DQN) and transfer learning. The motivation behind is that Double Q-learning can alleviate the problem of overestimation of the action values present in conventional Q-learning, while transfer learning can leverage knowledge acquired by an expert model to accelerate learning in the MARL setting. The proposed algorithm is evaluated in a realistic V2X setting, with synthetic data generated based on a geometry-based propagation model that incorporates location-specific geographical descriptors of the simulated environment(outlines of buildings, foliage, and vehicles). The advantages of the proposed approach are demonstrated via numerical simulations.

cs.LG↗

arXiv2021

Set-Theoretic Learning for Detection in Cell-Less C-RAN Systems

Cloud-radio access network (C-RAN) can enable cell-less operation by connecting distributed remote radio heads (RRHs) via fronthaul links to a powerful central unit. In conventional C-RAN, baseband signals are forwarded after quantization/ compression to the central unit for centralized processing to keep the complexity of the RRHs low. However, the limited capacity of the fronthaul is thought to be a significant bottleneck in the ability of C-RAN to support large systems (e.g. massive machine-type communications (mMTC)). Therefore, in contrast to the conventional C-RAN, we propose a learning-based system in which the detection is performed locally at each RRH and only the likelihood information is conveyed to the CU. To this end, we develop a general set-theoretic learningmethod to estimate likelihood functions. The method can be used to extend existing detection methods to the C-RAN setting.

cs.IT↗

arXiv2021

Joint Source-Channel Coding for Semantics-Aware Grant-Free Radio Access in IoT Fog Networks

A fog-radio access network (F-RAN) architecture is studied for an Internet-of-Things (IoT) system in which wireless sensors monitor a number of multi-valued events and transmit in the uplink using grant-free random access to multiple edge nodes (ENs). Each EN is connected to a central processor (CP) via a finite-capacity fronthaul link. In contrast to conventional information-agnostic protocols based on separate source-channel (SSC) coding, where each device uses a separate codebook, this paper considers an information-centric approach based on joint source-channel (JSC) coding via a non-orthogonal generalization of type-based multiple access (TBMA). By leveraging the semantics of the observed signals, all sensors measuring the same event share the same codebook (with non-orthogonal codewords), and all such sensors making the same local estimate of the event transmit the same codeword. The F-RAN architecture directly detects the events values without first performing individual decoding for each device. Cloud and edge detection schemes based on Bayesian message passing are designed and trade-offs between cloud and edge processing are assessed.

cs.IT↗

arXiv2020

Sparse Signatures with Forward Error Correction Coding for Non-Orthogonal Massive Access

In massive connectivity scenarios with short packets, of interest is the regime where users share wireless resources in a non-orthogonal fashion. Small payloads combined with sporadic user activation call for approaches that jointly address the users access to the shared resources and the design of the channel code. In this paper, we propose a transmission scheme that combines sparse signatures with finite-length forward error correction (FEC) coding for non-orthogonal massive access. Our signature design is based on Euler squares, which are special instances of quasi-cyclic partial geometries that yield sparse graphs with favorable decoding properties. Following a graph-theoretic approach, we explicate the benefits of the coding scheme for the receiver processing that involves joint user detection and decoding. The proposed construction is flexible and can be explicitly characterized for a large number of combinations of system parameters, suitable for both grant-based and grant-free massive access. Finally, unlike common existing schemes, our scheme can be applied to unsourced random access (U-RA). We numerically characterize the trade-off between system parameters such as number of users, load and channel coding rate. The performance evaluation against the state of the art illustrates the potential of the scheme to provide an energy-efficient solution for U-RA.

eess.SP↗

arXiv2020

Correlates of the country differences in the infection and mortality rates during the first wave of the COVID-19 pandemic: Evidence from Bayesian model averaging

In the initial wave of the COVID-19 pandemic we observed great discrepancies in both infection and mortality rates between countries. Besides the biological and epidemiological factors, a multitude of social and economic criteria also influence the extent to which these discrepancies appear. Consequently, there is an active debate regarding the critical socio-economic and health factors that correlate with the infection and mortality rates outcome of the pandemic. Here, we leverage Bayesian model averaging techniques and country level data to investigate the potential of 28 variables, describing a diverse set of health and socio-economic characteristics, in being correlates of the final number of infections and deaths during the first wave of the coronavirus pandemic. We show that only few variables are able to robustly correlate with these outcomes. To understand the relationship between the potential correlates in explaining the infection and death rates, we create a Jointness Space. Using this space, we conclude that the extent to which each variable is able to provide a credible explanation for the COVID-19 infections/mortality outcome varies between countries because of their heterogeneous features.

physics.soc-ph↗

arXiv2019

Evolution of cooperation in networked heterogeneous fluctuating environments

Fluctuating environments are situations where the spatio-temporal stochasticity plays a significant role in the evolutionary dynamics. The study of the evolution of cooperation in these environments typically assumes a homogeneous, well mixed population, whose constituents are endowed with identical capabilities. In this paper, we generalize these results by developing a systematic study for the cooperation dynamics in fluctuating environments under the consideration of structured, heterogeneous populations with individual entities subjected to general behavioral rules. Considering complex network topologies, and a behavioral rule based on generalized reciprocity, we perform a detailed analysis of the effect of the underlying interaction structure on the evolutionary stability of cooperation. We find that, in the presence of environmental fluctuations, the cooperation dynamics can lead to the creation of multiple network components, each with distinct evolutionary properties. This is paralleled to the freezing state in the Random Energy Model. We utilize this result to examine the applicability of our generalized reciprocity behavioral rule in a variety of settings. We thereby show that the introduced rule leads to steady state cooperative behavior that is always greater than or equal to the one predicted by the evolutionary stability analysis of unconditional cooperation. As a consequence, the implementation of our results may go beyond explaining the evolution of cooperation. In particular, they can be directly applied in domains that deal with the development of artificial systems able to adequately mimic reality, such as reinforcement learning.

q-bio.PE↗

arXiv2019

Joint Source-Channel Coding and Bayesian Message Passing Detection for Grant-Free Radio Access in IoT

Consider an Internet-of-Things (IoT) system that monitors a number of multi-valued events through multiple sensors sharing the same bandwidth. Each sensor measures data correlated to one or more events, and communicates to the fusion center at a base station using grant-free random access whenever the corresponding event is active. The base station aims at detecting the active events, and, for each active event, to determine a scalar value describing each active event's state. A conventional solution based on Separate Source-Channel (SSC) coding would use a separate codebook for each sensor and decode the sensors' transmitted packets at the base station in order to subsequently carry out events' detection. In contrast, this paper considers a potentially more efficient solution based on Joint Source-Channel (JSC) coding via a non-orthogonal generalization of Type-Based Multiple Access (TBMA). Accordingly, all sensors measuring the same event share the same codebook (with non-orthogonal codewords), and the base station directly detects the events' values without first performing individual decoding for each sensor. A novel Bayesian message-passing detection scheme is developed for the proposed TBMA-based protocol, and its performance is compared to conventional solutions.

eess.SP↗

arXiv2019

Lead-lag Relationships in Foreign Exchange Markets

Lead-lag relationships among assets represent a useful tool for analyzing high frequency financial data. However, research on these relationships predominantly focuses on correlation analyses for the dynamics of stock prices, spots and futures on market indexes, whereas foreign exchange data have been less explored. To provide a valuable insight on the nature of the lead-lag relationships in foreign exchange markets here we perform a detailed study for the one-minute log returns on exchange rates through three different approaches: i) lagged correlations, ii) lagged partial correlations and iii) Granger causality. In all studies, we find that even though for most pairs of exchange rates lagged effects are absent, there are many pairs which pass statistical significance tests. Out of the statistically significant relationships, we construct directed networks and investigate the influence of individual exchange rates through the PageRank algorithm. The algorithm, in general, ranks stock market indexes quoted in their respective currencies, as most influential. In contrast to the claims of the efficient market hypothesis, these findings suggest that all market information does not spread instantaneously.

q-fin.ST↗

arXiv2019

The Role of Multiplex Network Structure in Cooperation through Generalized Reciprocity

Recent studies suggest that the emergence of cooperative behavior can be explained by generalized reciprocity, a behavioral mechanism based on the principle of "help anyone if helped by someone". In complex systems, the cooperative dynamics is largely determined by the network structure which dictates the interactions among neighboring individuals. These interactions often exhibit multidimensional features, either as relationships of different types or temporal dynamics, both of which may be modeled as a "multiplex" network. Against this background, here we advance the research on cooperation models inspired by generalized reciprocity by considering a multidimensional networked society. Our results reveal that a multiplex network structure may enhance the role of generalized reciprocity in promoting cooperation, whereby some of the network dimensions act as a latent support for the others. As a result, generalized reciprocity forces the cooperative contributions of the individuals to concentrate in the dimension which is most favorable for the existence of cooperation.

q-bio.PE↗

arXiv2019

Cooperation dynamics in the networked geometric Brownian motion

Recent works suggest that pooling and sharing may constitute a fundamental mechanism for the evolution of cooperation in well-mixed fluctuating environments. The rationale is that, by reducing the amplitude of fluctuations, pooling and sharing increases the steady-state growth rate at which the individuals self-reproduce. However, in reality interactions are seldom realized in a well-mixed structure, and the underlying topology is in general described by a complex network. Motivated by this observation, we investigate the role of the network structure on the cooperative dynamics in fluctuating environments, by developing a model for networked pooling and sharing of resources undergoing environmental fluctuations, represented through geometric Brownian motion. The study reveals that, while in general cooperation increases the individual steady state growth rates (i.e. is evolutionary advantageous), the interplay with the network structure may yield large discrepancies in the observed individual resource endowments. We comment possible biological and social implications and discuss relations to econophysics.

nlin.AO↗