|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'503'724
Articles rated: 2609
23 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks | | Keith M. Martin
; | | Date: |
3 Feb 2009 | | Abstract: | 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. | | Source: | arXiv, 0902.0458 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER