Accurate Analysis of Connectivity and Resilience for a Class of Wireless Sensor Networks

PANG Shanqi; HU Xianchao; GAO Qiang; LI Yongmei; XIA Yifan

doi:10.1049/cje.2019.12.007

Volume 29 Issue 2

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Electronics > 2020 > 29(2): 208-219

PANG Shanqi, HU Xianchao, GAO Qiang, et al., “Accurate Analysis of Connectivity and Resilience for a Class of Wireless Sensor Networks,” Chinese Journal of Electronics, vol. 29, no. 2, pp. 208-219, 2020, doi: 10.1049/cje.2019.12.007

Citation:

PANG Shanqi, HU Xianchao, GAO Qiang, et al., “Accurate Analysis of Connectivity and Resilience for a Class of Wireless Sensor Networks,” Chinese Journal of Electronics, vol. 29, no. 2, pp. 208-219, 2020, doi: 10.1049/cje.2019.12.007

Citation:

PDF( 423 KB)

Accurate Analysis of Connectivity and Resilience for a Class of Wireless Sensor Networks

doi: 10.1049/cje.2019.12.007

1.
College of Mathematics and Information Science, Henan Normal University, Xinxiang 453007, China;
2.
Henan Engineering Laboratory for Big Data Statistical Analysis and Optimal Control, Henan Normal University, Xinxiang 453007, China

Funds: This work is supported by the National Natural Science Foundation of China (No.11571094).

Received Date: 2019-01-23
Rev Recd Date: 2019-06-18
Publish Date: 2020-03-10

Abstract

Abstract

Increasing attention is being devoted to network security with the extensive application of wireless sensor networks in various fields. Connectivity and resilience are the crucial metrics of network security. We establish precise formulas for obtaining the resilience of a Key predistribution scheme (KPS) obtained from an Orthogonal array (OA). We study the connectivity and resilience of the Broadcast-enhanced key predistribution scheme (BEKPS) based on OAs and improve the existing methods. We also present precise formulas for evaluating the resilience of these schemes based on any number of partitions, completely solving the problem regarding the resilience of this type of BEKPS. We obtain precise formulas for ensuring the connectivity of two partitions under the condition that each pair of trees from different partitions intersects at exactly one node. We present a general approximate formula for evaluating the connectivity of more than two partitions, providing a positive solution to the open problem in Kendall et al.'s paper in ACM Transactions on Sensor Networks (Vol.11, No.1, 2014). Thus, we can conclude that for this type of BEKPS, connectivity increases, whereas resilience remains unchanged as the number of partitions increases. A comparison of the obtained results and the previously reported results reveals the superior performance of the proposed BEKPSs.
- Wireless sensor network,
- Key predistribution scheme,
- Broadcast-enhanced key predistribution scheme,
- Orthogonal array

FullText(HTML)

References(38)

References

H.M. Ammari, N. Gomes, M. Jacques, et al., “A survey of sensor network applications and architectural components”, Ad Hoc & Sensor Wireless Networks, Vol.25, No.1-2, pp.1-44, 2015.

N. Gura, A. Patel, A. Wander, et al., “Comparing elliptic curve cryptography and RSA on 8-bit CPUs”, Proc. of International Workshop on Cryptographic Hardware and Embedded Systems, Cambridge, Boston, USA, pp.119-132, 2004.

L. Eschenauer and V.B. Gligor, “A key management scheme for distributed sensor networks”, Proc. of the 9th ACM Conference on Computer and Communications Security, Washington, DC, USA, pp.41-47, 2002.

H. Chan, A. Perrig and D. Song, “Random key predistribution schemes for sensor networks”, Proc. of IEEE Symposium on Security and Privacy, Oakland, California, USA, pp.197-213, 2003.

C. Blundo, A.D. Santis, A. Herzberg, et al., “Perfectly secure key distribution for dynamic conferences”, Information and Computation, Vol.146, No.1, pp.1-23, 1998.

S.A. Çamtepe and B. Yener, “Combinatorial design of key distribution mechanisms for wireless sensor networks”, Proc. of the European Symposium on Research in Computer Security, Sophia Antipolis, France, pp.293-308, 2004.

J. Lee and D.R. Stinson, “A combinatorial approach to key predistribution for distributed sensor networks”, Proc. of IEEE Wireless Communications and Networking Conference, New Orleans, LA, USA, pp.1200-1205, 2005.

J. Lee and D.R. Stinson, “Common intersection designs”, Journal of Combinatorial Designs, Vol.14, No.4, pp.251-269, 2006.

J. Lee and D.R. Stinson, “On the construction of practical key predistribution schemes for distributed sensor networks using combinatorial designs”, ACM Transactions on Information & System Security, Vol.11, No.2, pp.1-35, 2008.

M.B. Paterson and D.R. Stinson, “A unified approach to combinatorial key predistribution schemes for sensor networks”, Designs, Codes and Cryptography, Vol.71, No.3, pp.433-457, 2014.

J. Dong, D. Pei and X. Wang, “A class of key predistribution schemes based on orthogonal arrays”, Journal of Computer Science and Technology, Vol.23, No.5, pp.825-831, 2008.

Q. Gao, W. Ma and X. Li, “A key predistribution scheme based on mixed-level orthogonal arrays”, Ad Hoc & Sensor Wireless Networks, Vol.37, No.1-4, pp.53-69, 2017.

