On optimizing the security-throughput trade-off in wireless networks with adversaries

Authors:
Mohamed A. Haleem;Chetan Nanjunda Mathur;R. Chandramouli;K. P. Subbalakshmi
Affiliations:
Department of Electrical and Computer Engineering, Stevens Institute of Technology, Hoboken, NJ;Department of Electrical and Computer Engineering, Stevens Institute of Technology, Hoboken, NJ;Department of Electrical and Computer Engineering, Stevens Institute of Technology, Hoboken, NJ;Department of Electrical and Computer Engineering, Stevens Institute of Technology, Hoboken, NJ
Venue:
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Year:
2006

Citing 5
Cited 0

Elements of information theory

Elements of information theory
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C

Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Cryptography: Theory and Practice

Cryptography: Theory and Practice
Introduction to Algorithms

Introduction to Algorithms
Convex Optimization

Convex Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we model the adversary (eavesdropper) present in the wireless communication medium using probabilistic models. We precisely formulate the security-throughput optimization and derive analytical solutions. The effect of different adversary models, and single and multi-rate modulation schemes (BPSK and MQAM) are studied. Simulation results are given to show that significant throughput gain can be achieved by using link (channel) adaptive and adversary adaptive encryption techniques compared to fixed block length encryption.