<> <http://www.w3.org/2000/01/rdf-schema#comment> "The repository administrator has not yet configured an RDF license."^^<http://www.w3.org/2001/XMLSchema#string> .
<> <http://xmlns.com/foaf/0.1/primaryTopic> <https://discovery.ucl.ac.uk/id/eprint/10054691> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/AcademicArticle> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Article> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/dc/terms/title> "Optimization for Maximizing Sum Secrecy Rate in SWIPT-enabled NOMA Systems"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/ontology/bibo/abstract> "OAPA In this paper, we study secrecy simultaneous wireless information and power transfer (SWIPT) in downlink nonorthogonal multiple access (NOMA) systems comprising a base station (BS), multiple information receivers (IRs), and multiple energy receivers (ERs) that have potential to wiretap the IRs. The goal of this paper is to maximize the sum secrecy rate (SSR) of the system subject to the individual IR&#x2019;s minimum data rate requirement and the individual ER&#x2019;s minimum harvested energy requirement. The corresponding problem involves resource allocation via max-min function, which is non-convex and difficult to solve directly. In order to tackle this, we first transform the original non-convex problem to a sequence of convex subproblems which can be solved simultaneously. Hence, a closedform solution of the optimal power allocation policy is derived based on the Karush-Kuhn-Tucker (KKT) conditions. Numerical results validate the theoretical findings and demonstrate that significant performance gain over the orthogonal multiple access (OMA) scheme in terms of SSR can be achieved by the proposed algorithm in a SWIPT-enabled NOMA system."^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/dc/terms/date> "2018-07-26" .
<https://discovery.ucl.ac.uk/id/document/721766> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Document> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/ontology/bibo/volume> "6" .
<https://discovery.ucl.ac.uk/id/publication/ext-21693536> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Collection> .
<https://discovery.ucl.ac.uk/id/publication/ext-21693536> <http://xmlns.com/foaf/0.1/name> "IEEE Access"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/dc/terms/isPartOf> <https://discovery.ucl.ac.uk/id/publication/ext-21693536> .
<https://discovery.ucl.ac.uk/id/publication/ext-21693536> <http://www.w3.org/2002/07/owl#sameAs> <urn:issn:21693536> .
<https://discovery.ucl.ac.uk/id/publication/ext-21693536> <http://purl.org/ontology/bibo/issn> "21693536" .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/ontology/bibo/status> <http://purl.org/ontology/bibo/status/published> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-187527b03655513be502a5726c091b37> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/10054691#authors> .
<https://discovery.ucl.ac.uk/id/eprint/10054691#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_1> <https://discovery.ucl.ac.uk/id/person/ext-187527b03655513be502a5726c091b37> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-69c7368f9d21a9a5922fdfc899575c1b> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/10054691#authors> .
<https://discovery.ucl.ac.uk/id/eprint/10054691#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_2> <https://discovery.ucl.ac.uk/id/person/ext-69c7368f9d21a9a5922fdfc899575c1b> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-8a55865e0a71fafb9d8ffe0f1525ddf3> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/10054691#authors> .
<https://discovery.ucl.ac.uk/id/eprint/10054691#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_3> <https://discovery.ucl.ac.uk/id/person/ext-8a55865e0a71fafb9d8ffe0f1525ddf3> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-b2f3d670ff87204c55f90ab2f42a5f2b> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/10054691#authors> .
<https://discovery.ucl.ac.uk/id/eprint/10054691#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_4> <https://discovery.ucl.ac.uk/id/person/ext-b2f3d670ff87204c55f90ab2f42a5f2b> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-bb6fe3f6592ad9799475cd1e9179e33d> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/10054691#authors> .
<https://discovery.ucl.ac.uk/id/eprint/10054691#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_5> <https://discovery.ucl.ac.uk/id/person/ext-bb6fe3f6592ad9799475cd1e9179e33d> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-84aa954ca96d9fcb6d0874fe6599f275> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/10054691#authors> .
<https://discovery.ucl.ac.uk/id/eprint/10054691#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_6> <https://discovery.ucl.ac.uk/id/person/ext-84aa954ca96d9fcb6d0874fe6599f275> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/dc/terms/creator> <https://discovery.ucl.ac.uk/id/person/ext-76ecf553521a33a64e53e95c00c9b36a> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/ontology/bibo/authorList> <https://discovery.ucl.ac.uk/id/eprint/10054691#authors> .
<https://discovery.ucl.ac.uk/id/eprint/10054691#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_7> <https://discovery.ucl.ac.uk/id/person/ext-76ecf553521a33a64e53e95c00c9b36a> .
<https://discovery.ucl.ac.uk/id/person/ext-187527b03655513be502a5726c091b37> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-187527b03655513be502a5726c091b37> <http://xmlns.com/foaf/0.1/givenName> "J"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-187527b03655513be502a5726c091b37> <http://xmlns.com/foaf/0.1/familyName> "Tang"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-187527b03655513be502a5726c091b37> <http://xmlns.com/foaf/0.1/name> "J Tang"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-69c7368f9d21a9a5922fdfc899575c1b> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-69c7368f9d21a9a5922fdfc899575c1b> <http://xmlns.com/foaf/0.1/givenName> "T"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-69c7368f9d21a9a5922fdfc899575c1b> <http://xmlns.com/foaf/0.1/familyName> "Dai"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-69c7368f9d21a9a5922fdfc899575c1b> <http://xmlns.com/foaf/0.1/name> "T Dai"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-8a55865e0a71fafb9d8ffe0f1525ddf3> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-8a55865e0a71fafb9d8ffe0f1525ddf3> <http://xmlns.com/foaf/0.1/givenName> "M"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-8a55865e0a71fafb9d8ffe0f1525ddf3> <http://xmlns.com/foaf/0.1/familyName> "Cui"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-8a55865e0a71fafb9d8ffe0f1525ddf3> <http://xmlns.com/foaf/0.1/name> "M Cui"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-bb6fe3f6592ad9799475cd1e9179e33d> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-bb6fe3f6592ad9799475cd1e9179e33d> <http://xmlns.com/foaf/0.1/givenName> "A"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-bb6fe3f6592ad9799475cd1e9179e33d> <http://xmlns.com/foaf/0.1/familyName> "Shojaeifard"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-bb6fe3f6592ad9799475cd1e9179e33d> <http://xmlns.com/foaf/0.1/name> "A Shojaeifard"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-76ecf553521a33a64e53e95c00c9b36a> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-76ecf553521a33a64e53e95c00c9b36a> <http://xmlns.com/foaf/0.1/givenName> "Z"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-76ecf553521a33a64e53e95c00c9b36a> <http://xmlns.com/foaf/0.1/familyName> "Li"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-76ecf553521a33a64e53e95c00c9b36a> <http://xmlns.com/foaf/0.1/name> "Z Li"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-b2f3d670ff87204c55f90ab2f42a5f2b> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-b2f3d670ff87204c55f90ab2f42a5f2b> <http://xmlns.com/foaf/0.1/givenName> "X"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-b2f3d670ff87204c55f90ab2f42a5f2b> <http://xmlns.com/foaf/0.1/familyName> "Zhang"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-b2f3d670ff87204c55f90ab2f42a5f2b> <http://xmlns.com/foaf/0.1/name> "X Zhang"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-84aa954ca96d9fcb6d0874fe6599f275> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://discovery.ucl.ac.uk/id/person/ext-84aa954ca96d9fcb6d0874fe6599f275> <http://xmlns.com/foaf/0.1/givenName> "KK"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-84aa954ca96d9fcb6d0874fe6599f275> <http://xmlns.com/foaf/0.1/familyName> "Wong"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/person/ext-84aa954ca96d9fcb6d0874fe6599f275> <http://xmlns.com/foaf/0.1/name> "KK Wong"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/EPrint> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/ArticleEPrint> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/dc/terms/isPartOf> <https://discovery.ucl.ac.uk/id/repository> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/721766> .
<https://discovery.ucl.ac.uk/id/document/721766> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/721766> <http://www.w3.org/2000/01/rdf-schema#label> "Optimization for Maximizing Sum Secrecy Rate in SWIPT-enabled NOMA Systems (Text)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://purl.org/dc/elements/1.1/hasVersion> <https://discovery.ucl.ac.uk/id/document/721766> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://eprints.org/ontology/hasAccepted> <https://discovery.ucl.ac.uk/id/document/721766> .
<https://discovery.ucl.ac.uk/id/document/721766> <http://eprints.org/ontology/hasFile> <https://discovery.ucl.ac.uk/id/eprint/10054691/1/08421218.pdf> .
<https://discovery.ucl.ac.uk/id/document/721766> <http://purl.org/dc/terms/hasPart> <https://discovery.ucl.ac.uk/id/eprint/10054691/1/08421218.pdf> .
<https://discovery.ucl.ac.uk/id/eprint/10054691/1/08421218.pdf> <http://www.w3.org/2000/01/rdf-schema#label> "08421218.pdf"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/721768> .
<https://discovery.ucl.ac.uk/id/document/721768> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/721768> <http://www.w3.org/2000/01/rdf-schema#label> "Optimization for Maximizing Sum Secrecy Rate in SWIPT-enabled NOMA Systems (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/721768> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/721766> .
<https://discovery.ucl.ac.uk/id/document/721768> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/721766> .
<https://discovery.ucl.ac.uk/id/document/721768> <http://eprints.org/relation/ispreviewThumbnailVersionOf> <https://discovery.ucl.ac.uk/id/document/721766> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/721769> .
<https://discovery.ucl.ac.uk/id/document/721769> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/721769> <http://www.w3.org/2000/01/rdf-schema#label> "Optimization for Maximizing Sum Secrecy Rate in SWIPT-enabled NOMA Systems (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/721769> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/721766> .
<https://discovery.ucl.ac.uk/id/document/721769> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/721766> .
<https://discovery.ucl.ac.uk/id/document/721769> <http://eprints.org/relation/ismediumThumbnailVersionOf> <https://discovery.ucl.ac.uk/id/document/721766> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/721770> .
<https://discovery.ucl.ac.uk/id/document/721770> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/721770> <http://www.w3.org/2000/01/rdf-schema#label> "Optimization for Maximizing Sum Secrecy Rate in SWIPT-enabled NOMA Systems (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/721770> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/721766> .
<https://discovery.ucl.ac.uk/id/document/721770> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/721766> .
<https://discovery.ucl.ac.uk/id/document/721770> <http://eprints.org/relation/issmallThumbnailVersionOf> <https://discovery.ucl.ac.uk/id/document/721766> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/721771> .
<https://discovery.ucl.ac.uk/id/document/721771> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/721771> <http://www.w3.org/2000/01/rdf-schema#label> "Optimization for Maximizing Sum Secrecy Rate in SWIPT-enabled NOMA Systems (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/721771> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/721766> .
<https://discovery.ucl.ac.uk/id/document/721771> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/721766> .
<https://discovery.ucl.ac.uk/id/document/721771> <http://eprints.org/relation/islightboxThumbnailVersionOf> <https://discovery.ucl.ac.uk/id/document/721766> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://eprints.org/ontology/hasDocument> <https://discovery.ucl.ac.uk/id/document/721772> .
<https://discovery.ucl.ac.uk/id/document/721772> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<https://discovery.ucl.ac.uk/id/document/721772> <http://www.w3.org/2000/01/rdf-schema#label> "Optimization for Maximizing Sum Secrecy Rate in SWIPT-enabled NOMA Systems (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://discovery.ucl.ac.uk/id/document/721772> <http://eprints.org/relation/isVersionOf> <https://discovery.ucl.ac.uk/id/document/721766> .
<https://discovery.ucl.ac.uk/id/document/721772> <http://eprints.org/relation/isVolatileVersionOf> <https://discovery.ucl.ac.uk/id/document/721766> .
<https://discovery.ucl.ac.uk/id/document/721772> <http://eprints.org/relation/isIndexCodesVersionOf> <https://discovery.ucl.ac.uk/id/document/721766> .
<https://discovery.ucl.ac.uk/id/eprint/10054691> <http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://discovery.ucl.ac.uk/id/eprint/10054691/> .
<https://discovery.ucl.ac.uk/id/eprint/10054691/> <http://purl.org/dc/elements/1.1/title> "HTML Summary of #10054691 \n\nOptimization for Maximizing Sum Secrecy Rate in SWIPT-enabled NOMA Systems\n\n" .
<https://discovery.ucl.ac.uk/id/eprint/10054691/> <http://purl.org/dc/elements/1.1/format> "text/html" .
<https://discovery.ucl.ac.uk/id/eprint/10054691/> <http://xmlns.com/foaf/0.1/primaryTopic> <https://discovery.ucl.ac.uk/id/eprint/10054691> .