A key storage and path key efficient diagonal-based grouping for wireless sensor network

Simple item page
dc.contributor.authorKhan, Md Asif
dc.contributor.authorUniversity of Lethbridge. Faculty of Arts and Science
dc.contributor.supervisorLi, Hua
dc.date.accessioned2016-05-30T17:41:29Z
dc.date.available2016-05-30T17:41:29Z
dc.date.issued2016
dc.degree.levelMastersen_US
dc.description.abstractResearch 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.en_US
dc.embargoNoen_US
dc.identifier.urihttps://hdl.handle.net/10133/4493
dc.language.isoenen_US
dc.proquest.subject0984en_US
dc.proquestyesYesen_US
dc.publisherLethbridge, Alta : University of Lethbridge, Dept. of Mathematics and Computer Scienceen_US
dc.publisher.departmentDepartment of Mathematics and Computer Scienceen_US
dc.publisher.facultyArts and Scienceen_US
dc.relation.ispartofseriesThesis (University of Lethbridge. Faculty of Arts and Science)en_US
dc.subjectdiagonal-based groupingen_US
dc.subjectgroupingen_US
dc.subjecthash keyen_US
dc.subjectwireless sensor networksen_US
dc.titleA key storage and path key efficient diagonal-based grouping for wireless sensor networken_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
KHAN_ASIF_MSC_2016.pdf
Size:
6.57 MB
Format:
Adobe Portable Document Format
Description:
Thesis
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
3.13 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Arts and Science, Faculty of
University of Lethbridge Theses