Cooperative Temporal Data Dissemination in SDN-Based Heterogeneous Vehicular Networks

摘要

Heterogeneous network resources are expected to cooperate with each other to support temporal data services in vehicular networks. However, it is challenging to implement an efficient data scheduling strategy due to the following factors: first, there are different time constraints on services, which are imposed by the application requirements of both temporal data quality and transmission delay; second, the heterogeneity of wireless interfaces further complicates the transmission task assignment in dynamic vehicular environments. Therefore, this paper proposes an software-defined network-based architecture to enable unified management on heterogeneous network resources. Then, we formulate the cooperative temporal data dissemination (CTDD) problem by considering the property of temporal data, the heterogeneity of wireless interfaces, and the delay constraints on service requests. Further, we prove the NP-hardness of the CTDD by constructing a polynomial-time reduction from a well know NP-hard problem, classical knapsack problem. On this basis, we design a heuristic algorithm called priority-based task assignment (PTA), which synthesizes dynamic task assignment, broadcast efficiency, and service deadline into priority design. Accordingly, PTA is able to adaptively distribute broadcast tasks of each request among multiple interfaces, so as to improve overall system performance. Last but not least, we build the simulation model and implement the proposed algorithm. The comprehensive simulation results show the superiority of the proposed algorithm under a wide range of scenarios.