DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ko, Myoungjun | ko |
dc.contributor.author | Yun, Sangseok | ko |
dc.contributor.author | Ha, Jeongseok | ko |
dc.date.accessioned | 2017-12-05T02:19:37Z | - |
dc.date.available | 2017-12-05T02:19:37Z | - |
dc.date.created | 2017-11-30 | - |
dc.date.created | 2017-11-30 | - |
dc.date.created | 2017-11-30 | - |
dc.date.created | 2017-11-30 | - |
dc.date.issued | 2017-10-19 | - |
dc.identifier.citation | International Conference on Information and Communication Technology Convergence (ICTC), pp.1168 - 1170 | - |
dc.identifier.issn | 2162-1233 | - |
dc.identifier.uri | http://hdl.handle.net/10203/227571 | - |
dc.description.abstract | This paper considers a fast fading wireless powered wiretap channel, where an energy constrained information source, powered by a dedicated power beacon, sends a secret message to a legitimate user using the artificial noise (AN) scheme in the presence of a passive eavesdropper. Based on a two-phase time division protocol, the ergodic secrecy throughput is derived. Furthermore, the optimal time-switching factor and power-allocation factor are studied for maximizing the ergodic secrecy throughput. Numerical results are presented to validate our theoretical results. | - |
dc.language | English | - |
dc.publisher | KICS | - |
dc.title | Resource Allocation Scheme for Wireless Powered Wiretap Channel | - |
dc.type | Conference | - |
dc.identifier.wosid | 000426978700280 | - |
dc.identifier.scopusid | 2-s2.0-85046889640 | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 1168 | - |
dc.citation.endingpage | 1170 | - |
dc.citation.publicationname | International Conference on Information and Communication Technology Convergence (ICTC) | - |
dc.identifier.conferencecountry | KO | - |
dc.identifier.conferencelocation | Lotte City Hotel Jeju, Jeju Island | - |
dc.identifier.doi | 10.1109/ICTC.2017.8190887 | - |
dc.contributor.localauthor | Ha, Jeongseok | - |
dc.contributor.nonIdAuthor | Ko, Myoungjun | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.