With the remarkable progress of cooperative communication technology in recent years, its transformation to vehicular networking is gaining momentum. Such a transformation has brought a new research challenge in facing the realization of cooperative vehicular networking (CVN). This paper presents a comprehensive survey of recent advances in the field of CVN. We cover important aspects of CVN research, including physical, medium access control, and routing protocols, as well as link scheduling and security. We also classify these research efforts in a taxonomy of cooperative vehicular networks. A set of key requirements for realizing the vision of cooperative vehicular networks is then identified and discussed. We also discuss open research challenges in enabling CVN. Lastly, the paper concludes by highlighting key points of research and future directions in the domain of CVN.

/pdf/cooperative-vehicular-networking-a-survey-47r0gpwto5.pdf

Cooperative Vehicular Networking: A Survey

Cooperative diversity has gained much interest due to its ability to mitigate multipath fading without using multiple antennas. There has been considerable research on how cooperative transmission can improve the performance of the physical layer. During the past few years, the researchers have started to take into consideration cooperative transmission in routing, and there has been a growing interest in designing and evaluating cooperative routing protocols. Routing algorithms that take into consideration the availability of cooperative transmission at the physical layer are known as cooperative routing algorithms. This paper presents a comprehensive survey of the existing cooperative routing techniques, together with the highlights of the performance of each strategy. This survey also provides a taxonomy of different cooperative routing protocols and outlines the fundamental components and challenges associated with cooperative routing objectives. Existing cooperative routing algorithms are compared and lay the groundwork for further research.

Cooperative Routing in Wireless Networks: A Comprehensive Survey

In this letter we introduce a new routing technique designed exclusively for VANETs and present some initial performance results. The algorithm was named Junction-based Multipath Source Routing (JMSR). Its main characteristics comprise the multiple routes towards the destination, the junction-centric logic and the adoption of source routing mechanisms.

https://www.eurecom.fr/en/publication/3911/download/cm-publi-3911.pdf

Investigating a Junction-Based Multipath Source Routing Algorithm for VANETs

Vehicular ad-hoc network (VANET) is a self-configuring decentralized dynamic network connects the vehicles through wireless links. Hence during the life time of vehicles, VANET may experience frequent link breaks, demands an efficient routing mechanism for networking of data packets among high speed vehicles with less delay. In this paper based on, cross layer autonomous route recovery (CLARR) mechanism, a new cross layer cluster based routing (CCBR) protocol is proposed. The major objective is to set up stable clusters to improve the routing path lifetime by decreasing the link breaks for better multimedia data dissemination. This is achieved by introducing clustering concept into the existing CLARR using mobility metric, then finding reliable relay vehicles to the destination by measuring relative distances among them. Performance of proposed scheme is evaluated through simulation experiments using network simulator-2.34 for different vehicle velocities and compared with existing cross layer based on demand routing protocol, CLARR. Simulation results indicate that the proposed CCBR routing algorithm outperforms over existing CLARR in terms of throughput, energy consumption per vehicle and reliability. Additionally, due to improved reliability, overall delay is reduced to 60% in proposed CCBR for different vehicle velocity and density.

A Cross Layer Cluster Based Routing Approach for Efficient Multimedia Data Dissemination with Improved Reliability in VANETs

Cognitive radio (CR) technology enables the opportunistic use of the vacant licensed frequency bands, thereby improving the spectrum utilization. Therefore, considering end-to-end throughput in CR ad-hoc networks is an important research issue because the availability of local spectrum resources may change frequently with the time and locations. In this paper, we propose a cooperative routing protocol in CR ad-hoc networks. An on-demand routing protocol is used to find an end-to-end minimum cost path between a pair of source and destination. The simulation results show that our proposed cooperative routing protocol not only obtains higher end-to-end throughput, but also reduces the end-to-end delay and the amount of control messages compared to previous work.

/pdf/cooperative-routing-protocol-in-cognitive-radio-ad-hoc-19z19nc0b8.pdf

Cooperative routing protocol in cognitive radio ad-hoc networks

Vehicular ad hoc networks (VANETs) using WLAN technology have recently received considerable attention. One of the critical research challenges consists of the design of scalable routing algorithms that are robust to frequent path breakage caused by high mobility of vehicles. In this paper, we propose a multipath routing protocol for VANET named Fast Restoration On-demand Multipath Routing (FROMR). Different from previous researches which emphasize path disjointness, FROMR focuses on rapidly building an alternate path if the original route is broken. In order to reduce the amount of control messages as well as increase the path robustness, FROMR partitions the geographic region into squares of equal-size called grids. Inside each grid, a vehicle which is expected to stay for the longest duration is selected as the grid leader. Only grid leaders are responsible for route discovery, maintenance and restoration. Experimental results show that the proposed FROMR protocols outperform the popular AODV protocol in terms of packet delivery ratio, throughput, route lifetime, and control overhead.

Design of fast restoration multipath routing in VANETs

Vehicular Networks are more and more considerable recently. With the rapid advance of information technology, it becomes easy to support low cost inter-vehicle communication. In particular, the demand for delay sensitive applications, such as streaming media distribution, is increasing. However, due to the high mobility, links between roadside units and wireless nodes are intermittent, unreliable and inefficient. We propose cross-layer cooperative routing (CLCR) for vehicular networks to overcome the unreliability of the wireless channel and maximize the system throughput. Owing to different relay nodes may lead to different results. In this paper, we propose a mechanism to choose appropriate relay nodes in vehicular networks. Furthermore, we extend the lifetime of routing path to reduce the frequency of route rediscovering. Simulation results based on network simulator 2 (ns2) and mobility model generator for vehicular networks (MOVE) show the proposed CLCR has good performance.

Cross-layer cooperative routing for vehicular networks

Most proposed distributed energy-efficient multicasting algorithms utilise local search technology to refine a multicast tree iteratively. They use MST or SPT as the initial solution and improve the total power consumption by switching certain tree nodes from their respective parent nodes to new corresponding parent nodes. These algorithms are not scalable because the refinement operations require heavy message exchange fiows. In this paper, we propose the algorithm Localised Energy-efficient Multicast with Grouping (LEMG) features to perform a local search in a fully localised fashion. The mechanism Grouping exploits a novel idea to evaluate the power consumption cost of every node and to limit message exchange within an adjustable constant hop. Our simulation shows LEMG is comparable in energy efficiency with DMEM, while the refinement can be performed with limited hops of message passing regardless of the network size and the number of destinations.

Shuo-Cheng Hu

Papers

Design of fast restoration multipath routing in VANETs

Cross-layer cooperative routing for vehicular networks

Fully localised energy-efficient multicast in large-scale wireless ad hoc networks