KEY PREDISTRIBUTION BASED ON MULTIPLE BALANCED INCOMPLETE BLOCK DESIGNS IN WIRELESS SENSOR NETWORKS

Purchase PDF

Published: 2015-06-18

Page: 129-137


MASOUMEH JAVANBAKHT *

Department of Mathematics and Computer Science, Shahed University, Tehran, Iran.

AMIRHOSEIN FATHINAVID

Computer Engineering Department, Islamic Azad University, Hamedan, Iran.

AMIRMASOUD HOSEINMARDI

Department of Industrial Engineering, Islamic Azad University, Tehran, Iran.

MAHBOOBEH JANNESARI

Department of Mathematical Science, Isfahan University of Technology, Isfahan, Iran.

*Author to whom correspondence should be addressed.


Abstract

In this paper we discuss the use of certain class of combinatorial designs known as symmetric designs to present a fully connected key predistribution scheme (KPS) for sensor networks. In order to investigate the eect of increasing the number of shared keys in performance of fully connected KPSs, we use points and hyperplanes of Finite Projective Space to obtain a KPS which every two nodes share more than one common key. We study the resilience of the proposed scheme under node compromise and show that how to strengthen the determinestic key predistribution strenght against small scale attacks by increasing the number of common keys.

Keywords: Symmetric design, balanced incomplete block design (BIBD), nite projective space, key predistribution, resilience


How to Cite

JAVANBAKHT, M., FATHINAVID, A., HOSEINMARDI, A., & JANNESARI, M. (2015). KEY PREDISTRIBUTION BASED ON MULTIPLE BALANCED INCOMPLETE BLOCK DESIGNS IN WIRELESS SENSOR NETWORKS. Asian Journal of Mathematics and Computer Research, 5(2), 129–137. Retrieved from https://ikprress.org/index.php/AJOMCOR/article/view/159

Downloads

Download data is not yet available.