SwePub - search: id:"swepub:oai:research.chalme...

Enumeration	Reference	Cover	Find
1.	Wei, Qing, et al. (author) Resource allocation for V2X communications: A local search based 3D matching approach 2017 In: IEEE International Conference on Communications. - 1550-3607. - 9781467389990 Conference paper (peer-reviewed)abstract 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.

Wei, Qing, et al. (author)
Resource allocation for V2X communications: A local search based 3D matching approach
2017
In: IEEE International Conference on Communications. - 1550-3607. - 9781467389990
Conference paper (peer-reviewed)abstract
- 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.

Träfflista för sökning "id:"swepub:oai:research.chalmers.se:36e709c5-6cdc-4751-b84e-f38ad391bea7" "