Wireless Network Routing Algorithm for Traffic Distribution
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional wireless network routing techniques fail to address traffic jams caused by extreme communication traffic increases, as they only distribute traffic at the destination node and not at intermediate nodes.
Innovation Solution
The method involves adding an anycast operation to the ad-hoc routing algorithm, using a traffic distribution table and intermediate-node weight table to distribute traffic at both destination and intermediate nodes, thereby alleviating traffic jams by selecting optimal route paths based on node weights and throughput.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If traffic is distributed only at the destination node, then the routing algorithm is simple, but a traffic jam occurs under extreme communication traffic
Solution Approach 1:
The patent segments the traffic distribution function by introducing intermediate nodes into the traditional destination-only routing model. Each intermediate node independently determines whether to forward packets based on its own status and the destination node's status, dividing the traffic handling responsibility across multiple nodes rather than concentrating it at a single destination node, thereby preventing traffic jams while maintaining algorithmic simplicity
2Productivity
If anycast operation is added to ad-hoc routing algorithm, then traffic is distributed at intermediate nodes to alleviate traffic jam, but device complexity increases
Solution Approach 1:
The patent implements self-service by enabling each intermediate node to autonomously determine whether to forward packets based on its own operational status and the destination node's status. Each node independently evaluates traffic distribution decisions without requiring centralized control or complex coordination, allowing the system to achieve traffic distribution capability while keeping individual node complexity low
Data Source
AI summary
A method of routing a wireless network is provided. The method is performed by each of a group of nodes and includes: receiving a routing request signal; determining whether a node itself is a destination node, by referring to a traffic distribution table showing traffic throughput of the group of nodes and an intermediate-node weight table showing weights of intermediate nodes on all paths between the group of nodes and a source node, wherein a route path is selected by referring to the weights of intermediate nodes; and when it is determined that the node itself is the destination node transmitting a routing response signal to the source node that has transmitted the routing request signal, and receiving a packet from the source node, wherein the transmitting and receiving are performed by the determined destination node. By using the method, traffic in wireless network extreme communications can be distributed at intermediate nodes as well as at destination nodes. Therefore, all the networks can be effectively used in extreme circumstances.