arXiv subjects

Claudio Casetti

Publications and source records attributed to Claudio Casetti.

At least 19 recordsLinked to original sources

arXiv2026

A Practical Implementation of Day-3 Cooperative Intersection with Automated Connected Mini-Cars

Cooperative driving enabled by connected and automated vehicles is expected to improve traffic efficiency and safety, particularly at intersections where traditional control mechanisms such as traffic lights introduce delays and unnecessary stops. Although cooperative intersection management algorithms have been widely studied, experimental demonstrations remain limited. This paper presents a real-time demonstration of cooperative intersection management using connected autonomous mini-cars. The testbed consists of multiple 1:10 scale vehicles equipped with autonomous driving capabilities and wireless communication modules that interact with a centralized controller responsible for scheduling their crossing of the intersection. Vehicles approaching the intersection exchange messages with the controller to set the appropriate mobility profile to traverse the intersection without stopping. The demonstration integrates autonomous driving, wireless communication, and cooperative control in a single experimental platform, providing a practical environment for validating cooperative intersection management concepts for future intelligent transportation systems.

cs.NI↗

arXiv2026

VaN3Twin: the Multi-Technology V2X Digital Twin with Ray-Tracing in the Loop

This paper presents VaN3Twin-the first open-source, full-stack Network Digital Twin (NDT) framework for simulating the coexistence of multiple Vehicle-to-Everything (V2X) communication technologies with accurate physical-layer modeling via ray tracing. VaN3Twin extends the ms-van3t simulator by integrating Sionna Ray Tracer (RT) in the loop, enabling high-fidelity representation of wireless propagation, including diverse Line-of-Sight (LoS) conditions with focus on LoS blockage due to other vehicles' meshes, Doppler effect, and site-dependent effects-e.g., scattering and diffraction. Unlike conventional simulation tools, the proposed framework supports realistic coexistence analysis across DSRC and C-V2X technologies operating over shared spectrum. A dedicated interference tracking module captures cross-technology interference at the time-frequency resource block level and enhances signal-to-interference-plus-noise ratio (SINR) estimation by eliminating artifacts such as the bimodal behavior induced by separate LoS/NLoS propagation models. Compared to field measurements, VaN3Twin reduces application-layer disagreement by 50% in rural and over 70% in urban environments with respect to current state-of-the-art simulation tools, demonstrating its value for scalable and accurate digital twin-based V2X coexistence simulation.

cs.NI↗

arXiv2026

V2N-Based Algorithm and Communication Protocol for Autonomous Non-Stop Intersections

Intersections are critical areas for road safety and traffic efficiency, accounting for a significant portion of vehicle crashes and fatalities. While connected and autonomous vehicle (CAV) technologies offer a promising solution for autonomous intersection management, many existing proposals either rely on computationally heavy centralized controllers or overlook the practical impairments of real-world communication networks. This paper introduces seamless mobility of vehicles over intersections (Moveover), a novel algorithm comprising a vehicle-to-network (V2N) communication protocol designed to let vehicles cross autonomous intersections without stopping. Moveover delegates trajectory and speed profile selection to individual vehicles, allowing each CAV to optimize them according to its unique kinematic characteristics. Simultaneously, a local intersection controller prevents collisions through deterministic conflict zone reservations. The algorithm is rigorously evaluated under both ideal and non-ideal networking conditions, specifically modeling 4G and 5G communication delays, across multiple layouts including single-lane, multi-lane, and roundabouts. Furthermore, we test Moveover on a real urban map with multiple intersections. Simulation results demonstrate that Moveover significantly outperforms baseline strategies, offering substantial improvements in travel times and reduced pollutant emissions.

cs.NI↗

arXiv2025

Target Wake Time Scheduling for Time-sensitive and Energy-efficient Wi-Fi Networks

