Abstract
Many key predistribution (KP) protocols have been proposed and are well accepted in randomly deployed wireless sensor networks (WSNs). Being distributed and localized, they are perceived to be scalable as node density and network dimension increase. While it is true in terms of communication/computation overhead, their scalability in terms of security performance is unclear. in this paper, we conduct a detailed study on this issue. in particular, we define a new metric called Resilient Connectivity (RC) to quantify security performance in WSNs. We then conduct a detailed analytical investigation on how KP protocols scale with respect to node density and network dimension in terms of RC in randomly deployed WSNs. based on our theoretical analysis, we state two scaling laws of KP protocols. Our first scaling law states that KP protocols are not scalable in terms of RC with respect to node density. Our second scaling law states that KP protocols are not scalable in terms of RC with respect to network dimension. in order to deal with the Un scalability of the above two scaling laws, we further propose logical and physical group deployment, respectively. We validate our findings further using extensive theoretical analysis and simulations. © 2006 IEEE.
Recommended Citation
W. Gu et al., "Scaling Laws of Key Predistribution Protocols in Wireless Sensor Networks," IEEE Transactions on Information Forensics and Security, vol. 6, no. 4, pp. 1370 - 1381, article no. 5871717, Institute of Electrical and Electronics Engineers, Dec 2011.
The definitive version is available at https://doi.org/10.1109/TIFS.2011.2159001
Department(s)
Computer Science
International Standard Serial Number (ISSN)
1556-6013
Document Type
Article - Journal
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2024 Institute of Electrical and Electronics Engineers, All rights reserved.
Publication Date
01 Dec 2011
