Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
The capacity of wireless networks
IEEE Transactions on Information Theory
Capacity and delay tradeoffs for ad hoc mobile networks
IEEE Transactions on Information Theory
Optimal throughput-delay scaling in wireless networks - part I: the fluid model
IEEE Transactions on Information Theory
Optimal Throughput–Delay Scaling in Wireless Networks—Part II: Constant-Size Packets
IEEE Transactions on Information Theory
Throughput and Delay in Random Wireless Networks With Restricted Mobility
IEEE Transactions on Information Theory
Applications of LDPC Codes to the Wiretap Channel
IEEE Transactions on Information Theory
Optimal Delay–Throughput Tradeoffs in Mobile Ad Hoc Networks
IEEE Transactions on Information Theory
Security-capacity trade-off in large wireless networks using keyless secrecy
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
International Journal of Wireless and Mobile Computing
Hi-index | 0.00 |
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. An information theoretic approach for security is applied to achieve secure communication among legitimate nodes in MANETs with transmissions being kept perfectly secure from malicious nodes. A critical threshold on the number of malicious nodes (m) is identified such that when m = o(√nD), i.e., limn→∞ m/√nD = 0, the secrecy throughput equals the throughput of MANETs without malicious nodes, i.e., the impact of the presence of malicious nodes on the network throughput is negligible; and when m = Ω (√nDpoly(n)), i.e., limn→∞ m/(√nDpoly(n)) ≥ c for a positive constant c, the secrecy throughput is limited by the number of malicious nodes.