On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks

Computer Science – Cryptography and Security

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

The constraints of lightweight distributed computing environments such as wireless sensor networks lend themselves to the use of symmetric cryptography to provide security services. The lack of central infrastructure after deployment of such networks requires the necessary symmetric keys to be predistributed to participating nodes. The rich mathematical structure of combinatorial designs has resulted in the proposal of several key predistribution schemes for wireless sensor networks based on designs. We review and examine the appropriateness of combinatorial designs as a tool for building key predistribution schemes suitable for such environments.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-297272

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.