Graph-based resource allocation with conflict avoidance for V2V broadcast communications

Luis F. Abanto-Leon, Arie Koppelaar, Sonia Heemstra De Groot

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

3 Citaties (Scopus)
141 Downloads (Pure)

Uittreksel

In this paper we present a graph-based resource allocation scheme for sidelink broadcast vehicle-to-vehicle (V2V) communications. Harnessing information on the geographical position of vehicles and spectrum resources utilization, eNodeBs are capable of allotting the same set of sidelink resources to several different vehicles in order for them to broadcast their signals. Hence, vehicles sharing the same resources would ideally be in different communications clusters for the interference level - generated due to resource repurposing - to be maintained under control. Within a communications cluster, it is crucial that vehicles transmit in orthogonal time resources to prevent conflicts as vehicles - with half-duplex radio interfaces - cannot transmit and receive simultaneously. In this research, we have envisaged a solution based on a bipartite graph, where vehicles and spectrum resources are represented by vertices whereas the edges represent the achievable rate in each resource based on the signal-to-interference-plus-noise ratio (SINR) that vehicles perceive. The aforementioned constraint on time orthogonality of allocated resources can be approached by aggregating conflicting vertices into macro-vertices which, in addition, narrows the search space yielding a solution with computational complexity equivalent to the conventional graph matching problem. We show mathematically and through simulations that the proposed approach yields an optimal solution. In addition, we provide simulations showing that the proposed method outperforms other competing approaches, specially in scenarios with high vehicular density.

Originele taal-2Engels
Titel2017 IEEE International Symposium on Personal, Indoor and Mobile Radio Communications
SubtitelEngaged Citizens and their New Smart Worlds, PIMRC 2017 - Conference Proceedings
Plaats van productiePiscataway
UitgeverijInstitute of Electrical and Electronics Engineers
Pagina's1-7
Aantal pagina's7
ISBN van elektronische versie978-1-5386-3531-5
ISBN van geprinte versie978-1-5386-3529-2
DOI's
StatusGepubliceerd - 14 feb 2018
Evenement28th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2017) - Hotel Bonaventure, Montreal, Canada
Duur: 8 okt 201713 okt 2017
Congresnummer: 28
http://pimrc2017.ieee-pimrc.org/

Congres

Congres28th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2017)
Verkorte titelPIMRC 2017
LandCanada
StadMontreal
Periode8/10/1713/10/17
Internet adres

Vingerafdruk

Resource allocation
Communication
Vehicle to vehicle communications
Macros
Computational complexity

Citeer dit

Abanto-Leon, L. F., Koppelaar, A., & De Groot, S. H. (2018). Graph-based resource allocation with conflict avoidance for V2V broadcast communications. In 2017 IEEE International Symposium on Personal, Indoor and Mobile Radio Communications: Engaged Citizens and their New Smart Worlds, PIMRC 2017 - Conference Proceedings (blz. 1-7). Piscataway: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/PIMRC.2017.8292606
Abanto-Leon, Luis F. ; Koppelaar, Arie ; De Groot, Sonia Heemstra. / Graph-based resource allocation with conflict avoidance for V2V broadcast communications. 2017 IEEE International Symposium on Personal, Indoor and Mobile Radio Communications: Engaged Citizens and their New Smart Worlds, PIMRC 2017 - Conference Proceedings. Piscataway : Institute of Electrical and Electronics Engineers, 2018. blz. 1-7
@inproceedings{3055662fcd304ac684488f3e60219f39,
title = "Graph-based resource allocation with conflict avoidance for V2V broadcast communications",
abstract = "In this paper we present a graph-based resource allocation scheme for sidelink broadcast vehicle-to-vehicle (V2V) communications. Harnessing information on the geographical position of vehicles and spectrum resources utilization, eNodeBs are capable of allotting the same set of sidelink resources to several different vehicles in order for them to broadcast their signals. Hence, vehicles sharing the same resources would ideally be in different communications clusters for the interference level - generated due to resource repurposing - to be maintained under control. Within a communications cluster, it is crucial that vehicles transmit in orthogonal time resources to prevent conflicts as vehicles - with half-duplex radio interfaces - cannot transmit and receive simultaneously. In this research, we have envisaged a solution based on a bipartite graph, where vehicles and spectrum resources are represented by vertices whereas the edges represent the achievable rate in each resource based on the signal-to-interference-plus-noise ratio (SINR) that vehicles perceive. The aforementioned constraint on time orthogonality of allocated resources can be approached by aggregating conflicting vertices into macro-vertices which, in addition, narrows the search space yielding a solution with computational complexity equivalent to the conventional graph matching problem. We show mathematically and through simulations that the proposed approach yields an optimal solution. In addition, we provide simulations showing that the proposed method outperforms other competing approaches, specially in scenarios with high vehicular density.",
author = "Abanto-Leon, {Luis F.} and Arie Koppelaar and {De Groot}, {Sonia Heemstra}",
year = "2018",
month = "2",
day = "14",
doi = "10.1109/PIMRC.2017.8292606",
language = "English",
isbn = "978-1-5386-3529-2",
pages = "1--7",
booktitle = "2017 IEEE International Symposium on Personal, Indoor and Mobile Radio Communications",
publisher = "Institute of Electrical and Electronics Engineers",
address = "United States",

}

