Hierarchical RPL Address Assignment Reducing Memory and Power
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Ad hoc wireless communication networks, particularly those using the RPL protocol, face challenges with address assignment and reassignment, especially in hierarchical networks, leading to memory and power consumption issues due to the need for routing tables and complex handshaking processes.
Innovation Solution
An address generator assigns a unique network address to each node by appending bits to the parent node's address, eliminating the need for routing tables and reducing handshaking, allowing nodes to determine message routing based on their derived parental address, thereby conserving memory and power.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If routing tables are used for message routing in RPL networks, then message routing capability is improved, but memory consumption increases
Solution Approach 1:
The patent extracts the routing information from separate routing tables and embeds it directly into the hierarchical network addresses. Each address encodes the path from root to node, allowing nodes to determine routing decisions by comparing their own address with the destination address, eliminating the need for stored routing tables.
Solution Approach 2:
The patent creates a compressed representation of routing information by encoding the hierarchical path structure into the address itself. Instead of storing complete routing tables, each node holds only its own hierarchical address, which contains all necessary routing information to reach any other node in the hierarchy.
2Manufacturing precision
If complex handshaking processes are used for address assignment, then address management accuracy is improved, but power consumption increases
Solution Approach 1:
The patent performs address assignment preliminarily and automatically when nodes join the network hierarchy. The parent node assigns addresses following a predetermined hierarchical scheme, eliminating the need for complex post-assignment handshaking or address negotiation processes.
Solution Approach 2:
The hierarchical address scheme enables nodes to self-identify their position in the network hierarchy through their addresses alone. Nodes can autonomously determine routing paths by comparing address prefixes, eliminating the need for complex handshaking protocols to establish address relationships.
3Device complexity
If hierarchical address assignment is implemented, then device complexity is reduced, but address reassignment capability may be limited
Solution Approach 1:
The patent implements dynamic address reassignment within the hierarchical framework. When nodes move or parent-child relationships change, the system dynamically reassigns addresses by updating the hierarchical path encoding, maintaining the simplicity of the scheme while adapting to network changes.
Data Source
Figure 1~3
Figure 2
Figure 4
AI summary
This invention is an improvement of a Hierarchical Do-Dag based RPL (H-DOC) network configuration where the network address of each node corresponds to its location within the hierarchical network. Network addresses are initialized hierarchically (600). Candidate patent nodes signal availability (602). Candidate child nodes select a candidate parent node (603) and respond with a temporary address (604). The selected candidate parent node acknowledges selection and communicates a hierarchical address for the child node in a transmission to the temporary address (605). The child node changes its address to the hierarchical address from the parent node (606).