Asymptotic Analysis on Secrecy Capacity in Large-Scale Wireless Networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 754.84 |
The secrecy throughput of mobile ad hoc networks (MANETs) with malicious nodes is investigated. The MANET consists of $n$ legitimate mobile nodes and $m$ malicious nodes. Transmissions between legitimate nodes are subject to a delay constraint $D$. A model under passive attack is first studied, in which the malicious nodes are assumed to be eavesdroppers that only listen to transmission without actively injecting signals. An information-theoretic approach for security is applied to achieve secure communication among legitimate nodes in MANETs with transmissions being kept perfectly secure from eavesdroppers. A critical threshold on the number of malicious nodes $(m)$ is identified such that when $m=o(\sqrt {nD})$, i.e., $\lim _{n\rightarrow \infty } m/\sqrt {nD}=0$, the optimal secrecy throughput equals that of MANETs without malicious nodes, i.e., the impact of the presence of malicious nodes on the network throughput is negligible; and when $m=\Omega \left (\sqrt {nD}{\rm poly}(n)\right )$, i.e., $\lim _{n\rightarrow \infty } m/\left (\sqrt {nD}{\rm poly}(n)\right ) \geq c$ for a positive constant ${\rm c}$, the optimal secrecy throughput is limited by the number of malicious nodes. A model under active attack is further studied, in which the malicious nodes actively attack the network by transmitting modified packets to the destination nodes. It is shown that to guarantee the same throughput as the model under passive attack, the model under active attack needs to satisfy more stringent condition on the number of malicious nodes.