Please use this identifier to cite or link to this item:
https://hdl.handle.net/11147/9420
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Köse, Alper | - |
dc.contributor.author | Özbek, Berna | - |
dc.date.accessioned | 2020-07-25T22:10:47Z | - |
dc.date.available | 2020-07-25T22:10:47Z | - |
dc.date.issued | 2018 | - |
dc.identifier.isbn | 978-1-5386-6009-6 | - |
dc.identifier.uri | https://hdl.handle.net/11147/9420 | - |
dc.description | 29th IEEE Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC) -- SEP 09-12, 2018 -- Bologna, ITALY | en_US |
dc.description.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. | en_US |
dc.language.iso | en | en_US |
dc.publisher | IEEE | en_US |
dc.relation.ispartof | 29th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2018 | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | D2D Communications | en_US |
dc.subject | OFDMA | en_US |
dc.subject | Conflict graph | en_US |
dc.subject | Maximal Independent Set | en_US |
dc.subject | Knapsack Problem | en_US |
dc.title | Resource Allocation for Underlaying Device-To Communications Using Maximal Independent Sets and Knapsack Algorithm | en_US |
dc.type | Conference Object | en_US |
dc.institutionauthor | Özbek, Berna | - |
dc.department | İzmir Institute of Technology. Electrical and Electronics Engineering | en_US |
dc.identifier.wos | WOS:000457761900070 | en_US |
dc.identifier.scopus | 2-s2.0-85060514595 | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
item.fulltext | With Fulltext | - |
item.openairetype | Conference Object | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | open | - |
crisitem.author.dept | 03.05. Department of Electrical and Electronics Engineering | - |
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 | Size | Format | |
---|---|---|---|
Resource_Allocation.pdf | 328.19 kB | Adobe PDF | View/Open |
CORE Recommender
SCOPUSTM
Citations
16
checked on Dec 13, 2024
WEB OF SCIENCETM
Citations
10
checked on Nov 23, 2024
Page view(s)
170
checked on Dec 9, 2024
Download(s)
166
checked on Dec 9, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.