2018
DOI: 10.1109/twc.2018.2827958
|View full text |Cite
|
Sign up to set email alerts
|

Graph-Based Resource Sharing in Vehicular Communication

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

1
172
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
6
2
1

Relationship

2
7

Authors

Journals

citations
Cited by 164 publications
(173 citation statements)
references
References 30 publications
1
172
0
Order By: Relevance
“…Sum ergodic capacity of V2I links has been maximized with V2V reliability guarantee using large-scale fading channel information in [17] or CSI from periodic feedback in [18]. A novel graph-based approach has been further developed in [19] to deal with a generic V2X resource allocation problem.…”
Section: B Related Workmentioning
confidence: 99%
“…Sum ergodic capacity of V2I links has been maximized with V2V reliability guarantee using large-scale fading channel information in [17] or CSI from periodic feedback in [18]. A novel graph-based approach has been further developed in [19] to deal with a generic V2X resource allocation problem.…”
Section: B Related Workmentioning
confidence: 99%
“…Sun et al [8] propose a cluster-based resource allocation algorithm for V2X communications, where the latency and reliability requirements are transformed into outage constraints that can be tractable with slowly varying large-scale channel information. In [9], the ergodic capacity of V2I communications and the reliability of V2V communications are derived based on statistics of fast fading components, and then centralized resource allocation and power control algorithms are proposed to ensure diverse QoS requirements. Besides, impacts of delayed channel state information (CSI) and queue latency are investigated for cellular V2X communications in [10], [11], respectively.…”
Section: A Related Work and Chanllengesmentioning
confidence: 99%
“…denotes achievable data rate of V2V pair k. On the other hand, similar to [9], we denote outage probability as reliability metric. With outage threshold γ o and tolerable outage probability p o , the reliability requirement of V2V pair k ∈ K is expressed as…”
Section: B Qos Requirements Of I-vues and V2v Pairsmentioning
confidence: 99%
“…For the centralized schemes, decisions are usually made centrally at a given node, such as the head in a cluster or the base station (BS) in a given coverage area. Novel graph-based resource allocation schemes have been proposed in [8] and [9] to maximize the vehicle-to-infrastructure (V2I) capacity, exploiting the slow fading statistics of channel state information (CSI). In [10], an interference hyper-graph based resource allocation scheme has been developed in the non-orthogonal multiple access (NOMA)-integrated V2X scenario with the distance, channel gain, and interference known in each vehicle-to-vehicle (V2V) and V2I group.…”
mentioning
confidence: 99%