Editing
Security-Performance TradeoffsofInheritance
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
Title: Security-Performance TradeoffsofInheritance Main Research Question: How does a novel 2-Phase key predistribution scheme for wireless sensor networks balance the tradeoff between security and performance? Methodology: The researchers proposed a 2-Phase key predistribution scheme based on inherited and random key assignments from a given key pool. They developed an analytical framework to measure sensor network connectivity and resilience to enemy attacks. This framework provided metrics for measuring the se nsor network's average connectivity and q-composite connectivity, as well as the invulnerability of a communication link under arbitrary node captures. Simulation results were also used to compare the number of exclusive keys shared between any two nodes and the number of q-composite links compromised when a given number of nodes are captured by the enemy. Results: The 2-Phase scheme provided better average connectivity and superior q-composite connectivity than the random scheme. The invulnerability of a communication link under arbitrary node captures was higher under the 2-Phase scheme. The probability of a communicating node pair having an exclusive key also scaled better with network size under the 2-Phase scheme. The number of exclusive keys shared between any two nodes was higher, while the number of q-composite links compromised was smaller under the 2-Phase scheme compared to the random one. Implications: The 2-Phase key predistribution scheme offers a balance between security and performance for wireless sensor networks. It provides better network connectivity and resilience to enemy attacks while maintaining a limited number of keys per node. This makes it an attractive solution for securing communication links in resource-limited and large-scale environments. Link to Article: https://arxiv.org/abs/0405035v3 Authors: arXiv ID: 0405035v3 [[Category:Computer Science]] [[Category:Scheme]] [[Category:2]] [[Category:Phase]] [[Category:Key]] [[Category:Connectivity]]
Summary:
Please note that all contributions to Simple Sci Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Simple Sci Wiki:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
Edit source
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Page information