Due to the ability to support a wide range of applications and to involve infrastructure elements, connected and automated vehicles (CAVs) technology has played an important role in the development of cooperative intelligent transport systems. Thus, with the available sensing system, CAVs can perceive the surrounding environment. Indeed, due to the involvement of CAVs, communication of vehicles to other related devices using vehicle-to-everything (V2X) communication plays critical roles. This paper summarizes the research and development trends when proposing driving models, with a particular attention to highway on-ramp merging scenarios. The challenges and future research directions are also presented ©2021 IEEE

Vehicle-to-everything (V2X) communications allow a vehicle to interact with other vehicles and with communication parties in its vicinity (e.g., road-side units, pedestrian users, etc.) with the primary goal of making the driving and traveling experience safer, smarter and more comfortable. A wide set of V2X-tailored specifications have been identified by the Third Generation Partnership Project (3GPP) with focus on the design of architecture enhancements and a flexible air interface to ensure ultra-low latency, highly reliable and high-throughput connectivity as the ultimate aim. This paper discusses the potential of leveraging Information-Centric Networking (ICN) principles in the 3GPP architecture for V2X communications. We consider Named Data Networking (NDN) as reference ICN architecture and elaborate on the specific design aspects, required changes and enhancements in the 3GPP V2X architecture to enable NDN-based data exchange as an alternative/complementary solution to traditional IP networking, which barely matches the dynamics of vehicular environments. Results are provided to showcase the performance improvements of the NDN-based proposal in disseminating content requests over the cellular network against a traditional networking solution. © 2019 by the authors.

In recent years, the use of remote operation has been proposed as a bridge towards driverless mobility by providing human assistance remotely when an automated driving system finds a situation that is ambiguous and requires input from a remote operator. The remote operation of road vehicles has also been proposed as a way to enable drivers to operate vehicles from safer and more comfortable locations. While commercial solutions for remote operation exist, remaining challenges are being tackled by the research community, who is continuously testing and validating the feasibility of deploying remote operation of road vehicles on public roads. These tests range from the technological scope to social aspects such as acceptability and usability that affect human performance. This survey presents a compilation of works that approach the remote operation of road vehicles. We start by describing the basic architecture of remote operation systems and classify their modes of operation depending on the level of human intervention. We use this classification to organize and present recent and relevant work on the field from industry and academia. Finally, we identify the challenges in the deployment of remote operation systems in the technological, regulatory, and commercial scopes.

The use of reactive detection technologies such as passive and active sensors for avoiding car accidents involving pedestrians and other Vulnerable Road Users (VRU) is one of the cornerstones of Cooperative, Connected, and Automated Mobility (CCAM). However, CCAM systems are not yet present in all roads at all times. The use of currently available technologies that are embedded in smartphones, such as location services and Internet access, are enablers for the early detection of VRUs. This paper presents the proof-of-concept of a system that provides vehicles with enough information about the presence of VRUs by using public cellular networks, an MQTT broker, and IEEE 802.11p-enabled hardware (a roadside unit and an on-board unit). The system was tested in an urban environment and in a test track, where its feasibility was evaluated. Results were satisfactory, proving the system is reliable enough to alert of the sudden appearance of a VRU in time for the driver to react. © 2022 IEEE.

The current paper addresses the problem of the throughput-delay performance of a contemporary WPAN MAC standard. A brief overview of the standard functionality is first presented that allows a system model derivation. Two different acknowledgement policies are described under which the channel operation is considered. Two possible input traffic models are also considered one of them being saturation conditions under which the performance analysis is done that is further verified by means of the simulation. The obtained results show the system behavior as the number of channel users increase and allow the tuning of the protocol parameters to improve the performance.

This paper addresses the performance evaluation of the contemporary UWB WPAN standard. The basic standard functionality is described for which a system model is derived that accounts for the possible errors due to the background noise. Two realistic scenarios of the saturation conditions and the Bernoulli packet arrivals are considered to calculate the system throughput and the mean initial packet delay. The redundancy-based error detection mechanism that is implemented in the standard is discussed that allows the enhancement of the system performance. The obtained results are compared against the simulation which shows a good accordance with the analytical results and a distinct superiority of the introduced enhancement.

