Link Transmission Scheduling for Wireless Mesh Networks

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing wireless mesh networks face challenges in achieving increased throughput due to inefficiencies in MAC layers and routing protocols, particularly in multi-hop networks, which limits their widespread adoption despite physical layer improvements.

Innovation Solution

A method and apparatus for generating a fixed link transmission schedule using a two-phase routing algorithm that determines fixed traffic capacities and split ratios, allowing for static routing and scheduling, thereby simplifying network control and improving throughput by avoiding dynamic resource allocation.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If dynamic routing and scheduling are used to adapt to traffic changes, then network adaptability is improved, but device complexity and control overhead increase

Engineering Contradiction:

Improvenetwork adaptabilityVSAvoidcontrol complexity

Core Design Contradiction:

Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent segments the network control function into two independent parts: (1) a static link transmission schedule that defines fixed time slots for each link, and (2) a traffic routing function that operates within these fixed slots. This segmentation eliminates the need for dynamic coordination between routing and scheduling decisions, reducing control complexity while maintaining adaptability through the routing layer.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent performs preliminary action by pre-computing the link transmission schedule offline based on network topology and traffic patterns. This static schedule is then reused for multiple traffic matrices, eliminating the need for real-time scheduling recalculations and reducing online control complexity while preserving adaptability through the routing algorithm.

Inventive Principle:

Principle #10Preliminary action

2Device complexity

If static routing with fixed link transmission schedule is used, then device complexity is reduced, but network adaptability to traffic changes deteriorates

Engineering Contradiction:

Improvecontrol complexityVSAvoidnetwork adaptability

Core Design Contradiction:

Device complexityVSAdaptability or versatility

Solution Approach 1:

The patent introduces dynamics at the routing layer while keeping scheduling static. The routing algorithm dynamically adapts to different traffic matrices by computing appropriate routing paths within the fixed schedule framework, allowing the network to handle variable traffic patterns without requiring dynamic schedule reconfiguration.

Inventive Principle:

Principle #15Dynamics

Solution Approach 2:

The patent uses the fixed link transmission schedule as an intermediary that decouples the routing function from real-time scheduling decisions. This intermediary structure allows routing algorithms to adapt to traffic changes while the underlying schedule remains static, resolving the contradiction between simplicity and adaptability.

Inventive Principle:

Principle #24Intermediary (Mediator)

3Productivity

If dynamic resource allocation is implemented, then network throughput under varying traffic conditions is improved, but loss of time due to reconfiguration increases

Engineering Contradiction:

Improvenetwork throughputVSAvoidreconfiguration time

Core Design Contradiction:

ProductivityVSLoss of time

Solution Approach 1:

The patent performs preliminary action by pre-computing the link transmission schedule offline, eliminating the need for time-consuming real-time reconfiguration. The static schedule can be rapidly deployed and reused for multiple traffic scenarios, significantly reducing reconfiguration time while maintaining high throughput through efficient resource utilization.

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent ensures continuity of useful action by designing a static schedule that remains valid across multiple traffic matrices. This eliminates interruptions caused by frequent reconfiguration and allows the network to maintain continuous high-speed data transmission without periodic slowdowns associated with dynamic reallocation overhead.

Inventive Principle:

Principle #20Continuity of useful action

Data Source

PatentUS7729257B2Method and apparatus for link transmission scheduling for handling traffic variation in wireless mesh networks

Publication Date: 2010.06.01 WSOU INVESTMENTS LLC

AI summary

The invention includes a method and apparatus for generating a link transmission schedule for handling traffic variation in wireless networks without dynamic scheduling or routing. The method includes determining fixed traffic capacities associated with respective wireless links of a wireless network according to a routing algorithm, and generating, using the routing algorithm and the fixed traffic capacities, a link transmission schedule including at least one condition by which traffic is transmitted using each of the network links. The link transmission schedule is adapted to remain substantially fixed during dynamic traffic changes. The routing algorithm may be a two-phase routing algorithm in which traffic is distributed by each node in the wireless network to every node in the wireless network using traffic split ratios. For two-phase routing, fixed traffic capacities may be determined using ingress and egress traffic capacities and traffic split ratios associated with respective nodes in the wireless network.