We present a novel approach for distributed load balancing in heterogeneous networks that use cell range expansion (CRE) for user association and almost blank subframe (ABS) for interference management. First, we formulate the problem as a minimization of an α-fairness objective function with load and outage constraints. Depending on α, different objectives in terms of network performance or fairness can be achieved. Next, we model the interactions among the base stations for load balancing as a near-potential game, in which the potential function is the α-fairness function. The optimal pure Nash equilibrium (PNE) of the game is found by using distributed learning algorithms. We propose log-linear and binary log-linear learning algorithms for complete and partial information settings, respectively. We give a detailed proof of convergence of learning algorithms for a near-potential game. We provide sufficient conditions under which the learning algorithms converge to the optimal PNE. By running extensive simulations, we show that the proposed algorithms converge within few hundreds of iterations. The convergence speed in the case of partial information setting is comparable to that of the complete information setting. Finally, we show that outage can be controlled and a better load balancing can be achieved by introducing ABS.

We propose a distributed learning algorithm for the resource allocation problem in Device-to-Device (D2D) wireless networks that takes into account the throughput estimation noise. We first formulate a stochastic optimization problem with the objective of maximizing the generalized alpha-fair function of the network. In order to solve it distributively, we then define and use the framework of noisy-potential games. In this context, we propose a Binary Log-linear Learning Algorithm (BLLA), which is distributed across cells and converges to a Nash equilibrium of the resource allocation game. This equilibrium is also an optimal for the resource allocation optimization problem. A key enabler for the analysis of the convergence are the proposed rules for computation of resistance of trees of perturbed Markov chains. The convergence of BLLA is proved for bounded and unbounded noise, with fixed and decreasing temperature parameter. A sufficient number of estimation samples is also provided that guarantees the convergence to an optimal state in a single cell scenario and close to an optimal state in a multi-cell scenario. We assess the performance of BLLA by extensive simulations by considering both bounded and unbounded noise cases and show that BLLA achieves higher sum data rate compared to the state-of-the-art.

Ensuring the safety of Autonomous Driving Systems (ADS) at urban intersections remains challenging due to complex interactions between vehicles and traffic management infrastructure. This study validates an ADS equipped with connected perception using Infrastructure-to-Vehicle (I2V) communication within a combined virtual and hybrid testing approach. The validation follows the overall structure and methodology of the SUNRISE Safety Assurance Framework (SAF), which is applied in detail where required by the scope of the study. Five representative urban intersection scenarios, covering both nominal driving conditions and safety-critical edge cases, are evaluated using virtual simulations in MATLAB/Simulink (2014b) and hybrid experiments integrating OMNeT++ (5.7.1)/Veins (5.2)/SUMO (1.12.0) with real-world components. Key Performance Indicators (KPIs) related to safety, decision-making, longitudinal control, passenger comfort, and V2X communication performance are analyzed. The results show strong consistency between virtual and hybrid testing, with ego vehicle speed deviations below 2 km/h and trigger distance differences under 3 m. V2X communication achieves a near-perfect Cooperative Awareness Message (CAM) delivery ratio, with an average latency of approximately 142 ms. While this latency remains within the tolerance of the deployed ADS, the overall end-to-end delay highlights opportunities for further optimization. The study demonstrates how the SUNRISE SAF can effectively structure ADS validation, identifies critical scenarios such as right-of-way violations by non-priority obstacles, and provides insights into improving connectivity handling and low-speed braking behavior for Cooperative, Connected, and Automated Mobility (CCAM) systems in urban environments.

We present a novel solution for Channel Assignment Problem (CAP) in Device-to-Device (D2D) wireless networks that takes into account the throughput estimation noise. CAP is known to be NP-hard in the literature and there is no practical optimal learning algorithm that takes into account the estimation noise. In this paper, we first formulate the CAP as a stochastic optimization problem to maximize the expected sum data rate. To capture the estimation noise, CAP is modeled as a noisy potential game, a novel notion we introduce in this paper. Then, we propose a distributed Binary Log-linear Learning Algorithm (BLLA) that converges to the optimal channel assignments. Convergence of BLLA is proved for bounded and unbounded noise. Proofs for fixed and decreasing temperature parameter of BLLA are provided. A sufficient number of estimation samples is given that guarantees the convergence to the optimal state. We assess the performance of BLLA by extensive simulations, which show that the sum data rate increases with the number of channels and users. Contrary to the better response algorithm, the proposed algorithm achieves the optimal channel assignments distributively even in presence of estimation noise.