In this paper, the authors examine a client relay system comprising three wireless nodes. Closed-form expressions for mean packet delay, as well as for throughput, energy expenditure, and energy efficiency of the source nodes are also obtained. The precision of the established parameters is verified by means of simulation.

This paper addresses the performance of the contention-based polling techniques at the bandwidth reservation stage of IEEE 802.16 standard. A general proposition is proved, which establishes that the grouping of users in the random multiple access system does not change its capacity. Broadcast and multicast polling mechanisms are then considered, for which the throughput and the rate of the truncated binary exponential backoff algorithm are calculated for the lossy and the lossless system types, respectively. It is shown, that subject to proper optimization the performance of the aforementioned algorithm is the same for both system types. The efficiency of the symmetric user grouping is finally studied, which demonstrates that a negligible performance gain may be achieved for the cost of the increased IEEE 802.16 overhead.

In this paper we address the bandwidth reservation in IEEE 802.16 standard via multicast and broadcast polling mechanisms. It is shown that symmetric user grouping with the same QoS requirements does not change the capacity of the random multiple access system. Binary exponential backoff protocol is then investigated as it is standardized for both multicast and broadcast polling. We establish that symmetric user grouping does not essentially increase the performance of this protocol.

Cooperative awareness basic services are key components of several Connected Autonomous Vehicles (CAV) functions. We present a rigorous approach to the analysis of cooperative awareness basic services in a CAV setup. Our approach addresses a major challenge in the traditional analysis techniques of such services, namely, coming up with effective scenarios that can meaningfully cover their various behaviours, exercise the limits of these services and come up with a quantitative means for design-space exploration.Our approach integrates model-based testing and search-based testing to automatically generate scenarios and steer the scenario generation process towards generating inputs that can lead to the most severe hazards. Additionally we define other objectives that maximise the coverage of the model and the diversity of the generated test inputs. The result of applying our technique to the analysis of cooperative awareness services leads to automatically generated hazardous scenarios for parameters that abide by the ETSI ITS-G5 vehicular communications standard. We show that our technique can be used as an effective design-space exploration method and can be used to design adaptive protocols that can mitigate the hazards detected through our initial analysis. © 2020 by IEEE

Data offloading using vehicles is one of the most challenging tasks to perform due to the high mobility of vehicles. There are many solutions available for this purpose, but due to the inefficient management of data along with the control decisions, these solutions are not adequate to provide data offloading by making use of the available networks. Moreover, with the advent of 5G and related technologies, there is a need to cope with high speed and traffic congestion in the existing infrastructure used for data offloading. Hence, to make intelligent decisions for data offloading, an SDN-based scheme is presented in this article. In the proposed scheme, an SDNbased controller is designed that makes decisions for data offloading by using the priority manager and load balancer. Using these two managers in SDN-based controllers, traffic routing is managed efficiently even with an increase in the size of the network. Moreover, a single-leader multi-follower Stackelberg game for network selection is also used for data offloading. The proposed scheme is evaluated with respect to several parameters where its performance was found to be superior in comparison to the existing schemes. © Copyright 2017 IEEE

Vehicle-to-Everything (V2X) communication is essential for facilitating connected and automated driving, where vehicles and other road traffic participants share data instantaneously and cooperate to solve tricky traffic situations in milliseconds. This paper proposes two stochastic models for the V2X standard IEEE 802.11p to characterize amongst other things the Age of Information (AoI), a recently-proposed metric that measures the freshness of information. The first model is based on renewal process analysis of a tagged station with mean field approximation, while the second one adopts Markov chain approach with network level view. Analytical results show that IEEE 802.11p, given its adaptability to event-triggered and aperiodic messaging, supports advanced cooperative driving scenarios.

