Resource allocation for V2X communications: A local search based 3D matching approach
Paper in proceedings, 2017

Vehicle-to-everything (V2X) communications, en- abled by cellular device-to-device (D2D) links, have recently drawn much attention due to its potential to improve traffic safety, efficiency, and comfort. In this context, however, intracell interference combined with demanding latency and reliability requirements of safety vehicular users (V-UEs) are challenging issues. In this paper, we study a resource allocation problem among safety V-UEs, non-safety V-UEs, and conventional cellular UEs (C-UEs). Firstly, the resource allocation problem is formulated as a three-dimensional matching problem, where the objective is to maximize the total throughput of non-safety V-UEs on condition of satisfying the requirements on C-UEs and on safety V-UEs. Due to its NP-hardness, we then exploit hypergraph theory and propose a local search based approximation algorithm to solve it. Through simulation results, we show that the proposed algorithm outperforms the existing scheme in terms of both throughput performance and computational complexity.

Author

Qing Wei

Beijing University of Posts and Telecommunications (BUPT)

Sun Wanlu

Chalmers, Signals and Systems, Communication and Antenna Systems, Communication Systems

Bo Bai

Tsinghua University

Li Wang

Southeast University

Beijing University of Posts and Telecommunications (BUPT)

Erik Ström

Chalmers, Signals and Systems, Communication and Antenna Systems, Communication Systems

Mei Song

Beijing University of Posts and Telecommunications (BUPT)

IEEE International Conference on Communications

05361486 (ISSN)

7996984

Areas of Advance

Information and Communication Technology

Transport

Driving Forces

Sustainable development

Subject Categories

Communication Systems

Signal Processing

DOI

10.1109/ICC.2017.7996984

ISBN

978-1-4673-8999-0

More information

Latest update

5/23/2018