On topological properties of wireless sensor networks under the q-composite key predistribution scheme with on/off channels

作者: Osman Yagan , Jun Zhao , Virgil D. Gligor

DOI: 10.1109/ISIT.2014.6875009

关键词:

摘要: To be considered for an IEEE Jack Keil Wolf ISIT Student Paper Award. The seminal q-composite key predistribution scheme [3] (IEEE S&P 2003) is used prevalently secure communications in large-scale wireless sensor networks (WSNs). Yagan [10] IT 2012) and we [13] 2013) explore topological properties of WSNs employing the case q = 1 with unreliable communication links modeled as independent on/off channels. However, it challenging to derive results general under such channel model. In this paper, resolve challenge investigate related node degree operating Our apply q, yet there has not been any work literature reporting corresponding even 1, which are stronger than those about [10], [13]. Specifically, show that number nodes asymptotically converges a Poisson distribution, present asymptotic probability distribution minimum network, establish exact property at least arbitrary value. Numerical experiments confirm validity our analytical findings.

参考文章(38)
K. Krzywdziński, K. Rybarczyk, Geometric Graphs with Randomly Deleted Edges - Connectivity and Routing Protocols Mathematical Foundations of Computer Science 2011. pp. 544- 555 ,(2011) , 10.1007/978-3-642-22993-0_49
Ehud Friedgut, Gil Kalai, Every monotone graph property has a sharp threshold Proceedings of the American Mathematical Society. ,vol. 124, pp. 2993- 3002 ,(1996) , 10.1090/S0002-9939-96-03732-X
Virgil D. Gligor, Adrian Perrig, Jun Zhao, Brief Encounters with a Random Key Graph international workshop on security. pp. 157- 161 ,(2009) , 10.1007/978-3-642-36213-2_19
Osman Yagan, Jun Zhao, Virgil D. Gligor, k-Connectivity in Secure Wireless Sensor Networks with Physical Link Constraints - The On/Off Channel Model arXiv: Information Theory. ,(2012)
Milan Bradonjić, Aric Hagberg, Nicolas W. Hengartner, Allon G. Percus, Component Evolution in General Random Intersection Graphs workshop on algorithms and models for the web graph. ,vol. 6516, pp. 36- 49 ,(2010) , 10.1007/978-3-642-18009-5_5
Katarzyna Rybarczyk, Sharp Threshold Functions for Random Intersection Graphs via a Coupling Method The Electronic Journal of Combinatorics. ,vol. 18, pp. 36- ,(2011) , 10.37236/523
Piyush Gupta, P. R. Kumar, Critical Power for Asymptotic Connectivity in Wireless Networks Birkhäuser, Boston, MA. pp. 547- 566 ,(1999) , 10.1007/978-1-4612-1784-8_33
Jerzy Jaworski, Michał Karoński, Dudley Stark, The degree of a typical vertex in generalized random intersection graph models Discrete Mathematics. ,vol. 306, pp. 2152- 2165 ,(2006) , 10.1016/J.DISC.2006.05.013
Béla Bollobás, Alex Scott, Intersections of graphs Journal of Graph Theory. ,vol. 66, pp. 261- 282 ,(2011) , 10.1002/JGT.20489