Exchanging status information between closely located mobile agents is an underlying process in numerous future Cyber Physical Systems (CPS). Real-time updates including positions of neighboring nodes is performed when, for example, autonomous vehicles execute a cooperative maneuver, industrial robots collaborate with each other on a task, or Unmanned Aerial Vehicles (UAVs) execute a mission in a swarm. For the design of networked automatic control strategies in these scenarios, it is essential to understand the performance of such Machine-to-Machine (M2M) communications from the information freshness perspective. To this end, we introduce a mathematical framework which allows characterizing the Age of Information (AoI) in networks governed by the Carrier-Sense Multiple Access (CSMA) protocol. Differently from existing work, we take into account the fact that update packets sent by mobile nodes are not necessarily periodic, since packet triggering is often coupled with agents’ mobility. Our approach is based on the assumption that diverse mobility-triggered message generation patterns can be modeled by a wide class of update traffic arrival processes. We apply Discrete Markovian Arrival Process (DMAP), which is a versatile arrival model able to fit arrival patterns that are modulated by a finite state machine, including bursty traffic. We develop an accurate and efficient analytical model of nodes exchanging one-hop broadcast update messages with bursty arrivals to evaluate the moments as well as entire probability distribution of several performance metrics, including AoI. An asymptotic analysis for large networks suggests a simple way to control the update message rate to minimize the AoI. We show that the optimal update rate that minimizes the mean AoI coincides with the optimum of the wireless channel utilization. Numerical examples point out that the asymptotic theory provides accurate predictions also for small values of the number of nodes. © 2013 IEEE.

A fundamental paradigm of the Internet of Things (IoT) consists of agents that communicate updates to each other to perform joint actions, e.g., cooperative awareness in transportation systems, swarms of Unmanned Aerial Vehicles (UAVs), fleet of robots, automated assembly lines and logistics. A common feature of update messaging is emphasis on reliable throughput and freshness of collected data. We develop an analytical model that yields accurate predictions of all relevant metrics, both in terms of moments and probability distributions, for the case of one-hop broadcast update messages exchanged by using a CSMA-based wireless network. The model is validated against simulations and then applied to compare two update message scheduling approaches: providing a minimal buffer resource or providing no buffer. Surprisingly, we prove that having no buffer improves Age of Information (AoI) performance as well as message delivery rate, in spite of dropped packets. This is essentially due to much smaller congestion and hence collision probability in the wireless channel. From a system point of view this suggests a simple design of message handling, with no need of buffering and overwriting older messages. From a modeling point of view, the result supports the definition of simpler models that need not keep into account buffer state. © 2021 by IEEE.

Molecular communication is a relatively new communication paradigm for nanomachines where the communication is realized by utilizing existing biological components found in nature. In recent years researchers have proposed using bacteria to realize molecular communication because the bacteria have the ability to swim and migrate between locations, carry DNA contents (i.e. plasmids) that could be utilized for information storage, and interact and transfer plasmids to other bacteria (one of these processes is known as bacterial conjugation). However, current proposals for bacterial nanonetworks have not considered the internal structures of the nanomachines that can facilitate the use of bacteria as an information carrier. This article presents the types and functionalities of nanomachines that can be utilized in bacterial nanonetworks. A particular focus is placed on the bacterial conjugation and its support for multihop communication between nanomachines. Simulations of the communication process have also been evaluated, to analyze the quantity of bits received as well as the delay performances. Wet lab experiments have also been conducted to validate the bacterial conjugation process. The article also discusses potential applications of bacterial nanonetworks for cancer monitoring and therapy. © 2014 IEEE.

Applications involving multiple UAVs have gained increasing relevance in recent years, due to the benefits that cooperative systems tend to provide to their applications. In addition to performing several simultaneous tasks, the time spent to perform a certain task is reduced. In this article, an architecture for sharing navigation information is demonstrated to support applications composed of systems with multiple UAVs. © 2021. All Rights Reserved.

Multi-user spatial multiplexing combined with packet aggregation can significantly increase the performance of Wireless Local Area Networks (WLANs). In this letter, we present and evaluate a simple technique to perform packet aggregation in IEEE 802.11ac MU-MIMO (Multi-user Multiple Input Multiple Output) WLANs. Results show that in non-saturation conditions both the number of active stations (STAs) and the queue size have a significant impact on the system performance. If the number of STAs is excessively high, the heterogeneity of destinations in the packets contained in the queue makes it difficult to take full advantage of packet aggregation. This effect can be alleviated by increasing the queue size, which increases the chances of scheduling a large number of packets at each transmission, hence improving the system throughput at the cost of a higher delay. © 1997-2012 IEEE.

Prospective IEEE 802.11p-based vehicular surveillance system, where video from the vehicle on-board camera is transmitted to the management center, is considered. Multi-hop transmission from the vehicle to the nearest roadside unit and then-via other roadside units-to the gateway is addressed. In this letter we assess the feasibility of such system by analyzing the video end-to-end distortion for a target vehicle, located several hops away from the gateway, when it is alone or there are also other vehicles transmitting video. We demonstrate the importance of dynamic adaptation of the video bit rate of each vehicle depending on the number and positions of the participating vehicles. © 2014 IEEE.

