For example when m 100 we only need 13 bytes to

Info icon This preview shows pages 91–93. Sign up to view the full content.

For example, when m = 100, we only need 13 bytes to represent the list. Clearly, the communication overhead introduced by such list will not be a problem for our method. Based on the above discussion, we can see that our solution for the second issue is quite clear as long as the direct key between the sensor nodes in the same group can be established. Such a solution actually works for both of our later instantiations. Hence, the only remaining issue at this point is the in-group and cross-group key pre-distribution instances. Therefore, in our instantiations, we only explain the technical detail of these in-group and cross-group key pre-distribution instances. Copyright © 2010. World Scientific Publishing Company. All rights reserved. May not be reproduced in any form without permission from the publisher, except fair uses permitted under U.S. or applicable copyright law. EBSCO Publishing : eBook Collection (EBSCOhost) - printed on 2/16/2016 3:46 AM via CGC-GROUP OF COLLEGES (GHARUAN) AN: 340572 ; Beyah, Raheem, Corbett, Cherita, McNair, Janise.; Security in Ad Hoc and Sensor Networks Account: ns224671
Image of page 91

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

Key Pre-Distribution for Sensor Networks Using Group Deployment Knowledge 79 4.2. Hash Key-Based Instantiation For small groups, the simplest key pre-distribution method is to generate and assign a unique random key to every pair of sensor nodes. This scheme also provides perfect security guarantee in the presence of compromised sen- sor nodes, which means that the compromise of sensor nodes does not leak any information about the shared keys between non-compromised sensor nodes. However, in this chapter, we propose to take advantage of the one- way hash function to reduce almost half of the storage overhead and evenly split it among sensor nodes . The detail of the basic building block for our group-based instantiation is presented below. Before deployment, every sensor node i is pre-distributed with a master key K i , which is only known by the trusted central server (e.g., base station) and the node i . Let G be either a deployment group or a cross group. Assume that the node IDs in G have already been sorted in an ascendent order. For any sensor node i G , let Pos( i ) be the position of this node in the ordered group G . For any two nodes i and j (Pos( i ) < Pos( j )) in this group, we check the value (Pos( i ) + Pos( j )). If it is an odd value ((Pos( i ) + Pos( j )) mod 2 = 1), we will pre-distribute H ( K i || j ) to the node j ; otherwise, we will pre-distribute H ( K j || i ) to the node i , where H is a one-way hash function. For example, as shown in Figure 2, node 1 and node 2 are in the same deployment group. In this case, we will simply pre-distribute the key H ( K 1 || 2) to node 2. Because of our group construction method, we can easily calculate the positions of a sensor node in its deployment group and cross group, respec- tively. Specifically, given a sensor node ID i , we can easily determine that this node is in the deployment group with index i m and the cross group with index (( i 1) mod m )+1. Therefore, in case of the deployment group, we have Pos( i ) = (( i 1) mod m ) + 1; in the case of cross group, we have Pos( i ) = i m .
Image of page 92
Image of page 93
This is the end of the preview. Sign up to access the rest of the document.
  • Spring '12
  • Kushal Kanwar
  • Public key infrastructure, ........., Public-key cryptography, Pretty Good Privacy

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern