Electrical - Electronic Engineering / Elektrik - Elektronik Mühendisliği

Permanent URI for this collectionhttps://hdl.handle.net/11147/11

Browse

Filters

2017 - 20182

Settings

Publisher: search.filters.publisher.IEEESubject: search.filters.subject.OFDMA

Search Results

Now showing 1 - 2 of 2
  • Conference Object
    Citation - Scopus: 1
    Interference Management for Multiuser Multiantenna Ofdma Underlaying Device-To Communications
    (IEEE, 2017) Özbek, Berna; Pischella, Mylene; Le Ruyet, Didier
    Underlaying device-to-device (D2D) transmission in cellular wireless systems is one of the promising transmission techniques for fifth generation (5G) and beyond 5G applications. Nevertheless, the interference between the D2D pairs, the interference from cellular users to D2D receivers and the interference that affects the cellular communications should be mitigated to increase the overall system performance. In this paper, we propose interference management techniques for D2D underlaying communications in multiuser multiantenna orthogonal frequency division multiple access (OFDMA) systems. Our goal is to increase the data rate of both the cellular users and D2D pairs by performing interference management in frequency, power and spatial dimensions. The performance evaluations illustrate the effectiveness of the proposed algorithm in terms of average data rate and average transmitted power for both cellular users and D2D pairs.
  • Conference Object
    Citation - WoS: 11
    Citation - Scopus: 17
    Resource Allocation for Underlaying Device-To Communications Using Maximal Independent Sets and Knapsack Algorithm
    (IEEE, 2018) Köse, Alper; Özbek, Berna
    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.