Time Sensitive Networking (TSN) is fundamental for the reliable, low-latency networks that will enable the Industrial Internet of Things (IIoT). Wi-Fi has historically been considered unfit for TSN, as channel contention and collisions prevent deterministic transmission delays. However, this issue can be overcome by using Target Wake Time (TWT), which enables the access point to instruct Wi-Fi stations to wake up and transmit in non-overlapping TWT Service Periods (SPs), and sleep in the remaining time. In this paper, we first formulate the TWT Acceptance and Scheduling Problem (TASP), with the objective to schedule TWT SPs that maximize traffic throughput and energy efficiency while respecting Age of Information (AoI) constraints. Then, due to TASP being NP-hard, we propose the TASP Efficient Resolver (TASPER), a heuristic strategy to find near-optimal solutions efficiently. Using a TWT simulator based on ns-3, we compare TASPER to several baselines, including HSA, a state-of-the-art solution originally designed for WirelessHART networks. We demonstrate that TASPER obtains up to 24.97% lower mean transmission rejection cost and saves up to 14.86% more energy compared to the leading baseline, ShortestFirst, in a challenging, large-scale scenario. Additionally, when compared to HSA, TASPER also reduces the energy consumption by 34% and reduces the mean rejection cost by 26%. Furthermore, we validate TASPER on our IIoT testbed, which comprises 10 commercial TWT-compatible stations, observing that our solution admits more transmissions than the best baseline strategy, without violating any AoI deadline.

cs.NI↗

arXiv2021

V-Edge: Virtual Edge Computing as an Enabler for Novel Microservices and Cooperative Computing

As we move from 5G to 6G, edge computing is one of the concepts that needs revisiting. Its core idea is still intriguing: instead of sending all data and tasks from an end user's device to the cloud, possibly covering thousands of kilometers and introducing delays that are just owed to limited propagation speed, edge servers deployed in close proximity to the user, e.g., at some 5G gNB, serve as proxy for the cloud. Yet this promising idea is hampered by the limited availability of such edge servers. In this paper, we discuss a way forward, namely the virtual edge computing (V-Edge) concept. V-Edge bridges the gap between cloud, edge, and fog by virtualizing all available resources including the end users' devices and making these resources widely available using well-defined interfaces. V-Edge also acts as an enabler for novel microservices as well as cooperative computing solutions. We introduce the general V-Edge architecture and we characterize some of the key research challenges to overcome, in order to enable wide-spread and even more powerful edge services.

cs.NI↗

arXiv2021

Edge-Based Collision Avoidance for Vehicles and Vulnerable Users: An Architecture Based on MEC

Collision avoidance is one of the most promising applications for vehicular networks, dramatically improving the safety of the vehicles that support it. In this paper, we investigate how it can be extended to benefit vulnerable users, e.g., pedestrians and bicycles, equipped with a smartphone. We argue that, owing to the reduced capabilities of smartphones compared to vehicular on-board units, traditional distributed approaches are not viable, and that multi-access edge computing (MEC) support is needed. Thus, we propose a MEC-based collision avoidance system, discussing its architecture and evaluating its performance. We find that, thanks to MEC, we are able to extend the protection of collision avoidance, traditionally thought for vehicles, to vulnerable users without impacting its effectiveness or latency.

cs.NI↗

arXiv2019

The RICH Prefetching in Edge Caches for In-Order Delivery to Connected Cars

Content caching on the edge of 5G networks is an emerging and critical feature to quench the thirst for content of future connected cars. However, the tight packaging of 5G cells, the finite storage capacity at the edge, and the need for content availability while driving motivate the need to develop smart edge caching strategies adapted to the mobility characteristics of connected cars. In this paper, we propose a scheme called RICH (RoadsIde CacHe), which optimally caches content at edge nodes where connected vehicles require it most. In particular, our scheme is designed to ensure in-order delivery of content chunks to end users. Unlike blind popularity decisions, the probabilistic caching used by RICH accounts for the user mobility information that the system can realistically acquire. Furthermore, we provide a complete system architecture and define the protocols through which the different system entities can interact. We assess the performance of our approach against state-of-the-art solutions, under realistic mobility datasets and system scenarios. Our RICH edge caching scheme improves significantly the content availability at the caches and reduces the required backhaul bandwidth, with beneficial effects for both the end users and the network operators.

cs.NI↗

arXiv2019

An Optimization-enhanced MANO for Energy-efficient 5G Networks

5G network nodes, fronthaul and backhaul alike, will have both forwarding and computational capabilities. This makes energy-efficient network management more challenging, as decisions such as activating or deactivating a node impact on both the ability of the network to route traffic and the amount of processing it can perform. To this end, we formulate an optimization problem accounting for the main features of 5G nodes and the traffic they serve, allowing joint decisions about (i) the nodes to activate, (ii) the network functions they run, and (iii) the traffic routing. Our optimization module is integrated within the management and orchestration framework of 5G, thus enabling swift and high-quality decisions. We test our scheme with both a real-world testbed based on OpenStack and OpenDaylight, and a large-scale emulated network whose topology and traffic come from a real-world mobile operator, finding it to consistently outperform state-of-the art alternatives and closely match the optimum.

