Wireless Terminal Importance Computation via Partitioning Probability
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In ad hoc network systems, computing the importance of wireless terminals for prioritized maintenance is time-consuming and resource-intensive due to the need to aggregate and process routing information across multiple nodes, leading to high load on the network and potential data loss from facility stops or battery failures.
Innovation Solution
A method where each wireless terminal computes a partitioning probability indicating transmission failure by partitioning locations between source and destination nodes, using partitioning points within received packets to generate an importance value representing the effect of a relaying node's failure on the network, allowing for dynamic adjustment of routes and prioritization of maintenance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If the number of substitute routes is computed by aggregating adjacent tables of all wireless terminals to a predetermined wireless terminal, then the importance of the wireless terminal can be computed, but the amount of communication required to collect the adjacent tables becomes considerably large, putting a load on the ad hoc network system
Solution Approach 1:
The patent divides the importance computation task into segments performed by each wireless terminal independently. Instead of one terminal aggregating all adjacent tables, each terminal computes its own importance metric by analyzing only its local adjacent table and routing information, eliminating the need for extensive data aggregation across the network.
Solution Approach 2:
The patent extracts only the essential information needed for importance computation from the adjacent tables, rather than transmitting and processing complete adjacent table data. Each terminal extracts relevant routing information and computes importance locally, reducing communication overhead while maintaining computation accuracy.
2Measurement precision
If the adjacent tables of all wireless terminals are aggregated to compute substitute routes, then the importance can be determined, but the storage capacity required becomes sufficiently large to store the adjacent tables
Solution Approach 1:
The computation is segmented so that each wireless terminal independently processes its own adjacent table data rather than aggregating all terminal data at one location. This distributed approach maintains computational accuracy while eliminating the need for large centralized storage capacity.
3Measurement precision
If the predetermined wireless terminal computes the substitute route by repeating the process similar to construction of routing information, then the importance can be computed, but a large load is easily applied to the predetermined wireless terminal, and the process requires a long time to perform
Solution Approach 1:
The patent segments the computation workload across all wireless terminals in the network. Each terminal performs a simplified computation based on its local data, rather than one terminal performing the complete computation process. This distributes the processing load and significantly reduces the time required for importance computation.
Solution Approach 2:
Each wireless terminal serves itself by computing its own importance metric using its local adjacent table and routing information, rather than relying on another terminal to perform the computation. This self-service approach eliminates the bottleneck of centralized computation and improves overall network productivity.
Data Source
AI summary
In a wireless terminal of a network system in which routes amongst a plurality of nodes are dynamically adjusted according to an environment, the wireless terminal forms a target node forming a final destination of data sent from a sending node. The wireless terminal computes a partitioning probability indicating whether transmission fails by partitioning a location with respect to each pair of a sending source node and a sending destination node, based on a partitioning point set included in a packet received from a relaying node within the network system, wherein the partitioning point set includes partitioning points where nodes partition routes within the network system, and generates an importance representing an effect of a failure of the relaying node on the network system by a transmission failure probability.