Ad-hoc Network Load Distribution via Routing Table Analysis
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In ad-hoc networks, there is a risk of communication load concentration on specific nodes due to network configuration and communication state, leading to potential overload and inefficiencies.
Innovation Solution
A method for selecting a transfer destination in an ad-hoc network where nodes with fewer communication loads are prioritized by analyzing the number of uses in routing tables and selecting nodes with the lowest number of entries that have not been referred to for a prescribed period, thereby distributing the communication load.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data is transferred through nodes in an ad-hoc network, then communication routes are formed and data transfer is enabled, but communication load concentrates on specific nodes leading to potential overload
Solution Approach 1:
The patent implements dynamic route selection by continuously monitoring the number of uses in routing tables and adapting transfer destination choices in real-time. Nodes with fewer uses are dynamically selected as transfer destinations, allowing the network to flexibly respond to changing load conditions and prevent static route bottlenecks
Solution Approach 2:
The patent changes the selection criterion for transfer destinations from static routing information to dynamic parameters based on the number of uses in routing tables. By using the count of unreferenced entries as a load indicator, the system adjusts route selection to distribute traffic away from overloaded nodes, resolving the contradiction between maintaining data transfer capability and preserving network efficiency
2Adaptability or versatility
If nodes with more routing entries are selected as transfer destinations, then more communication routes are available, but these nodes experience higher communication loads
Solution Approach 1:
The patent implements a feedback mechanism where nodes monitor the number of uses in their routing tables and use this information to make informed transfer destination selections. The feedback loop counts unreferenced entries in routing tables and uses this metric to dynamically adjust route selection, ensuring that nodes with higher loads (indicated by more uses) are less likely to be selected as transfer destinations
Solution Approach 2:
Instead of selecting transfer destinations based on nodes with more routing entries (which would increase route availability but also load), the patent inverts the selection criterion to choose nodes with fewer uses. This inversion maintains route availability while actively reducing communication load on selected nodes, addressing the contradiction between adaptability and load quantity
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A transfer destination selecting method conducted by a communication device (N,R) includes selecting, when the communication device stores, according to a destination, pieces of information indicating a plurality of other communication devices that are candidates for a transfer destination of data, one of the other communication devices to be the transfer destination from among the candidates on the basis of a number of destinations in a routing table used for controlling a data transfer and stored in each of the plurality of other communication devices (S17).