Linear Precoding for Fading Cognitive Multiple-Access Wiretap Channel With Finite-Alphabet Inputs

We investigate the fading cognitive multiple-access wiretap channel (CMAC-WT), in which two secondary-user transmitters (STs) send secure messages to a secondary-user receiver (SR) in the presence of an eavesdropper and subject to interference threshold constraints at multiple primary-user receivers...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on vehicular technology Vol. 66; no. 4; pp. 3059 - 3070
Main Authors Jin, Juening, Xiao, Chengshan, Tao, Meixia, Chen, Wen
Format Journal Article
LanguageEnglish
Published New York IEEE 01.04.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
Abstract We investigate the fading cognitive multiple-access wiretap channel (CMAC-WT), in which two secondary-user transmitters (STs) send secure messages to a secondary-user receiver (SR) in the presence of an eavesdropper and subject to interference threshold constraints at multiple primary-user receivers (PRs). We design linear precoders to maximize the average secrecy sum rate for a multiple-input-multiple-output (MIMO) fading CMAC-WT under finite-alphabet inputs and statistical channel state information at STs. For this nondeterministic polynomial-time NP-hard problem, we utilize an accurate approximation of the average secrecy sum rate to reduce the computational complexity and then present a two-layer algorithm by embedding the convex-concave procedure into an outer-approximation framework. The idea behind this algorithm is to reformulate the approximated average secrecy sum rate as a difference of convex functions and then generate a sequence of simpler relaxed sets to approach the nonconvex feasible set. Subsequently, we maximize the approximated average secrecy sum rate over the sequence of relaxed sets by using the convex-concave procedure. Numerical results indicate that our proposed precoding algorithm is superior to the conventional Gaussian precoding method in the medium and high signal-to-noise ratio (SNR) regimes.
AbstractList We investigate the fading cognitive multiple-access wiretap channel (CMAC-WT), in which two secondary-user transmitters (STs) send secure messages to a secondary-user receiver (SR) in the presence of an eavesdropper and subject to interference threshold constraints at multiple primary-user receivers (PRs). We design linear precoders to maximize the average secrecy sum rate for a multiple-input-multiple-output (MIMO) fading CMAC-WT under finite-alphabet inputs and statistical channel state information at STs. For this nondeterministic polynomial-time NP-hard problem, we utilize an accurate approximation of the average secrecy sum rate to reduce the computational complexity and then present a two-layer algorithm by embedding the convex-concave procedure into an outer-approximation framework. The idea behind this algorithm is to reformulate the approximated average secrecy sum rate as a difference of convex functions and then generate a sequence of simpler relaxed sets to approach the nonconvex feasible set. Subsequently, we maximize the approximated average secrecy sum rate over the sequence of relaxed sets by using the convex-concave procedure. Numerical results indicate that our proposed precoding algorithm is superior to the conventional Gaussian precoding method in the medium and high signal-to-noise ratio (SNR) regimes.
Author Chengshan Xiao
Meixia Tao
Wen Chen
Juening Jin
Author_xml – sequence: 1
  givenname: Juening
  orcidid: 0000-0002-1627-3156
  surname: Jin
  fullname: Jin, Juening
– sequence: 2
  givenname: Chengshan
  surname: Xiao
  fullname: Xiao, Chengshan
– sequence: 3
  givenname: Meixia
  surname: Tao
  fullname: Tao, Meixia
– sequence: 4
  givenname: Wen
  surname: Chen
  fullname: Chen, Wen
