BUIR logo
Communities & Collections
All of BUIR
  • English
  • Türkçe
Log In
Please note that log in via username/password is only available to Repository staff.
Have you forgotten your password?
  1. Home
  2. Browse by Subject

Browsing by Subject "Non-orthogonal multiple access"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • Loading...
    Thumbnail Image
    ItemOpen Access
    Graph-theoretical dynamic user pairing for downlink NOMA systems
    (IEEE, 2021-08-03) Köse, A.; Koca, M.; Anarım, E.; Médard, M.; Gökçesu, Hakan
    We propose a novel graph-theoretical dynamic user pairing strategy based on the user rate requirements in cellular networks employing non-orthogonal multiple access (NOMA). The proposed approach relies on first constructing a conflict graph corresponding to all possible user pairings and then reformulating the problem of finding the best user pairs as that of finding the maximum weighted independent set (MWIS) on the conflict graph. This formulation turns the originally NP-hard problem into one that can be solvable in polynomial time thanks to the claw-freeness property of the conflict graph. The proposed user pairing method satisfies the maximum number of user demands with optimal network sum-rate as shown theoretically and as validated by the simulation results.

About the University

  • Academics
  • Research
  • Library
  • Students
  • Stars
  • Moodle
  • WebMail

Using the Library

  • Collections overview
  • Borrow, renew, return
  • Connect from off campus
  • Interlibrary loan
  • Hours
  • Plan
  • Intranet (Staff Only)

Research Tools

  • EndNote
  • Grammarly
  • iThenticate
  • Mango Languages
  • Mendeley
  • Turnitin
  • Show more ..

Contact

  • Bilkent University
  • Main Campus Library
  • Phone: +90(312) 290-1298
  • Email: dspace@bilkent.edu.tr

Bilkent University Library © 2015-2025 BUIR

  • Privacy policy
  • Send Feedback