Secrecy throughput of MANETs under passive and active attacks

Yingbin Liang, H. Vincent Poor, Lei Ying

Research output: Contribution to journalArticle

25 Citations (Scopus)

Abstract

The secrecy throughput of mobile ad hoc networks (MANETs) with malicious nodes is investigated. The MANET consists of n legitimate mobile nodes and m malicious nodes. Transmissions between legitimate nodes are subject to a delay constraint D. A model under passive attack is first studied, in which the malicious nodes are assumed to be eavesdroppers that only listen to transmission without actively injecting signals. An information-theoretic approach for security is applied to achieve secure communication among legitimate nodes in MANETs with transmissions being kept perfectly secure from eavesdroppers. A critical threshold on the number of malicious nodes (m) is identified such that when m=o(√nD), i.e., lim n → ∞ m| √ nD=0, the optimal secrecy throughput equals that of MANETs without malicious nodes, i.e., the impact of the presence of malicious nodes on the network throughput is negligible; and when m=Ω (√nD poly(n), i.e., lim → m| (√nDpoly(n)) ≥ c for a positive constant {\rm c}, the optimal secrecy throughput is limited by the number of malicious nodes. A model under active attack is further studied, in which the malicious nodes actively attack the network by transmitting modified packets to the destination nodes. It is shown that to guarantee the same throughput as the model under passive attack, the model under active attack needs to satisfy more stringent condition on the number of malicious nodes.

Original languageEnglish (US)
Article number6034725
Pages (from-to)6692-6702
Number of pages11
JournalIEEE Transactions on Information Theory
Volume57
Issue number10
DOIs
StatePublished - Oct 1 2011

Fingerprint

secrecy
Mobile ad hoc networks
Throughput
guarantee
communication

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Library and Information Sciences
  • Computer Science Applications

Cite this

@article{d642ecafda9e40f499470be26ad78d17,
title = "Secrecy throughput of MANETs under passive and active attacks",
abstract = "The secrecy throughput of mobile ad hoc networks (MANETs) with malicious nodes is investigated. The MANET consists of n legitimate mobile nodes and m malicious nodes. Transmissions between legitimate nodes are subject to a delay constraint D. A model under passive attack is first studied, in which the malicious nodes are assumed to be eavesdroppers that only listen to transmission without actively injecting signals. An information-theoretic approach for security is applied to achieve secure communication among legitimate nodes in MANETs with transmissions being kept perfectly secure from eavesdroppers. A critical threshold on the number of malicious nodes (m) is identified such that when m=o(√nD), i.e., lim n → ∞ m| √ nD=0, the optimal secrecy throughput equals that of MANETs without malicious nodes, i.e., the impact of the presence of malicious nodes on the network throughput is negligible; and when m=Ω (√nD poly(n), i.e., lim → m| (√nDpoly(n)) ≥ c for a positive constant {\rm c}, the optimal secrecy throughput is limited by the number of malicious nodes. A model under active attack is further studied, in which the malicious nodes actively attack the network by transmitting modified packets to the destination nodes. It is shown that to guarantee the same throughput as the model under passive attack, the model under active attack needs to satisfy more stringent condition on the number of malicious nodes.",
author = "Yingbin Liang and Poor, {H. Vincent} and Lei Ying",
year = "2011",
month = "10",
day = "1",
doi = "https://doi.org/10.1109/TIT.2011.2165800",
language = "English (US)",
volume = "57",
pages = "6692--6702",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

Secrecy throughput of MANETs under passive and active attacks. / Liang, Yingbin; Poor, H. Vincent; Ying, Lei.

In: IEEE Transactions on Information Theory, Vol. 57, No. 10, 6034725, 01.10.2011, p. 6692-6702.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Secrecy throughput of MANETs under passive and active attacks

AU - Liang, Yingbin

AU - Poor, H. Vincent

AU - Ying, Lei

PY - 2011/10/1

Y1 - 2011/10/1

N2 - The secrecy throughput of mobile ad hoc networks (MANETs) with malicious nodes is investigated. The MANET consists of n legitimate mobile nodes and m malicious nodes. Transmissions between legitimate nodes are subject to a delay constraint D. A model under passive attack is first studied, in which the malicious nodes are assumed to be eavesdroppers that only listen to transmission without actively injecting signals. An information-theoretic approach for security is applied to achieve secure communication among legitimate nodes in MANETs with transmissions being kept perfectly secure from eavesdroppers. A critical threshold on the number of malicious nodes (m) is identified such that when m=o(√nD), i.e., lim n → ∞ m| √ nD=0, the optimal secrecy throughput equals that of MANETs without malicious nodes, i.e., the impact of the presence of malicious nodes on the network throughput is negligible; and when m=Ω (√nD poly(n), i.e., lim → m| (√nDpoly(n)) ≥ c for a positive constant {\rm c}, the optimal secrecy throughput is limited by the number of malicious nodes. A model under active attack is further studied, in which the malicious nodes actively attack the network by transmitting modified packets to the destination nodes. It is shown that to guarantee the same throughput as the model under passive attack, the model under active attack needs to satisfy more stringent condition on the number of malicious nodes.

AB - The secrecy throughput of mobile ad hoc networks (MANETs) with malicious nodes is investigated. The MANET consists of n legitimate mobile nodes and m malicious nodes. Transmissions between legitimate nodes are subject to a delay constraint D. A model under passive attack is first studied, in which the malicious nodes are assumed to be eavesdroppers that only listen to transmission without actively injecting signals. An information-theoretic approach for security is applied to achieve secure communication among legitimate nodes in MANETs with transmissions being kept perfectly secure from eavesdroppers. A critical threshold on the number of malicious nodes (m) is identified such that when m=o(√nD), i.e., lim n → ∞ m| √ nD=0, the optimal secrecy throughput equals that of MANETs without malicious nodes, i.e., the impact of the presence of malicious nodes on the network throughput is negligible; and when m=Ω (√nD poly(n), i.e., lim → m| (√nDpoly(n)) ≥ c for a positive constant {\rm c}, the optimal secrecy throughput is limited by the number of malicious nodes. A model under active attack is further studied, in which the malicious nodes actively attack the network by transmitting modified packets to the destination nodes. It is shown that to guarantee the same throughput as the model under passive attack, the model under active attack needs to satisfy more stringent condition on the number of malicious nodes.

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

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

U2 - https://doi.org/10.1109/TIT.2011.2165800

DO - https://doi.org/10.1109/TIT.2011.2165800

M3 - Article

VL - 57

SP - 6692

EP - 6702

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 10

M1 - 6034725

ER -