Data Dissemination via I2V/V2V Communications in Software Defined Vehicular Networks

This chapter presents the study on scheduling for cooperative data dissemination in a hybrid I2V and V2V communication environment. We formulate the novel problem of Cooperative Data Scheduling (CDS). Each vehicle informs the RSU the list of its current neighboring vehicles and the identifiers of the retrieved and newly requested data. The RSU then selects sender and receiver vehicles and corresponding data for V2V communication, while it simultaneously broadcasts a data item to vehicles that are instructed to tune in to the I2V channel. The goal is to maximize the number of vehicles that retrieve their requested data. We prove that CDS is NP-hard by constructing a polynomial-time reduction from the Maximum Weighted Independent Set (MWIS) problem. Scheduling decisions are made by transforming CDS to MWIS and using a greedy method to approximately solve MWIS. We build a simulation model based on realistic traffic and communication characteristics and demonstrate the superiority and scalability of the proposed solution.