Interference graph-based resource-sharing schemes for vehicular networks

Rongqing Zhang*, Xiang Cheng, Qi Yao, Cheng-Xiang Wang, Yang Yang, Bingli Jiao

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

105 Citations (Scopus)

Abstract

This paper investigates the resource-sharing problem in vehicular networks, including both vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication links. A novel underlaying resource-sharing communication mode for vehicular networks is proposed, in which different V2V and V2I communication links are permitted to access the same resources for their individual data transmission. To solve the resource-sharing problem in vehicular networks, we, for the first time, apply graph theory and propose the following two interference graph-based resource-sharing schemes: 1) the interference-aware graph-based resource-sharing scheme and 2) the interference-classified graph-based resource-sharing scheme. Compared with the traditional orthogonal communication mode in vehicular networks, the proposed two resource-sharing schemes express better network sum rate. The utility of the proposed V2V and V2I underlaying communication mode and the two proposed interference graph-based resource-sharing schemes are verified by simulations.

Original languageEnglish
Pages (from-to)4028-4039
Number of pages12
JournalIEEE Transactions on Vehicular Technology
Volume62
Issue number8
DOIs
Publication statusPublished - Oct 2013

Keywords

  • Interference-aware graph
  • interference-classified graph
  • resource sharing
  • vehicle-to-infrastructure (V2I) communication
  • vehicle-to-vehicle (V2V) communication
  • TO-DEVICE COMMUNICATION
  • AD HOC NETWORKS
  • CHANNEL ALLOCATION
  • COMPLEXITY
  • GEOMETRY

Fingerprint

Dive into the research topics of 'Interference graph-based resource-sharing schemes for vehicular networks'. Together they form a unique fingerprint.

Cite this