Skip to content

On Intercept Probability Minimization under Sparse Random Linear Network Coding

Research output: Contribution to journalArticle

Standard

On Intercept Probability Minimization under Sparse Random Linear Network Coding. / Tassi, Andrea; Piechocki, Robert J.; Nix, Andrew.

In: IEEE Transactions on Vehicular Technology, Vol. 68, No. 6, 8673872, 25.03.2019, p. 6137-6141.

Research output: Contribution to journalArticle

Harvard

Tassi, A, Piechocki, RJ & Nix, A 2019, 'On Intercept Probability Minimization under Sparse Random Linear Network Coding', IEEE Transactions on Vehicular Technology, vol. 68, no. 6, 8673872, pp. 6137-6141. https://doi.org/10.1109/TVT.2019.2907290

APA

Tassi, A., Piechocki, R. J., & Nix, A. (2019). On Intercept Probability Minimization under Sparse Random Linear Network Coding. IEEE Transactions on Vehicular Technology, 68(6), 6137-6141. [8673872]. https://doi.org/10.1109/TVT.2019.2907290

Vancouver

Tassi A, Piechocki RJ, Nix A. On Intercept Probability Minimization under Sparse Random Linear Network Coding. IEEE Transactions on Vehicular Technology. 2019 Mar 25;68(6):6137-6141. 8673872. https://doi.org/10.1109/TVT.2019.2907290

Author

Tassi, Andrea ; Piechocki, Robert J. ; Nix, Andrew. / On Intercept Probability Minimization under Sparse Random Linear Network Coding. In: IEEE Transactions on Vehicular Technology. 2019 ; Vol. 68, No. 6. pp. 6137-6141.

Bibtex

@article{c1153ef5d4914dcc970c6dd68438b4b7,
title = "On Intercept Probability Minimization under Sparse Random Linear Network Coding",
abstract = "This paper considers a network where a node wishes to transmit a source message to a legitimate receiver in the presence of an eavesdropper. The transmitter secures its transmissions employing a sparse implementation of random linear network coding (RLNC). A tight approximation to the probability of the eavesdropper recovering the source message is provided. The proposed approximation applies to both the cases where transmissions occur without feedback, or where the reliability of the feedback channel is impaired by an eavesdropper jamming the feedback channel. An optimization framework for minimizing the intercept probability by optimizing the sparsity of the RLNC is also presented. Results validate the proposed approximation and quantify the gain provided by our optimization over solutions where non-sparse RLNC is used.",
keywords = "intercept probability, physical layer security, secrecy outage probability, Sparse random network coding",
author = "Andrea Tassi and Piechocki, {Robert J.} and Andrew Nix",
year = "2019",
month = "3",
day = "25",
doi = "10.1109/TVT.2019.2907290",
language = "English",
volume = "68",
pages = "6137--6141",
journal = "IEEE Transactions on Vehicular Technology",
issn = "0018-9545",
publisher = "Institute of Electrical and Electronics Engineers (IEEE)",
number = "6",

}

RIS - suitable for import to EndNote

TY - JOUR

T1 - On Intercept Probability Minimization under Sparse Random Linear Network Coding

AU - Tassi, Andrea

AU - Piechocki, Robert J.

AU - Nix, Andrew

PY - 2019/3/25

Y1 - 2019/3/25

N2 - This paper considers a network where a node wishes to transmit a source message to a legitimate receiver in the presence of an eavesdropper. The transmitter secures its transmissions employing a sparse implementation of random linear network coding (RLNC). A tight approximation to the probability of the eavesdropper recovering the source message is provided. The proposed approximation applies to both the cases where transmissions occur without feedback, or where the reliability of the feedback channel is impaired by an eavesdropper jamming the feedback channel. An optimization framework for minimizing the intercept probability by optimizing the sparsity of the RLNC is also presented. Results validate the proposed approximation and quantify the gain provided by our optimization over solutions where non-sparse RLNC is used.

AB - This paper considers a network where a node wishes to transmit a source message to a legitimate receiver in the presence of an eavesdropper. The transmitter secures its transmissions employing a sparse implementation of random linear network coding (RLNC). A tight approximation to the probability of the eavesdropper recovering the source message is provided. The proposed approximation applies to both the cases where transmissions occur without feedback, or where the reliability of the feedback channel is impaired by an eavesdropper jamming the feedback channel. An optimization framework for minimizing the intercept probability by optimizing the sparsity of the RLNC is also presented. Results validate the proposed approximation and quantify the gain provided by our optimization over solutions where non-sparse RLNC is used.

KW - intercept probability

KW - physical layer security

KW - secrecy outage probability

KW - Sparse random network coding

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

U2 - 10.1109/TVT.2019.2907290

DO - 10.1109/TVT.2019.2907290

M3 - Article

VL - 68

SP - 6137

EP - 6141

JO - IEEE Transactions on Vehicular Technology

JF - IEEE Transactions on Vehicular Technology

SN - 0018-9545

IS - 6

M1 - 8673872

ER -