Rethinking the Intercept Probability of Random Linear Network Coding

Amjad Saeed Khan, Andrea Tassi, Ioannis Chatzigeorgiou

Research output: Contribution to journalLetter (Academic Journal)peer-review

15 Citations (Scopus)
319 Downloads (Pure)

Abstract

This letter considers a network comprising a transmitter, which employs random linear network coding to encode a message, a legitimate receiver, which can recover the message if it gathers a sufficient number of linearly independent coded packets, and an eavesdropper. Closed-form expressions for the probability of the eavesdropper intercepting enough coded packets to recover the message are derived. Transmission with and without feedback is studied. Furthermore, an optimization model that minimizes the intercept probability under delay and reliability constraints is presented. Results validate the proposed analysis and quantify the secrecy gain offered by a feedback link from the legitimate receiver.
Original languageEnglish
Pages (from-to)1762-1765
Number of pages4
JournalIEEE Communications Letters
Volume19
Issue number10
DOIs
Publication statusPublished - 8 Oct 2015

Keywords

  • Network coding
  • fountain coding
  • intercept probability
  • physical layer security
  • secrecy outage probability

Fingerprint Dive into the research topics of 'Rethinking the Intercept Probability of Random Linear Network Coding'. Together they form a unique fingerprint.

Cite this