Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/74563
Title: | Simultaneous Wireless Information and Power Transfer in Multi-User OFDMA Networks with Physical Secrecy |
Authors: | Pubet Sangmahamad Kampol Woradit Poompat Saengudomlert |
Authors: | Pubet Sangmahamad Kampol Woradit Poompat Saengudomlert |
Keywords: | Biochemistry, Genetics and Molecular Biology;Chemistry;Computer Science;Engineering |
Issue Date: | 1-May-2022 |
Abstract: | This paper considers simultaneous wireless information and power transfer (SWIPT) from a base station to multiple Internet of Things (IoT) nodes via orthogonal frequency-division multiple access (OFDMA), where every node can eavesdrop on the subcarriers allocated to other nodes. Application layer encryption is unsuitable for IoT nodes relying on energy harvesting, and physical layer secrecy should be deployed. The different channels among users on every subcarrier can be exploited to obtain physical layer secrecy without using artificial noise. We propose an algorithm to maximize the secrecy rate of IoT nodes by jointly optimizing the power splitting ratio and subcarrier allocation. For fairness, the lowest total secrecy rate among users is maximized. Through simulations, the proposed algorithm is compared with the minimum effort approach, which allocates each subcarrier to the strongest node and selects the minimum sufficient power splitting ratio. The obtained secrecy rate is 3 times (4.5 over 1.5 bps/Hz) higher than that of the minimum effort approach in every case of parameters: the base station’s transmit power, the minimum harvested energy requirement of an IoT node and the energy harvesting efficiency. |
URI: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85130110507&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/74563 |
ISSN: | 14248220 |
Appears in Collections: | CMUL: Journal Articles |
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.