Downlink traffic scheduling with contact durations awareness for vehicular infrastructures

Zhongjiang Yan, Bo Li

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Article number451372
JournalInternational Journal of Distributed Sensor Networks
Volume2014
DOIs
StatePublished - 2014

Fingerprint

Dive into the research topics of 'Downlink traffic scheduling with contact durations awareness for vehicular infrastructures'. Together they form a unique fingerprint.

Cite this