Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Localized Sensor Area Coverage with Low Communication Overhead
PERCOM '06 Proceedings of the Fourth Annual IEEE International Conference on Pervasive Computing and Communications
Secure and Continuous Management of Heterogeneous Ad Hoc Networks
AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 01
Cooperation in ad hoc networks: enhancing the virtual currency based models
InterSense '06 Proceedings of the first international conference on Integrated internet ad hoc and sensor networks
Group key management scheme for large-scale sensor networks
Ad Hoc Networks
IEEE Network: The Magazine of Global Internetworking
Analysis of an Adaptive Key Selection Scheme in Wireless Sensor Networks
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
| Hi-index | 0.01 |
Secure key establishment in wireless sensor networks has been shown to be efficient. For sake of computation power, pre- distribution of symmetric keys is recommended. In such schemes, a set S of keys is used and each deployed node knows a subset of S. However, the capture of nodes can quickly lead to the corruption of a significant part of the network and solutions like multi-deployment have been proposed. In multi-deployment schemes, sets of nodes – using different key sets – are sequentially deployed that limits the impact of the capture of nodes. In this paper, we consider the problem of connectivity of single deployment in regards to the size of key sets. We show that connectivity guaranteed solutions lead to network vulnerability when nodes are captured. Then we evaluate network robustness of different schemes.