Hyppää sisältöön
    • FI
    • ENG
  • FI
  • /
  • EN
OuluREPO – Oulun yliopiston julkaisuarkisto / University of Oulu repository
Näytä viite 
  •   OuluREPO etusivu
  • Oulun yliopisto
  • Avoin saatavuus
  • Näytä viite
  •   OuluREPO etusivu
  • Oulun yliopisto
  • Avoin saatavuus
  • Näytä viite
JavaScript is disabled for your browser. Some features of this site may not work without it.

Dynamic proximity-aware resource allocation in vehicle-to-vehicle (V2V) communications

Ashraf, Muhammad Ikram; Bennis, Mehdi; Perfecto, Cristina; Saad, Walid (2017-02-09)

 
Avaa tiedosto
nbnfi-fe2018080133237.pdf (389.9Kt)
nbnfi-fe2018080133237_meta.xml (31.47Kt)
nbnfi-fe2018080133237_solr.xml (34.01Kt)
Lataukset: 

URL:
https://doi.org/10.1109/GLOCOMW.2016.7848885

Ashraf, Muhammad Ikram
Bennis, Mehdi
Perfecto, Cristina
Saad, Walid
Institute of Electrical and Electronics Engineers
09.02.2017

M. I. Ashraf, M. Bennis, C. Perfecto and W. Saad, "Dynamic Proximity-Aware Resource Allocation in Vehicle-to-Vehicle (V2V) Communications," 2016 IEEE Globecom Workshops (GC Wkshps), Washington, DC, 2016, pp. 1-6. doi: 10.1109/GLOCOMW.2016.7848885

https://rightsstatements.org/vocab/InC/1.0/
© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
https://rightsstatements.org/vocab/InC/1.0/
doi:https://doi.org/10.1109/GLOCOMW.2016.7848885
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi-fe2018080133237
Tiivistelmä

Abstract

In this paper, a novel proximity and load-aware resource allocation for vehicle-to-vehicle (V2V) communication is proposed. The proposed approach exploits the spatio-temporal traffic patterns, in terms of load and vehicles’ physical proximity, to minimize the total network cost which captures the tradeoffs between load (i.e., service delay) and successful transmissions while satisfying vehicles’ quality-of-service (QoS) requirements. To solve the optimization problem under slowly varying channel information, it is decoupled the problem into two interrelated sub-problems. First, a dynamic clustering mechanism is proposed to group vehicles in zones based on their traffic patterns and proximity information. Second, a matching game is proposed to allocate resources for each V2V pair within each zone. The problem is cast as many-to-one matching game in which V2V pairs and resource blocks (RBs) rank one another in order to minimize their service delay. The proposed game is shown to belong to the class of matching games with externalities. To solve this game, a distributed algorithm is proposed using which V2V pairs and RBs interact to reach a stable matching. Simulation results for a Manhattan model shown that the proposed scheme yields a higher percentage of V2V pairs satisfying QoS as well as significant gain in terms of the signal-to- interference-plus-noise ratio (SINR) as compared to a state-of-art resource allocation baseline.

Kokoelmat
  • Avoin saatavuus [37798]
oulurepo@oulu.fiOulun yliopiston kirjastoOuluCRISLaturiMuuntaja
SaavutettavuusselosteTietosuojailmoitusYlläpidon kirjautuminen
 

Selaa kokoelmaa

NimekkeetTekijätJulkaisuajatAsiasanatUusimmatSivukartta

Omat tiedot

Kirjaudu sisäänRekisteröidy
oulurepo@oulu.fiOulun yliopiston kirjastoOuluCRISLaturiMuuntaja
SaavutettavuusselosteTietosuojailmoitusYlläpidon kirjautuminen