{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T11:59:57Z","timestamp":1777982397294,"version":"3.51.4"},"reference-count":19,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T00:00:00Z","timestamp":1770163200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"},{"start":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T00:00:00Z","timestamp":1770163200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["24\u201029\u201000172"],"award-info":[{"award-number":["24\u201029\u201000172"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Internet Technology Letters"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n                  <jats:p>This letter presents a comparative analysis of power\u2010domain non\u2010orthogonal multiple access (PD\u2010NOMA) and orthogonal multiple access (OMA) under max\u2013min fairness (MMF), proportional fair (PF), and Round Robin (RR) scheduling, with an emphasis on preserving fairness across both systems. Motivated by the lack of consistent evaluation methods for multiuser scenarios, we develop a unified fairness\u2010aware framework that enforces identical user\u2010rate distributions and resource constraints in PD\u2010NOMA and OMA. Fairness preservation is guaranteed by the proposed rate\u2010matching methodology applied to both schemes under identical transmit\u2010power budgets. A stochastic single\u2010carrier downlink model over Rayleigh fading is used to evaluate systems with up to 20 users. The results demonstrate that PD\u2010NOMA consistently outperforms OMA in sum\u2010rate across all scheduling policies, with the gain increasing with the number of users and with median SNR and approaching an asymptotic limit at high SNR and large user counts. Beyond three users, the incremental gain becomes negligible relative to the added system complexity, indicating that multiplexing two or three users provides the most practical performance\u2013complexity trade\u2010off, while larger group sizes may still be relevant in connectivity\u2010centric scenarios.<\/jats:p>","DOI":"10.1002\/itl2.70219","type":"journal-article","created":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T01:00:41Z","timestamp":1770253241000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fairness\u2010Aware Comparison of\n                    <scp>PD<\/scp>\n                    \u2010\n                    <scp>NOMA<\/scp>\n                    and\n                    <scp>OMA<\/scp>\n                    Under Max\u2010Min, Proportional, and Round\u2010Robin Scheduling"],"prefix":"10.1002","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4115-9080","authenticated-orcid":false,"given":"Yakov","family":"Kryukov","sequence":"first","affiliation":[{"name":"Department of Telecommunications and Radio Engineering Tomsk State University of Control Systems and Radioelectronics  Tomsk Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9405-4573","authenticated-orcid":false,"given":"Dmitriy","family":"Pokamestov","sequence":"additional","affiliation":[{"name":"Department of Telecommunications and Radio Engineering Tomsk State University of Control Systems and Radioelectronics  Tomsk Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0174-9158","authenticated-orcid":false,"given":"Artem","family":"Shinkevich","sequence":"additional","affiliation":[{"name":"Department of Telecommunications and Radio Engineering Tomsk State University of Control Systems and Radioelectronics  Tomsk Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5015-599X","authenticated-orcid":false,"given":"Georgy","family":"Shalin","sequence":"additional","affiliation":[{"name":"Department of Telecommunications and Radio Engineering Tomsk State University of Control Systems and Radioelectronics  Tomsk Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-0570-5495","authenticated-orcid":false,"given":"Sergey","family":"Eremeev","sequence":"additional","affiliation":[{"name":"Department of Telecommunications and Radio Engineering Tomsk State University of Control Systems and Radioelectronics  Tomsk Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-8697-8945","authenticated-orcid":false,"given":"Dmitriy","family":"Ilinskiy","sequence":"additional","affiliation":[{"name":"Department of Telecommunications and Radio Engineering Tomsk State University of Control Systems and Radioelectronics  Tomsk Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2026,2,4]]},"reference":[{"key":"e_1_2_1_9_2_1","first-page":"1","volume-title":"IEEE 77th Vehicular Technology Conference","author":"Saito Y.","year":"2013"},{"key":"e_1_2_1_9_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11277\u2010021\u201008504\u20101"},{"key":"e_1_2_1_9_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2948343"},{"key":"e_1_2_1_9_5_1","doi-asserted-by":"publisher","DOI":"10.1134\/S106422692212011"},{"key":"e_1_2_1_9_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/VTCSpring.2017.8108680"},{"key":"e_1_2_1_9_7_1","doi-asserted-by":"publisher","DOI":"10.32604\/cmc.2022.022020"},{"key":"e_1_2_1_9_8_1","doi-asserted-by":"crossref","unstructured":"S.TrankatwarandP.Wali \u201cPower Allocation for Joint Sum Rate and Fairness Optimization in Downlink NOMA Networks \u201d 2023 Authorea Preprints.","DOI":"10.22541\/au.168207850.01736278\/v1"},{"key":"e_1_2_1_9_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2816597"},{"key":"e_1_2_1_9_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.phycom.2024.102336"},{"key":"e_1_2_1_9_11_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-024-59241-x"},{"key":"e_1_2_1_9_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/00051144.2024.2314937"},{"issue":"1","key":"e_1_2_1_9_13_1","first-page":"2022","article-title":"A Quantitative Measure of Fairness and Discrimination","volume":"21","author":"Jain R. K.","year":"1984","journal-title":"Eastern Research Laboratory, Digital Equipment Corporation, Hudson, MA"},{"key":"e_1_2_1_9_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2020.3013514"},{"key":"e_1_2_1_9_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2779504"},{"key":"e_1_2_1_9_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-021-00786-x"},{"key":"e_1_2_1_9_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2018.2865362"},{"key":"e_1_2_1_9_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2017.2777672"},{"key":"e_1_2_1_9_19_1","first-page":"584","volume-title":"Computer Science On\u2010line Conference","author":"Kryukov Y. V.","year":"2020"},{"key":"e_1_2_1_9_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/dac.5642"}],"container-title":["Internet Technology Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/itl2.70219","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/itl2.70219","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/itl2.70219","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T23:06:47Z","timestamp":1774566407000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/itl2.70219"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,4]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["10.1002\/itl2.70219"],"URL":"https:\/\/doi.org\/10.1002\/itl2.70219","archive":["Portico"],"relation":{"has-review":[{"id-type":"doi","id":"10.1002\/ITL2.70219\/v1\/review3","asserted-by":"object"},{"id-type":"doi","id":"10.1002\/ITL2.70219\/v1\/review2","asserted-by":"object"},{"id-type":"doi","id":"10.1002\/ITL2.70219\/v1\/review1","asserted-by":"object"},{"id-type":"doi","id":"10.1002\/ITL2.70219\/v1\/decision1","asserted-by":"object"}]},"ISSN":["2476-1508","2476-1508"],"issn-type":[{"value":"2476-1508","type":"print"},{"value":"2476-1508","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,4]]},"assertion":[{"value":"2025-10-22","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-24","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e70219"}}