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

An Efficient Emergency Message Broadcasting Scheme in Vehicular Ad Hoc Networks

Author

Listed:
  • Hayder Salman Dawood
  • Yuming Wang

Abstract

Broadcasting of emergency message (EM) in the vehicular Ad hoc networks (VANETs) plays a significant role in safety applications, which require immediate broadcasting of EM to the relevant vehicles located in the risk zone (RZ). This paper proposes an efficient emergency message broadcasting (EEMB) scheme in VANETs. This scheme aims at avoiding multiple accidents and reducing traffic jams by broadcasting EM at high speed and with low overhead. When an accident takes place, the crashed vehicle (CV) will choose the best relayer(s) and broadcast the EM. The relayer will also choose the best next relayer(s) and rebroadcast the EM further. This process continues until the EM covers the whole RZ. The EEMB scheme reduces the overhead caused by beacons by using the prediction method. Our proposed scheme also overcomes the network fragmentation problem either by choosing the vehicles moving in the opposite direction as the relayer(s) if there are no vehicles in the same direction or by using the store-carry-forward (SCF) mechanism when there are no vehicles moving in both directions. The simulation results have shown that the proposed scheme has better performance in terms of the risk zone latency (RZL) and the beacons overhead (BCO).

Suggested Citation

  • Hayder Salman Dawood & Yuming Wang, 2013. "An Efficient Emergency Message Broadcasting Scheme in Vehicular Ad Hoc Networks," International Journal of Distributed Sensor Networks, , vol. 9(11), pages 232916-2329, November.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:11:p:232916
    DOI: 10.1155/2013/232916
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/232916
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/232916?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:11:p:232916. 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.