Motivated by information-theoretic secrecy, geometric models for secrecy in wireless networks have begun to receive increased attention. The general question is how the presence of eavesdroppers affects the properties and performance of the network. Previously, the focus has been mostly on connectivity. Here we study the impact of eavesdroppers on the coverage of a network of base stations. The problem we address is the following. Let base stations and eavesdroppers be distributed as stationary Poisson point processes in a disk of area n. If the coverage of each base station is limited by the distance to the nearest eavesdropper, what is the maximum density of eavesdroppers that can be accommodated while still achieving full coverage, asymptotically as n→∞?
Required Publisher's Statement
Published by Taylor & Francis Group
Link to publisher version: http://www.tandfonline.com/doi/abs/10.1080/15427951.2012.673333
Sarkar, Amites and Haenggi, Martin, "Secrecy Coverage" (2013). Mathematics. Paper 88.