On secure and reliable communications in wireless sensor networks: Towards k-connectivity under a random pairwise key predistribution scheme

We study the secure and reliable connectivity of wireless sensor networks. Security is assumed to be ensured by the random pairwise key predistribution scheme of Chan, Perrig, and Song, and unreliable wireless links are represented by independent on/off channels. Modeling the network by an intersection of a random K-out graph and an Erdös-Rényi graph, we present scaling conditions (on the number of nodes, the scheme parameter K, and the probability of a wireless channel being on) such that the resulting graph contains no node with degree less than k with high probability, when the number of nodes gets large. Results are given in the form of a zero-one law and are shown to improve the previous results by Yağan and Makowski on the absence of isolated nodes (i.e., absence of nodes with degree zero). Via simulations, the established zero-one laws are shown to hold also for the property of k-connectivity; i.e., the property that graph remains connected despite the deletion of any k - 1 nodes or edges.

[1]  Virgil D. Gligor,et al.  Secure k-connectivity in wireless sensor networks under an on/off channel model , 2013, 2013 IEEE International Symposium on Information Theory.

[2]  P. Erd Os,et al.  On the strength of connectedness of random graphs , 1961 .

[3]  Virgil D. Gligor,et al.  k-Connectivity in Secure Wireless Sensor Networks with Physical Link Constraints - The On/Off Channel Model , 2012, ArXiv.

[4]  J. Dall,et al.  Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Yong Wang,et al.  A survey of security issues in wireless sensor networks , 2006, IEEE Communications Surveys & Tutorials.

[6]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[7]  K. Joag-dev,et al.  Negative Association of Random Variables with Applications , 1983 .

[8]  Armand M. Makowski,et al.  Connectivity results for sensor networks under a random pairwise key predistribution scheme , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[9]  Dawn Xiaodong Song,et al.  Random key predistribution schemes for sensor networks , 2003, 2003 Symposium on Security and Privacy, 2003..

[10]  Béla Bollobás,et al.  Random Graphs , 1985 .

[11]  Armand M. Makowski,et al.  On the Connectivity of Sensor Networks Under Random Pairwise Key Predistribution , 2013, IEEE Transactions on Information Theory.

[12]  A. Frieze,et al.  On the connectivity of randomm-orientable graphs and digraphs , 1982 .

[13]  Armand M. Makowski,et al.  Modeling the Pairwise Key Predistribution Scheme in the Presence of Unreliable Links , 2013, IEEE Transactions on Information Theory.

[14]  Armand M. Makowski,et al.  On the gradual deployment of random pairwise key distribution schemes , 2011, 2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks.

[15]  Xiaojiang Du,et al.  A survey of key management schemes in wireless sensor networks , 2007, Comput. Commun..

[16]  Virgil D. Gligor,et al.  A key-management scheme for distributed sensor networks , 2002, CCS '02.

[17]  Osman Yagan.  Performance of the Eschenauer–Gligor Key Distribution Scheme Under an ON/OFF Channel , 2012, IEEE Transactions on Information Theory.

[18]  D. Manjunath,et al.  On connectivity thresholds in superposition of random key graphs on random geometric graphs , 2013, 2013 IEEE International Symposium on Information Theory.

[19]  Armand M. Makowski,et al.  On the scalability of the random pairwise key predistribution scheme: Gradual deployment and key ring sizes , 2013, Perform. Evaluation.

[20]  Armand M. Makowski,et al.  Designing Securely Connected Wireless Sensor Networks in the Presence of Unreliable Links , 2011, 2011 IEEE International Conference on Communications (ICC).

[21]  Roberto Di Pietro,et al.  Redoubtable Sensor Networks , 2008, TSEC.

[22]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[23]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[24]  Virgil D. Gligor,et al.  Toward $k$ -Connectivity of the Random Graph Induced by a Pairwise Key Predistribution Scheme With Unreliable Links , 2014, IEEE Transactions on Information Theory.

[25]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .