Please use this identifier to cite or link to this item:
Title: Resource allocation for underlaying device-to-device communications using maximal independent sets and Knapsack algorithm
Authors: Köse, Alper
Özbek, Berna
Keywords: D2D Communications
Conflict graph
Maximal Independent Set
Knapsack Problem
Issue Date: 2018
Publisher: IEEE
Abstract: In this paper, we address the resource allocation problem of device-to-device (D2D) communications underlaying orthogonal frequency division multiple access (OFDMA) based cellular systems by exploiting the efficiency that comes from an ensemble of graph theory and Knapsack problem. It is possible to construct the conflict graph of the D2D pairs by finding the maximal independent sets. Then, we use those independent sets as inputs to Knapsack problem iteratively in order to find D2D groups which allocate the subchannels. In Knapsack problem, we consider a maximum interference level that the base station is exposed at each subchannel. We illustrate that the proposed resource allocation method significantly outperforms graph coloring in terms of average data rate for the high number of underlaying D2D pairs in cellular systems.
Description: 29th IEEE Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC) -- SEP 09-12, 2018 -- Bologna, ITALY
ISBN: 978-1-5386-6009-6
Appears in Collections:Electrical - Electronic Engineering / Elektrik - Elektronik Mühendisliği
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Files in This Item:
File SizeFormat 
Resource_Allocation.pdf328.19 kBAdobe PDFView/Open
Show full item record

CORE Recommender


checked on Mar 18, 2023

Page view(s)

checked on Mar 20, 2023


checked on Mar 20, 2023

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.