Unicasting on the Secrecy Graph

• Published in: IEEE transactions on information forensics and security Vol. 8; no. 9; pp. 1469 - 1481
• Main Authors: Vuppala, Satyanaranaya, de Abreu, Giuseppe
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.09.2013; Institute of Electrical and Electronics Engineers
• 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; Fading channels; Channel capacity; Probabilistic approach; Graph theory; Random networks; fading; Eavesdropping; Unicast; secrecy capacity; Wireless network; Ad hoc network; Secrecy; Computer security; Computer attack
• ISSN: 1556-6013; 1556-6021
• DOI: 10.1109/TIFS.2013.2274954

We consider the secrecy capacity of unicast channels of ad hoc networks exposed to randomly located eavesdroppers, as modeled by {\cal 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).