DIVINE: Data offloading in vehicular networks with QoS provisioning

With the adoption of sensing technology, vehicles are able to gather information about driver's environment, like speed, temperature, moisture and road condition, etc. The state-of-the-art wireless technologies also provide vehicles with the ability of communicating to their neighboring vehicles on the road, as well as the static frameworks on the road side. Vehicular Sensor Network (VSN) is an emerging paradigm in vehicular networks. In this paper, we propose a new VSN scenario, Road Probing. The Road Side Unit (RSU) initiates the probing process and selects the passing by vehicles as probes to collect traffic and environment information. The selected vehicles sense the desired data and forward it back to the RSU in a multi-hop fashion. A dynamically growing one-dimension probing chain originated from the RSU is formed by participated vehicles as the probing process going on. A mobility profile based probe selection method is developed to improve this chain's connectivity as it's the key issue to assure the quality of data collection. The performance of Road Probing is demonstrated by simulation experiments.

The reliability of communication in vehicular networks depends mostly on the density of DSRC-enabled vehicles that form the network. In highway scenarios, and depending on the time of day, the probability of having a disconnected vehicular network can be very high, which hinders communication reliability. To improve communication in these scenarios, infrastructure points known as Road Side Units (RSU) may be used. RSUs, however, have an associated cost, and therefore the number of RSUs needs to be minimized while still providing a significant improvement on communications. In this paper we study the effect of including RSUs as relay nodes to improve communication in highway scenarios. We model the average time taken to propagate a packet to disconnected nodes (denoted as re-healing time) when considering both scenarios of connected and disconnected RSUs. We then compare the results of both these models and of a model with no RSUs. Results show significant improvements with RSU deployments, both connected and disconnected, particularly in multi-cluster communication scenarios.

In this work, we propose a new GRASP-based heuristic, called ΔrGRASP2_MH, for solving the allocation of roadside units (RSUs) in a vehicular network with multi-hop transmission and synchronous communication. A vehicular network with hybrid architecture enables the infrastructure-to-vehicle communication, as well as the vehicle- to-vehicle communication. Our goal is to find the minimum set of RSUs to meet the quality of service requirements specified by the Deployment Δρ1ρ2. The Deployment Δρ1ρ2 is a metric employed in the evaluation of the quality of service offered in vehicular networks. We test ΔrGRASP2_MH under several communication ranges to analyze the influence exerted by these ranges on the number of RSUs employed.

Recently, the number of vehicles equipped with wireless connections has increased considerably. The impact of that growth in areas such as telecommunications, infotainment, and automatic driving is enormous. More and more drivers want to be part of a vehicular network, despite the implications or risks that, for instance, the openness of wireless communications, its dynamic topology, and its considerable size may bring. Undoubtedly, this trend is because of the benefits the vehicular network can offer. Generally, a vehicular network has two modes of communication (V2I and V2V). The advantage of V2I over V2V is roadside units' high computational and transmission power, which assures the functioning of early warning and driving guidance services. This paper aims to discover the principal vulnerabilities and challenges in V2I communications, the tools and methods to mitigate those vulnerabilities, the evaluation metrics to measure the effectiveness of those tools and methods, and based on those metrics, the methods or tools that provide the best results. Researchers have identified the non-resistance to attacks, the regular updating and exposure of keys, and the high dependence on certification authorities as main vulnerabilities. Thus, the authors found schemes resistant to attacks, authentication schemes, privacy protection models, and intrusion detection and prevention systems. Of the solutions for providing security analyzed in this review, the authors determined that most of them use metrics such as computational cost and communication overhead to measure their performance. Additionally, they determined that the solutions that use emerging technologies such as fog/edge/cloud computing present better results than the rest. Finally, they established that the principal challenge in V2I communication is to protect and dispose of a safe and reliable communication channel to avoid adversaries taking control of the medium.

With the development of the vehicular communications technology, roadside units (RSUs) placement problem has recently received considerable attentions in vehicular ad hoc networks (VANETs). This paper addresses the roadside units (RSUs) placement problem for traffic flow coverage requirement number in vehicular ad hoc networks (VANETs). Given a set of road segments, some traffic flows and a coverage requirement number n, the problem is how to find the optimal placement of RSUs, such that each traffic flow is covered by at least n RSUs. We first investigate full RSUs placement problem, which place all the RSUs on the given road segments totally. We prove that this problem is NP-hard. Then, we propose a greedy algorithm to solve the problem and theoretical analysis is given. We also study incremental RSUs placement problem, which place the partial RSUs based on the deployed RSUs on the given road segments. Based on the proposed greedy algorithm, we also propose a algorithm to solve the incremental RSUs placement problem. Extensive simulations have been conducted to show the performance of our proposed algorithms is superior to the other algorithms.

Multi-tenant software-defined networks have emerged as a promising service platform to manage and share virtual network services between tenants and end-users. However, when using a service level agreement (SLA) in a multi-tenant circumstance, the resource competition among tenants incurred in many challenges on the quality of services (QoS) provisioning. First, as the existing QoS provisioning was to translate the high-level SLA contact into a group of corresponding low-level QoS rules, this traditional top-down translation mechanism was too ossified to support the dynamic SLA negotiation. Second, since an end-user usually requested multiple services and different services had different QoS requirements, the QoS provisioning required tenants to monitor and control the network status though OpenFlow protocol in a fine-grained way. To address these issues, we propose an SLA-aware fine-grained QoS provisioning (SFQP) scheme for MTSDN. The SFQP scheme extracts the eigen characteristics of each packet by application-aware technology automatically. Considering tenants are more willing to serve for users which have popular SLA contact to earn more revenues, we predict the SLA popularity by K-nearest neighbor. Moreover, we present an SLA-aware dynamic bandwidth allocation algorithm to implement the proposed SFQP scheme. The feasibility of the proposed scheme is verified by simulations of the SLA taxonomy, bandwidth utilization, and bandwidth fluctuation.

The recent advances in wireless communication techniques have made it possible for fast-moving vehicles to download data from the Internet. For the reliable data upload and download, TCP can be used for vehicular networks. However, TCP requires the connection initialization using three-way handshaking for the data exchange between two end systems over the Internet. Thus, the efficient operation of TCP is important for data services in the vehicular networks. This paper proposes a method of TCP Context Migration Scheme (TOMS) for the enhancement of data services in vehicular networks. TOMS provides vehicles with proactive TCP connection initialization using a moving TCP proxy as a cluster head, which will have the Internet connectivity with a Road-Side Unit (RSU). A cluster member can initiate its TCP connection toward its corresponding TCP end-system (e.g., server and peer) via the TCP proxy within its cluster. The TCP proxy performs the TCP connection set-up for the sake of other cluster member vehicles and acknowledges the received TCP segments toward these vehicles. When the TCP proxy moves out of the communication range of the RSU, it transfers the TCP contexts of other vehicles to another vehicle, which will play the role of a TCP proxy through the proposed TCP context migration scheme. Also, the RSU works as a fixed TCP proxy for handling the acknowledgement of TCP segments and TCP timer handling (e.g., persist timer and keepalive timer) when there happens the disconnection between the moving proxy and the RSU. Thus, it is shown that our TOMS outperforms the legacy TCP in vehicular networks.

This paper proposed a mobility-aware multimedia data transfer mechanism using Multipath TCP in Vehicular Network. Since high transmission rate and low latency are the two key factors for multimedia data transmission that could provide stable video streaming services, therefore, we first adopted Multipath Transport Control Protocol which can transfer data concurrently for improving transmission rate and designed Quality-aware Data Distribution to dynamically allocate the data to different subflows. Moreover, in Vehicular Network, the mobile terminal, which means the vehicle, can communicate with remote server through roadside unit (RSU). However, the communication link between terminals and remote server will disrupt while the vehicle exceeding the communication range of roadside unit; and there also exists the situation that the vehicle is in the communication range of several RSU. Accordingly, we exploited a mobility-aware distance measurement for checking whether the vehicle has moved out of the communication range of any RSU or it is in multi-RSU's communication range. Afterwards, we designed a handover mechanism which transfer data to connected path (4G) for stable transmission using MPTCP when the vehicle exceeded the communication range of RSU; while one mobile can communicate with more than one RSU, we exploited a mechanism which can trigger new path for multipath data transmission and non-corporation Nash Equilibria was employed for solving the problem of fairness in the same kind of network technology multipath transmission. Simulation results show how mobility-aware multimedia data transfer mechanism improve the performance of transmission comparison with state-of-art solution.

