Divide-and-conquer based cooperative jamming: Addressing multiple eavesdroppers in close proximity

Zhihong Liu; Jiajia Liu; Nei Kato; Jianfeng Ma; Qiping Huang

doi:10.1109/INFOCOM.2016.7524448

Divide-and-conquer based cooperative jamming: Addressing multiple eavesdroppers in close proximity

Zhihong Liu, Jiajia Liu, Nei Kato, Jianfeng Ma, Qiping Huang

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

13 Scopus citations

Abstract

This paper investigates divide-and-conquer based cooperative jamming for physical-layer security enhancement in the presence of multiple eavesdroppers. Different from previous works, we consider a scenario where the eavesdroppers can be located anywhere inside the communication region of the source, no location information of the eavesdroppers is available and no constraint on the number of eavesdroppers is presupposed. The basic idea is to transmit the message in multiple rounds and exploit the helpful interference from the source and the destination to jam the eavesdroppers in close proximity. Stochastic geometry based analytic results as well as Monte Carlo simulations are presented to illustrate the achievable secrecy performances.

Original language	English
Title of host publication	IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9781467399531
DOIs	https://doi.org/10.1109/INFOCOM.2016.7524448
State	Published - 27 Jul 2016
Externally published	Yes
Event	35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016 - San Francisco, United States Duration: 10 Apr 2016 → 14 Apr 2016

Publication series

Name	Proceedings - IEEE INFOCOM
Volume	2016-July
ISSN (Print)	0743-166X

Conference

Conference	35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016
Country/Territory	United States
City	San Francisco
Period	10/04/16 → 14/04/16

Access to Document

10.1109/INFOCOM.2016.7524448

Cite this

Liu, Z., Liu, J., Kato, N., Ma, J., & Huang, Q. (2016). Divide-and-conquer based cooperative jamming: Addressing multiple eavesdroppers in close proximity. In IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications Article 7524448 (Proceedings - IEEE INFOCOM; Vol. 2016-July). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/INFOCOM.2016.7524448

@inproceedings{0642494db0354cd888a9392636149932,

title = "Divide-and-conquer based cooperative jamming: Addressing multiple eavesdroppers in close proximity",

abstract = "This paper investigates divide-and-conquer based cooperative jamming for physical-layer security enhancement in the presence of multiple eavesdroppers. Different from previous works, we consider a scenario where the eavesdroppers can be located anywhere inside the communication region of the source, no location information of the eavesdroppers is available and no constraint on the number of eavesdroppers is presupposed. The basic idea is to transmit the message in multiple rounds and exploit the helpful interference from the source and the destination to jam the eavesdroppers in close proximity. Stochastic geometry based analytic results as well as Monte Carlo simulations are presented to illustrate the achievable secrecy performances.",

author = "Zhihong Liu and Jiajia Liu and Nei Kato and Jianfeng Ma and Qiping Huang",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016 ; Conference date: 10-04-2016 Through 14-04-2016",

year = "2016",

month = jul,

day = "27",

doi = "10.1109/INFOCOM.2016.7524448",

language = "英语",

series = "Proceedings - IEEE INFOCOM",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications",

}

Liu, Z, Liu, J, Kato, N, Ma, J & Huang, Q 2016, Divide-and-conquer based cooperative jamming: Addressing multiple eavesdroppers in close proximity. in IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications., 7524448, Proceedings - IEEE INFOCOM, vol. 2016-July, Institute of Electrical and Electronics Engineers Inc., 35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016, San Francisco, United States, 10/04/16. https://doi.org/10.1109/INFOCOM.2016.7524448

Divide-and-conquer based cooperative jamming: Addressing multiple eavesdroppers in close proximity. / Liu, Zhihong; Liu, Jiajia; Kato, Nei et al.
IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications. Institute of Electrical and Electronics Engineers Inc., 2016. 7524448 (Proceedings - IEEE INFOCOM; Vol. 2016-July).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Divide-and-conquer based cooperative jamming

T2 - 35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016

AU - Liu, Zhihong

AU - Liu, Jiajia

AU - Kato, Nei

AU - Ma, Jianfeng

AU - Huang, Qiping

PY - 2016/7/27

Y1 - 2016/7/27

N2 - This paper investigates divide-and-conquer based cooperative jamming for physical-layer security enhancement in the presence of multiple eavesdroppers. Different from previous works, we consider a scenario where the eavesdroppers can be located anywhere inside the communication region of the source, no location information of the eavesdroppers is available and no constraint on the number of eavesdroppers is presupposed. The basic idea is to transmit the message in multiple rounds and exploit the helpful interference from the source and the destination to jam the eavesdroppers in close proximity. Stochastic geometry based analytic results as well as Monte Carlo simulations are presented to illustrate the achievable secrecy performances.

AB - This paper investigates divide-and-conquer based cooperative jamming for physical-layer security enhancement in the presence of multiple eavesdroppers. Different from previous works, we consider a scenario where the eavesdroppers can be located anywhere inside the communication region of the source, no location information of the eavesdroppers is available and no constraint on the number of eavesdroppers is presupposed. The basic idea is to transmit the message in multiple rounds and exploit the helpful interference from the source and the destination to jam the eavesdroppers in close proximity. Stochastic geometry based analytic results as well as Monte Carlo simulations are presented to illustrate the achievable secrecy performances.

UR - http://www.scopus.com/inward/record.url?scp=84983354259&partnerID=8YFLogxK

U2 - 10.1109/INFOCOM.2016.7524448

DO - 10.1109/INFOCOM.2016.7524448

M3 - 会议稿件

AN - SCOPUS:84983354259

T3 - Proceedings - IEEE INFOCOM

BT - IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications

PB - Institute of Electrical and Electronics Engineers Inc.

Y2 - 10 April 2016 through 14 April 2016

ER -

Divide-and-conquer based cooperative jamming: Addressing multiple eavesdroppers in close proximity

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this