Secrecy Coverage (Conference Proceeding)

摘要: 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 properties and performance network. Previously focus has been mostly on connectivity. Here we study impact coverage a network base stations. problem address following. Let stations be distributed as stationary Poisson point processes disk area n. If each station limited distance nearest eavesdropper, what maximum density that can accommodated while still achieving full coverage, asymptotically n → ∞?