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

A Distance-Aware Safety-Related Message Broadcasting Algorithm for Vehicular Networks

Author

Listed:
  • Xiaohuan Li
  • Bin-jie Hu
  • Hongbin Chen
  • Jin Ye

Abstract

A new distance-aware broadcasting algorithm was proposed to enhance the propagation distance in the latency time of safety-related message broadcasting. The IEEE 802.11p standard states that if the medium is detected as idle, a station would defer its transmission within a backoff time to avoid collisions with other stations. The backoff times follow uniform distribution over [0, CW ]. In this way, fairness among all the stations can be guaranteed. However, propagation distance was ignored and in safety-related message broadcasting fairness is not the most important issue. In the proposed algorithm, the lengths of backoff times are generated from a nonuniform distribution. They are related with the distances between the source station and its forwarding stations. The farthest forwarding station has the highest probability to forward messages. Performance of the proposed algorithm is analyzed by using a 2D Markov chain. Analytical and simulation results demonstrate that the proposed algorithm can enhance the performance of safety-related message broadcasting in terms of propagation distance, which is reflected by the successful transmission probability. The proposed algorithm does not need additional waiting time, RTS/CTS, and ACK, therefore having better compatibility with the IEEE 802.11p standard than earlier distance-aware algorithms.

Suggested Citation

  • Xiaohuan Li & Bin-jie Hu & Hongbin Chen & Jin Ye, 2014. "A Distance-Aware Safety-Related Message Broadcasting Algorithm for Vehicular Networks," International Journal of Distributed Sensor Networks, , vol. 10(2), pages 139857-1398, February.
  • Handle: RePEc:sae:intdis:v:10:y:2014:i:2:p:139857
    DOI: 10.1155/2014/139857
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/139857
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/139857?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:10:y:2014:i:2:p:139857. 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.