Vehicular ad hoc networking based on the incorporation of geographical information in the IPv6 header

Several approaches can be identified in the domain of vehicular ad hoc networks (VANET). Internet Protocol version 6 (IPv6) networking and non-IP geographical networking can each fulfill a subset of the application requirements. In general, a combination of both techniques is proposed to meet all of the application requirements. In this case, packets of one VANET routing protocol are encapsulated inside packets of another. This tunneling, together with the position service required for non-IP geographical unicasting, makes such a combined solution rather complex, and hence more challenging to implement, debug, and maintain. In this article, a new VANET approach is presented that relies on the key assumptions that geo-anycast functionality is not required by the applications, and that geographic unicasting is not needed when IP-based unicasting is provided. This enables the adoption of an IPv6-only VANET solution, removing the need for tunneling and position services. New techniques are required to support IPv6-based geo-broadcasting. In this article, it is described how addresses should be assigned, how geographical data can be incorporated in the IPv6 address, how the other IPv6 header fields can be used to contain additional VANET information, and how routing should be handled to guarantee that no modifications are required to the application units. The implementation of the proposed techniques is described, and the correct functionality of the solutions is experimentally demonstrated. Finally, to prove the added value compared to current state-of-the-art propositions, the presented solution is stacked up against the recently released ETSI standards TS 102 636-4-1 (geographical addressing and forwarding) and TS 102 636-6-1 (transmission of IPv6 packets over GeoNetworking protocols)

Performance improvement in geographic routing for vehicular Ad Hoc networks

Geographic routing is one of the most investigated themes by researchers for reliable and efficient dissemination of information in Vehicular Ad Hoc Networks (VANETs). Recently, different Geographic Distance Routing (GEDIR) protocols have been suggested in the literature. These protocols focus on reducing the forwarding region towards destination to select the Next Hop Vehicles (NHV). Most of these protocols suffer from the problem of elevated one-hop link disconnection, high end-to-end delay and low throughput even at normal vehicle speed in high vehicle density environment. This paper proposes a Geographic Distance Routing protocol based on Segment vehicle, Link quality and Degree of connectivity (SLD-GEDIR). The protocol selects a reliable NHV using the criteria segment vehicles, one-hop link quality and degree of connectivity. The proposed protocol has been simulated in NS-2 and its performance has been compared with the state-of-the-art protocols: P-GEDIR, J-GEDIR and V-GEDIR. The empirical results clearly reveal that SLD-GEDIR has lower link disconnection and end-to-end delay, and higher throughput as compared to the state-of-the-art protocols. It should be noted that the performance of the proposed protocol is preserved irrespective of vehicle density and spee

SDDV: scalable data dissemination in vehicular ad hoc networks

An important challenge in the domain of vehicular ad hoc networks (VANET) is the scalability of data dissemination. Under dense traffic conditions, the large number of communicating vehicles can easily result in a congested wireless channel. In that situation, delays and packet losses increase to a level where the VANET cannot be applied for road safety applications anymore. This paper introduces scalable data dissemination in vehicular ad hoc networks (SDDV), a holistic solution to this problem. It is composed of several techniques spread across the different layers of the protocol stack. Simulation results are presented that illustrate the severity of the scalability problem when applying common state-of-the-art techniques and parameters. Starting from such a baseline solution, optimization techniques are gradually added to SDDV until the scalability problem is entirely solved. Besides the performance evaluation based on simulations, the paper ends with an evaluation of the final SDDV configuration on real hardware. Experiments including 110 nodes are performed on the iMinds w-iLab.t wireless lab. The results of these experiments confirm the results obtained in the corresponding simulations