Wireless objects equipped with multiple antennas are able to simultaneously transmit multiple packets by exploiting the channel's spatial dimensions. In this paper, we study the benefits of such Multiple Packet Transmission (MPT) approach, when it is used in combination with a Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol for fully interconnected networks, addressing the interactions between the two mechanisms and showing the performance gains that can be achieved. To this end, a very simple Media Access Control (MAC) protocol that captures the fundamental properties and tradeoffs of a CSMA/CA channel access protocol supporting MPT is introduced. Using this protocol as a reference, a new analytical model is presented for the case of non-saturated traffic sources with finite buffer space. Simulation results show that the analytical model is able to accurately characterize the steady-state behavior of the reference protocol for different number of antennas and different traffic loads, providing a useful tool for understanding the performance gains achieved by MAC protocols supporting MPT. © 2013 Elsevier B.V. All rights reserved.

The proceedings contain 18 papers. The topics discussed include: network coding as a WiMAX link reliability mechanism; initialization procedure of wireless network coding with hierarchical decode and forward strategy in random connectivity networks; a coded DHA FH OFDMA system with a noncoherent ML detector under multitone jamming; analysis of inter-RSU beaconing interference in VANETs; survey of energy efficient tracking and localization techniques in buildings using optical and wireless communication media; network coding as a WiMAX link reliability mechanism: an experimental demonstration; spectrum sensing with USRP-E110; power control for wireless networks with a limited number of channels; a measurement study for predicting throughput from LQI and RSSI; reality considerations when designing a TDMA-FDMA based link-layer for real-time WSN; and wireless groupcast routing with palette of transmission methods.

This book chapter introduces the use of Continuous Time Markov Networks (CTMN) to analytically capture the operation of Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) networks. It is of tutorial nature, and it aims to be an introduction on this topic, providing a clear and easy-to-follow description. To illustrate how CTMN can be used, we introduce a set of representative and cutting-edge scenarios, such as Vehicular Ad-hoc Networks (VANETs), Power Line Communication networks and multiple overlapping Wireless Local Area Networks (WLANs). For each scenario, we describe the specific CTMN, obtain its stationary distribution and compute the throughput achieved by each node in the network. Taking the per-node throughput as reference, we discuss how the complex interactions between nodes using CSMA/CA have an impact on system performance.

Overtaking on rural roads may cause severe accidents when oncoming traffic is detected by a driver too late, or its speed is underestimated. Recently proposed cooperative overtaking assistance systems are based on real-time video transmission, where a video stream captured with a camera installed at the windshield of a vehicle is compressed, broadcast through the wireless channel, and displayed to the drivers of vehicles driving behind. In such a system, it is of ultimate importance to deliver video information about the opposite lane with low end-to-end latency and good visual quality. In this paper, we propose reallocating the wireless channel resources in favor of the part of the captured video frame containing the image of the oncoming vehicle. To achieve this goal, we apply automotive radar for oncoming vehicle detection, and we use the image of this vehicle as a region-of-interest (ROI) for the video rate control. We present the theoretical framework, which describes the basics of such an approach and can serve as a useful guideline for the future practical implementation of the overtaking assistance systems. The benefits of our proposal are demonstrated in relation to the practical scenario of H.264/Advance Video Coding (AVC), IEEE 802.11p/Wireless Access for Vehicular Environments (WAVE) intervehicle communication standards, and currently used automotive radars.

Real-time video delivery in Vehicle-to-Infrastructure (V2I) scenario enables a variety of multimedia vehicular services. We conduct experiments with Dedicated Short Range Communications (DSRC) transceivers located in the mutual proximity and exchanging Skype video calls traffic. We demonstrate that the lack of coordination between the users both at the application as well as Medium Access Control (MAC) layers results in problems with quality of service provisioning even for the setup without vehicular mobility. © Copyright 2017 IEEE

