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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Vehicular networks are a cornerstone of the envisioned intelligent transportation system (ITS) by enabling vehicles to communicate with each other via vehicle-to-vehicle (V2V) communications to overcome the current and future needs for increasing traffic safety and efficiency. In this paper, we employ the knapsack problem (KP) to formulate the problem of cooperative scheduling and radio resource management in vehicular networks for non-real time services. For the sake of maximizing sum utility (MSU) of the networks, we propose two-dimensional-multi-choice knapsack problem (2D-MCKP)-based scheduling scheme to select the coordinator vehicles for the sink vehicle and allocate radio resource to V2V and vehicle-to-infrastructure (V2I) links to solve the MSU optimization problem. Simulation results indicate that the proposed scheme significantly improves the average utility and average data rates with sustainable computational complexity. Moreover, the designed cooperative communication system achieves higher spectral efficiency and better fairness.

Joint optimization of link scheduling and resource allocation in cooperative vehicular networks