On the Price of Security in Large-Scale Wireless Ad Hoc Networks
- 4 February 2011
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 19 (2) , 319-332
Abstract
Security always comes with a price in terms of performance degradation, which should be carefully quantified. This is especially the case for wireless ad hoc networks (WANETs), which offer communications over a shared wireless channel without any preexisting infrastructure. Forming end-to-end secure paths in such WANETs is more challenging than in conventional networks due to the lack of central authorities, and its impact on network performance is largely untouched in the literature. In this paper, based on a general random network model, the asymptotic behaviors of secure throughput and delay with the common transmission range rn and the probability pf of neighboring nodes having a primary security association are quantified when the network size n is sufficiently large. The costs and benefits of secure-link-augmentation operations on the secure throughput and delay are also analyzed. In general, security has a cost: Since we require all the communications operate on secure links, there is a degradation in the network performance when pf <; 1. However, one important exception is that when pf is Ω(1/logn), the secure throughput remains at the Gupta and Kumar bound of Θ(1/√{n log n}) packets/time slot, wherein no security requirements are enforced on WANETs. This implies that even when the pf goes to zero as the network size becomes arbitrarily large, it is still possible to build throughput-order-optimal secure WANETs, which is of practical interest since pf is very small in many practical large-scale WANETs.Keywords
This publication has 24 references indexed in Scilit:
- Modeling Secure Connectivity of Self-Organized Wireless Ad Hoc Networks2008
- Information theoretic bounds on the throughput scaling of wireless relay networks2005
- Capacity and Delay Tradeoffs for Ad Hoc Mobile NetworksIEEE Transactions on Information Theory, 2005
- Throughput-delay trade-off in wireless networks2004
- A Deterministic Approach to Throughput Scaling in Wireless NetworksIEEE Transactions on Information Theory, 2004
- A pairwise key pre-distribution scheme for wireless sensor networks2003
- A key-management scheme for distributed sensor networks2002
- The quest for security in mobile ad hoc networks2001
- The capacity of wireless networksIEEE Transactions on Information Theory, 2000
- A guided tour of chernoff boundsInformation Processing Letters, 1990