{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T00:35:24Z","timestamp":1778632524574,"version":"3.51.4"},"reference-count":16,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T00:00:00Z","timestamp":1540425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Internet Technology Letters"],"published-print":{"date-parts":[[2019,3]]},"abstract":"<jats:p>This letter investigates the physical layer security of dual\u2010hop nonorthogonal multiple access (NOMA) networks. We consider a multicarrier transmission scenario which consists of a single source, a relay, an eavesdropper, and multiple users. Our objective is to maximize the sum secure rate of the system with optimal power allocation over different sub\u2010carriers at the source. Because of the rate expression and binary variable, the optimization problem is formulated as a nonconvex and mixed integer programming problem. Thus, the optimal solution is obtained through duality theory which is considered to be an efficient method for solving nonconvex optimization problems. We compare the performance of the proposed NOMA scheme with orthogonal frequency multiple access (OFDMA) scheme. Our simulation results show that the proposed NOMA scheme has good performance in convergence and significantly outperforms the traditional OFDMA scheme.<\/jats:p>","DOI":"10.1002\/itl2.76","type":"journal-article","created":{"date-parts":[[2018,10,8]],"date-time":"2018-10-08T07:43:33Z","timestamp":1538984613000},"update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Maximizing physical layer security in relay\u2010assisted multicarrier nonorthogonal multiple access transmission"],"prefix":"10.1002","volume":"2","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0003-1485-5141","authenticated-orcid":false,"given":"Wali Ullah","family":"Khan","sequence":"first","affiliation":[{"name":"School of Information Sciences and Engineering Shandong University  Qingdao China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2018,10,25]]},"reference":[{"key":"e_1_2_7_2_1","doi-asserted-by":"crossref","unstructured":"DighririM AlfoudiASD LeeGM BakerT PereiraR. Comparison data traffic scheduling techniques for classifying QoS over 5G mobile networks. Paper presented at: IEEE WAINA'2017 2017; Taipei Taiwan.","DOI":"10.1109\/WAINA.2017.106"},{"key":"e_1_2_7_3_1","doi-asserted-by":"crossref","unstructured":"DighririM LeeGM BakerT AlfoudiASD. Data traffic model in machine to machine communications over 5G network slicing. Paper presented at: IEEE DeSE'2016 2016; Liverpool UK.","DOI":"10.1109\/DeSE.2016.54"},{"key":"e_1_2_7_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2017.2779485"},{"key":"e_1_2_7_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2646183"},{"key":"e_1_2_7_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/itl2.32"},{"key":"e_1_2_7_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2017.2789223"},{"key":"e_1_2_7_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2539162"},{"key":"e_1_2_7_9_1","doi-asserted-by":"crossref","unstructured":"QinZ LiuY DingZ ElkashhlanM. Physical layer security for 5G non\u2010orthogonal multiple access in large\u2010scale networks. Talk at IEEE ICC'2016 2016; Kuala Lumpur Malaysia.","DOI":"10.1109\/ICC.2016.7510755"},{"key":"e_1_2_7_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2650987"},{"key":"e_1_2_7_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2825559"},{"key":"e_1_2_7_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2661281"},{"key":"e_1_2_7_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2716921"},{"key":"e_1_2_7_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.2345763"},{"key":"e_1_2_7_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2017.2726398"},{"key":"e_1_2_7_16_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"e_1_2_7_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2006.877962"}],"container-title":["Internet Technology Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fitl2.76","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/itl2.76","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T19:04:25Z","timestamp":1694718265000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/10.1002\/itl2.76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,25]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["10.1002\/itl2.76"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1002\/itl2.76","archive":["Portico"],"relation":{},"ISSN":["2476-1508","2476-1508"],"issn-type":[{"value":"2476-1508","type":"print"},{"value":"2476-1508","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,25]]},"assertion":[{"value":"2018-07-09","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-10-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e76"}}