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

A Network Coding Based Rarest-First Packet Recovery Algorithm for Transmitting Geocast Packets over Hybrid Sensor-Vehicular Networks

Author

Listed:
  • Tz-Heng Hsu
  • Ying-Chen Lo

Abstract

Vehicular ad hoc network (VANET) and road-side sensors are used to improve driving safety in many applications. Sensor nodes deployed along the roadside are used to sense road conditions and then deliver information about dangerous conditions to vehicles. In hybrid sensor-vehicular networks, new challenges arise and should be addressed. Geocasting can be used to perform the regional broadcast to deliver geographic-related safety, commercials, and advertisements messages. The challenging problem in geocasting is how to deliver packets to all the nodes within the geocast region with high efficiency but low overhead. Network coding is a special in-network data-processing technique that can potentially increase the network capacity and packet throughput in wireless networking environments. In this paper, a network coding based rarest-first packet recovery algorithm for transmitting geocast packets over hybrid sensor-vehicular-networks is proposed. The proposed algorithm can increase packet delivered ratio at each mobile node. As a result, the safety and transmission efficiency can be achieved simultaneously.

Suggested Citation

  • Tz-Heng Hsu & Ying-Chen Lo, 2012. "A Network Coding Based Rarest-First Packet Recovery Algorithm for Transmitting Geocast Packets over Hybrid Sensor-Vehicular Networks," International Journal of Distributed Sensor Networks, , vol. 8(4), pages 954398-9543, April.
    • Handle: RePEc:sae:intdis:v:8:y:2012:i:4:p:954398
    DOI: 10.1155/2012/954398
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2012/954398
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2012/954398?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:8:y:2012:i:4:p:954398. 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.