Distributed Node Address Assignment for Lower Network Overhead
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current address assignment methods require a dedicated server for each node, leading to high costs and significant network resource consumption, especially for nodes far from the server.
Innovation Solution
Distribute the address assignment function among non-leaf nodes in a network, where a first node assigns addresses to its subnodes using its own address as high-order bits and adds low-order bits, reducing the need for a dedicated server and shortening network distances.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a dedicated server is disposed for address assignment, then address assignment can be centralized and managed, but address assignment costs increase and network resource consumption increases
Solution Approach 1:
The patent segments the address assignment function from the centralized server and distributes it to multiple non-leaf nodes in the network. Each non-leaf node can independently assign addresses to its child nodes, reducing the burden on the dedicated server and decreasing network resource consumption for address assignment requests and responses.
Solution Approach 2:
The patent enables non-leaf nodes to perform address assignment autonomously without requiring dedicated server intervention. Each non-leaf node uses its own address to generate addresses for its child nodes, allowing the network to serve itself rather than relying on external centralized management.
2Reliability
If a dedicated server is disposed for address assignment, then address assignment can be centralized and managed, but address assignment costs increase
Solution Approach 1:
The patent divides the address assignment functionality across multiple non-leaf nodes rather than requiring a single dedicated server. This segmentation eliminates the need for expensive dedicated address assignment server hardware while maintaining distributed address management capability.
Solution Approach 2:
The patent makes ordinary non-leaf nodes in the network capable of performing address assignment functions, which are traditionally the exclusive domain of dedicated servers. This multi-functionality allows regular network nodes to serve dual purposes: data transmission and address assignment, reducing overall system cost.
3Area of stationary object
If the node is far away from the server, then the network covers a larger area, but the address assignment request and response are forwarded through a plurality of hops consuming relatively large network resources
Solution Approach 1:
The patent implements local address assignment where each non-leaf node assigns addresses to its immediate child nodes. This localizes the address assignment process to the immediate network neighborhood, eliminating the need for distant server communications and reducing the number of hops required for address assignment requests and responses.
4Area of stationary object
If the node is far away from the server, then the network covers a larger area, but address assignment consumes relatively large network resources
Solution Approach 1:
The patent segments the address assignment function to local non-leaf nodes, allowing large-scale networks to maintain efficient address assignment by processing requests locally rather than forwarding them across the entire network to a distant server.
Data Source
AI summary
A method includes: a first node obtains an address of a second node based on an address of the first node, where the address of the first node includes m bits, where the address of the second node includes m+n bits, where high-order m bits of the address of the second node are the same as low-order m bits of the address of the first node, and where m and n each are an integer greater than 0; and the first node sends the address of the second node to the second node.