Date of Original Version
Abstract or Description
The seminal q-composite key predistribution scheme  (IEEE S&P 2003) is used prevalently for secure communications in large-scale wireless sensor networks (WSNs). Yagan  (IEEE IT 2012) and we  (IEEE ISIT 2013) explore topological properties of WSNs employing the q-composite scheme in the case of q = 1 with unreliable communication links modeled as independent on/off channels. However, it is challenging to derive results for general q under such on/off channel model. In this paper, we resolve such challenge and investigate topological properties related to node degree in WSNs operating under the q-composite scheme and the on/off channel model. Our results apply to general q, yet there has not been any work in the literature reporting the corresponding results even for q = 1, which are stronger than those about node degree in , . Specifically, we show that the number of nodes with an arbitrary degree asymptotically converges to a Poisson distribution, present the asymptotic probability distribution for the minimum node degree of the network, and establish the asymptotically exact probability for the property that the minimum node degree is at least an arbitrary value. Numerical experiments confirm the validity our analytical findings.
 H. Chan, A. Perrig, and D. Song. Random key predistribution schemes for sensor networks. In Proc. of IEEE Symposium on Security and Privacy, May 2003.
 O. Ya˘gan. Performance of the Eschenauer-Gligor key distribution scheme under an on/off channel. IEEE Transactions on Information Theory, 58(6):3821–3835, June 2012
 J. Zhao, O. Ya˘gan, and V. Gligor. Secure k-connectivity in wireless sensor networks under an on/off channel model. In Proc. of IEEE ISIT, pages 2790–2794, 2013