Conventional time-series forecasting methods typically aim to minimize overall prediction error, without accounting for the varying importance of different forecast ranges in downstream applications. We propose a training methodology that enables forecasting models to adapt their focus to application-specific regions of interest at inference time, without retraining. The approach partitions the prediction space into fine-grained segments during training, which are dynamically reweighted and aggregated to emphasize the target range specified by the application. Unlike prior methods that predefine these ranges, our framework supports flexible, on-demand adjustments. Experiments on standard benchmarks and a newly collected wireless communication dataset demonstrate that our method not only improves forecast accuracy within regions of interest but also yields measurable gains in downstream task performance. These results highlight the potential for closer integration between predictive modeling and decision-making in real-world systems.

In forthcoming AI-assisted 6G networks, integrating semantic, pragmatic, and goal-oriented communication strategies becomes imperative. This integration will enable sensing, transmission, and processing of exclusively pertinent task data, ensuring conveyed information possesses understandable, pragmatic semantic significance, aligning with destination needs and goals. Without doubt, no communication is error free. Within this context, besides errors stemming from typical wireless communication dynamics, potential distortions between transmitter-intended and receiver-interpreted meanings can emerge due to limitations in semantic processing capabilities, as well as language and knowledge representation disparities between transmitters and receivers. The main contribution of this paper is two-fold. First, it proposes and details a novel mathematical modeling of errors stemming from language mismatches at both semantic and effectiveness levels. Second, it provides a novel algorithmic solution to counteract these types of errors which leverages optimal transport theory. Our numerical results show the potential of the proposed mechanism to compensate for language mismatches, thereby enhancing the attainability of reliable communication under noisy communication environments.

The optimal cluster of access points (APs) for user equipment (UEs) is a crucial task to maximize the energy efficiency of cell-free networks. It is a complex problem, which becomes even difficult to solve when we aim to satisfy all UEs with respect to their requested quality of service (QoS). In this context, finding a balanced solution is challenging, in particular, due to the conflicting interests between APs and UEs. This paper considers the sociality regime of UEs, being either selfish, egalitarian or altruistic, which expresses their willingness to contribute to such a balance. To solve this problem, we first cast it into a many-tomany social matching game, during which, a UE may accept or reject a matching operation depending on its sociality regime. Hence, we propose two novel algorithms based on deferred acceptance (DA) and early acceptance (EA) matching games. In the DA game, APs buffer UE association requests based on their preferences and conduct the final association decision at the end of game. In contrast, in the EA game, the decision to associate a UE with an AP is immediate upon receipt of the request, which reduces decision-making times at the cost of a sub-optimal matching strategy. Numerical results show the significant impact of UEs sociality regime on their QoS satisfaction and network energy efficiency for both algorithms, with the egalitarian regime proving the best performance trade-off.

We consider a multi-user semantic communications system in which agents (transmitters and receivers) interact through the exchange of semantic messages to convey meanings. In this context, languages are instrumental in structuring the construction and consolidation of knowledge, influencing conceptual representation and semantic extraction and interpretation. Yet, the crucial role of languages in semantic communications is often overlooked. When this is not the case, agent languages are assumed compatible and unambiguously interoperable, ignoring practical limitations that may arise due to language mismatching. This is the focus of this work. When agents use distinct languages, message interpretation is prone to semantic noise resulting from critical distortion introduced by semantic channels. To address this problem, this paper proposes a new semantic channel equalizer to counteract and limit the critical ambiguity in message interpretation. Our proposed solution models the mismatch of languages with measurable transformations over semantic representation spaces. We achieve this using optimal transport theory, where we model such transformations as transportation maps. Then, to recover at the receiver the meaning intended by the teacher we operate semantic equalization to compensate for the transformation introduced by the semantic channel, either before transmission and/or after the reception of semantic messages. We implement the proposed approach as an operation over a codebook of transformations specifically designed for successful communication. Numerical results show that the proposed semantic channel equalizer outperforms traditional approaches in terms of operational complexity and transmission accuracy.

5G and beyond networks need to provide dynamic and efficient infrastructure management to better adapt to time-varying user behaviors (e.g., user mobility, interference, user traffic and evolution of the network topology). In this paper, we propose to manage the trajectory of Mobile Access Points (MAPs) under all these dynamic constraints with reduced complexity. We first formulate the placement problem to manage MAPs over time. Our solution addresses time-varying user traffic and user mobility through a Multi-Agent Deep Reinforcement Learning (MADRL). To achieve real-time behavior, the proposed solution learns to perform distributed assignment of MAP-user positions and schedules the MAP path among all users without centralized user's clustering feedback. Our solution exploits a dual-attention MADRL model via proximal policy optimization to dynamically move MAPs in 3D. The dual-attention takes into account information from both users and MAPs. The cooperation mechanism of our solution allows to manage different scenarios, without a priory information and without re-training, which significantly reduces complexity.

We consider a dynamic millimeter-wave network with integrated access and backhaul, where mobile relay nodes move to auto-reconfigure the wireless backhaul. Specifically, we focus on in-band relaying networks, which conduct access and backhaul links on the same frequency band with severe constraints on co-channel interference. In this context, we jointly study the complex problem of dynamic relay node positioning, user association, and backhaul capacity allocation. To address this problem, with limited complexity, we adopt a hierarchical multi-agent reinforcement with a two-level structure. A high-level policy dynamically coordinates mobile relay nodes, defining the backhaul configuration for a low-level policy, which jointly assigns user equipment to each relay and allocates the backhaul capacity accordingly. The resulting solution automatically adapts the access and backhaul network to changes in the number of users, the traffic distribution, and the variations of the channels. Numerical results show the effectiveness of our proposed solution in terms of convergence of the hierarchical learning procedure. It also provides a significant backhaul capacity and network sumrate increase (up to 3.5×) compared to baseline approaches.

This paper addresses the efficient management of Mobile Access Points (MAPs), which are Unmanned Aerial Vehicles (UAV), in 5G networks. We propose a two-level hierarchical architecture, which dynamically reconfigures the network while considering Integrated Access-Backhaul (IAB) constraints. The high-layer decision process determines the number of MAPs through consensus, and we develop a joint optimization process to account for co-dependence in network self-management. In the low-layer, MAPs manage their placement using a double-attention based Deep Reinforcement Learning (DRL) model that encourages cooperation without retraining. To improve generalization and reduce complexity, we propose a federated mechanism for training and sharing one placement model for every MAP in the low-layer. Additionally, we jointly optimize the placement and backhaul connectivity of MAPs using a multi-objective reward function, considering the impact of varying MAP placement on wireless backhaul connectivity.

The integration of sensing capability in the design of wireless communication systems is foreseen as a key enabler for efficient radio resource management in next-generation networks. This paper focuses on millimeter-wave communications, which are subject to severe attenuation due to blockages, ultimately detrimental to system performance. In this context, the sensing functionality can allow measuring or even imaging the wireless environment allowing anticipation of possible link failures, thus enabling proactive resource reallocation such as handover. This work proposes a novel mechanism for opportunistic environment sensing, which leverages existing network infrastructure with low complexity. More specifically, our approach exploits the fluctuations of interference, perceived in antenna side lobes, to detect local activity due to a moving blocker around the reference communication link. Numerical evaluations show that the proposed method is promising as it allows effective assessment of the blocker direction, trajectory and possibly, its location, speed, and size.

Recently, semantic communications are envisioned as a key enabler of future 6G networks. Back to Shannon’s information theory, the goal of communication has long been to guarantee the correct reception of transmitted messages irrespective of their meaning. However, in general, whenever communication occurs to convey a meaning, what matters is the receiver’s understanding of the transmitted message and not necessarily its correct reconstruction. Hence, semantic communications introduce a new paradigm: transmitting only relevant information sufficient for the receiver to capture the meaning intended can save significant communication bandwidth. Thus, this work explores the opportunity offered by semantic communications for beyond 5G networks. In particular, we focus on the benefit of semantic compression. We refer to semantic message as a sequence of well-formed symbols learned from the "meaning" underlying data, which have to be interpreted at the receiver. This requires a reasoning unit, here artificial, on a knowledge base: a symbolic knowledge representation of the specific application. Therefore, we present and detail a novel architecture that enables representation learning of semantic symbols for effective semantic communications. We first discuss theoretical aspects and successfully design objective functions, which help learn effective semantic encoders and decoders. Eventually, we show promising numerical results for the scenario of text transmission, especially when the sender and receiver speak different languages.

We study the problem of user association, namely finding the optimal assignment of user equipment to base stations to achieve a targeted network performance. In this paper, we focus on the knowledge transferability of association policies. Indeed, traditional non-trivial user association schemes are often scenario-specific or deployment-specific and require a policy re-design or re-learning when the number or the position of the users change. In contrast, transferability allows to apply a single user association policy, devised for a specific scenario, to other distinct user deployments, without needing a substantial re-learning or re-design phase and considerably reducing its computational and management complexity. To achieve transferability, we first cast user association as a multi-agent reinforcement learning problem. Then, based on a neural attention mechanism that we specifically conceived for this context, we propose a novel distributed policy network architecture, which is transferable among users with zero-shot generalization capability i.e., without requiring additional training. Numerical results show the effectiveness of our solution in terms of overall network communication rate, outperforming centralized benchmarks even when the number of users doubles with respect to the initial training point.

The dense deployment of millimeter wave small cells combined with directional beamforming is a promising solution to enhance the network capacity of the current generation of wireless communications. However, the reliability of millimeter wave communication links can be affected by severe pathloss, blockage, and deafness. As a result, mobile users are subject to frequent handoffs, which deteriorate the user throughput and the battery lifetime of mobile terminals. To tackle this problem, our paper proposes a deep multi-agent reinforcement learning framework for distributed handover management called RHando (Reinforced Handover). We model users as agents that learn how to perform handover to optimize the network throughput while taking into account the associated cost. The proposed solution is fully distributed, thus limiting signaling and computation overhead. Numerical results show that the proposed solution can provide higher throughput compared to conventional schemes while considerably limiting the frequency of the handovers.

Network densification and millimeter-wave technologies are key enablers to fulfill the capacity and data rate requirements of the fifth generation (5G) of mobile networks. In this context, designing low-complexity policies with local observations, yet able to adapt the user association with respect to the global network state and to the network dynamics is a challenge. In fact, the frameworks proposed in literature require continuous access to global network information and to recompute the association when the radio environment changes. With the complexity associated to such an approach, these solutions are not well suited to dense 5G networks. In this paper, we address this issue by designing a scalable and flexible algorithm for user association based on multi-agent reinforcement learning. In this approach, users act as independent agents that, based on their local observations only, learn to autonomously coordinate their actions in order to optimize the network sum-rate. Since there is no direct information exchange among the agents, we also limit the signaling overhead. Simulation results show that the proposed algorithm is able to adapt to (fast) changes of radio environment, thus providing large sum-rate gain in comparison to state-of-the-art solutions.

Finding the optimal association between users and base stations that maximizes the network sum-rate is a complex task. This problem is combinatorial and non-convex, and is even more challenging in millimeter-wave networks due to beamforming, blockages, and severe path loss. Despite the interest that this problem has gained over the last years, the various solutions proposed so far in the literature still fail at being flexible, computationally effective, and suitable to the dynamic nature of mobile networks. This paper addresses these issues with a novel distributed algorithm based on multi-agent reinforcement learning. More specifically, we model each user as an agent, which, at each time step, maps its observations to an action corresponding to an association request to a base station in its coverage range. Our numerical results show that the proposed solution offers near optimal performance and thanks to its flexibility, provides large sum-rate gain with respect to the state-of-art approaches.