Adaptive priority and optimum parameters based relay vehicle selection scheme in vehicular ad hoc networks

Vehicular ad hoc networks are subjected to severe challenges in vehicle-to-infrastructure (communication as a result of intermittent connectivity, high mobility of vehicles, and ineffective data scheduling mechanisms. The current methods fail to optimize the delivery of messages because of fixed prioritization and the absence of adaptive scheduling policies. To address these problems, this paper introduces an adaptive priority and optimum parameters-based scheduling algorithm, which dynamically adjusts the priority of messages according to vehicle speed, data size, message deadline, and estimated valid connection time. The algorithm guarantees efficient handling of service requests by combining pre-judgment of connection feasibility with adaptive rescheduling. Experimental comparisons demonstrate that the proposed algorithm enhances data delivery ratio by 14.6%, lowers scheduling delay by 18.3%, and increases total system throughput by 21.7% over current state-of-the-art solutions.