The best known new feature of UMTS is higher user bit rates: on circuit-switched connections 384 kbps, and on packet-switched connections up to 2 Mbps, can be reached. Higher bit rates naturally facilitate some new services, such as video telephony and quick downloading of data. If there is to be a killer application, it is most likely to be quick access to information and its filtering appropriate to the location of a user: see Figure 2.1. Often the requested information is on the Internet, which calls for effective handling of TCP/UDP/IP traffic in the UMTS network. At the start of the UMTS era almost all traffic will be voice, but later the share of data will increase. It is, however, difficult to predict the pace at which the share of data will start to dominate the overall traffic volume. At the same time that transition from voice to data occurs, traffic will move from circuitswitched connections to packet-switched connections. At the start of UMTS service not all of the Quality of Service (QoS) functions will be implemented, and therefore delaycritical applications such as speech and video telephony will be carried on circuit-switched bearers. Later, it will be possible to support delay-critical services as packet data with QoS functions. Compared to GSM and other existing mobile networks, UMTS provides a new and important feature, namely it allows negotiation of the properties of a radio bearer. Attributes that define the characteristics of the transfer may include throughput, transfer delay and data error rate. To be a successful system, UMTS has to support a wide range of applications that possess different quality of service (QoS) requirements. At present it is not possible to predict the nature and usage of many of these applications. Therefore it is neither possible nor sensible to optimise UMTS to only one set of applications. UMTS bearers have to be generic by nature, to allow good support for existing applications and to facilitate the evolution of new applications. Since most of the telecommunications applications today are Internet or N-ISDN applications, it is natural that these applications and services dictate primarily the procedures for bearer handling.

Orthogonal time frequency space (OTFS) modulation is a promising candidate for supporting reliable information transmission in high-mobility vehicular networks. In this paper, we consider the employment of the integrated (radar) sensing and communication (ISAC) technique for assisting OTFS transmission in both uplink and downlink vehicular communication systems. Benefiting from the OTFS-ISAC signals, the roadside unit (RSU) is capable of simultaneously transmitting downlink information to the vehicles and estimating the sensing parameters of vehicles, e.g., locations and speeds, based on the reflected echoes. Then, relying on the estimated kinematic parameters of vehicles, the RSU can construct the topology of the vehicular network that enables the prediction of the vehicle states in the following time instant. Consequently, the RSU can effectively formulate the transmit downlink beamformers according to the predicted parameters to counteract the channel adversity such that the vehicles can directly detect the information without the need of performing channel estimation. As for the uplink transmission, the RSU can infer the delays and Dopplers associated with different channel paths based on the aforementioned dynamic topology of the vehicular network. Thus, inserting guard space as in conventional methods are not needed for uplink channel estimation which removes the required training overhead. Finally, an efficient uplink detector is proposed by taking into account the channel estimation uncertainty. Through numerical simulations, we demonstrate the benefits of the proposed ISAC-assisted OTFS transmission scheme.

In this paper, we investigate a joint admission control (AC) and resource allocation (RA) scheme for providing quality of service (QoS) guarantees for video streaming in OFDMA networks. The QoS provisioning is posed as a network utility maximization (NUM) problem. We prove that the QoS requirements are mainly dominated by the average data rate with the aid of diffusion approximation approach, allowing us to decompose the NUM problem into two tractable sub-problems, namely, the AC and the RA sub-problems. We develop an AC algorithm, which enables us to select a maximum user set such that all selected users can meet their QoS requirements related to user perceived video quality during the video playback period. In addition, in order to handle the computational complexity, we further split the RA sub-problem into the constrained Markov decision process associated problems performed at users together with a transmission problem performed at the base station. Correspondingly, we develop a power and sub-carrier allocation algorithm to minimize the average power consumption. The decision of AC is made in a long timescale and depends on the average channel state information (CSI), whereas the decision of RA is made in a short timescale and is subject to both instantaneous CSI and queue state information. Simulation results demonstrate the advantages of the proposed algorithms.

