Be Stable and Fair: Robust Data Scheduling for Vehicular Networks

Abstract

The stable and fair data transmission of vehicular networks can improve transport efficiency and reduce traffic accident. It is challenging to ensure the stability and fairness of data transmission in dynamic vehicular networks. However, existing works based on opportunistic scheduling cannot support reliable transmission since stability and fairness are difficult to be guaranteed at the same time. In this paper, we propose a stable scheduling scheme for dynamic vehicular networks based on fair allocation of available channel resources. We formulate the problem of stability and fairness as network utility maximization, and propose an algorithm, called SF-NUM, to solve it. SF-NUM uses the stability scheduling method based on back pressure vector for the first time in vehicular networks. In order to achieve the fairness distribution of channel resources of the vehicular networks in the distributed computing way, multiple factors are considered in the SF-NUM algorithm. The experimental results show that the proposed algorithm outperforms other algorithms.