Resource-Aware Multi-Task Routing in Heterogeneous Wireless Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional routing methods in wireless networks, such as RPL, are designed for homogeneous networks and do not account for node heterogeneity, leading to inefficient resource utilization and potential network partitioning in heterogeneous wireless networks like IoT, where nodes have varying resources and capabilities.
Innovation Solution
A resource-aware routing method that adapts routing functions based on node resources and capabilities by defining different modes of operation (MOP) for nodes, allowing them to select appropriate objective functions and routing metrics for constructing multi-tier and multi-cluster network topologies, and dynamically modifying MOPs in response to changes in resource availability and network conditions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional hierarchical routing methods are used in heterogeneous wireless networks, then routing can be established, but node heterogeneity and resource constraints are not considered leading to inefficient resource utilization
Solution Approach 1:
The patent applies local quality by allowing different nodes to operate with different modes of operation (MOP) based on their individual resource capabilities. Each node independently determines its MOP (0-3) according to its own memory, processing power, and energy constraints, rather than requiring uniform configuration across the network. This enables efficient resource utilization by matching routing responsibilities to actual node capabilities.
Solution Approach 2:
The patent implements dynamics by enabling nodes to dynamically change their mode of operation during network operation. Nodes can adaptively adjust their MOP based on changing resource availability, network conditions, and traffic patterns. This dynamic adaptation allows the routing system to respond to heterogeneity and resource constraints in real-time, improving overall routing efficiency.
2Reliability
If RPL protocol is used with uniform MOP requirement, then routing can be established, but nodes with different resources cannot extend the network and network partitioning occurs
Solution Approach 1:
The patent resolves this contradiction by allowing each node to determine its own MOP based on local resource conditions. Nodes with sufficient resources can adopt higher MOP values (2 or 3) to extend the network, while resource-constrained nodes operate with lower MOP values (0 or 1). This local adaptation prevents network partitioning by allowing heterogeneous nodes to participate in routing according to their capabilities.
Solution Approach 2:
The patent enables nodes to dynamically adjust their MOP to maintain network connectivity. When resource conditions change, nodes can transition between MOPs to continue participating in routing. This dynamic behavior ensures that nodes with varying resources can all contribute to network extension without causing partitioning.
3Productivity
If single objective function and routing metrics are used, then routing can be established, but different application requirements (energy efficiency, throughput, latency) cannot be optimized
Solution Approach 1:
The patent applies universality by designing the routing protocol to support multiple objective functions and routing metrics within the same network. Each node can select from available objective functions (e.g., energy efficiency, throughput, latency) and routing metrics based on application requirements. This multi-functional capability allows a single routing infrastructure to serve diverse application needs.
Solution Approach 2:
The patent enables dynamic selection of objective functions and routing metrics based on application requirements and network conditions. Nodes can adaptively choose appropriate objective functions for different traffic types and application scenarios, allowing the routing system to optimize for energy efficiency, throughput, or latency as needed.
Data Source
Figure 1A~1B
Figure 1C
Figure 2A
AI summary
A multi-hop heterogeneous wireless network is partitioned into a set of subnetworks including a first subnetwork having a first sink node and a second subnetwork having a second sink node. A node forms parts of the first and the second subnetworks and has different modes of operations (MOP) depending on the subnetwork. For example, the node has a first MOP specifying a type of the routing in the first subnetwork and a second MOP specifying a type of the routing in the second subnetwork. The node determines the MOD based on available routing resource of the node that is independent from the subnetwork and based on required routing resource that varies among the subnetworks. The node routs packets in the first subnetwork according to the first MOP and routing packets in the second subnetwork according to the second MOP.