Please use this identifier to cite or link to this item: https://idr.l4.nitk.ac.in/jspui/handle/123456789/7190
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBhaskar, P.K.
dc.contributor.authorPais, A.R.
dc.date.accessioned2020-03-30T09:58:36Z-
dc.date.available2020-03-30T09:58:36Z-
dc.date.issued2015
dc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2015, Vol.8956, , pp.311-317en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/7190-
dc.description.abstractWireless Sensor Networks (WSN) are network of sensors having low computation, storage and battery power. Hierarchical WSN are heterogeneous network of sensors having different capabilities which form a hierarchy to achieve energy efficiency. Key management algorithms are center of the security protocols in WSN. It involves key pre distribution, shared key discovery, key revocation, and refreshing. Due to resource constraints in WSN achieving a perfect key management scheme has been quite challenging. In this paper a new key management scheme for Hierarchical WSN based on Chinese Remainder Theorem has been proposed. An experimental setup is created to evaluate this scheme. The results indicate that it establishes the key with minimum computation, communication, storage cost at each node, also it is scalable and resilient to different attacks. � Springer International Publishing Switzerland 2015.en_US
dc.titleA chinese remainder theorem based key management algorithm for hierarchical wireless sensor networken_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.