Time-sharing of Quantum Key Distribution (QKD) transceivers with the help of optical switches and a central Software-Defined Networking (SDN) controller is a promising technique to better amortize the large investments required to build a Quantum Key Distribution Network (QKDN). In this work, we investigate the implications of introducing Time-Division Multiplexing (TDM) in trusted-relay QKDNs at the wide-area network scale in terms of performance and cost-saving. To this end, we developed both a Mixed Integer Linear Programming (qTDM-MILP) model and a Heuristic Algorithm (qTDM-HA) to solve the allocation of QKD transceivers and network resources for a novel switched QKDN operating scheme: qTDM-QKDN. Our heuristic method provides a close-to-optimal resource planning for the offline problem that computes the minimum number of QKD transceivers and optical switch ports at each node, as well as the number of quantum channels on each link required to satisfy a target set of end-to-end secret-keyrate demands. Moreover, both the model and the heuristic provide the time fractions that each QKD transceiver needs to peer with each neighbor QKD transceiver. We compared our proposed model and heuristic algorithm for cost minimization with non-time sharing QKD transceivers (nTDM) as baseline. The results show that qTDM can achieve substantial cost-savings in the range of 10%–40% compared to nTDM. Furthermore, this work sheds light on the selection of the value for the working cycle T and its influence on network performance. • TDM optimizes QKD networks, enhancing efficiency and cost-effectiveness. • A MILP model and the qTDM-HA ease resource allocation in large-scale QKD networks. • The tools provide outstanding solutions from 10% to 40% in terms of cost-savings. • TDM minimizes the number of dedicated QKD transceivers by using shared ones wisely.

This paper evaluates the performance of the two ETSI non-area forwarding algorithms in the GeoNetworking specification: Greedy Forwarding and Non-Area Contention-Based Forwarding (CBF). Non-area forwarding occurs when a packet is sent to a geographical Destination Area from a node located outside of this area, e.g., when a vehicle wants to alert of hazardous events to other vehicles located in a distant geographical area. The evaluation has been carried out both in urban and highway scenarios and takes into account the complete ETSI Architecture, including the interaction with the Decentralized Congestion Control (DCC) mechanism. We have also compared ETSI-defined mechanisms with optimizations found in the literature. Our main findings are that Greedy Forwarding, when combined with DCC, is extremely ineffective even with optimizations, and Non-Area CBFs (both ETSI CBF and an optimized version called S-FoT+) outperform Greedy Forwarding both in highway and urban scenarios.

This paper evaluates the performance of ETSI ITS Contention-Based Forwarding (CBF) and ETSI Simple GeoBroadcast forwarding while disseminating warning messages over a Geographical Area in highway and urban scenarios. Our experimental evaluation considers the complete ETSI ITS architecture including the Decentralized Congestion Control (DCC) mechanism. We propose an enhanced CBF mechanism, named S-FOT+, which combines several improvements to the ETSI CBF algorithm. S-FoT+ has a similar or better performance than the ETSI forwarding algorithms regarding both reliability and end-to-end delay while requiring much fewer transmissions. The improvements are equally effective and efficient in both urban and highway scenarios with large Destination Areas. Finally, we evaluate the trade-offs that stem from using multi-hop broadcast mechanisms in urban settings with smaller Destination Areas when compared to single-hop broadcast. Results show that multi-hop mechanisms significantly improve coverage at the cost of an increased number of transmissions.

There is a growing need for vehicular mobility datasets that can be employed in the simulative evaluation of protocols and architectures designed for upcoming vehicular networks. Such datasets should be realistic, publicly available, and heterogeneous, i.e., they should capture varied traffic conditions. In this paper, we contribute to the ongoing effort to define such mobility scenarios by introducing a novel set of traces for vehicular network simulation. Our traces are derived from high-resolution real-world traffic counts, and describe the road traffic on two highways around Madrid, Spain, at several hours of different working days. We provide a thorough discussion of the real-world data underlying our study, and of the synthetic trace generation process. Finally, we assess the potential impact of our dataset on networking studies, by characterizing the connectivity of vehicular networks built on the different traces. Our results underscore the dramatic impact that relatively small communication range variations have on the network. Also, they unveil previously unknown temporal dynamics of the topology of highway vehicular networks, and identify their causes.

