Literature Database Entry


D. Puthal, Z.H. Mir, F. Filali and H. Menouar, "Cross-layer architecture for congestion control in Vehicular Ad-hoc Networks," Proceedings of 2nd International Conference on Connected Vehicles & Expo (ICCVE 2013), Las Vegas, NV, December 2013, pp. 887–892.


nodes, Vehicular Ad-hoc Networks (VANETs) are special kind of Mobile Ad-hoc Networks (MANETs). The distinctive characteristics of the VANETs include high speed of vehicular and detection, high variability in node density. Congestion and performance, control protocols have been proved to be an efficient method for improving network and are well studied for the MANET environment. However, they often result in sub-optimal network performance for the vehicular network environment due to the specialized characteristics of VANET. In this paper we present an adaptive and detection, distributed cross-layer congestion and control protocol for the VANET environment. During the congestion detection phase, information from each layer of the network protocol stack is combined and mapped on to congestion levels. In the subsequent congestion control phase parameters like contention window, transmission rate and analysis, transmit power are jointly adjusted to improve on the network performance. The effectiveness of the proposed model is evaluated through mathematical and studies., simulation-based

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX


D. Puthal
Z.H. Mir
F. Filali
H. Menouar

BibTeX reference

    address = {Las Vegas, NV},
    author = {Puthal, D. and Mir, Z.H. and Filali, F. and Menouar, H.},
    booktitle = {2nd International Conference on Connected Vehicles \& Expo (ICCVE 2013)},
    doi = {10.1109/ICCVE.2013.6799921},
    month = {12},
    pages = {887--892},
    publisher = {Institute of Electrical and Electronics Engineers},
    title = {{Cross-layer architecture for congestion control in Vehicular Ad-hoc Networks}},
    year = {2013},

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

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

This page was automatically generated using BibDB and bib2web.