2009/08/06 by O. Ozan Koyluoglu, C. Emre Koksal, Koyluoglu, O. Ozan +3
Computer Science · Engineering · Mathematics · #Advanced MIMO Systems Optimization #Cooperative Communication and Network Coding #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques #cs.CR #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.0908.0898
Submitted to IEEE Transactions on Information Theory
openalex publication_date 2009/08/06 · arxiv created 2010/04/10 · arxiv updated 2010/04/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This work studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes with intensities λ and λe, respectively. It is shown that, as long as λe/λ=o((log n)-2), almost all of the nodes achieve a perfectly secure rate of Ω((1)/(√(n))) for the extended and dense network models. Therefore, under these assumptions, securing the network does not entail a loss in the per-node throughput. The achievability argument is based on a novel multi-hop forwarding scheme where randomization is added in every hop to ensure maximal ambiguity at the eavesdropper(s). Secondly, an ergodic fading model with n source-destination pairs and ne eavesdroppers is considered. Employing the ergodic interference alignment scheme with an appropriate secrecy pre-coding, each user is shown to achieve a constant positive secret rate for sufficiently large n. Remarkably, the scheme does not require eavesdropper CSI (only the statistical knowledge is assumed) and the secure throughput per node increases as we add more legitimate users to the network in this setting. Finally, the effect of eavesdropper collusion on the performance of the proposed schemes is characterized.