Secrecy throughput of MANETs with malicious nodes

  • Authors:
  • Yingbin Liang;H. Vincent Poor;Lei Ying

  • Affiliations:
  • Department of Electrical Engineering, University of Hawaii at Manoa, Honolulu, HI;Department of Electrical Engineering, Princeton University, Princeton, NJ;Department of Electrical and Computer Engineering, Iowa State University, Ames, IA

  • Venue:
  • ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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. An information theoretic approach for security is applied to achieve secure communication 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(√nD), i.e., limn→∞ m/√nD = 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 = Ω (√nDpoly(n)), i.e., limn→∞ m/(√nDpoly(n)) ≥ c for a positive constant c, the secrecy throughput is limited by the number of malicious nodes.