Multi-Hop Wireless Channel Allocation via Conflict Graph Coloring
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Multi-hop wireless networks face challenges in maximizing system throughput due to channel interference among nodes, which affects concurrent transmission efficiency, particularly in wireless mesh and ad-hoc networks where non-overlapping channels are not optimally allocated.
Innovation Solution
A dynamic multi-channel assignment method is implemented, involving gathering neighbor node information, constructing connectivity and conflict graphs, and using a sub-graph list coloring algorithm to allocate non-overlapping channels, considering channel interference and radio availability, to maximize channel utilization and minimize interference.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If multiple non-overlapping channels are allocated to relay nodes for concurrent transmission, then system throughput is improved, but channel interference among nodes increases
Solution Approach 1:
The patent applies local quality by allowing different relay nodes to use different channel allocation strategies based on their local interference environments. Each node's channel assignment is optimized according to its specific position and interference conditions, rather than applying a uniform allocation scheme across the entire network.
Solution Approach 2:
The patent implements dynamic channel allocation where relay nodes can switch between different channels based on real-time interference conditions. The system dynamically adjusts channel assignments to maximize throughput while avoiding interference, rather than using static channel allocation.
2Productivity
If non-overlapping channels are used for simultaneous transmission in neighborhood nodes, then system performance is improved, but device complexity increases due to multiple radio interfaces
Solution Approach 1:
The patent makes radio interfaces multi-functional by enabling them to operate on multiple different channels dynamically. Instead of requiring dedicated hardware for each channel, the same radio interface can be reconfigured to work on different non-overlapping channels, reducing hardware complexity while maintaining performance benefits.
3Productivity
If channel allocation considers all interference factors (inter-flow and intra-flow), then network throughput is maximized, but computational complexity increases
Solution Approach 1:
The patent segments the interference management problem into separate inter-flow and intra-flow components, handling each type of interference independently through dedicated algorithms. This segmentation simplifies the overall computational complexity while still addressing all interference factors comprehensively.
Solution Approach 2:
The patent performs preliminary channel allocation and interference assessment before actual data transmission begins. By pre-calculating optimal channel assignments and identifying potential interference scenarios in advance, the system reduces real-time computational requirements during active transmission.
Data Source
AI summary
Multi-hop wireless networks have benefits in coverage extension and throughput improvement. In this multi-hop wireless networks, multiple channels are available to improve system performance through concurrent transmission. In this invention, a multi-channel assignment method is described. For efficient utilization of multiple channels considering different channel condition at each node, the multi-channel assignment method is comprising the steps of: a) gathering neighbor relay node information by relaying control messages which include node information, such as the list of neighbor nodes, the preferable channel list of nodes, and the number of available radio interfaces; b) connectivity graph construction, by generating the multi-graph connectivity graph from the gathered node information; c) conflict graph composition, by generating the multi-channel conflict graph which exhibits interference among links from the multi-graph connectivity graph; and d) multi-channel assignment, by allocating channels to links considering channel interference by referring the multi-channel conflict graph using the list coloring algorithm.