Literature Database Entry

duduku2016performance


V. Viswacheda Duduku, Ali Chekima and Jamal Ahmed Dargham, "Performance Evaluation of Proposed Secured Minimum Delay Routing Protocol (SMDRP) in Vehicular Adhoc Network," Proceedings of International Conference on Soft Computing and Pattern Recognition, Vellore, India, December 2016, pp. 322-329.

Abstract

In the present day research of vehicular Adhoc networks, the design of an efficient routing protocol providing high speed communications is a technical challenge for researchers in this area of study. A protocol that is secured, stable and reliable is an important aspect for the vehicular as hoc networks. The present day existing routing protocols designed for vehicular communications are not providing the required quality of service in VANETS and still research is going on for providing the full-fledged support for intra and inter vehicular communications. In our research we proposed a protocol called as Secured Minimum Delay Routing Protocol (SMDRP) by utilizing the clustering technique and location information using GPS. For the network performance we evaluated the different network parameters with protocols such as GPSR, CAGFP and GRUV using NS3 a network analyzing simulator. The simulation results show that SMDRP showed cost effective in terms of packet delivery ratio, throughput and end to end delay.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

V. Viswacheda Duduku
Ali Chekima
Jamal Ahmed Dargham

BibTeX reference

@inproceedings{duduku2016performance,
    author = {Duduku, V. Viswacheda and Chekima, Ali and Dargham, Jamal Ahmed},
    title = {{Performance Evaluation of Proposed Secured Minimum Delay Routing Protocol (SMDRP) in Vehicular Adhoc Network}},
    booktitle = {International Conference on Soft Computing and Pattern Recognition},
    pages = {322-329},
    year = {2016},
    month = {December},
    address = {Vellore, India},
    publisher = {Springer},
    doi = {10.1007/978-3-319-60618-7_32},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceeedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.