Literature Database Entry

malik2017efficient

Arun Malik and Babita Pandey, "An Efficient and Reliable Data Gathering Protocol Based on RSU Identification," in Advanced Informatics for Computing Research, Springer, 2017, pp. 343–354.

Abstract

Vehicular Ad hoc Networks (VANETs) can act as an essential platform for providing various types of safety and non-safety applications by collecting the data sensed by the vehicles during their journey. To collect data in an efficient manner exclusive of network congestion is a very challenging task. In this paper, an efficient data gathering protocol based on Road side unit (RSU) identification approach is proposed for collecting the essential data sensed by the vehicle during their journey in an efficient manner without network congestion. The proposed protocol is able to reduce the communication overhead and average delay and capable of increasing the packet delivery ratio. Moreover, the proposed protocol is compared with the RSU activated data gathering protocol based on beacon broadcast. With the help of simulation results it has been identified that the proposed data gathering protocol considerably improves the efficiency of data collection as compared to RSU activated data gathering protocol based on beacon broadcast on the basis of communication overhead, average delay and packet delivery ratio.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

Arun Malik
Babita Pandey

BibTeX reference

@incollection{malik2017efficient,
    author = {Malik, Arun and Pandey, Babita},
    doi = {10.1007/978-981-10-5780-9_31},
    title = {{An Efficient and Reliable Data Gathering Protocol Based on RSU Identification}},
    pages = {343--354},
    booktitle = {Advanced Informatics for Computing Research},
    publisher = {Springer},
    year = {2017},
   }
   
   

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 proceedings 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.