Modeling location uncertainty for eavesdroppers: A secrecy graph approach

Satashu Goel, Vaneet Aggarwal, Aylin Yener, A. Robert Calderbank

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    38 Scopus citations

    Abstract

    In this paper, we consider end-to-end secure communication in a large wireless network, where the locations of eavesdroppers are uncertain. Our framework attempts to bridge the gap between physical layer security under uncertain channel state information of the eavesdropper and network level connectivity under security constraints, by modeling location uncertainty directly at the network level as correlated node and link failures in a secrecy graph. Bounds on the percolation threshold are obtained for square and triangular lattices, and bounds on mean degree are obtained for Poisson secrecy graphs. Both analytic and simulation results show the dramatic effect of uncertainty in location of eavesdroppers on connectivity in a secrecy graph.

    Original languageEnglish (US)
    Title of host publication2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
    Pages2627-2631
    Number of pages5
    DOIs
    StatePublished - Aug 23 2010
    Event2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States
    Duration: Jun 13 2010Jun 18 2010

    Publication series

    NameIEEE International Symposium on Information Theory - Proceedings
    ISSN (Print)2157-8103

    Other

    Other2010 IEEE International Symposium on Information Theory, ISIT 2010
    Country/TerritoryUnited States
    CityAustin, TX
    Period6/13/106/18/10

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Information Systems
    • Modeling and Simulation
    • Applied Mathematics

    Fingerprint

    Dive into the research topics of 'Modeling location uncertainty for eavesdroppers: A secrecy graph approach'. Together they form a unique fingerprint.

    Cite this