Wireless Network Key Distribution via Node Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current wireless network security key distribution schemes either expose all nodes to security risks when using a single key or require an excessive number of keys as nodes increase, leading to storage and computational inefficiencies.
Innovation Solution
The method involves grouping nodes into pairs and allocating unique pairs of security keys to each group, using a half-weight column matrix to minimize the number of security keys required, with each node storing only a subset of keys necessary for communication.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If a single security key is allocated to all nodes, then the number of security keys per node is minimized, but security risk increases because all nodes share the same key
Solution Approach 1:
The patent divides the network nodes into multiple groups and allocates different security keys to different groups. Specifically, nodes are segmented into Group 1 and Group 2, with Group 1 nodes receiving security key SK1 and Group 2 nodes receiving security key SK2. This segmentation resolves the contradiction by reducing the number of keys per node while maintaining security through group-based differentiation.
Solution Approach 2:
The patent applies local quality by assigning different security key characteristics to different node groups based on their specific communication needs. Group 1 nodes and Group 2 nodes have different key allocations (SK1 vs SK2), allowing each group to have optimized security properties suitable for their specific roles and communication patterns in the network.
2Reliability
If different security keys are allocated to each node, then security risk is reduced, but the number of security keys per node increases
Solution Approach 1:
The patent segments nodes into groups and allocates security keys at the group level rather than individual node level. Each node receives only the security keys necessary for its group's communication needs, dramatically reducing the number of keys per node compared to individual key allocation while maintaining security through group-based key management.
Solution Approach 2:
Security keys are made universal within each group, where all nodes in Group 1 share SK1 and all nodes in Group 2 share SK2. This multi-functionality allows a single key to serve multiple nodes, reducing the total number of keys required while maintaining security through the group structure and controlled key distribution.
3Adaptability or versatility
If more nodes are added to the network, then network coverage and functionality improve, but the number of security keys required increases
Solution Approach 1:
The patent structures the network into scalable groups where nodes are divided into Group 1 and Group 2. This segmentation allows the network to scale by adding nodes to existing groups or creating new groups without proportionally increasing the number of security keys, as keys are allocated at the group level rather than individual node level.
Solution Approach 2:
The patent implements partial key allocation where nodes receive only the security keys necessary for their specific group communications rather than all possible keys. This partial action approach allows network scalability while controlling key quantity, as nodes have access to fewer keys than would be required in a fully connected individual key distribution scheme.
Data Source
AI summary
A method of reducing the number of security keys allocated to each node of a wireless network, and of reducing the number of security keys that are required by the wireless network. N nodes are grouped into a first and a second groups, each group comprising N/2 nodes without nodes being shared. The first group is grouped such that at least two nodes are included and at least one node is different, and first security keys are allocated to the first group nodes without any security keys being shared among the groups. (N/2) groups are grouped to include a security key arrangement of (B/2) number of security keys of B number of second security keys, and the second security keys of each group are allocated to each node of the first group. Here, the security key arrangement of each group differs from that of the others.