DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/18742
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDua, Amit-
dc.date.accessioned2025-04-23T05:18:08Z-
dc.date.available2025-04-23T05:18:08Z-
dc.date.issued2014-01-
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S2214209614000059-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/18742-
dc.description.abstractVehicular Ad Hoc Networks (VANETs) have emerged as a new powerful technology with an aim of providing safety for the persons sitting in the vehicles. Vehicles may be connected to the Internet with/without the existing infrastructure using various IEEE standards such as IEEE 802.11p. But as nodes in VANETs have very high mobility, so there are lots of challenges to route the packets to their final destination which need to be addressed by existing/proposing new solutions for the same. Keeping in view of the above, this paper provides a detailed description of various existing routing techniques in literature with an aim of selecting a particular strategy depending upon its applicability in a particular application. A detailed categorization of various routing techniques is provided in the paper with critical discussion on each categorization with respect to its advantages, disadvantages, various constraints and applications. Finally, numbers of parameters are selected for comparison and analysis of all the existing routing schemes in the literatureen_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.subjectComputer Scienceen_US
dc.subjectVANETs (Vehicular Ad Hoc Networks)en_US
dc.subjectRoutingen_US
dc.subjectMobilityen_US
dc.titleA systematic review on routing protocols for vehicular Ad Hoc networksen_US
dc.typeArticleen_US
Appears in Collections:Department of Computer Science and Information Systems

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.