Since we have additional deployment knowledge in our

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

View Full Document Right Arrow Icon
Since we have additional deployment knowledge in our framework, we are able to more precisely predict the possible neighbors for any sensor node than the original schemes. It is thus expected that the framework can improve the existing key pre-distribution schemes even if the expected or 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 89

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

View Full Document Right Arrow Icon
Key Pre-Distribution for Sensor Networks Using Group Deployment Knowledge 77 discovered locations are not available. In this chapter, we are interested in seeking practical instantiations under the proposed framework. 4.1. Overview The previous section has described the details of our framework. There are two remaining issues that need to be addressed properly to develop an efficient instantiation. The first issue is the technical detail of the in- group and cross-group key pre-distribution instances. We note that in our framework, the size of deployment groups and the size of cross groups are usually much smaller than the network size. For small size groups, it is practical to apply simple key pre-distribution schemes such as the basic polynomial-based scheme in Ref. 23. The reason is that a single sensor node can usually provide enough storage space for us to use very secure and efficient key pre-distribution schemes for a small number of sensor nodes. For example, for a group of 100 sensor nodes, we can assign a unique key between every pair of sensor nodes. This only occupies the storage space that is equivalent to 99 keys. The second issue is the communication with the two given sensor nodes involved in the bridge identified in the path key establishment. In the pro- posed framework, we provide an efficient way for a sensor node to compute all the possible bridges by only looking at the IDs of the sensor nodes. However, it is still non-trivial to actually communicate with the two sensor nodes related to a given bridge. Theoretically, we are able to check every possible bridges as long as the routing protocol can support the commu- nication between any pair of sensor nodes. However, in practice, it is not desirable to introduce too much communication overhead during the path key establishment. Besides, the routing protocol may not support the end- to-end communication between any pair of sensor nodes. We are thus more interested in the ideas that can discover a valid bridge by only contacting a few sensor nodes in the network. With these in mind, we introduce two efficient instantiations in this sub- section. For the first issue, we will look for key pre-distribution schemes that do not require additional communication overhead during the establishment of direct keys. This is particularly suitable for resource-constrained sensor
Image of page 90
Image of page 91
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