Asilomar Conference on Signals, Systems and Computers (ACSSC)
Unicasting on the S-Graph
Satyanaranaya Vuppala, Giuseppe Thadeu Freitas de Abreu
Abstract
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 non-zero. 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 that under AWGN.