Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/151562
Title: Secrecy throughput maximization for full-duplex wireless powered IoT networks under fairness constraints
Authors: Rezaei, Roohollah
Sun, Sumei
Kang, Xin
Guan, Yong Liang
Mohammad Reza Pakravan
Keywords: Engineering::Electrical and electronic engineering
Issue Date: 2019
Source: 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
Project: A1788a0023
RIE2020 IAF-PP
Journal: IEEE Internet of Things Journal
Abstract: 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.
URI: https://hdl.handle.net/10356/151562
ISSN: 2327-4662
DOI: 10.1109/JIOT.2019.2913219
Rights: © 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.
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:EEE Journal Articles

SCOPUSTM   
Citations 20

15
Updated on Nov 22, 2022

Web of ScienceTM
Citations 20

11
Updated on Nov 27, 2022

Page view(s)

154
Updated on Nov 29, 2022

Download(s) 50

23
Updated on Nov 29, 2022

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.