Abanto-Leon, LF, Koppelaar, A & De Groot, SH 2018, Graph-based resource allocation with conflict avoidance for V2V broadcast communications. in 2017 IEEE International Symposium on Personal, Indoor and Mobile Radio Communications: Engaged Citizens and their New Smart Worlds, PIMRC 2017 - Conference Proceedings. Institute of Electrical and Electronics Engineers, Piscataway, blz. 1-7, 28th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2017), Montreal, Canada, 8/10/17. https://doi.org/10.1109/PIMRC.2017.8292606

Graph-based resource allocation with conflict avoidance for V2V broadcast communications. / Abanto-Leon, Luis F.; Koppelaar, Arie; De Groot, Sonia Heemstra.

2017 IEEE International Symposium on Personal, Indoor and Mobile Radio Communications: Engaged Citizens and their New Smart Worlds, PIMRC 2017 - Conference Proceedings. Piscataway : Institute of Electrical and Electronics Engineers, 2018. blz. 1-7.

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

TY - GEN

T1 - Graph-based resource allocation with conflict avoidance for V2V broadcast communications

AU - Abanto-Leon, Luis F.

AU - Koppelaar, Arie

AU - De Groot, Sonia Heemstra

PY - 2018/2/14

Y1 - 2018/2/14

N2 - In this paper we present a graph-based resource allocation scheme for sidelink broadcast vehicle-to-vehicle (V2V) communications. Harnessing information on the geographical position of vehicles and spectrum resources utilization, eNodeBs are capable of allotting the same set of sidelink resources to several different vehicles in order for them to broadcast their signals. Hence, vehicles sharing the same resources would ideally be in different communications clusters for the interference level - generated due to resource repurposing - to be maintained under control. Within a communications cluster, it is crucial that vehicles transmit in orthogonal time resources to prevent conflicts as vehicles - with half-duplex radio interfaces - cannot transmit and receive simultaneously. In this research, we have envisaged a solution based on a bipartite graph, where vehicles and spectrum resources are represented by vertices whereas the edges represent the achievable rate in each resource based on the signal-to-interference-plus-noise ratio (SINR) that vehicles perceive. The aforementioned constraint on time orthogonality of allocated resources can be approached by aggregating conflicting vertices into macro-vertices which, in addition, narrows the search space yielding a solution with computational complexity equivalent to the conventional graph matching problem. We show mathematically and through simulations that the proposed approach yields an optimal solution. In addition, we provide simulations showing that the proposed method outperforms other competing approaches, specially in scenarios with high vehicular density.

AB - In this paper we present a graph-based resource allocation scheme for sidelink broadcast vehicle-to-vehicle (V2V) communications. Harnessing information on the geographical position of vehicles and spectrum resources utilization, eNodeBs are capable of allotting the same set of sidelink resources to several different vehicles in order for them to broadcast their signals. Hence, vehicles sharing the same resources would ideally be in different communications clusters for the interference level - generated due to resource repurposing - to be maintained under control. Within a communications cluster, it is crucial that vehicles transmit in orthogonal time resources to prevent conflicts as vehicles - with half-duplex radio interfaces - cannot transmit and receive simultaneously. In this research, we have envisaged a solution based on a bipartite graph, where vehicles and spectrum resources are represented by vertices whereas the edges represent the achievable rate in each resource based on the signal-to-interference-plus-noise ratio (SINR) that vehicles perceive. The aforementioned constraint on time orthogonality of allocated resources can be approached by aggregating conflicting vertices into macro-vertices which, in addition, narrows the search space yielding a solution with computational complexity equivalent to the conventional graph matching problem. We show mathematically and through simulations that the proposed approach yields an optimal solution. In addition, we provide simulations showing that the proposed method outperforms other competing approaches, specially in scenarios with high vehicular density.

UR - http://www.scopus.com/inward/record.url?scp=85045247095&partnerID=8YFLogxK

U2 - 10.1109/PIMRC.2017.8292606

DO - 10.1109/PIMRC.2017.8292606

M3 - Conference contribution

AN - SCOPUS:85045247095

SN - 978-1-5386-3529-2

SP - 1

EP - 7

BT - 2017 IEEE International Symposium on Personal, Indoor and Mobile Radio Communications

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway

ER -

Abanto-Leon LF, Koppelaar A, De Groot SH. Graph-based resource allocation with conflict avoidance for V2V broadcast communications. In 2017 IEEE International Symposium on Personal, Indoor and Mobile Radio Communications: Engaged Citizens and their New Smart Worlds, PIMRC 2017 - Conference Proceedings. Piscataway: Institute of Electrical and Electronics Engineers. 2018. blz. 1-7 https://doi.org/10.1109/PIMRC.2017.8292606