Modelling extremal events: for insurance and finance
Modelling extremal events: for insurance and finance
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Fundamentals of wireless communication
Fundamentals of wireless communication
Wireless device identification with radiometric signatures
Proceedings of the 14th ACM international conference on Mobile computing and networking
Secrecy throughput of MANETs with malicious nodes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Guaranteeing Secrecy using Artificial Noise
IEEE Transactions on Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
Asymptotic Analysis on Secrecy Capacity in Large-Scale Wireless Networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
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 n(n))1ε) antennas, ∀ε 0. We also establish sufficient conditions on the number of eavesdroppers to achieve a non-zero throughput in our construction.