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

Traffic-Aware Data Delivery Scheme for Urban Vehicular Sensor Networks

Author

Listed:
  • Chunmei Ma
  • Nianbo Liu

Abstract

Vehicular sensor network (VSN) is a promising technology which could be widely applied to monitor the physical world in urban areas. In such a scenario, the efficient data delivery plays a central role. Existing schemes, however, cannot choose an optimal route, since they either ignore the impact of vehicular distribution on connectivity, or make some unreasonable assumptions on vehicular distribution. In this paper, we propose a traffic-aware data delivery scheme (TADS). The basic idea of TADS is to choose intersections to forward packets dynamically as the route from a source to destination based on link quality and remaining Euclidean distance to destination. Specifically, we first present an optimal utility function as the criteria of intersection selection. Besides the packet forwarding through intersections, we also propose an improved geographically greedy routing algorithm for packet forwarding in straightway mode. Moreover, in order to decrease the routing overhead brought by the traffic information gathering, we build a traffic condition prediction model to estimate the link quality. The simulation results show that our TADS outperforms existing works on packet delivery ratio, end-to-end delay, and routing overhead.

Suggested Citation

  • Chunmei Ma & Nianbo Liu, 2013. "Traffic-Aware Data Delivery Scheme for Urban Vehicular Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 9(1), pages 101878-1018, January.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:1:p:101878
    DOI: 10.1155/2013/101878
    as

    Download full text from publisher

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

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