Copyright 2010 world scientific publishing company

Info icon This preview shows pages 94–97. Sign up to view the full content.

View Full Document Right Arrow Icon
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 94

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

View Full Document Right Arrow Icon
82 D. Liu, P. Ning and W. Du Table 1. Notations. n number of deployment groups m number of the sensor nodes in the same deployment group c number of compromised sensor nodes p d probability of having a direct key between two neighbors p i probability of having an indirect key between two neighbors p cd probability of a direct key being compromised p ci probability of an indirect key being compromised According to Ref. 23, this simple method can tolerate up to t compro- mised nodes in a group. In other words, the collusion of no more than t compromised nodes cannot break the shared key between any two non- compromised sensor nodes in the group. On the other hand, we also see that the overall storage overhead for key materials in the polynomial-based instantiation is 2 t , which is independent of the number of groups n + m in the network. Clearly, this allows further trade-offs between the storage space and the security performance. Note that the polynomial-based instantiation is similar to the grid-based scheme 10 or PIKE, 11 especially when every row (or column) of the sensor nodes in the grid structure are deployed in the same group. However, the main contribution of this chapter is that we exploit the possibility of using the deployment knowledge other than the expected or discovered locations to further improve key pre-distribution . As we will see, our polynomial-based scheme can achieve much better performance than the grid-based scheme when the group-based deployment knowledge is available. On the other hand, our group construction generates small groups and thus allows us to build an efficient key pre-distribution for a large scale network from a simple and efficient key pre-distribution scheme that may only work well for a small network if used directly. 5. Evaluation During the evaluation, we assume the same number of deployment groups and cross groups in the network ( m = n ) for simplicity. The analysis will be focused on the probability of establishing keys between sensor nodes and the security of the direct and indirect keys in the presence of compromised sensor nodes. For convenience, we list those frequently used notations in our later analysis in Table 1. 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 95
Key Pre-Distribution for Sensor Networks Using Group Deployment Knowledge 83 5.1. Overhead
Image of page 96

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

View Full Document Right Arrow Icon
Image of page 97
This is the end of the preview. Sign up to access the rest of the document.

{[ 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