A two-stage resource allocation for SCMA-based C-V2X networks

Wei Wu; Tong Xue; Qie Wang; Shuai Han; Xuanli Wu

doi:10.1109/GLOBECOM38437.2019.9013535

A two-stage resource allocation for SCMA-based C-V2X networks

Wei Wu
, Tong Xue
, Qie Wang
, Shuai Han
, Xuanli Wu

School of Electronics and Information Engineering, Harbin Institute of Technology

Research output: Contribution to journal › Conference article › peer-review

6 Scopus citations

Abstract

The increasing demand for the internet of vehicle (IoV) services has prompted the prosperity of cellular-based vehicle-to-everything (C-V2X). This paper investigates the resource allocation in an uplink SCMA-enabled C-V2X network. At the aim to maximize the sum rate of cellular links in condition of guaranteeing the reliability of V2X links, we propose a Two-Stage space code multiple access (SCMA) codebook allocation algorithm. The complicated resource matching problem is transformed into a 2-D matching problem by using V2X grouping algorithm at first. Then a Matching-Auction-based codebook allocation algorithm is adopted to address the issue of matching conflict. Finally, numerical simulation results indicate that the proposed scheme outperforms in terms of the sum data transmission rate of the cellular links and the reliability of V2X links.

Original language	English
Article number	9013535
Journal	Proceedings - IEEE Global Communications Conference, GLOBECOM
DOIs	https://doi.org/10.1109/GLOBECOM38437.2019.9013535
State	Published - 2019
Externally published	Yes
Event	2019 IEEE Global Communications Conference, GLOBECOM 2019 - Waikoloa, United States Duration: 9 Dec 2019 → 13 Dec 2019

Keywords

C-V2X
Codebook resource allocation
Matching-auction
SCMA

Access to Document

10.1109/GLOBECOM38437.2019.9013535

Cite this

@article{560e3061a57740928e2429e10de87923,

title = "A two-stage resource allocation for SCMA-based C-V2X networks",

abstract = "The increasing demand for the internet of vehicle (IoV) services has prompted the prosperity of cellular-based vehicle-to-everything (C-V2X). This paper investigates the resource allocation in an uplink SCMA-enabled C-V2X network. At the aim to maximize the sum rate of cellular links in condition of guaranteeing the reliability of V2X links, we propose a Two-Stage space code multiple access (SCMA) codebook allocation algorithm. The complicated resource matching problem is transformed into a 2-D matching problem by using V2X grouping algorithm at first. Then a Matching-Auction-based codebook allocation algorithm is adopted to address the issue of matching conflict. Finally, numerical simulation results indicate that the proposed scheme outperforms in terms of the sum data transmission rate of the cellular links and the reliability of V2X links.",

keywords = "C-V2X, Codebook resource allocation, Matching-auction, SCMA",

author = "Wei Wu and Tong Xue and Qie Wang and Shuai Han and Xuanli Wu",

note = "Publisher Copyright: {\textcopyright} 2019 IEEE.; 2019 IEEE Global Communications Conference, GLOBECOM 2019 ; Conference date: 09-12-2019 Through 13-12-2019",

year = "2019",

doi = "10.1109/GLOBECOM38437.2019.9013535",

language = "英语",

journal = "Proceedings - IEEE Global Communications Conference, GLOBECOM",

issn = "2334-0983",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - A two-stage resource allocation for SCMA-based C-V2X networks

AU - Wu, Wei

AU - Xue, Tong

AU - Wang, Qie

AU - Han, Shuai

AU - Wu, Xuanli

PY - 2019

Y1 - 2019

N2 - The increasing demand for the internet of vehicle (IoV) services has prompted the prosperity of cellular-based vehicle-to-everything (C-V2X). This paper investigates the resource allocation in an uplink SCMA-enabled C-V2X network. At the aim to maximize the sum rate of cellular links in condition of guaranteeing the reliability of V2X links, we propose a Two-Stage space code multiple access (SCMA) codebook allocation algorithm. The complicated resource matching problem is transformed into a 2-D matching problem by using V2X grouping algorithm at first. Then a Matching-Auction-based codebook allocation algorithm is adopted to address the issue of matching conflict. Finally, numerical simulation results indicate that the proposed scheme outperforms in terms of the sum data transmission rate of the cellular links and the reliability of V2X links.

AB - The increasing demand for the internet of vehicle (IoV) services has prompted the prosperity of cellular-based vehicle-to-everything (C-V2X). This paper investigates the resource allocation in an uplink SCMA-enabled C-V2X network. At the aim to maximize the sum rate of cellular links in condition of guaranteeing the reliability of V2X links, we propose a Two-Stage space code multiple access (SCMA) codebook allocation algorithm. The complicated resource matching problem is transformed into a 2-D matching problem by using V2X grouping algorithm at first. Then a Matching-Auction-based codebook allocation algorithm is adopted to address the issue of matching conflict. Finally, numerical simulation results indicate that the proposed scheme outperforms in terms of the sum data transmission rate of the cellular links and the reliability of V2X links.

KW - C-V2X

KW - Codebook resource allocation

KW - Matching-auction

KW - SCMA

UR - https://www.scopus.com/pages/publications/85081974840

U2 - 10.1109/GLOBECOM38437.2019.9013535

DO - 10.1109/GLOBECOM38437.2019.9013535

M3 - 会议文章

AN - SCOPUS:85081974840

SN - 2334-0983

JO - Proceedings - IEEE Global Communications Conference, GLOBECOM

JF - Proceedings - IEEE Global Communications Conference, GLOBECOM

M1 - 9013535

T2 - 2019 IEEE Global Communications Conference, GLOBECOM 2019

Y2 - 9 December 2019 through 13 December 2019

ER -

A two-stage resource allocation for SCMA-based C-V2X networks

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this