BookMark eNp9kMFLwzAUh4NMcE7vgpeC586kSZrmOIrTwUQPU48lTV-2jJrWJBP87-3c8ODB03s_-H7vwXeORq5zgNAVwVNCsLxdva6mGSb5NOMScypP0JhIKlNJuRyhMcakSCVn_Aydh7AdImOSjJFaWgfKJ88edNdYt05M55O5-lnLbu1stJ-QPO7aaPsW0pnWEELyZj1E1SflRjkH7ZDjJpnbgR6Qtt-oGmKycP0uhgt0alQb4PI4J-hlfrcqH9Ll0_2inC1TnUkSUxBFVpCaMMpIrnPBMi24NpgWdQEmb-q6wQaLhtc1M4oohYHmWaaEoQQMF3SCbg53e9997CDEatvtvBteVhkRjBHBiz2VHyjtuxA8mErbqKLtXPTKthXB1V5nNeis9jqro86hiP8Ue2_flf_6r3J9qFgA-MUFxzJngn4DyOWCiw
CODEN ITVTAB
CitedBy_id crossref_primary_10_1109_TVT_2022_3213752
crossref_primary_10_1109_TWC_2022_3143543
crossref_primary_10_1109_TSP_2017_2713766
crossref_primary_10_1109_ACCESS_2017_2696032
crossref_primary_10_1109_TIFS_2021_3080499
crossref_primary_10_1109_JSAC_2018_2825079
crossref_primary_10_1109_LCOMM_2024_3450275
crossref_primary_10_1109_TCOMM_2022_3222022
crossref_primary_10_1109_TCOMM_2019_2899628
crossref_primary_10_1109_TWC_2018_2810072
crossref_primary_10_1109_TVT_2018_2802915
crossref_primary_10_1109_ACCESS_2018_2792155
crossref_primary_10_1109_TVT_2024_3384959
crossref_primary_10_1109_TWC_2020_2985968
crossref_primary_10_1109_JSAC_2018_2825818
crossref_primary_10_1049_iet_com_2019_0244
Cites_doi 10.1109/SPCOM.2014.6983915
10.1162/08997660360581958
10.1109/TVT.2012.2195339
10.1109/LCOMM.2013.040213.130082
10.1109/TWC.2009.080621
10.1109/TIT.2008.2006422
10.1109/TSP.2012.2188717
10.1109/TCOMM.2011.041111.090713
10.1109/TIT.2006.876220
10.1109/GLOCOM.2008.ECP.898
10.1109/JSAC.2012.121103
10.1002/j.1538-7305.1975.tb02040.x
10.1109/TWC.2012.122212.120324
10.1002/j.1538-7305.1949.tb00928.x
10.1109/TCOMM.2012.072612.110686
10.1109/TCOMM.2014.2345659
10.1109/TIT.2009.2039045
10.1007/978-3-0348-9297-1_18
10.1109/JSAC.2013.130902
10.1109/TWC.2016.2515090
10.1109/TSP.2011.2140112
10.1109/TSP.2014.2326617
10.1109/TCOMM.2014.2329471
10.1007/s10898-008-9343-5
10.1109/TWC.2004.833444
10.1109/TIT.2008.921680
10.1109/JSAC.2008.080105
10.1017/CBO9780511804441
10.1109/MSP.2010.936019
10.1109/JPROC.2009.2015717
10.1109/TCOMM.2012.091212.110199
10.1109/TSP.2012.2208635
10.1007/978-3-662-03199-5
10.1109/TWC.2011.091911.110508
10.1109/LSP.2014.2370033
10.1109/TIT.1978.1055892
10.1007/s10898-009-9456-5
10.1007/s101070050100
10.1109/TWC.2014.022614.130860
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017
DBID 97E
RIA
RIE
AAYXX
CITATION
7SP
8FD
FR3
KR7
L7M
DOI 10.1109/TVT.2016.2590539
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Electronics & Communications Abstracts
Technology Research Database
Engineering Research Database
Civil Engineering Abstracts
Advanced Technologies Database with Aerospace
DatabaseTitle CrossRef
Civil Engineering Abstracts
Engineering Research Database
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
DatabaseTitleList Civil Engineering Abstracts

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1939-9359
EndPage 3070
ExternalDocumentID 10_1109_TVT_2016_2590539
7509647
Genre orig-research
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: 61322102
  funderid: 10.13039/501100001809
– fundername: national 863 project
  grantid: 2015AA01A710
– fundername: U.S. National Science Foundation
  grantid: ECCS-1231848; ECCS-1539316
– fundername: national 973 project
  grantid: 2012CB316106
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
5GY
5VS
6IK
97E
AAIKC
AAJGR
AAMNW
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
ACNCT
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
HZ~
H~9
IAAWW
IBMZZ
ICLAB
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
RIA
RIE
RNS
RXW
TAE
TN5
VH1
AAYOK
AAYXX
CITATION
RIG
7SP
8FD
FR3
KR7
L7M
ID FETCH-LOGICAL-c291t-e78281b143416c6742c75cf038b8ef6dbbd0f07d5bb4fa1aa0e3622a7f31ef573
IEDL.DBID RIE
ISSN 0018-9545
IngestDate Mon Jun 30 10:18:27 EDT 2025
Tue Jul 01 01:04:31 EDT 2025
Thu Apr 24 23:00:38 EDT 2025
Tue Aug 26 16:43:26 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c291t-e78281b143416c6742c75cf038b8ef6dbbd0f07d5bb4fa1aa0e3622a7f31ef573
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-1627-3156
PQID 2174417587
PQPubID 85454
PageCount 12
ParticipantIDs crossref_citationtrail_10_1109_TVT_2016_2590539
proquest_journals_2174417587
ieee_primary_7509647
crossref_primary_10_1109_TVT_2016_2590539
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2017-04-01
PublicationDateYYYYMMDD 2017-04-01
PublicationDate_xml – month: 04
  year: 2017
  text: 2017-04-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on vehicular technology
