Secrecy throughput maximization for full-duplex wireless powered IoT networks under fairness constraints

In this paper, we study the secrecy throughput of a full-duplex wireless powered communication network (WPCN) for Internet of Things (IoT). The WPCN consists of a full-duplex multiantenna base station (BS) and a number of sensor nodes. The BS transmits energy all the time, and each node harvests ene...

Full description

Saved in:
Bibliographic Details
Main Authors: Rezaei, Roohollah, Sun, Sumei, Kang, Xin, Guan, Yong Liang, Mohammad Reza Pakravan
Other Authors: School of Electrical and Electronic Engineering
Format: Article
Language:English
Published: 2021
Subjects:
Online Access:https://hdl.handle.net/10356/151562
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-151562
record_format dspace
spelling sg-ntu-dr.10356-1515622021-06-21T06:39:38Z Secrecy throughput maximization for full-duplex wireless powered IoT networks under fairness constraints Rezaei, Roohollah Sun, Sumei Kang, Xin Guan, Yong Liang Mohammad Reza Pakravan School of Electrical and Electronic Engineering Engineering::Electrical and electronic engineering Energy Beamforming Fairness In this paper, we study the secrecy throughput of a full-duplex wireless powered communication network (WPCN) for Internet of Things (IoT). The WPCN consists of a full-duplex multiantenna base station (BS) and a number of sensor nodes. The BS transmits energy all the time, and each node harvests energy prior to its transmission time slot. The nodes sequentially transmit their confidential information to the BS, and the other nodes are considered as potential eavesdroppers. We first aim to optimize the sum secrecy throughput of the nodes. The optimization variables are the duration of the time slots and the BS beamforming vectors in different time slots. The optimization problem is shown to be nonconvex. To tackle the problem, we propose a suboptimal two stage approach, referred to as sum secrecy throughput maximization (SSTM). In the first stage, the BS focuses its beamforming to blind the potential eavesdroppers (other nodes) during information transmission time slots. Then, the optimal beamforming vector in the initial noninformation transmission time slot and the optimal time slots are derived. We then consider secrecy throughput fairness among the nodes and propose max-min fair (MMF) and proportional fair (PF) algorithms. The MMF algorithm maximizes the minimum secrecy throughput of the nodes, while the PF achieves a good tradeoff between the sum secrecy throughput and fairness among the nodes. Through the numerical simulations, we first demonstrate the superior performance of the SSTM to uniform time slotting and beamforming in different settings. Then, we show the effectiveness of MMF and PF algorithms. Agency for Science, Technology and Research (A*STAR) Accepted version The work of R. Rezaei was supported by the Agency for Science, Technology and Research (A*STAR) Research Attachment Program (ARAP). The work of S. Sun was supported by the A*STAR Industrial Internet of Things Research Program through RIE2020 IAF-PP under Grant A1788a0023. Part of this work will be presented in ICC 2019. 2021-06-21T06:39:38Z 2021-06-21T06:39:38Z 2019 Journal Article Rezaei, R., Sun, S., Kang, X., Guan, Y. L. & Mohammad Reza Pakravan (2019). Secrecy throughput maximization for full-duplex wireless powered IoT networks under fairness constraints. IEEE Internet of Things Journal, 6(4), 6964-6976. https://dx.doi.org/10.1109/JIOT.2019.2913219 2327-4662 https://hdl.handle.net/10356/151562 10.1109/JIOT.2019.2913219 4 6 6964 6976 en A1788a0023 RIE2020 IAF-PP IEEE Internet of Things Journal © 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: https://doi.org/10.1109/JIOT.2019.2913219. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Engineering::Electrical and electronic engineering
Energy Beamforming
Fairness
spellingShingle Engineering::Electrical and electronic engineering
Energy Beamforming
Fairness
Rezaei, Roohollah
Sun, Sumei
Kang, Xin
Guan, Yong Liang
Mohammad Reza Pakravan
Secrecy throughput maximization for full-duplex wireless powered IoT networks under fairness constraints
description In this paper, we study the secrecy throughput of a full-duplex wireless powered communication network (WPCN) for Internet of Things (IoT). The WPCN consists of a full-duplex multiantenna base station (BS) and a number of sensor nodes. The BS transmits energy all the time, and each node harvests energy prior to its transmission time slot. The nodes sequentially transmit their confidential information to the BS, and the other nodes are considered as potential eavesdroppers. We first aim to optimize the sum secrecy throughput of the nodes. The optimization variables are the duration of the time slots and the BS beamforming vectors in different time slots. The optimization problem is shown to be nonconvex. To tackle the problem, we propose a suboptimal two stage approach, referred to as sum secrecy throughput maximization (SSTM). In the first stage, the BS focuses its beamforming to blind the potential eavesdroppers (other nodes) during information transmission time slots. Then, the optimal beamforming vector in the initial noninformation transmission time slot and the optimal time slots are derived. We then consider secrecy throughput fairness among the nodes and propose max-min fair (MMF) and proportional fair (PF) algorithms. The MMF algorithm maximizes the minimum secrecy throughput of the nodes, while the PF achieves a good tradeoff between the sum secrecy throughput and fairness among the nodes. Through the numerical simulations, we first demonstrate the superior performance of the SSTM to uniform time slotting and beamforming in different settings. Then, we show the effectiveness of MMF and PF algorithms.
author2 School of Electrical and Electronic Engineering
author_facet School of Electrical and Electronic Engineering
Rezaei, Roohollah
Sun, Sumei
Kang, Xin
Guan, Yong Liang
Mohammad Reza Pakravan
format Article
author Rezaei, Roohollah
Sun, Sumei
Kang, Xin
Guan, Yong Liang
Mohammad Reza Pakravan
author_sort Rezaei, Roohollah
title Secrecy throughput maximization for full-duplex wireless powered IoT networks under fairness constraints
title_short Secrecy throughput maximization for full-duplex wireless powered IoT networks under fairness constraints
title_full Secrecy throughput maximization for full-duplex wireless powered IoT networks under fairness constraints
title_fullStr Secrecy throughput maximization for full-duplex wireless powered IoT networks under fairness constraints
title_full_unstemmed Secrecy throughput maximization for full-duplex wireless powered IoT networks under fairness constraints
title_sort secrecy throughput maximization for full-duplex wireless powered iot networks under fairness constraints
publishDate 2021
url https://hdl.handle.net/10356/151562
_version_ 1703971233354219520