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 resource scheduling for heterogeneous vehicularnetworks, where some moving vehicles are selected and scheduled as helpingrelays to assist information transmission between the roadside infrastructureand other moving vehicles. For such a system, we propose a mobile-service basedmax-min fairness resource scheduling scheme, where service amount which is moresuitable for high mobility scenarios is adopted to characterize the informationtransmission capacity of the links and the max-min criteria is adopted to meetthe fairness requirement of the moving vehicles. Simulation results demonstratethe effectiveness of our proposed scheme. It is shown that our proposed schemearchives higher throughput and better fairness compared with random schedulingscheme and non relaying scheme.

Mobile-service based Max-Min Fairness Resource Scheduling for Heterogeneous Vehicular Networks