SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:research.chalmers.se:36e709c5-6cdc-4751-b84e-f38ad391bea7"
 

Search: onr:"swepub:oai:research.chalmers.se:36e709c5-6cdc-4751-b84e-f38ad391bea7" > Resource allocation...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist
  • Wei, QingBeijing University of Posts and Telecommunications (BUPT) (author)

Resource allocation for V2X communications: A local search based 3D matching approach

  • Article/chapterEnglish2017

Publisher, publication year, extent ...

  • 2017
  • electronicrdacarrier

Numbers

  • LIBRIS-ID:oai:research.chalmers.se:36e709c5-6cdc-4751-b84e-f38ad391bea7
  • ISBN:9781467389990
  • https://research.chalmers.se/publication/501051URI
  • https://research.chalmers.se/publication/250080URI
  • https://doi.org/10.1109/ICC.2017.7996984DOI

Supplementary language notes

  • Language:English
  • Summary in:English

Part of subdatabase

Classification

  • Subject category:kon swepub-publicationtype
  • Subject category:ref swepub-contenttype

Notes

  • 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.

Subject headings and genre

Added entries (persons, corporate bodies, meetings, titles ...)

  • Wanlu, Sun,1986Chalmers tekniska högskola,Chalmers University of Technology(Swepub:cth)wanlu (author)
  • Bai, BoTsinghua University (author)
  • Wang, LiSoutheast University,Beijing University of Posts and Telecommunications (BUPT) (author)
  • Ström, Erik,1965Chalmers tekniska högskola,Chalmers University of Technology(Swepub:cth)estrom (author)
  • Song, MeiBeijing University of Posts and Telecommunications (BUPT) (author)
  • Beijing University of Posts and Telecommunications (BUPT)Chalmers tekniska högskola (creator_code:org_t)

Related titles

  • In:IEEE International Conference on Communications1550-36079781467389990

Internet link

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view