IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v9y2013i8p932673.html
   My bibliography  Save this article

A Proximity-Based Concurrent Access Strategy to Improve Throughput in VANETs

Author

Listed:
  • Chen Chen
  • Qingqi Pei
  • Yanan Jin
  • Shengjin Ge
  • Xiaoji Li
  • Weizhi Dai

Abstract

Intervehicle communication gives vehicles opportunities to exchange packets within limited transmission ranges and self-organize with ad hoc manner into VANETs (vehicular ad hoc networks). However, due to shared spectrum and present collisions' resolution mechanism which reject new admissions when wireless medium is busy, communications between vehicles have experienced severe throughput degradation and been restrained for concurrent transmissions. In this paper, a PCM (proximity-based concurrent transmission MAC) protocol has been proposed to permit concurrent access in shared channel for improving goodput in VANETs. By introducing game theory to the concurrent transmission opportunities determination process, PCM could provide extra access chances between active nodes or vehicles based on our defined proximity. To make PCM practical, we further give a detailed implementation method on NS2 to evaluate its performance. Numerical results show that PCM is not only feasible and reasonable in theory, but also has great improvement on average transmission delay, delivery ratio, and throughput performance in test.

Suggested Citation

  • Chen Chen & Qingqi Pei & Yanan Jin & Shengjin Ge & Xiaoji Li & Weizhi Dai, 2013. "A Proximity-Based Concurrent Access Strategy to Improve Throughput in VANETs," International Journal of Distributed Sensor Networks, , vol. 9(8), pages 932673-9326, August.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:8:p:932673
    DOI: 10.1155/2013/932673
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/932673
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/932673?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:9:y:2013:i:8:p:932673. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.