Wireless Mesh Network Scheduling via Permutation Matrices
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current wireless mesh networks face challenges in achieving high backhaul capacity and scalability with low computational complexity, near-minimal queuing delays, and near-perfect Quality of Service (QoS) due to congestion and interference issues, particularly in uniform and non-uniform network configurations.
Innovation Solution
A scheduling and channel assignment method that forms sequences of permutation matrices to represent active radio links, decomposing them into partial permutation matrices to avoid conflicts and optimize radio channel usage, ensuring near-minimal delay and jitter for guaranteed-rate backhaul traffic flows across wireless mesh networks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If traditional scheduling methods are used in wireless mesh networks, then implementation is simpler, but queuing delays and jitter increase
Solution Approach 1:
The patent segments the scheduling problem into multiple independent components: permutation matrix generation, decomposition into partial permutation matrices, and conflict-free set identification. This segmentation allows complex scheduling to be broken down into manageable steps that can be processed efficiently, reducing overall computational complexity while minimizing queuing delays.
Solution Approach 2:
The patent performs preliminary actions by pre-generating permutation matrices and decomposing them into partial permutation matrices before actual traffic scheduling. This pre-processing creates a structured framework that guides subsequent scheduling decisions, enabling faster packet forwarding with reduced queuing delay and jitter.
2Productivity
If more radio links are activated to increase backhaul capacity, then network throughput improves, but interference and conflicts increase
Solution Approach 1:
The patent applies local quality by identifying specific sets of radio links that can be activated together without interference. Through decomposition into partial permutation matrices, the system determines which local combinations of links are conflict-free, allowing maximum activation of links in each geographic area without causing harmful interference to other links.
Solution Approach 2:
The patent uses permutation matrices and their decompositions as intermediaries to mediate between the desire for high backhaul capacity and the need to avoid interference. These mathematical structures serve as a planning layer that identifies compatible link combinations, acting as an intermediary between traffic demands and physical radio resource allocation.
3Reliability
If permutation matrices are decomposed into partial permutation matrices, then radio link conflicts are avoided, but computational processing increases
Solution Approach 1:
The patent implements self-service by designing algorithms that automatically generate permutation matrices and decompose them into partial permutation matrices without requiring manual configuration or complex external control. The system serves itself by using the mathematical properties of these matrices to automatically identify conflict-free link sets, reducing the need for complex external scheduling machinery.
Solution Approach 2:
The patent changes parameters by transforming the scheduling problem from directly managing individual radio links to managing permutation matrices and their decompositions. This parameter transformation simplifies the computational task by working with structured mathematical objects that inherently encode conflict-free properties, rather than manually checking all possible link combinations.
4Reliability
If near-minimal delay and jitter are achieved through sophisticated scheduling, then QoS improves, but implementation complexity increases
Solution Approach 1:
The patent achieves universality by creating a scheduling framework based on permutation matrices that can be applied to various wireless mesh network configurations and traffic patterns. This universal approach provides near-minimal delay and jitter guarantees across different network topologies and traffic conditions without requiring custom implementations for each scenario.
Solution Approach 2:
The patent substitutes mechanical scheduling approaches with mathematical structures. Instead of using complex control logic and iterative optimization algorithms, the system uses the inherent mathematical properties of permutation matrices and their decompositions to automatically determine optimal scheduling decisions, replacing mechanical complexity with elegant mathematical solutions.
Data Source
AI summary
Schedule and channel assignment (SCA) in a wireless mesh network (WMN) is disclosed. A method includes: forming a representation of a sequence of permutation matrices from an n×n rate matrix. The entries of the rate matrix define the bandwidth of links between the n nodes of the WMN. Each of the permutation matrices represents active radio links between the n nodes. The sequence of permutation matrices defines a sequence of radio links to provide the desired bandwidth of links between said n nodes. Further, a representation of a sequence of partial permutation matrices corresponding to the sequence of permutation matrices is formed in such a way that each of the permutation matrices can be decomposed into a group of partial permutation matrices. Each of the partial permutation matrices in a group represents non-interfering radio links between the n nodes. In each timeslot, the n nodes are configured for radio transmission and reception in accordance with at least one of the partial permutation matrices in each group to transmit traffic between the n nodes. Example SCA can be used to provision longer-term guaranteed-rate backhaul traffic flows supporting multimedia services such as VOIP or IPTV between base-stations in a WMN, with near-minimal delay and jitter and near-perfect Quality-of-Service for every provisioned traffic flow.