This work is dedicated to a live video streaming in vehicular networks where the application-based inter-packet forward error correction is used for the packet loss protection. A practical way to apply such a protection at the video encoder side for the unknown channel loss rate is proposed. Experimental results which demonstrate the performance for the proposed approach for a scalable extension of the H.264/AVC standard (H.264/SVC) and for the non-standardized video codec based on three-dimensional discrete wavelet transform (3-D DWT) are provided.

In recently proposed cooperative overtaking assistance systems a video stream captured by a windshield-mounted camera in a vehicle is compressed and broadcast to the vehicle driving behind it, where it is displayed to the driver. It has been shown that this system can provide robust operation if video codec channel adaptation is undertaken by exploiting information from the cooperative awareness messages about any forthcoming increases in the multiple access channel load. In this letter we demonstrate the gains achievable in system performance when the video transmitter power control is also used. © 1997-2012 IEEE.

Prospective IEEE 802.11p-enabled automotive video applications are identified. Preliminary experimental results of inter-vehicular live video streaming for surveillance applications are presented. A test-bed for the demonstration of the achievable visual quality under different channel conditions is described.

IEEE 802.11p vehicle-to-vehicle and vehicle-to-infrastructure communication technology is currently an emerging research topic in both industry and academia. Respective spectrum allocation of 10 MHz channels in the 5.9 GHz band for USA and Europe allows considering inter-vehicle transmission of a live video information as a basis, which enables a new class of safety and infotainment automotive applications such as road video surveillance. This paper is first of its kind where such a video transmission system is developed and experimentally validated. We propose a low-complexity unequal packet loss protection and rate control algorithms for a scalable video coding based on the three-dimensional discrete wavelet transform. We show that in comparison with a scalable extension of the H.264/AVC standard the new codec is less sensitive to packet losses, has less computational complexity and provides comparable performance in case of unequal packet loss protection. It is specially designed to cope with severe channel fading typical for dynamic vehicular environments and has a low complexity, making it a feasible solution for real-time automotive surveillance applications. Extensive measurements obtained in realistic city traffic scenarios demonstrate that good visual quality and continuous playback is possible when the moving vehicle is in the radius of 600 meters from the roadside unit. ©2014 IEEE

Communication between road users is crucial, as miscommunication and misunderstandings can lead to accidents, often bearing serious consequences in case Vulnerable Road Users (VRU) are involved. In this article we focus on communication solutions directed towards one particular group of VRUs, namely pedestrians. Various approaches for communication from vehicles to pedestrians have been proposed, including external Human-Machine Interfaces and Vehicle-to-Everything (V2X) communication. Surprisingly, these works are rarely looked at together. Therefore we jointly survey these separate fields as a starting point for the development of effective methods for interactions between vehicles and pedestrians. We argue that merging the perspectives of different fields can be beneficial as their approaches often complement each other. © 2024 IEEE.

In Cooperative Intelligent Transportation Systems (C-ITSs), vehicles need to wirelessly connect with Roadside units (RSUs) over limited durations when such point-to-point connections are possible. One example of such communications is the downloading of maps to the C-ITS vehicles. Another example occurs in the testing of C-ITS vehicles, where the tested vehicles upload trajectory records to the roadside units. Because of real-time requirements, and limited bandwidths, data are sent as User Datagram Protocol (UDP) packets. We propose an inter-packet error control coding scheme that improves the recovery of data when some of these packets are lost; we argue that the coding scheme has to be one of convolutional coding. We measure performance through the session averaged probability of successfully delivering groups of packets. We analyze two classes of convolution codes and propose a low-complexity decoding procedure suitable for network applications. We conclude that Reed–Solomon convolutional codes perform better than Wyner–Ash codes at the cost of higher complexity. We show this by simulation on the memoryless binary erasure channel (BEC) and channels with memory, and through simulations of the IEEE 802.11p DSRC/ITS-G5 network at the C-ITS test track AstaZero.

To enable testing and performance evaluation of new connected and autonomous driving functions, it is important to characterize packet losses caused by degradation in vehicular (V2X) communication channels. In this paper we suggest an approach to constructing packet loss models based on the socalled Pseudo-Markov chains (PMC). The PMC based model needs only short training sequences, has low computational complexity, and yet provides more precise approximations than known techniques. We show how to learn PMC models from either empirical records of packet receptions, or from analytical models of fluctuations in the received signal strength. In particular, we validate our approach by applying it on (i) V2X packet reception data collected from an active safety test run, which used the LTE network of the AstaZero automotive testing site in Sweden, and (ii) variants of the Rician fading channel models corresponding to two models of correlations of packet losses. We also show that initializing the Baum-Welch algorithm with a second order PMC model leads to a high accuracy model. © 2019 IEEE.