cs.NI↗

arXiv2019

Planning UAV Activities for Efficient User Coverage in Disaster Areas

Climate changes brought about by global warming as well as man-made environmental changes are often the cause of sever natural disasters. ICT, which is itself responsible for global warming due to its high carbon footprint, can play a role in alleviating the consequences of such hazards by providing reliable, resilient means of communication during a disaster crisis. In this paper, we explore the provision of wireless coverage through UAVs (Unmanned Aerial Vehicles) to complement, or replace, the traditional communication infrastructure. The use of UAVs is indeed crucial in emergency scenarios, as they allow for the quick and easy deployment of micro and pico cellular base stations where needed. We characterize the movements of UAVs and define an optimization problem to determine the best UAV coverage that maximizes the user throughput, while maintaining fairness across the different parts of the geographical area that has been affected by the disaster. To evaluate our strategy, we simulate a flooding in San Francisco and the car traffic resulting from people seeking safety on higher ground.

cs.NI↗

arXiv2018

Arbitration Among Vertical Services

A 5G network provides several service types, tailored to specific needs such as high bandwidth or low latency. On top of these communication services, verticals are enabled to deploy their own vertical services. These vertical service instances compete for the resources of the underlying common infrastructure. We present a resource arbitration approach that allows to handle such resource conflicts on a high level and to provide guidance to lowerlevel orchestration components.

cs.NI↗

arXiv2018

Area formation and content assignment for LTE broadcasting

Broadcasting and multicasting services in LTE networks are shaping up to be an effective way to provide popular content. A key requirement is that cells are aggregated into areas where a tight time synchronization among transmissions is enforced, so as to broadcast the same radio resources. Our paper addresses a facet of LTE broadcasting that has so far received little attention: the creation of broadcasting areas and the assignment of content to them in order to efficiently exploit radio resources and satisfy user requests. Our original clustering approach, named Single-Content Fusion, achieves these goals by initially aggregating cells into single-content areas and maximizing cell similarity in content interests. Aggregated areas are then merged into multiple-content areas by virtue of similar spatial coverage. We show the validity of our solution pointing out the advantages it provides in comparison to other approaches. We also discuss the impact of various system factors (e.g., number of served users, broadcast data rate, area size) and the scalability of our proposal in large, realistic scenarios with both static and time-varying user interest.

cs.NI↗

arXiv2018

Performance Analysis of C-V2I-based Automotive Collision Avoidance

One of the key applications envisioned for C-V2I (Cellular Vehicle-to-Infrastructure) networks pertains to safety on the road. Thanks to the exchange of Cooperative Awareness Messages (CAMs), vehicles and other road users (e.g., pedestrians) can advertise their position, heading and speed and sophisticated algorithms can detect potentially dangerous situations leading to a crash. In this paper, we focus on the safety application for automotive collision avoidance at intersections, and study the effectiveness of its deployment in a C-V2I-based infrastructure. In our study, we also account for the location of the server running the application as a factor in the system design. Our simulation-based results, derived in real-world scenarios, provide indication on the reliability of algorithms for car-to-car and car-to-pedestrian collision avoidance, both when a human driver is considered and when automated vehicles (with faster reaction times) populate the streets.

cs.NI↗

arXiv2018

Characterizing Docker Overhead in Mobile Edge Computing Scenarios

Mobile Edge Computing (MEC) is an emerging network paradigm that provides cloud and IT services at the point of access of the network. Such proximity to the end user translates into ultra-low latency and high bandwidth, while, at the same time, it alleviates traffic congestion in the network core. Due to the need to run servers on edge nodes (e.g., an LTE-A macro eNodeB), a key element of MEC architectures is to ensure server portability and low overhead. A possible tool that can be used for this purpose is Docker, a framework that allows easy, fast deployment of Linux containers. This paper addresses the suitability of Docker in MEC scenar- ios by quantifying the CPU consumed by Docker when running two different containerized services: multiplayer gam- ing and video streaming. Our tests, run with varying numbers of clients and servers, yield different results for the two case studies: for the gaming service, the overhead logged by Docker increases only with the number of servers; con- versely, for the video streaming case, the overhead is not affected by the number of either clients or servers.

