Analysis of Multi-path Random Key Pre-distribution for Wireless Sensor Networks

Most wireless sensor networks require that every large enough node contain certain properties. By using the Szemeredi's regularity lemma, one can approximate a complex network by a much simpler object in such a way that the approximation is "regular" for most pairs of partitions of this network. After obtaining a more traceable network, we establish bounds for the probability of the property that a random key pre-distribution sub graph satisfies that each node has a path of length l to its l-th-hop neighbors. The end result is a sharp threshold p >= Cn^-(l-1)/| that satisfies this property and that can be considered as an application of the sparse Szemeredi's regularity lemma.

[1]  E. Szemerédi.  Regular Partitions of Graphs , 1975 .

[2]  Biswanath Mukherjee,et al.  Wireless sensor network survey , 2008, Comput. Networks.

[3]  Xiaojiang Du,et al.  A Survey on Sensor Network Security , 2008 .

[4]  Yoshiharu Kohayakawa,et al.  Regular pairs in sparse random graphs I , 2003, Random Struct. Algorithms.

[5]  Thomas Schickinger,et al.  Complete subgraphs of random graphs , 2002 .

[6]  Nael B. Abu-Ghazaleh,et al.  A taxonomy of wireless micro-sensor network models , 2002, MOCO.

[7]  Sanjay Kumar Madria,et al.  Sensor networks: an overview , 2003 .

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

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

[10]  Vojtech Rödl,et al.  The algorithmic aspects of the regularity lemma , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[11]  Kang Yen,et al.  Sensor network security: a survey , 2009, IEEE Communications Surveys & Tutorials.

[12]  Wen-Shyong Hsieh,et al.  Multi-neighbor random key pre-distribution: a probabilistic analysis , 2009, IEEE Communications Letters.

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

[14]  Yoshiharu Kohayakawa,et al.  Small subsets inherit sparse ε-regularity , 2004 .

[15]  Mohamed F. Younis,et al.  A survey on routing protocols for wireless sensor networks , 2005, Ad Hoc Networks.

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

[17]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[18]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[19]  Yunghsiang Sam Han,et al.  A pairwise key predistribution scheme for wireless sensor networks , 2005, TSEC.

[20]  Wen-Shyong Hsieh,et al.  Performance Analysis of Connectivity on Multi-hop Random Key Pre-distribution , 2009, 2009 International Conference on New Trends in Information and Service Science.

[21]  Kazi Chandrima Rahman,et al.  A Survey on Sensor Network , 2010 .

[22]  Roberto Di Pietro,et al.  Random key-assignment for secure Wireless Sensor Networks , 2003, SASN '03.