Asymptotic analysis on secrecy capacity in large-scale wireless networks

J Zhang, L Fu, X Wang - IEEE/ACM Transactions on …, 2013 - ieeexplore.ieee.org
Since wireless channel is vulnerable to eavesdroppers, the secrecy during message
delivery is a major concern in many applications such as commercial, governmental, and …

Impact of secrecy on capacity in large-scale wireless networks

J Zhang, L Fu, X Wang - 2012 Proceedings IEEE INFOCOM, 2012 - ieeexplore.ieee.org
Since wireless channel is vulnerable to eavesdroppers, the secrecy during message
delivery is a major concern in many applications such as commercial, governmental and …

Secrecy capacity scaling of large-scale networks with social relationships

K Zheng, J Zhang, X Liu, L Fu, X Wang… - IEEE Transactions …, 2016 - ieeexplore.ieee.org
Due to the nature of a wireless medium, a wireless channel is susceptible to malicious
nodes, which encourages the consideration of secrecy in many applications such as satellite …

On secrecy capacity scaling in wireless networks

OO Koyluoglu, CE Koksal… - IEEE Transactions on …, 2012 - ieeexplore.ieee.org
This paper studies the achievable secure rate per source-destination pair in wireless
networks. First, a path loss model is considered, where the legitimate and eavesdropper …

Optimal secrecy capacity-delay tradeoff in large-scale mobile ad hoc networks

X Cao, J Zhang, L Fu, W Wu… - IEEE/ACM Transactions …, 2015 - ieeexplore.ieee.org
In this paper, we investigate the impact of information-theoretic secrecy constraint on the
capacity and delay of mobile ad hoc networks (MANETs) with mobile legitimate nodes and …

Security-capacity trade-off in large wireless networks using keyless secrecy

S Vasudevan, D Goeckel, DF Towsley - Proceedings of the eleventh …, 2010 - dl.acm.org
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 …

Secure communication in stochastic wireless networks

PC Pinto, J Barros, MZ Win - arXiv preprint arXiv:1001.3697, 2010 - arxiv.org
Information-theoretic security--widely accepted as the strictest notion of security--relies on
channel coding techniques that exploit the inherent randomness of the propagation …

Unicasting on the secrecy graph

S Vuppala, GTF de Abreu - IEEE transactions on information …, 2013 - ieeexplore.ieee.org
We consider the secrecy capacity of unicast channels of ad hoc networks exposed to
randomly located eavesdroppers, as modeled by S-Graphs. Expressions that quantify the …

Secure node packing of large-scale wireless networks

J Lee, H Shin, MZ Win - 2012 IEEE International Conference on …, 2012 - ieeexplore.ieee.org
This paper presents a new framework to evaluate the performance of wireless networks with
intrinsic secrecy. Specifically, we put forth the notion of secure node packing (SNP), defined …

On the effect of colluding eavesdroppers on secrecy capacity scaling

OO Koyluoglu, CE Koksal… - 2010 European Wireless …, 2010 - ieeexplore.ieee.org
In a powerful secrecy attack, eavesdroppers can collude, ie, they can share their
observations. Securing information in such a scenario will be an even more challenging task …