@techreport{TD:100201,
	att_abstract={{This paper investigates the effect of eavesdroppers on network connectivity, using a wiretap model and
percolation theory. The wiretap model captures the effect of eavesdroppers on link security. A link exists
between two nodes only if the secrecy capacity of that link is positive. Network connectivity is defined in
percolation sense, i.e., connectivity exists if an infinite connected component exists in the corresponding
secrecy graph. We consider uncertainty in location of eavesdroppers, which is modeled directly at the
network level as correlated failures in the secrecy graph. Our approach attempts to bridge the gap between
physical layer security under uncertain channel state information and network level connectivity under
secrecy constraints. For square and triangular lattice secrecy graphs, we obtain bounds on the percolation
threshold, which is the critical value of the probability of occurrence of an eavesdropper, above which
network connectivity does not exist. For Poisson secrecy graphs, degree distribution and mean value of
upper and lower bounds on node degree are obtained. Further, inner and outer bounds on the achievable
region for network connectivity are obtained. Both analytic and simulation results show that uncertainty
in location of eavesdroppers has a dramatic effect on network connectivity in a secrecy graph.}},
	att_authors={va037f},
	att_categories={C_CCF.3},
	att_copyright={{IEEE}},
	att_copyright_notice={{}},
	att_donotupload={true},
	att_private={false},
	att_projects={},
	att_tags={},
	att_techdoc={true},
	att_techdoc_key={TD:100201},
	att_url={},
	author={Vaneet Aggarwal and Satashu Goel and Robert Calderbank and Aylin Yener},
	institution={{IEEE Transactions on Information Forensics and Security}},
	month={May},
	title={{The Effect of Eavesdroppers on Network Connectivity: A Secrecy Graph Approach}},
	year=2011,
}