A key storage and path key efficient diagonal-based grouping for wireless sensor network
Loading...
Date
2016
Authors
Khan, Md Asif
University of Lethbridge. Faculty of Arts and Science
Journal Title
Journal ISSN
Volume Title
Publisher
Lethbridge, Alta : University of Lethbridge, Dept. of Mathematics and Computer Science
Abstract
Research into the security of wireless sensor networks, often referred to as WSN, has always been a great challenge due to the limited resources and a rich domain of active research. Recently developed probabilistic key predistribution for WSN groupings are not entirely secure. If an adversary can compromise a certain number of sensors, s/he could reconstruct the keys for rest of the sensors. The objective of this thesis was to develop a storage-efficient and low pathkey consuming grouping scheme for a wireless sensor network. In this thesis, a diagonal-based grouping is proposed to improve the security and performance of key distribution based on the work conducted by Liu, Ning, and Du [1]. Two different types of grouping schemes are presented: diagonal-based grouping and diagonalmin grouping. The step-by-step implementation of these groupings in several types of network orientations is also described. This thesis examines the proposed grouping schemes in terms of the key storage and the length of the pathkey. Finally, the outcomes of this thesis demonstrate that the proposed grouping is more key-storage efficient than are the existing schemes. If there is a lot of data flow across the diagonals, the proposed grouping would demonstrate efficient key utilization.
Description
Keywords
diagonal-based grouping , grouping , hash key , wireless sensor networks