A Sybil attack is one where an adversary assumes multiple identities with the purpose of defeating the trust of an existing reputation system. When Sybil attacks are launched in vehicular networks, an added challenge in detecting malicious nodes is mobility that makes it increasingly difficult to tie a node to the location of attacks. In this paper, we present an innovative protocol for Sybil detection in vehicular networks. Considering that vehicular networks are cyber-physical systems integrating cyber and physical components, our technique exploits well grounded results in the physical (i.e., transportation) domain to tackle the Sybil problem in the cyber domain. Compared to existing works that rely on additional cyber hardware support, or complex cryptographic primitives for Sybil detection, the key innovation in our protocol is leverage the theory of platoon dispersion that models the physics of naturally occurring dispersion in roads. Specifically, our technique employs a certain number of roadside units that periodically collect reports from vehicles regarding their physical neighborhood as they move in roads. Leveraging from existing models of platoon dispersion, we design a protocol to detect anomalously close neighborhoods that are reflective of Sybil attacks. To the best of our knowledge, this is the first work integrating a well established theory in transportation engineering for detecting cyber space attacks in vehicular networks. The resulting protocol is naturally simple, efficient and performs very well.

With the onset of multimedia applications, Quality of Service (QoS) in 802.11-based wireless ad hoc networks has been an essential area to look into. Standard wireless protocols such as IEEE 802.11b and IEEE 802.11e have been deemed unsuitable for multimedia traffic transmission in an ad hoc (multihop) network environment due to the unique network characteristics. As an ad hoc network is infrastructureless and distributed in nature, it gives rise to several challenges in QoS provisioning. In this thesis, we focus on the research of three key areas on QoS in ad hoc networks namely, buffer management in the medium access control (MAC) layer, cross-layer design and flow admission control. Firstly, we study MAC layer buffer management in the IEEE 802.11e protocol. The IEEE 802.11e MAC protocol provides QoS for multimedia traffic by probabilistic priority queueing. Ad hoc networks tend to generate a large volume of network control packets for route maintenance and these control packets are typically queued in the highest priority queue. As a result, higher priority control traffic is always being served, consuming most of the bandwidth and results in poor network performance for data traffic. We examine this problem and propose a dynamic buffer management scheme to mitigate it. By setting different threshold levels in different priority queues, we allow lower priority data traffic to be served when the higher priority control traffic is deemed to be excessive. Simulation of our proposed scheme has shown that our approach yielded better network performance compared to the standard protocol in terms of packet delivery ratio and average delay. Secondly, we study the cross-layer interaction between the MAC and Network layers to identify its impact on QoS. We select the IEEE 802.11e MAC protocol and Ad-hoc On Demand Distance Vector (AODV) routing protocol in our study since they are standardized protocols for wireless networks. In IEEE 802.11e MAC protocol, lower priority traffic has a higher probability of being blocked. Hence, the MAC layer will inform the Network layer of a broken link through the link notification function. In this case, AODV will re-route the paths that traverse this link. As a result, higher priority traffic which shares the same link as the lower priority traffic will undergo the same re-routing procedures. We termed this phenomenon path correlation effect. Under high traffic load, the path correlation effect will be more intense and hence degrade the QoS of higher priority traffic. To break the path correlation effect, we propose a cross-layer design called the Bundled Virtual Circuit (BVC). Our proposed BVC scheme not only addresses the path correlation issues, but also provides priority treatment from the Network layer to the MAC layer. Through our simulations, our proposed cross-layer design approach is proven to provide better network performance than the 802.11e/AODV protocols in terms of packet delivery ratio and delay. Finally, we examine flow admission control at the routing layer in ad hoc networks. Standard routing protocols such as AODV performs routing on a shortest path basis. In the presence of multiple routes, hotspots are likely to form among the intermediate nodes and thus lead to network congestion. In addition, existing routes are not well-protected from the introduction of new routes. We propose a flow admission control algorithm to be used with AODV. Our algorithm allows routes to be created through available bandwidth and congestion estimation. During the route discovery phase, each node will be gauged on its estimated available bandwidth and its backlog of packets in the MAC buffer. If a node does not have sufficient bandwidth, or has too many backlogged packets compared to the requested flow rate, it will not participate in the route discovery process. From simulations, our new scheme is able to provide better network performance than the standard AODV protocol in terms of delay. Our work in this thesis focuses on QoS provisioning in ad hoc networks from the MAC and network layer perspectives. By studying the network characteristics and protocols’ behavior, we investigate the various problems of providing QoS in an ad hoc network environment and propose three different schemes to improve the QoS provisioning at the MAC and network layers. We believe that our work is able to provide some insights to the research area on QoS in ad hoc networks.

