2010/01/09 by Jiangyuan Li, Athina P. Petropulu, Steven Weber · 1 citation
Computer Science · Engineering · Mathematics · #Artificial noise #Channel (broadcasting) #Computer network #Computer science #Computer security #Constraint (computer-aided design) #Cooperative Communication and Network Coding #Jamming #Mathematical optimization #Mathematics #Maximization #Node (physics) #Physical layer #Secrecy #Secure transmission #Security in Wireless Sensor Networks #Telecommunications #Transmission (telecommunications) #Transmitter #Transmitter power output #Wireless #Wireless Communication Security Techniques #Wireless network #cs.IT #math.IT
paper · pdf · doi:10.1109/tsp.2011.2159598
30 pages, 8 figures
arxiv created 2010/01/09 · openalex publication_date 2011/06/21 · arxiv updated 2015/05/14 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
We consider a cooperative wireless network in the presence of one or more eavesdroppers, and exploit node cooperation for achieving physical (PHY) layer based security. Two different cooperation schemes are considered. In the first scheme, cooperating nodes retransmit a weighted version of the source signal in a decode-and-forward (DF) fashion. In the second scheme, referred to as cooperative jamming (CJ), while the source is transmitting, cooperating nodes transmit weighted noise to confound the eavesdropper. We investigate two objectives: i) maximization of the achievable secrecy rate subject to a total power constraint and ii) minimization of the total power transmit power under a secrecy rate constraint. For the first design objective, we obtain the exact solution for the DF scheme for the case of a single or multiple eavasdroppers, while for the CJ scheme with a single eavesdropper we reduce the multivariate problem to a problem of one variable. For the second design objective, existing work introduces additional constraints in order to reduce the degree of difficulty, thus resulting in suboptimal solutions. Our work raises those constraints, and obtains either an analytical solution for the DF scheme with a single eavesdropper, or reduces the multivariate problem to a problem of one variable for the CJ scheme with a single eavesdropper. Numerical results are presented to illustrate the proposed results and compare them to existing work.