In emerging non-safety unicast applications of vehicular ad hoc networks (VANETs) such as Internet Access, Content, Map, or Database Download (CMDD), end-to-end and connection-oriented transmission control must be employed to guarantee a desired level of performance. It is envisioned that in the future, these non-safety applications will involve several concurrent flows. Providing a fair distribution of goodput and bandwidth among these concurrent flows will therefore be crucial. To tackle this significant issue, in this paper we propose a Cooperative Routing Protocol (CROP) which, in conjunction with the local packet scheduling and queue management, can reduce the inherent unfairness of the transport layer as well as MAC protocol used in the DSRC standard. Our results show that the proposed cooperative routing concept provides significant improvement in terms of per-flow goodput, end-to-end delays, jitter, and fairness at the expense of a very small decrease in the overall system goodput.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Providing fairness between multiple flows in vehicular networks


    Contributors:


    Publication date :

    2015-12-01


    Size :

    1119609 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    VEHICULAR INFORMATION PROVIDING DEVICE AND VEHICULAR INFORMATION PROVIDING SYSTEM

    ASAI TOSHITAKA / SHIRATO TOSHIHARU | European Patent Office | 2019

    Free access


    VEHICULAR INFORMATION PROVIDING APPARATUS

    TAMURA SHIGEAKI | European Patent Office | 2019

    Free access

    VEHICULAR INFORMATION PROVIDING DEVICE

    TAMURA SHIGEAKI | European Patent Office | 2017

    Free access

    VEHICULAR INFORMATION PROVIDING DEVICE

    TAMURA SHIGEAKI | European Patent Office | 2016

    Free access