PublicationTitleAbbrev TVT
PublicationYear 2017
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref34
ref12
ref37
ref15
ref14
ref31
ref30
ref33
ref11
ref32
ref10
ref2
ref1
ref39
ref17
ref38
ref16
ref19
ref18
seber (ref35) 2008; 15
ref24
chan (ref4) 0
ref23
ref26
ref25
ref20
ref42
ref41
ref22
ref21
ref28
ref27
rudin (ref36) 1964; 3
ref29
ref8
ref7
ref9
ref3
ref6
ref5
ref40
References_xml – ident: ref26
  doi: 10.1109/SPCOM.2014.6983915
– ident: ref31
  doi: 10.1162/08997660360581958
– volume: 3
  year: 1964
  ident: ref36
  publication-title: Principles of Mathematical Analysis
– ident: ref23
  doi: 10.1109/TVT.2012.2195339
– ident: ref25
  doi: 10.1109/LCOMM.2013.040213.130082
– ident: ref3
  doi: 10.1109/TWC.2009.080621
– ident: ref8
  doi: 10.1109/TIT.2008.2006422
– ident: ref21
  doi: 10.1109/TSP.2012.2188717
– ident: ref34
  doi: 10.1109/TCOMM.2011.041111.090713
– ident: ref15
  doi: 10.1109/TIT.2006.876220
– ident: ref16
  doi: 10.1109/GLOCOM.2008.ECP.898
– ident: ref20
  doi: 10.1109/JSAC.2012.121103
– ident: ref6
  doi: 10.1002/j.1538-7305.1975.tb02040.x
– ident: ref24
  doi: 10.1109/TWC.2012.122212.120324
– ident: ref5
  doi: 10.1002/j.1538-7305.1949.tb00928.x
– ident: ref10
  doi: 10.1109/TCOMM.2012.072612.110686
– ident: ref13
  doi: 10.1109/TCOMM.2014.2345659
– ident: ref17
  doi: 10.1109/TIT.2009.2039045
– ident: ref30
  doi: 10.1007/978-3-0348-9297-1_18
– ident: ref11
  doi: 10.1109/JSAC.2013.130902
– ident: ref28
  doi: 10.1109/TWC.2016.2515090
– ident: ref18
  doi: 10.1109/TSP.2011.2140112
– ident: ref14
  doi: 10.1109/TSP.2014.2326617
– ident: ref12
  doi: 10.1109/TCOMM.2014.2329471
– ident: ref32
  doi: 10.1007/s10898-008-9343-5
– ident: ref33
  doi: 10.1109/TWC.2004.833444
– volume: 15
  year: 2008
  ident: ref35
  publication-title: A Matrix Handbook for Statisticians
– ident: ref9
  doi: 10.1109/TIT.2008.921680
– ident: ref2
  doi: 10.1109/JSAC.2008.080105
– ident: ref38
  doi: 10.1017/CBO9780511804441
– ident: ref42
  doi: 10.1109/MSP.2010.936019
– ident: ref1
  doi: 10.1109/JPROC.2009.2015717
– ident: ref22
  doi: 10.1109/TCOMM.2012.091212.110199
– ident: ref41
  doi: 10.1109/TSP.2012.2208635
– ident: ref29
  doi: 10.1007/978-3-662-03199-5
– ident: ref19
  doi: 10.1109/TWC.2011.091911.110508
– ident: ref40
  doi: 10.1109/LSP.2014.2370033
– ident: ref7
  doi: 10.1109/TIT.1978.1055892
– ident: ref39
  doi: 10.1007/s10898-009-9456-5
– ident: ref37
  doi: 10.1007/s101070050100
– ident: ref27
  doi: 10.1109/TWC.2014.022614.130860
– start-page: 197
  year: 0
  ident: ref4
  article-title: Random key predistribution schemes for sensor networks
  publication-title: Proc IEEE Symp SP
