A survey on multi-constrained optimal path selection schemes and authentication schemes for VANET

Vehicular ad hoc networks (VANETs) are intended to get better driver safety, avoid collisions, and offer traffic optimization. Recent years have behold an increasing interest in the security schemes for VANETs as well as improve multi-constrained optimal path selection for finding feasible routes. However, there are still several issues to be convey prior to such authentication mechanisms can be voluntarily and extensively used in real-life deployments. In this paper, we examine several authentication schemes and multi-constrained optimal path selection based on certain criteria like Qos constraints.

[1]  Geyong Min,et al.  Investigation of routing reliability of vehicular ad hoc networks , 2013, EURASIP J. Wirel. Commun. Netw..

[2]  Mohammad S. Obaidat,et al.  Vehicular Security Through Reputation and Plausibility Checks , 2014, IEEE Systems Journal.

[3]  Kemal Akkaya,et al.  A survey of authentication schemes for vehicular ad hoc networks , 2011, Secur. Commun. Networks.

[4]  Xiaodong Lin,et al.  An Efficient Pseudonymous Authentication Scheme With Strong Privacy Preservation for Vehicular Communications , 2010, IEEE Transactions on Vehicular Technology.

[5]  Qin Li,et al.  A Reputation-Based Announcement Scheme for VANETs , 2012, IEEE Transactions on Vehicular Technology.

[6]  Josep Domingo-Ferrer,et al.  Trustworthy Privacy-Preserving Car-Generated Announcements in Vehicular Ad Hoc Networks , 2009, IEEE Transactions on Vehicular Technology.

[7]  Fernando A. Kuipers,et al.  An overview of constraint-based path selection algorithms for QoS routing , 2002 .

[8]  Pin-Han Ho,et al.  ECPP: Efficient Conditional Privacy Preservation Protocol for Secure Vehicular Communications , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[9]  Jianhua He,et al.  A Multihop Peer-Communication Protocol With Fairness Guarantee for IEEE 802.16-Based Vehicular Networks , 2007, IEEE Transactions on Vehicular Technology.

[10]  Gang Liu,et al.  A*Prune: an algorithm for finding K shortest paths subject to multiple constraints , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[11]  Siaw-Lynn Ng,et al.  Threshold Anonymous Announcement in VANETs , 2011, IEEE Journal on Selected Areas in Communications.

[12]  A. Festag,et al.  A Survey of Existing Approaches for Secure Ad Hoc Routing and Their Applicability to VANETS Version 1 . 1 June 2 , 2006 , 2006 .

[13]  Qiang Ni,et al.  An Evolving Graph-Based Reliable Routing Scheme for VANETs , 2013, IEEE Transactions on Vehicular Technology.

[14]  Marwan Krunz,et al.  Multi-constrained optimal path selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[15]  Omar Abdel Wahab,et al.  VANET QoS-OLSR: QoS-based clustering protocol for Vehicular Ad hoc Networks , 2013, Comput. Commun..