cs.NI↗

arXiv2018

Virtualization-based Evaluation of Backhaul Performance in Vehicular Applications

Next-generation networks, based on SDN and NFV, are expected to support a wide array of services, including vehicular safety applications. These services come with strict delay constraints, and our goal in this paper is to ascertain to which extent SDN/NFV-based networks are able to meet them. To this end, we build and emulate a vehicular collision detection system, using the popular Mininet and Docker tools, on a real-world topology with mobility information. Using different core network topologies and open-source SDN controllers, we measure (i) the delay with which vehicle beacons are processed and (ii) the associated overhead and energy consumption. We find that we can indeed meet the latency constraints associated with vehicular safety applications, and that SDN controllers represent a moderate contribution to the overall energy consumption but a significant source of additional delay.

cs.NI↗

arXiv2016

Energy-efficient Traffic Allocation in SDN-based Backhaul Networks: Theory and Implementation

5G networks are expected to be highly energy efficient, with a 10 times lower consumption than today's systems. An effective way to achieve such a goal is to act on the backhaul network by controlling the nodes operational state and the allocation of traffic flows. To this end, in this paper we formulate energy-efficient flow routing on the backhaul network as an optimization problem. In light of its complexity, which impairs the solution in large-scale scenarios, we then propose a heuristic approach. Our scheme, named EMMA, aims to both turn off idle nodes and concentrate traffic on the smallest possible set of links, which in its turn increases the number of idle nodes. We implement EMMA on top of ONOS and derive experimental results by emulating the network through Mininet. Our results show that EMMA provides excellent energy saving performance, which closely approaches the optimum. In larger network scenarios, the gain in energy consumption that EMMA provides with respect to the simple benchmark where all nodes are active, is extremely high, reaching almost 1 under medium-low traffic load.

cs.NI↗

arXiv2014

Content-centric Routing in Wi-Fi Direct Multi-group Networks

The added value of Device-to-Device (D2D) communication amounts to an efficient content discovery mechanism that enables users to steer their requests toward the node most likely to satisfy them. In this paper, we address the implementation of content-centric routing in a D2D architecture for Android devices based on WiFi Direct, a protocol recently standardised by the Wi-Fi Alliance. After discussing the creation of multiple D2D groups, we introduce novel paradigms featuring intra- and inter-group bidirectional communication. We then present the primitives involved in content advertising and requesting among members of the multi-group network. Finally, we evaluate the performance of our architecture in a real testbed involving Android devices in different group configurations. We also compare the results against the ones achievable exploiting Bluetooth technologies.

cs.NI↗

arXiv2014

Real-Time Scheduling for Content Broadcasting in LTE

Broadcasting capabilities are one of the most promising features of upcoming LTE-Advanced networks. However, the task of scheduling broadcasting sessions is far from trivial, since it affects the available resources of several contiguous cells as well as the amount of resources that can be devoted to unicast traffic. In this paper, we present a compact, convenient model for broadcasting in LTE, as well as a set of efficient algorithms to define broadcasting areas and to actually perform content scheduling. We study the performance of our algorithms in a realistic scenario, deriving interesting insights on the possible trade-offs between effectiveness and computational efficiency.

cs.NI↗

arXiv2013

Fast Resource Scheduling in HetNets with D2D Support

Resource allocation in LTE networks is known to be an NP-hard problem. In this paper, we address an even more complex scenario: an LTE-based, 2-tier heterogeneous network where D2D mode is supported under the network control. All communications (macrocell, microcell and D2D-based) share the same frequency bands, hence they may interfere. We then determine (i) the network node that should serve each user and (ii) the radio resources to be scheduled for such communication. To this end, we develop an accurate model of the system and apply approximate dynamic programming to solve it. Our algorithms allow us to deal with realistic, large-scale scenarios. In such scenarios, we compare our approach to today's networks where eICIC techniques and proportional fairness scheduling are implemented. Results highlight that our solution increases the system throughput while greatly reducing energy consumption. We also show that D2D mode can effectively support content delivery without significantly harming macrocells or microcells traffic, leading to an increased system capacity. Interestingly, we find that D2D mode can be a low-cost alternative to microcells.

cs.NI↗