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

Downlink Traffic Scheduling with Contact Durations Awareness for Vehicular Infrastructures

Author

Listed:
  • Zhongjiang Yan
  • Bo Li

Abstract

The vehicular infrastructures or roadside units (RSUs) in vehicular delay tolerant networks (VDTNs) can be used as the gateways of the distributed sensor networks. The different classes of service (CoS) support are desired when more than one type of the sensed data are collected by the RSUs. In this paper, the CoS support traffic scheduling problem for the RSU in VDTNs is considered. By exploring the contact information between the vehicles and the RSU, the CoS traffic scheduling problem is formulated as a maximum weighted triple matching problem, where the traffic scheduling strategy is a timeslot-vehicle-traffic matched pair. A flow network based method is proposed to optimally solve the maximum weighted triple matching problem. Both the offline version and the online version of the traffic scheduling algorithm are developed. Extensive simulations are conducted and the simulation results show the effectiveness and efficiency of the proposed flow network based algorithms.

Suggested Citation

  • Zhongjiang Yan & Bo Li, 2014. "Downlink Traffic Scheduling with Contact Durations Awareness for Vehicular Infrastructures," International Journal of Distributed Sensor Networks, , vol. 10(11), pages 451372-4513, November.
  • Handle: RePEc:sae:intdis:v:10:y:2014:i:11:p:451372
    DOI: 10.1155/2014/451372
    as

    Download full text from publisher

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

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