Multi-radio Mesh Channel Assignment for Interference Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Multi-radio mesh networks face challenges in optimizing channel assignments to minimize interference and maximize throughput due to dense topology and limited number of radios and channels, which affects network performance and efficiency.
Innovation Solution
A method for quasi-static per-link channel assignment in multi-radio multiple-hop mesh networks involves topology discovery, reduction, balancing, and channel selection to create non-interfering paths and distribute traffic load, using a Multi-Channel Controller to compute and apply channel assignments, ensuring connectivity and reducing interference.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If a simple channel assignment method is used (selecting N channels and assigning each to N radios of each node), then the implementation is simple, but it does not reduce wireless interference or improve performance
Solution Approach 1:
The patent changes the channel assignment parameters from simple uniform assignment to optimized per-link assignment. It computes optimal channel assignments by considering interference ranges and transmission ranges, assigning different channels to links within interference range while allowing channel reuse beyond interference range. This parameter optimization resolves the contradiction by achieving both improved throughput and manageable complexity through systematic channel selection algorithms.
Solution Approach 2:
The patent applies local quality by making channel assignments specific to each link rather than uniform across all nodes. Each link's channel assignment is optimized based on its local interference environment and topology position. This allows different parts of the network to use different channel strategies, improving overall throughput while maintaining implementation feasibility through localized decision-making rules.
2Reliability
If dense topology is used to increase redundancy, then fast recovery from node failure is enabled, but interference in the network increases and optimal channel assignment becomes difficult
Solution Approach 1:
The patent addresses the interference issue in dense topologies by changing the channel assignment parameters to account for multi-hop paths and interference ranges. It computes channel assignments that specifically consider the dense connectivity pattern, assigning channels to minimize interference between concurrent transmissions while maintaining the redundant paths. This resolves the contradiction by enabling dense topology benefits while controlling interference through optimized channel selection.
Solution Approach 2:
The patent segments the network into interference domains and assigns channels at the link level rather than node level. This segmentation allows different channels to be used in different parts of the dense topology simultaneously, enabling redundancy maintenance while reducing overall interference. The per-link assignment approach divides the channel allocation problem into manageable segments that can be optimized independently.
3Productivity
If channel assignment is optimized to reduce interference, then network performance improves, but the complexity of computation increases
Solution Approach 1:
The patent applies partial action by computing optimal channel assignments for the most critical paths and links first, rather than attempting to optimize every single link simultaneously. It focuses computational resources on links that have the greatest impact on overall network throughput, achieving significant performance improvement without the full computational burden of complete optimization. This resolves the contradiction by delivering most of the benefits with manageable computation.
Solution Approach 2:
The patent performs preliminary channel assignment computations during network setup and configuration phases, before actual data transmission begins. It pre-computes optimal channel assignments based on the network topology and interference characteristics, storing these assignments for use during operation. This preliminary action resolves the contradiction by moving the complex computation to setup time rather than real-time operation, achieving high throughput without real-time computational burden.
Data Source
AI summary
Techniques are described for automatically determining quasi-static per-link channel assignments for each radio in multiple-hop mesh networks having nodes with two or more radios and where only a small number of channels is available for use in the network. The method optimally assigns the channels to the radios of all of the nodes in the network so as to achieve the lowest interference among links and the highest possible bandwidth.