An approach to constructing discrete models of packet losses suitable for a wide variety of communication network applications is studied. It is based on estimating parameters of probabilistic automata described via so-called pseudo-Markov chains. The new technique is applied both to approximating a discrete time analog process at the output of known channel models and to the experimental data stream. Comparison of models is performed by computing probabilities of more than m losses out of n transmitted packets (P (≥ m, n)). It is shown that for the Rician fading channel with exponential correlation and correlation determined by a Bessel filter, the obtained rank-two and rank-three discrete modes, respectively, provide high accuracy coincidence of P (≥ m, n) performances. The rank-three discrete model computed on the experimental data stream obtained from the LTE network provides significantly better approximation of P (≥ m, n) performance than that obtained by the Baum-Welch algorithm.

This paper studies the impact of vulnerabilities associated with the Sybil attack (through falsification of multiple identities) and message falsification in vehicular platooning. Platooning employs Inter-Vehicular Communication (IVC) to control a group of vehicles. It uses broadcast information such as acceleration, position, and velocity to operate a longitudinal control law. Cooperation among vehicles allows platoons to reduce fuel consumption and risks associated with driver mistakes. In spite of these benefits, the use of network communication to control vehicles exposes a relevant attack surface that can be exploited by malicious actors. To carry out this study, we evaluate five scenarios to quantify the potential impact of such attacks, identifying how platoons behave under varying Sybil attack conditions and what are the associated safety risks. This research also presents the use of location hijacking attack. In this attack, innocent vehicles that are not part of a platoon are used as a way to create trust bond between the false identities and the physical vehicles. We demonstrate that the ability to create false identities increases the effectiveness of message falsification attacks by making them easier to deploy and harder to detect in time.

Platooning employs a set of technologies to manage how a group of vehicles operates, including radar, GPS and Inter-Vehicular Communication (IVC). It uses broadcasted information such as acceleration, position and velocity to operate vehicle members of the platoon. Cooperation among vehicles allows platoons to reduce fuel consumption and risks associated with driver mistakes. In spite of these benefits, the use of IVC to control vehicles exposes a relevant attack surface that can be exploited by malicious actors. In this paper we study the impact of vulnerabilities associated with the Sybil attack (through falsification of multiple identities) and message falsification in vehicular platooning. Simulation results show that this attack may impact the longitudinal control and compromise the entire platoon control. © Copyright 2018 IEEE

Recent advances in cooperative driving hold the potential to significantly improve safety, comfort and efficiency on our roads. An application of particular interest is platooning of vehicles, where reduced inter-vehicle gaps lead to considerable reductions in fuel consumption. This, however, puts high requirements on timeliness and reliability of the underlying exchange of control data. Considering the difficult radio environment and potentially long distances between communicating platoon members, as well as the random channel access method used by the IEEE 802.11p standard for short-range inter-vehicle communication, those requirements are very difficult to meet. The relatively static topology of a platoon, however, enables us to preschedule communication within the platoon over a dedicated service channel. Furthermore, we are able to set aside parts of the available bandwidth for retransmission of packets in order to fulfil the reliability requirements stated by the platoon control application. In this paper, we describe the platooning framework along with the scheduling algorithm used to assign retransmission slots to control packets that are most likely to need them. This retransmission scheduling scheme offers a valuable tool for system designers when answering questions about the number of safely supported vehicles in a platoon, achievable reductions in inter-vehicle gaps and periodicity of control packets. © 2014 Springer International Publishing.

Cooperative vehicular applications, like collision avoidance, driver assistance, and cruise control require that vehicles become aware of other vehicles in the surroundings. This cooperative awareness is achieved by beaconing, the exchange of periodical single-hop broadcast short status message that include data about the position, the speed, and the heading of a vehicle. Although several works have studied beaconing techniques both from an analytical point of view and through simulative study, none of the existing works has investigated how beaconing works on top of 802.11p/WAVE (Wireless Access for Vehicular Environment), the upcoming standard intended to deliver both safety and non-safety applications to vehicles on the roads. According to it, safety and control messages are expected to be delivered on a given frequency during a common control channel (CCH) interval set by the WAVE draft standard. The rest of the time, vehicles switch over one of available service channel (SCH) frequencies for non-safety related data exchange. In this paper we discuss and evaluate through numerical results the main effects the WAVE channel switching procedures have on beaconing. © 2010 by IEICE

