Downlink Traffic Scheduling with Contact Durations Awareness for Vehicular Infrastructures

Zhongjiang Yan and Bo Li

International Journal of Distributed Sensor Networks, 2014, vol. 10, issue 11, 451372

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.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2014/451372 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:10:y:2014:i:11:p:451372

DOI: 10.1155/2014/451372

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().