Unicasting on the Secrecy Graph

We consider the secrecy capacity of unicast channels of ad hoc networks exposed to randomly located eavesdroppers, as modeled by S-Graphs. Expressions that quantify the impact of fading and of the density of legitimate nodes relative to that of eavesdroppers are obtained, in terms of the probability...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information forensics and security 2013-09, Vol.8 (9), p.1469-1481
Main Authors: Vuppala, Satyanaranaya, de Abreu, Giuseppe T. F.
Format: Article
Language:English
Subjects:
Applied sciences
Capacity planning
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Equations
Equipments and installations
Exact sciences and technology
fading
Indexes
Mathematical model
Memory and file management (including protection and security)
Memory organisation. Data processing
Mobile radiocommunication systems
Radiocommunications
Random networks
Rayleigh channels
secrecy capacity
Software
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
Unicast
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider the secrecy capacity of unicast channels of ad hoc networks exposed to randomly located eavesdroppers, as modeled by S-Graphs. Expressions that quantify the impact of fading and of the density of legitimate nodes relative to that of eavesdroppers are obtained, in terms of the probability that secrecy capacities of unicast channels are nonzero. The results indicate that depending on the relative density of eavesdroppers and the fading intensity, the secrecy capacity of unicast channels subject to fading may be higher than under additive white Gaussian noise (AWGN).
ISSN:1556-6013
1556-6021
DOI:10.1109/TIFS.2013.2274954