Recent significant advances in self-interference cancellation techniques pave the way for the deployment of full-duplex wireless transceivers capable of concurrent transmission and reception on the same channel. Despite the promise to theoretically double the spectrum efficiency, full-duplex prototyping in off-the-shelf chips of mobile devices is still in its infancy, mainly because of the challenges in mitigating self-interference to a tolerable level and the strict hardware constraints. In this article, we argue in favor of embedding full-duplex radios in onboard units of future vehicles. Unlike the majority of mobile devices, vehicular onboard units are good candidates to host complex FD transceivers because of their virtually unlimited power supply and processing capacity. Taking into account the effect of imperfect SI cancellation, we investigate the design implications of full-duplex devices at the higher-layer protocols of next-generation vehicular networks and highlight the benefits they could bring with respect to half-duplex devices in some representative use cases. Early results are also provided that give insight into the impact of self-interference cancellation on vehicle-to-roadside communications, and showcase the benefits of FD-enhanced medium access control protocols for vehicle-to-vehicle communications supporting crucial road safety applications.

Decentralized Environmental Notification Messages (DENMs) are generated by a vehicle upon detection of an accident or other hazards on the road, and need to be promptly and reliably transmitted. Delayed or lost messages may have fatal consequences, especially in critical driving situations, such as automated overtake and emergency braking, when vehicles can be very close to each other. In this letter, the DENM latency and reliability performances are characterized over the Cellular Vehicle-to-everything (C-V2X) sidelink (PC5 interface). The conducted study uses analytical tools, among which stochastic geometry, to derive performance results, then validated by simulations. Results are applied to the case of DENMs for emergency electronic brake lights, and helpful insights are provided for this crucial case and for other more general DENM-assisted V2X use cases.

A rich portfolio of services (e.g., road traffic information, maps download, Internet/cloud access) will be delivered to users on wheels through Vehicular Ad Hoc Networks (VANETs).Most of them will be offered by road-side units (RSUs) sparsely deployed along the roads. The prompt access to such services by passing by vehicles highly relies on the efficiency of service announcement procedures performed by the RSUs. In this paper, we present an analytical framework that models the service discovery and access mechanisms in multi-channel vehicular networks. The model accounts for dual-radio devices under different channel configurations for the delivery of announcements (e.g., on the control channel, on a service channel) and related switching mechanisms. Guidelines are suggested for the setting of service announcements parameters and channel configuration to allow providers to boost service provisioning. © 2016 IEEE.

Multiple channels have been allocated in the 5 GHz spectrum for vehicular communications worldwide, however, due to the limited allocated bandwidth, simultaneous communications occurring over nearby channels may be affected by adjacent channel interference (ACI). Due to ACI, packet reception may be unsuccessful and transmissions may be delayed. In this work, we investigate the ACI phenomena in multichannel vehicular networks to shed light on their effects, with focus on the transmitter-side. To this purpose, a simple analytical model is introduced along with a preliminary evaluation. Suggestions are also provided about the usage of adjacent channels so to minimize side effects on the communication quality. © 2014 IEEE

A wide portfolio of safety and non-safety services will be provided to drivers and passengers on top of Vehicular Ad Hoc Networks (VANETs).

Non-safety services are announced by providers, e.g., road-side units (RSUs), on a channel that is different from the one where the services are delivered. The dependable and timely delivery of the advertisement messages is crucial for vehicles to promptly discover and access the announced services in challenging vehicle-to-roadside scenarios, characterized by intermittent and short lived connectivity.

In this paper, we present an analytical framework that models the service advertisement and access mechanisms in multichannel vehicular networks.

The model accounts for dual-radio devices, and computes the mean service discovery time and the service channel utilization by considering the disruption periods due to the switching of the RSU from the advertising channel (where announcements are transmitted) to the advertised channel (where services are exchanged), under different channel and mobility conditions. It provides quick insights on parameter settings to allow providers to improve service provisioning. © 2015 IEEE