Sudarshan Vasudevan
ABSTRACT
We investigate the scalability of a class of algorithms that exploit the dynamics of wireless fading channels to achieve secret communication in a large wireless network of n randomly located nodes. We describe a construction in which nodes transmit artificial noise to suppress eavesdroppers whose locations are unknown and ensure secrecy of messages transported across the network. Under a model in which eavesdroppers operate independently and under appropriate conditions on the achievable per-node throughput Ψ(n), we show that the network can tolerate Ω((1⁄√n(n))2c) eavesdroppers while ensuring that the aggregate rate at which eavesdroppers intercept packets goes to 0, where c is a constant such that 0 < c < 1. The result clearly establishes a trade-off between the achievable throughput and the allowable number of eavesdroppers. Under a collaborating eavesdropper model and a similar constraint on the eavesdropper throughput, we show that the network can tolerate a single eavesdropper with Ω((ln 1⁄√n(n))1ε) antennas, ∀ε > 0. We also establish sufficient conditions on the number of eavesdroppers to achieve a non-zero throughput in our construction.
- }}V. Brik, S. Banerjee, M. Gruteser, and S. Oh. Wireless device identification with radiometric signatures. In ACM MOBICOM, pages 116--127, 2008. Google Scholar
Digital Library
- }}P. Embrechts, C. Kluppelberg, and T. Mikosch. Modelling extremal events for insurance and finance. Springer-Verlag, 1997. Google ScholarDigital Library
- }}M. Franceschetti, O. Dousse, D. N. C. Tse, and P. Thiran. Closing the gap in the capacity of wireless networks via percolation theory. IEEE Transactions on Information Theory, 53:1009--1018, 2007. Google ScholarDigital Library
- }}S. Goel and R. Negi. Guaranteeing secrecy using artificial noise. IEEE Transactions on Wireless Communications, 7(6):2180--2189, 2008. Google ScholarDigital Library
- }}P. Gupta and P. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, 46(2):388--404, 2000. Google ScholarDigital Library
- }}M. Haenggi. The secrecy graph and some of its properties. In IEEE ISIT, 2008.Google ScholarCross Ref
- }}J. Hershey, A. Hassan, and R. Yarlagadda. Unconventional cryptographic keying variable management. IEEE Transactions on Communications, 43(1):3--6, 1995.Google ScholarCross Ref
- }}O. Koyluoglu, C. E. Koksal, and H. E. Gamal. On secrecy capacity scaling in wireless networks. Under submission, (eprint arXiv:0908.0898), 2009.Google Scholar
- }}Y. Liang, H. Poor, and L. Ying. Secrecy throughput of manets with malicious nodes. In International Symposium on Information Theory, 2009. Google ScholarDigital Library
- }}M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005. Google ScholarDigital Library
- }}Y. Nebat. A lower bound for the achievable throughput in large wireless networks under fixed multipath fading. In IEEE SpaSWiN, 2006.Google ScholarCross Ref
- }}E. Perron, S. N. Diggavi, and E. Telatar. On cooperative wireless network secrecy. In IEEE INFOCOM, 2009.Google ScholarCross Ref
- }}S. Toumpis. Capacity and Cross-Layer Design of Wireless Ad Hoc Networks. PhD thesis, Stanford University, 2003.Google Scholar
- }}D. Tse and P. Viswanath. Fundamentals of Wireless Communication. Cambridge University Press, 2005. Google ScholarDigital Library
- }}S. Vasudevan, S. Adams, D. Goeckel, Z. Ding, D. Towsley, and K. Leung. Multi-user diversity for secrecy in wireless networks. In Information Theory and Applications Workshop, 2009.Google Scholar
- }}S. Vasudevan, D. Goeckel, and D. Towsley. Security-capacity trade-off in large wireless networks using keyless secrecy. Technical Report UM-CS-2010-042, UMass Computer Science, 2010.Google ScholarDigital Library
- }}A. D. Wyner. The wire-tap channel. Bell Syst. Tech. Journal, 54:1355--1387, 1975.Google Scholar
- }}S. Xiao, H. Pishro-Nik, and W. Gong. Dense parity check based secrecy sharing in wireless communications. In IEEE GLOBECOM, 2007.Google ScholarCross Ref
Index Terms
- Security-capacity trade-off in large wireless networks using keyless secrecy
Recommendations
Asymptotic Analysis on Secrecy Capacity in Large-Scale Wireless Networks
Since wireless channel is vulnerable to eavesdroppers, the secrecy during message delivery is a major concern in many applications such as commercial, governmental, and military networks. This paper investigates information-theoretic secrecy in large-...
Capacity of multi-channel wireless networks: impact of number of channels and interfaces
MobiCom '05: Proceedings of the 11th annual international conference on Mobile computing and networkingThis paper studies how the capacity of a static multi-channel network scales as the number of nodes, n, increases. Gupta and Kumar have determined the capacity of single-channel networks, and those bounds are applicable to multi-channel networks as well,...
Secrecy transmission capacity in noisy wireless ad hoc networks
This paper considers the transmission of confidential messages over noisy wireless ad hoc networks, where both background noise and interference from concurrent transmitters affect the received signals. For the random networks where the legitimate nodes ...
Comments