Secrecy throughput of MANETs with malicious nodes

Yingbin Liang, H. Vincent Poor, Lei Ying

Research output: Chapter in Book/Entry/PoemConference contribution

37 Scopus citations


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. An information theoretic approach for security is applied to achieve secure comm unication among legitimate nodes in MANETs with transmissions being kept perfectly secure from malicious nodes. A critical threshold on the number of malicious nodes (m) is identified such that when m = o(..;;:J5), i.e., limn ---7oo m/..;;:J5 = 0, the secrecy throughput equals the throughput of MANETs without malicious nodes, i.e., the impact of the presence of malicious nodes on the network throughput is negligible; and when m = n (J5poly(n)), i.e., limn--<oo mj ( ..;;:J5poly(n)) :0:: c for a positive constant c, the secrecy throughput is limited by the number of malicious nodes.

Original languageEnglish (US)
Title of host publication2009 IEEE International Symposium on Information Theory, ISIT 2009
Number of pages5
StatePublished - 2009
Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
Duration: Jun 28 2009Jul 3 2009

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8102


Other2009 IEEE International Symposium on Information Theory, ISIT 2009
Country/TerritoryKorea, Republic of

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics


Dive into the research topics of 'Secrecy throughput of MANETs with malicious nodes'. Together they form a unique fingerprint.

Cite this