Q. Gao, W. Ma and W. Luo, “Hash-chain improvement of key predistribution schemes based on transversal designs”, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol.E101A, No.1, pp.157-159, 2018.

J. Cichoń, Z. Gołebiewski and M. Kutyłowski, “From key predistribution to key redistribution”, Theoretical Computer Science, Vol.453, pp.75-87, 2012.

M. Kendall, K.M. Martin, S. Ng, et al., “Broadcast-enhanced key predistribution schemes”, ACM Transactions on Sensor Networks, Vol.11, No.1, pp.6:1-6:33, 2014.

Q. Gao and W. Ma, “A broadcast-enhanced key predistribution scheme using combinatorial KPSs based on orthogonal arrays for the temporal layer”, Ad Hoc & Sensor Wireless Networks, Vol.36, No.1-4, pp.193-210, 2017.ebiewski and M. Kutyłowski, “From key predistribution to key redistribution”, Theoretical Computer Science, Vol.453, pp.75-87, 2012.

M. Kendall, K.M. Martin, S. Ng, et al., “Broadcast-enhanced key predistribution schemes”, ACM Transactions on Sensor Networks, Vol.11, No.1, pp.6:1-6:33, 2014.

Y. Zhang, S. Pang and Y. Wang, “Orthogonal arrays obtained by the generalized Hadamard product”, Discrete Math, Vol.238, No.1-3, pp.151-170, 2001.

Y. Zhang, Y. Lu and S. Pang, “Orthogonal arrays obtained by orthogonal decomposition of projection matrices”, Statistica Sinica, Vol.9, No.2, pp.595-604, 1999.

L. Ji and J. Yin, “Constructions of new orthogonal arrays and covering arrays of strength three”, Journal of Combinatorial Theory Series A, Vol.117, No.3, pp.236-247, 2010.

S. Pang, Y. Zhu and Y. Wang, “A class of mixed orthogonal arrays obtained from projection matrix inequalities”, Journal of Inequalities and Applications, Vol.2015, No.1, pp.1-9, 2015.

S. Pang and L. Chen, “Generalized Latin matrix and construction of orthogonal arrays”, Acta Mathematicae Applicatae Sinica, Vol.33, No.4, pp.1083-1092, 2017.

S. Pang, X. Wang, J. Wang, et al., “Construction and count of 1-resilient rotation symmetric Boolean functions”, Information Sciences, Vol.450, pp.336-342, 2018.

A.S. Hedayat, N.J.A. Sloane and J. Stufken, Orthogonal Arrays: Theory and Applications, Springer-Verlag, New York, USA, pp.38-42, 1999.

J. Du, S. Pang and Q. Wen, “Construction and count of 1-resilient rotation symmetric Boolean functions on pr variables”, Chinese Journal of Electronics, Vol.23, No.4, pp.816-820, 2014.

S. Pang, W. Xu, G. Chen, et al., “Construction of symmetric and asymmetric orthogonal arrays of strength t from orthogonal partition”, Indian Journal of Pure and Applied Mathematics, Vol.49, No.4, pp.663-669, 2018.

J. Du, S. Fu, L. Qu, et al., “New constructions of q-variable 1-resilient rotation symmetric functions over Fp”, Science China Information Sciences, Vol.59, No.7, pp.1-3, 2016.

S. Pang, W. Xu, J. Du, et al., “Construction and count of 1-resilient rotation symmetric Boolean functions on 4p variables”, Chinese Journal of Electronics, Vol.26, No.6, pp.1276-1283, 2017.

S. Pang, J. Wang, X. Wang, et al., “Application of orthogonal array and Walsh transform in resilient function”, Chinese Journal of Electronics, Vol.27, No.2, pp.281-286, 2018.

S. Pang, Q. Zhang and X. Lin, “Construction of generalized quantum Boolean functions”, Chinese Journal of Electronics, Vol.28, No.3, pp.508-513, 2019.

P. Ke, L. Huang and S. Zhang, “Improved lower bound on the number of balanced symmetric functions over GF (p)”, Information Sciences, Vol.179, No.5, pp.682-687, 2009.

S. Fu, L. Qu, C. Li, et al., “Balanced rotation symmetric boolean functions with maximum algebraic immunity”, IET Information Security, Vol.5, No.2, pp.93-99, 2011.

K. Fang, D. Lin, P. Winker, et al., “Uniform design: Theory and application”, Technometrics, Vol.42, No.3, pp.237-248, 2000.

Q. Gao, W. Ma and W. Luo, “A combinatorial key predistribution scheme for two-layer hierarchical wireless sensor networks”, Wireless Personal Communications, Vol.96, No.2, pp.2179-2204, 2017.

W. Du, J. Deng, Y. Han, et al., “A pairwise key predistribution scheme for wireless sensor networks”, ACM Transactions on Information and System Security, Vol.8, No.2, pp.228-258, 2005.

D. Wallner, E. Harder and R. Agee, “Key management for multicast: issues and architectures”, Request for Comments, Internet Engineering Task Force, RFC-2627, 1999.

H. Harney and E. Harder, “Logical key hierarchy protocol”, Internet Draft, Internet Engineering Task Force, draftharney-sparta-lkhp-sec-00.txt, 1999.

Relative Articles

Supplements(0)

Cited By

Proportional views