English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper investigates the downlink scheduling for relay-aided high-mobilityvehicular networks, where the vehicles with good vehicle-to-infrastructure(V2I) links are employed as cooperative relay nodes to help the ones with poorV2I links forward information via vehicle-to-vehicle (V2V) links. In existingworks, instantaneous achievable information rate was widely adopted to performthe link scheduling, but it is not efficient for vehicular networks, especiallyfor high-mobility scenarios. Different from them, in this paper, we introducethe mobile service to describe the mobile link capacity of vehicular networksand then we propose a mobile service based relaying scheduling (MSRS) for highmobility vehicular networks. In order to explore the system informationtransmission performance limit, we formulate an optimization problem tomaximize the mobile service amount of MSRS by jointly scheduling the V2I andV2V links. Since it is a combinational optimization problem which is toocomplex to solve, we design an efficient algorithm with low-complexity for it,where Sort-then-Select, Hungarian algorithm and Bisection search are employed.Simulation results demonstrate that our proposed MSRS is able to achieve theoptimal results with an optimal approximation ratio larger than 96.5%. It isalso shown that our proposed MSRS is much more efficient for high-mobilityvehicular systems, which can improve the system average throughput withincrement of 3.63% compared with existing instantaneous achievable informationrate based scheduling method, and with 15% increment compared with traditionalnon-cooperation scheduling method, respectively.

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