Efficient vehicle-to-internet routing and address autoconfiguration are two of the missing pieces required to provide Internet connectivity from vehicles. Here, we propose TREBOL, a tree-based and configurable protocol which benefits from the inherent tree-shaped nature of vehicle to Internet traffic to reduce the signaling overhead while dealing efficiently with the vehicular dynamics. The paper describes the design and rationale of the solution, and presents the results of an experimental validation and performance evaluation, based on extensive simulations and real vehicular traces obtained in the region of Madrid.

Building vehicular networks in roads and highways is a challenging research topic with a large number of applications ranging from traffic jams and car collisions prevention to efficient route planning. The analysis of the distance between vehicles in roads is a key factor in, e.g., designing vehicular networks protocols or planning a supporting infrastructure to improve vehicular connectivity. This work proposes a Gaussian-exponential mixture model to characterize the time distance between vehicles in a highway lane, based on measurements collected at different locations in several highways of the city of Madrid, in Spain. The model arises from the observed behavior that some vehicles travel very close together, like in a burst mode, showing Gaussian inter-arrival times, while other vehicles are somehow isolated, showing exponentially distributed inter-arrival times. The experiments show that such a Gaussian-exponential mixture model accurately characterizes inter-vehicle times observed from real traces.

In this paper, we propose a novel mechanism for application of an IPv6 automatic address configuration technique to vehicular ad-hoc networks. The solution consists of combining standardized IPv6 schemes with geographic routing functionalities, which enables the matching of geographically-scoped network partitions to single IPv6 multicast-capable links. Unlike existing solutions described in this paper and mostly derived from MANET approaches, our proposal explicitly targets automotive requirements, which we identify and analyze based on a real system architecture and its target applications. Furthermore, we examine the solutionpsilas timely aspects both analytically and experimentally with laboratory tests and compare the results. Finally, we outline intended future work on extending the proposed scheme.

Mobility in packet networks has become a critical issue in the last years. Mobile IP and the network mobility basic support protocol are the IETF proposals to provide mobility. However, both of them introduce performance limitations, due to the presence of an entity (home agent) in the communication path. Those problems have been tried to be solved in different ways. A family of solutions has been proposed in order to mitigate those problems by allowing mobile devices to use several geographically distributed home agents (thus making shorter the communication path). These techniques require a method to discover a close home agent, among those geographically distributed, to the mobile device. This paper proposes a peer-to-peer based solution, called peer-to-peer home agent network, in order to discover a close home agent. The proposed solution is simple, fully global, dynamic and it can be developed in IPv4 and IPv6.

An important requirement for Internet protocol (IP) networks to achieve the aim of ubiquitous connectivity is network mobility (NEMO). With NEMO support we can provide Internet access from mobile platforms, such as public transportation vehicles, to normal nodes that do not need to implement any special mobility protocol. The NEMO basic support protocol has been proposed in the IETF as a first solution to this problem, but this solution has severe performance limitations. This paper presents MIRON: Mobile IPv6 route optimization for NEMO, an approach to the problem of NEMO support that overcomes the limitations of the basic solution by combining two different modes of operation: a Proxy-MR and an address delegation with built-in routing mechanisms. This paper describes the design and rationale of the solution, with an experimental validation and performance evaluation based on an implementation

The network mobility (NEMO) basic support protocol enables mobile networks to change their point of attachment to the Internet, while preserving established sessions of the nodes within the mobile network. When only a nonnested mobile network is considered, the so-called triangle routing is the main problem that should be faced. In mobile IPv6, the route optimisation mechanism solves this problem, and the return routability mechanism aims to limit the security concerns originated because of the route optimisation. Nowadays return routability is considered a weak solution (i.e., based on strong assumptions). In this article we explore different approaches to route optimisation in NEMO and we devise how to adapt some of the terminal mobility solutions to a NEMO environment, where, as we propose, a delegation of signalling rights from the mobile network node to the mobile router is necessary.