Editore: Lap Lambert Academic Publishing, 2011
ISBN 10: 3846557757 ISBN 13: 9783846557754
Lingua: Inglese
Da: Revaluation Books, Exeter, Regno Unito
EUR 96,90
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 72 pages. 8.66x5.91x0.17 inches. In Stock.
Editore: Lap Lambert Academic Publishing, 2011
ISBN 10: 3846557757 ISBN 13: 9783846557754
Lingua: Inglese
Da: Revaluation Books, Exeter, Regno Unito
EUR 100,00
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 72 pages. 8.66x5.91x0.17 inches. In Stock.
Editore: LAP LAMBERT Academic Publishing Nov 2011, 2011
ISBN 10: 3846557757 ISBN 13: 9783846557754
Lingua: Inglese
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 49,00
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. 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.Books on Demand GmbH, Überseering 33, 22297 Hamburg 72 pp. Englisch.
Editore: LAP LAMBERT Academic Publishing, 2011
ISBN 10: 3846557757 ISBN 13: 9783846557754
Lingua: Inglese
Da: preigu, Osnabrück, Germania
EUR 43,35
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Key Pre-distribution and Key Revocation in Wireless Sensor Networks | A deterministic key pre-distribution approach and a distributed key revocation mechanism | Subhankar Chattopadhyay (u. a.) | Taschenbuch | 72 S. | Englisch | 2011 | LAP LAMBERT Academic Publishing | EAN 9783846557754 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.
Editore: LAP LAMBERT Academic Publishing, 2011
ISBN 10: 3846557757 ISBN 13: 9783846557754
Lingua: Inglese
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 366,03
Quantità: 1 disponibili
Aggiungi al carrellopaperback. Condizione: New. New. book.
Editore: LAP LAMBERT Academic Publishing Nov 2011, 2011
ISBN 10: 3846557757 ISBN 13: 9783846557754
Lingua: Inglese
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 49,00
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - 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.
Editore: LAP LAMBERT Academic Publishing, 2011
ISBN 10: 3846557757 ISBN 13: 9783846557754
Lingua: Inglese
Da: moluna, Greven, Germania
EUR 41,05
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Chattopadhyay SubhankarSubhankar Chattopadhyay has done his M. Tech in Information Security from NIT Rourkela, India. His research interest includes Sensor Network, Cryptography etc. Ashok Kumar Turuk has done his phd from IIT Kharag.
Editore: LAP LAMBERT Academic Publishing, 2011
ISBN 10: 3846557757 ISBN 13: 9783846557754
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 49,00
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.