SSID ssj0014491
Score 2.3154855
Snippet We investigate the fading cognitive multiple-access wiretap channel (CMAC-WT), in which two secondary-user transmitters (STs) send secure messages to a...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 3059
SubjectTerms Algorithms
Approximation
Approximation algorithms
Codes
Cognitive multiple-access wiretap channel (CMAC-WT)
Fading
Fading channels
finite-alphabet inputs
Interference
linear precoding
Mathematical analysis
multiple-input multiple-output (MIMO)
Optimization
physical-layer security
Polynomials
Precoding
Receivers
Secrecy aspects
Security
statistical channel state information (CSI)
Transmitters
Wiretapping
Title Linear Precoding for Fading Cognitive Multiple-Access Wiretap Channel With Finite-Alphabet Inputs
URI https://ieeexplore.ieee.org/document/7509647
https://www.proquest.com/docview/2174417587
Volume 66
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LSwMxEB7anvTgW6xWycGL4La72-wjx1IsVah4qNLbkmQnKJa16Pbir3eS7hZfiLddSCDsTDLft_lmBuA8DyKp0zD3yL6cCIpAT-o88nwjDJ1-XGtXgW9yG4_v-c0smjXgcp0Lg4hOfIZd--ju8vMXvbS_yno2usU8aUKTiNsqV2t9Y8B51R0voA1MsKC-kvRFb_owtRquuEtQn3xOfAlBrqfKj4PYRZfRNkzqda1EJc_dZam6-v1bycb_LnwHtiqYyQYrv9iFBhZ7sPmp-OA-SKKh5ObsznJiG8EY4Vc2cpp6NqxVRWxSKQ69gWutyKxctpQLZtMSCpzTe_nIRk8WunoDm7irsGTXxWJZvh3A_ehqOhx7VcMFT4ciKD0kuEAwliAUwTQdE2vWSaSN309ViibOlcp94yd5pBQ3MpDSR4p_oUxMP0ATJf1DaBUvBR4BQ9rnRuT9EAPk6KtUShGIRMTSICYqbkOvtkGmq2rktinGPHOsxBcZWS2zVssqq7XhYj1jsarE8cfYfWuE9bjq-7ehU5s5q7bqW2Y5GScQlSbHv886gY3QxnIn1-lAq3xd4ikhkVKdORf8AG6k2tk
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwED4VGICBN6I8PbAgkTZJnYfHClG1QBFDQWyR7ZwFAoUK0oVfz9lNKl5CbIlkS1bu7O-7-Ls7gOM8iKROw9wj-3IKUAR6UueR5xth6PTjWrsKfMPruH_LL-6j-wacznJhENGJz7BlH91dfv6iJ_ZXWduiW8yTOVgg3I-CabbW7M6A86o_XkBbmAbUl5K-aI_uRlbFFbeI7JPXiS8g5Lqq_DiKHb70VmFYr2wqK3lqTUrV0u_fijb-d-lrsFIRTdadesY6NLDYgOVP5Qc3QVIgSo7ObmxUbDGMEYNlPaeqZ2e1rogNK82h13XNFZkVzJZyzGxiQoHP9F4-sN6jJa9e16buKizZoBhPyrctuO2dj876XtVywdOhCEoPiTAQkSUSRURNxxQ36yTSxu-kKkUT50rlvvGTPFKKGxlI6SMhYCgT0wnQRElnG-aLlwJ3gCHtdCPyTogBcvRVKqUIRCJiaRATFTehXdsg01U9ctsW4zlzcYkvMrJaZq2WVVZrwslsxnhai-OPsZvWCLNx1fdvwn5t5qzarG-Zjco40ag02f191hEs9kfDq-xqcH25B0uhRXYn3tmH-fJ1ggfES0p16NzxAwGB3iI
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Linear+Precoding+for+Fading+Cognitive+Multiple-Access+Wiretap+Channel+With+Finite-Alphabet+Inputs&rft.jtitle=IEEE+transactions+on+vehicular+technology&rft.au=Jin%2C+Juening&rft.au=Xiao%2C+Chengshan&rft.au=Tao%2C+Meixia&rft.au=Chen%2C+Wen&rft.date=2017-04-01&rft.issn=0018-9545&rft.eissn=1939-9359&rft.volume=66&rft.issue=4&rft.spage=3059&rft.epage=3070&rft_id=info:doi/10.1109%2FTVT.2016.2590539&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TVT_2016_2590539
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9545&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9545&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9545&client=summon