Secret communication in large wireless networks without eavesdropper location information
Authors:
- 1 March 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4 (0743166X) , 1152-1160
Abstract
We present achievable scaling results on the per-node secure throughput that can be realized in a large random wireless network of n legitimate nodes in the presence of m eavesdroppers of unknown location. We consider both one-dimensional and two-dimensional networks. In the one-dimensional case, we show that a per-node secure throughput of order 1/n is achievable if the number of eavesdroppers satisfies m = o(n/log n). We obtain similar results for the two-dimensional case, where a secure throughput of order 1/(√n log n) is achievable under the same condition. The number of eavesdroppers that can be tolerated is significantly higher than previous works that address the case of unknown eavesdropper locations. The key technique introduced in our construction to handle unknown eavesdropper locations forces adversaries to intercept a number of packets to be able to decode a single message. The whole network is divided into regions, where a certain subset of packets is protected from adversaries located in each region. In the one-dimensional case, our construction makes use of artificial noise generation by legitimate nodes to degrade the signal quality at the potential locations of eavesdroppers. In the two-dimensional case, the availability of many paths to reach a destination is utilized to handle collaborating eavesdroppers of unknown location.Keywords
This publication has 24 references indexed in Scilit:
- Physical layer security from inter-session interference in large wireless networks2012
- Artificial Noise Generation from Cooperative Relays for Everlasting Secrecy in Two-Hop Wireless NetworksIEEE Journal on Selected Areas in Communications, 2011
- On the Throughput Cost of Physical Layer Security in Decentralized Wireless NetworksIEEE Transactions on Wireless Communications, 2011
- Security-capacity trade-off in large wireless networks using keyless secrecy2010
- Modeling location uncertainty for eavesdroppers: A secrecy graph approach2010
- On Cooperative Wireless Network Secrecy2009
- Guaranteeing Secrecy using Artificial NoiseIEEE Transactions on Wireless Communications, 2008
- SPREAD: enhancing data confidentiality in mobile ad hoc networks2004
- Efficient dispersal of information for security, load balancing, and fault toleranceJournal of the ACM, 1989
- How to share a secretCommunications of the ACM, 1979