Cooperative coding and caching scheduling via binary particle swarm optimization in software-defined vehicular networks

Published: 2021, Last Modified: 04 Jan 2026Neural Comput. Appl. 2021EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: With recent development in vehicular communication technologies, much attention has been paid to data dissemination in vehicular networks. In particular, the infrastructure-to-vehicle (I2V) communication is one of the primary technologies to provide a variety of information services. To enhance the bandwidth efficiency of I2V communication, this work considers in a software-defined vehicular networks (SDVN), aiming at exploiting synergistic effects of network coding and vehicular caching. First, we consider a data service scenario in which roadside unites (RSUs) are connected with the controller, which exercises scheduling decisions based on service requests received from vehicles. On this basis, we formulate a cooperative coding and caching scheduling problem with the objective of maximizing the bandwidth efficiency of I2V communication. Then, we propose a binary particle swarm optimization (BPSO)-based coding scheduling (BPSO_CS) algorithm. Finally, we build the simulation model and give a comprehensive performance evaluation. The results conclusively demonstrate the superiority of the proposed solution.
Loading