Literature Database Entry

qureshi2014congestion


K.N. Qureshi, A.H. Abdullah and R.W. Anwar, "Congestion control scheduling scheme for vehicular networks," Proceedings of 2014 International Conference on Information Technology and Multimedia (ICIMU 2014), Putrajaya, Malaysia, Nov 2014, pp. 55-59.

Abstract

The vehicular Ad hoc network is new emerging technology to enhance traffic safety and comfort for automotive users. Most of the safety applications in this field need real time information with high reliability and in time delivery. In dense network a large number of vehicles nodes disseminate the messages to all accessible nodes with high frequency and control channels will be easily congested and cause of broadcast storm. There is a need to prevent control channels from these types of storms and ensure the reliable and in time devilry of messages for safety applications. The congestion control mechanism is one of the most popular approach to control the load and ensure in time and efficient delivery of messages. We proposed a congestion control scheduling scheme to provide an efficient operation, congestion avoidance or mitigation. The performance of proposed scheme is evaluated in different congested scenarios and compared with existing congestion control scheduling schemes and improve packet loss rate and packet delay.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

K.N. Qureshi
A.H. Abdullah
R.W. Anwar

BibTeX reference

@inproceedings{qureshi2014congestion,
    author = {Qureshi, K.N. and Abdullah, A.H. and Anwar, R.W.},
    title = {{Congestion control scheduling scheme for vehicular networks}},
    booktitle = {2014 International Conference on Information Technology and Multimedia (ICIMU 2014)},
    pages = {55-59},
    year = {2014},
    month = {Nov},
    address = {Putrajaya, Malaysia},
    publisher = {IEEE},
    doi = {10.1109/ICIMU.2014.7066603},
   }
   
   

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.