Mobile Service Amount Based Link Scheduling for High-Mobility Cooperative Vehicular Networks

This paper investigates the link scheduling for relay-aided high-mobility vehicular networks, where the vehicles with good vehicle-to-infrastructure (V2I) links are employed as cooperative relay nodes to help forward information to the ones with poor V2I links over vehicle-to-vehicle (V2V) links. To overcome the inefficiency of current instantaneous information rate based link scheduling (IIR-LS) method, especially in high-mobility scenarios, we propose a mobile service amount based link scheduling (MSA-LS) for high-mobility vehicular networks. We formulate an optimization problem to maximize the MSA of MSA-LS by jointly scheduling the V2I and V2V links. Since the resulted combinational optimization problem is too complex to solve, we design an efficient low-complexity algorithm, where Sort-then-Select, Hungarian algorithm, and Bisection search are employed. Simulation results demonstrate that our proposed MSA-LS is able to achieve new optimal performance. It is also shown that our proposed MSA-LS is much more efficient for high-mobility vehicular systems, which can improve the system average throughput with increment of about 13% compared with existing IIR-LS and with about 22% increment compared with traditional non-cooperation scheduling.