Robust secrecy beamforming for MIMO SWIPT with probabilistic constraints

Muhammad R. A. Khandaker, Kai-Kit Wong

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)


This paper considers simultaneous wireless information and power transfer (SWIPT) in a multiple-input multiple-output (MIMO) wiretap channel with energy harvesting receivers. The main objective is to keep the probability of the legitimate user's achievable secrecy rate outage as well as the energy receivers' harvested energy outage as caused by CSI uncertainties below given thresholds. This probabilistic-constrained secrecy rate maximization problem presents a significant analytical and computational challenge since any closed-form for the probabilistic constraints with log-det functions is intractable. In this paper, we address this challenging issue using convex restrictions. In particular, we derive decomposition-based large deviation inequalities to transform the probabilistic constraints into second-order cone (SOC) constraints which are easier to handle. Then we show that a robust safe solution can be obtained through solving two convex sub-problems in an alternating fashion.

Original languageEnglish
Title of host publication2016 IEEE Globecom Workshops (GC Wkshps)
ISBN (Electronic)9781509024827
Publication statusPublished - 9 Feb 2017
Event2016 IEEE Globecom Workshops - Washington, United States
Duration: 4 Dec 20168 Dec 2016


Conference2016 IEEE Globecom Workshops
Abbreviated titleGC Wkshps 2016
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Communication
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Robust secrecy beamforming for MIMO SWIPT with probabilistic constraints'. Together they form a unique fingerprint.

Cite this