Subhankar Chattopadhyay: Key Pre-distribution and Key Revocation in Wireless Sensor Networks : A deterministic key pre-distribution approach and a distributed key revocation mechanism - Paperback
[EAN: 9783846557754], Neubuch, [PU: LAP Lambert Academic Publishing Nov 2011], This item is printed on demand - Print on Demand Neuware - Sensor networks are composed of resource constrai… More...
[EAN: 9783846557754], Neubuch, [PU: LAP Lambert Academic Publishing Nov 2011], This item is printed on demand - Print on Demand Neuware - Sensor networks are composed of resource constrained tiny sensor devices. They have less computational power and memory. Communication in sensor network is done in multi-hop, and for secure communication, neighboring sensor nodes must possess a secret common key among them. Symmetric and public key cryptography require more processing and memory space. Hence, they are not suitable for sensor network. In this book we proposed a deterministic key pre-distribution scheme using BCH codes. We mapped the BCH code to key identifier and the keys corresponding to each key identifier are installed into the sensor nodes before deployment. We compared our proposed scheme with existing one and found that it has a better resiliency. Our proposed scheme is scalable and requires the same or less number of keys for a given number of nodes than the existing well known schemes. We have also proposed an efficient key revocation technique using a novel distributed voting mechanism in which neighboring nodes of a sensor can vote against it if they suspect the node to be a compromised one. In the proposed key revocation scheme compromised nodes as well as the compromised keys are completely removed. 72 pp. Englisch<
Sensor networks are composed of resource constrained tiny sensor devices. They have less computational power and memory. Communication in sensor network is done in multi-hop, and for secu… More...
Sensor networks are composed of resource constrained tiny sensor devices. They have less computational power and memory. Communication in sensor network is done in multi-hop, and for secure communication, neighboring sensor nodes must possess a secret common key among them. Symmetric and public key cryptography require more processing and memory space. Hence, they are not suitable for sensor network. In this book we proposed a deterministic key pre-distribution scheme using BCH codes. We mapped the BCH code to key identifier and the keys corresponding to each key identifier are installed into the sensor nodes before deployment. We compared our proposed scheme with existing one and found that it has a better resiliency. Our proposed scheme is scalable and requires the same or less number of keys for a given number of nodes than the existing well known schemes. We have also proposed an efficient key revocation technique using a novel distributed voting mechanism in which neighboring nodes of a sensor can vote against it if they suspect the node to be a compromised one. In the proposed key revocation scheme compromised nodes as well as the compromised keys are completely removed. Bücher > Fremdsprachige Bücher > Englische Bücher 220 x 150 x 4 mm , LAP LAMBERT Academic Publishing, Taschenbuch, LAP LAMBERT Academic Publishing<
Orellfuessli.ch
Nr. A1019930392. Shipping costs:Lieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Versandfertig innert 4 - 7 Werktagen, zzgl. Versandkosten. (EUR 18.70) Details...
(*) Book out-of-stock means that the book is currently not available at any of the associated platforms we search.
Sensor networks are composed of resource constrained tiny sensor devices. They have less computational power and memory. Communication in sensor network is done in multi-hop, and for secu… More...
Sensor networks are composed of resource constrained tiny sensor devices. They have less computational power and memory. Communication in sensor network is done in multi-hop, and for secure communication, neighboring sensor nodes must possess a secret common key among them. Symmetric and public key cryptography require more processing and memory space. Hence, they are not suitable for sensor network. In this book we proposed a deterministic key pre-distribution scheme using BCH codes. We mapped the BCH code to key identifier and the keys corresponding to each key identifier are installed into the sensor nodes before deployment. We compared our proposed scheme with existing one and found that it has a better resiliency. Our proposed scheme is scalable and requires the same or less number of keys for a given number of nodes than the existing well known schemes. We have also proposed an efficient key revocation technique using a novel distributed voting mechanism in which neighboring nodes of a sensor can vote against it if they suspect the node to be a compromised one. In the proposed key revocation scheme compromised nodes as well as the compromised keys are completely removed. Buch (fremdspr.) Subhankar Chattopadhyay#Ashok Kumar Turuk Taschenbuch, LAP LAMBERT Academic Publishing, 01.11.2011, LAP LAMBERT Academic Publishing, 2011<
Orellfuessli.ch
Nr. 30579426. Shipping costs:Lieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Versandfertig innert 3 Wochen, zzgl. Versandkosten. (EUR 16.62) Details...
(*) Book out-of-stock means that the book is currently not available at any of the associated platforms we search.
Sensor networks are composed of resource constrained tiny sensor devices. They have less computational power and memory. Communication in sensor network is done in multi-hop, and for secu… More...
Sensor networks are composed of resource constrained tiny sensor devices. They have less computational power and memory. Communication in sensor network is done in multi-hop, and for secure communication, neighboring sensor nodes must possess a secret common key among them. Symmetric and public key cryptography require more processing and memory space. Hence, they are not suitable for sensor network. In this book we proposed a deterministic key pre-distribution scheme using BCH codes. We mapped the BCH code to key identifier and the keys corresponding to each key identifier are installed into the sensor nodes before deployment. We compared our proposed scheme with existing one and found that it has a better resiliency. Our proposed scheme is scalable and requires the same or less number of keys for a given number of nodes than the existing well known schemes. We have also proposed an efficient key revocation technique using a novel distributed voting mechanism in which neighboring nodes of a sensor can vote against it if they suspect the node to be a compromised one. In the proposed key revocation scheme compromised nodes as well as the compromised keys are completely removed. Buch (fremdspr.) Subhankar Chattopadhyay#Ashok Kumar Turuk Taschenbuch, LAP LAMBERT Academic Publishing, 01.11.2011, LAP LAMBERT Academic Publishing, 2011<
Sensor networks are composed of resource constrained tiny sensor devices. They have less computational power and memory. Communication in sensor network is done in multi-hop, and for secu… More...
Sensor networks are composed of resource constrained tiny sensor devices. They have less computational power and memory. Communication in sensor network is done in multi-hop, and for secure communication, neighboring sensor nodes must possess a secret common key among them. Symmetric and public key cryptography require more processing and memory space. Hence, they are not suitable for sensor network. In this book we proposed a deterministic key pre-distribution scheme using BCH codes. We mapped the BCH code to key identifier and the keys corresponding to each key identifier are installed into the sensor nodes before deployment. We compared our proposed scheme with existing one and found that it has a better resiliency. Our proposed scheme is scalable and requires the same or less number of keys for a given number of nodes than the existing well known schemes. We have also proposed an efficient key revocation technique using a novel distributed voting mechanism in which neighboring nodes of a sensor can vote against it if they suspect the node to be a compromised one. In the proposed key revocation scheme compromised nodes as well as the compromised keys are completely removed. Bücher, Hörbücher & Kalender / Bücher / Sachbuch / Computer & IT / Netzwerke & Internet<
Dodax.de
Nr. VEL1SHDTQ5M. Shipping costs:, Lieferzeit: 5 Tage, DE. (EUR 0.00) Details...
(*) Book out-of-stock means that the book is currently not available at any of the associated platforms we search.
Key Pre-distribution and Key Revocation in Wireless Sensor Networks : A deterministic key pre-distribution approach and a distributed key revocation mechanism - Paperback
[EAN: 9783846557754], Neubuch, [PU: LAP Lambert Academic Publishing Nov 2011], This item is printed on demand - Print on Demand Neuware - Sensor networks are composed of resource constrai… More...
[EAN: 9783846557754], Neubuch, [PU: LAP Lambert Academic Publishing Nov 2011], This item is printed on demand - Print on Demand Neuware - Sensor networks are composed of resource constrained tiny sensor devices. They have less computational power and memory. Communication in sensor network is done in multi-hop, and for secure communication, neighboring sensor nodes must possess a secret common key among them. Symmetric and public key cryptography require more processing and memory space. Hence, they are not suitable for sensor network. In this book we proposed a deterministic key pre-distribution scheme using BCH codes. We mapped the BCH code to key identifier and the keys corresponding to each key identifier are installed into the sensor nodes before deployment. We compared our proposed scheme with existing one and found that it has a better resiliency. Our proposed scheme is scalable and requires the same or less number of keys for a given number of nodes than the existing well known schemes. We have also proposed an efficient key revocation technique using a novel distributed voting mechanism in which neighboring nodes of a sensor can vote against it if they suspect the node to be a compromised one. In the proposed key revocation scheme compromised nodes as well as the compromised keys are completely removed. 72 pp. Englisch<
Sensor networks are composed of resource constrained tiny sensor devices. They have less computational power and memory. Communication in sensor network is done in multi-hop, and for secu… More...
Sensor networks are composed of resource constrained tiny sensor devices. They have less computational power and memory. Communication in sensor network is done in multi-hop, and for secure communication, neighboring sensor nodes must possess a secret common key among them. Symmetric and public key cryptography require more processing and memory space. Hence, they are not suitable for sensor network. In this book we proposed a deterministic key pre-distribution scheme using BCH codes. We mapped the BCH code to key identifier and the keys corresponding to each key identifier are installed into the sensor nodes before deployment. We compared our proposed scheme with existing one and found that it has a better resiliency. Our proposed scheme is scalable and requires the same or less number of keys for a given number of nodes than the existing well known schemes. We have also proposed an efficient key revocation technique using a novel distributed voting mechanism in which neighboring nodes of a sensor can vote against it if they suspect the node to be a compromised one. In the proposed key revocation scheme compromised nodes as well as the compromised keys are completely removed. Bücher > Fremdsprachige Bücher > Englische Bücher 220 x 150 x 4 mm , LAP LAMBERT Academic Publishing, Taschenbuch, LAP LAMBERT Academic Publishing<
Nr. A1019930392. Shipping costs:Lieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Versandfertig innert 4 - 7 Werktagen, zzgl. Versandkosten. (EUR 18.70)
Sensor networks are composed of resource constrained tiny sensor devices. They have less computational power and memory. Communication in sensor network is done in multi-hop, and for secu… More...
Sensor networks are composed of resource constrained tiny sensor devices. They have less computational power and memory. Communication in sensor network is done in multi-hop, and for secure communication, neighboring sensor nodes must possess a secret common key among them. Symmetric and public key cryptography require more processing and memory space. Hence, they are not suitable for sensor network. In this book we proposed a deterministic key pre-distribution scheme using BCH codes. We mapped the BCH code to key identifier and the keys corresponding to each key identifier are installed into the sensor nodes before deployment. We compared our proposed scheme with existing one and found that it has a better resiliency. Our proposed scheme is scalable and requires the same or less number of keys for a given number of nodes than the existing well known schemes. We have also proposed an efficient key revocation technique using a novel distributed voting mechanism in which neighboring nodes of a sensor can vote against it if they suspect the node to be a compromised one. In the proposed key revocation scheme compromised nodes as well as the compromised keys are completely removed. Buch (fremdspr.) Subhankar Chattopadhyay#Ashok Kumar Turuk Taschenbuch, LAP LAMBERT Academic Publishing, 01.11.2011, LAP LAMBERT Academic Publishing, 2011<
Nr. 30579426. Shipping costs:Lieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Versandfertig innert 3 Wochen, zzgl. Versandkosten. (EUR 16.62)
Sensor networks are composed of resource constrained tiny sensor devices. They have less computational power and memory. Communication in sensor network is done in multi-hop, and for secu… More...
Sensor networks are composed of resource constrained tiny sensor devices. They have less computational power and memory. Communication in sensor network is done in multi-hop, and for secure communication, neighboring sensor nodes must possess a secret common key among them. Symmetric and public key cryptography require more processing and memory space. Hence, they are not suitable for sensor network. In this book we proposed a deterministic key pre-distribution scheme using BCH codes. We mapped the BCH code to key identifier and the keys corresponding to each key identifier are installed into the sensor nodes before deployment. We compared our proposed scheme with existing one and found that it has a better resiliency. Our proposed scheme is scalable and requires the same or less number of keys for a given number of nodes than the existing well known schemes. We have also proposed an efficient key revocation technique using a novel distributed voting mechanism in which neighboring nodes of a sensor can vote against it if they suspect the node to be a compromised one. In the proposed key revocation scheme compromised nodes as well as the compromised keys are completely removed. Buch (fremdspr.) Subhankar Chattopadhyay#Ashok Kumar Turuk Taschenbuch, LAP LAMBERT Academic Publishing, 01.11.2011, LAP LAMBERT Academic Publishing, 2011<
Sensor networks are composed of resource constrained tiny sensor devices. They have less computational power and memory. Communication in sensor network is done in multi-hop, and for secu… More...
Sensor networks are composed of resource constrained tiny sensor devices. They have less computational power and memory. Communication in sensor network is done in multi-hop, and for secure communication, neighboring sensor nodes must possess a secret common key among them. Symmetric and public key cryptography require more processing and memory space. Hence, they are not suitable for sensor network. In this book we proposed a deterministic key pre-distribution scheme using BCH codes. We mapped the BCH code to key identifier and the keys corresponding to each key identifier are installed into the sensor nodes before deployment. We compared our proposed scheme with existing one and found that it has a better resiliency. Our proposed scheme is scalable and requires the same or less number of keys for a given number of nodes than the existing well known schemes. We have also proposed an efficient key revocation technique using a novel distributed voting mechanism in which neighboring nodes of a sensor can vote against it if they suspect the node to be a compromised one. In the proposed key revocation scheme compromised nodes as well as the compromised keys are completely removed. Bücher, Hörbücher & Kalender / Bücher / Sachbuch / Computer & IT / Netzwerke & Internet<
Nr. VEL1SHDTQ5M. Shipping costs:, Lieferzeit: 5 Tage, DE. (EUR 0.00)
1As some platforms do not transmit shipping conditions to us and these may depend on the country of delivery, the purchase price, the weight and size of the item, a possible membership of the platform, a direct delivery by the platform or via a third-party provider (Marketplace), etc., it is possible that the shipping costs indicated by find-more-books.com / find-more-books.com do not correspond to those of the offering platform.
Details of the book - Key Pre-distribution and Key Revocation in Wireless Sensor Networks
EAN (ISBN-13): 9783846557754 ISBN (ISBN-10): 3846557757 Hardcover Paperback Publishing year: 2011 Publisher: LAP LAMBERT Academic Publishing
Book in our database since 2009-08-23T18:44:15-04:00 (New York) Detail page last modified on 2022-08-17T11:20:54-04:00 (New York) ISBN/EAN: 3846557757
ISBN - alternate spelling: 3-8465-5775-7, 978-3-8465-5775-4 Alternate spelling and related search-keywords: Book author: ashok, kumar, chattopadhyay Book title: wireless sensor networks