The new era of the Internet of Things is promoting the evolution of self-driving vehicles into connected and autonomous vehicles (CAVs), which enable modern intelligent transportation systems. CAVs provide connectivity for vehicles by integrating the capabilities of new generation wireless technologies such as dedicated short-range communication (DSRC) and cellular networks (e.g., LTE, 5G, and potential future 6G developments). The success of CAVs and their applications is dependent on the performance of their underlying networks, known as vehicular networks, which can be compromised due to the traffic dynamics and limited transmission range of communication devices. This dissertation focuses on the optimization of message coverage and dissemination that improves the overall performance of vehicular networks. The coverage of message, from a performance perspective, can be studied in terms of dissemination distance, the size of inter-vehicle networks, and the delay of message dissemination. We study the message coverage in infrastructure-based vehicular networks by focusing on the problem of optimal utilization of roadside units (RSUs) in urban environments. Specifically, we develop efficient algorithms, which by considering the driving dynamics and delay constraint of applications find the candidate sites for RSUs deployment to achieve the maximum spatiotemporal message coverage and minimum delay of message dissemination. We also present a disseminator selection algorithm for infrastructure-based environments, which aims at improving message forwarding in the presence of RSUs. Effective clustering is crucial to mitigate routing scalability and reliability issues in vehicular networks. Clustering provides a hierarchical network architecture as a result of grouping the vehicles. We propose an adaptive clustering scheme to maximize the stability of clusters. To that end, we define a novel concept, named stability degree of vehicles, by taking into consideration the driving dynamics over a prediction horizon. We then formulate the clustering problem as an optimization problem, which is used within a rolling horizon framework in the cluster formation process. Our scheme also provides insight into the optimally of clustering algorithms. We present a heterogeneous vehicular network architecture, which supports DSRC- and Device-to-Device-based communications for vehicle-to-vehicle to improve routing reliability. We prove that the optimal clustering problem is NP-hard. Therefore, we develop a heuristic algorithm, which by taking into consideration the stability degree of vehicles over the prediction horizon, finds a near-optimal solution. We propose a hybrid routing protocol based on our adaptive clustering scheme to achieve a high packet delivery ratio and low delay. Our hybrid routing protocol is composed of generic

Roadside Units (RSUs), which enable the vehicles-to-infrastructure communication, are deployed along the roadside to handle the growing communication demands as the number of vehicles increases. How to optimally deploy the RSUs and efficiently use them to enhance the vehicular network performance are important problems in the RSU-aided opportunistic networks. In order to solving these problems, we need to understand fundamental laws and properties of the opportunistic contacts. Due to the prohibitive costs to collect enough realistic contact records, to the best of our knowledge, little experiment work has been conducted to study the communication contact patterns in RSU-aided opportunistic networks. In this work, we carry out an extensive experiment involving tens of thousands of operational taxis in Beijing city. Based on this newly collected Beijing trace and the existing Shanghai trace, we find some invariant characters for the communication contacts for large scale RSU-aided vehicular opportunistic networks. In terms of inter-contact time between the RSUs and vehicles, we find it obeys exponential distribution, while in terms of contact rate, it follows Poisson distribution. Our observations reveal fundamental patterns for large scale vehicular mobility, and further provide useful guidelines for the design of new routing protocols and their performance evaluation for RSU-aided vehicular opportunistic networks.